Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged made-easy-test-series
3
votes
1
answer
1681
MadeEasy Test Series: Operating System - Process Schedule
Suppose a system uses shortest job first scheduling and exponential average of the measured length of previous CPU burst is 0.25. If the initial value of the predicted CPU burst time is 4 unit. The predicted time for 4th CPU burst for a process with burst time of 4 unit, 12 unit and 8 unit respectively (units) is ______.
Sandeep Singh
asked
in
Operating System
Dec 21, 2015
by
Sandeep Singh
1.5k
views
operating-system
process-scheduling
made-easy-test-series
1
vote
2
answers
1682
MadeEasy Test Series: CO & Architecture - MicroProgramming
Q.27 Consider a CPU where 150 instructions take 8 clock cycles each to complete the execution. A horizontal microprogrammed control unit has to generate 125 control signals. What is the minimum size of control word? _______ Answer given is 136 ( ... or byte) , Neither they have given that answer should be multiple of 8 , if it is in bit !
Akash Kanase
asked
in
CO and Architecture
Dec 19, 2015
by
Akash Kanase
2.2k
views
co-and-architecture
microprogramming
made-easy-test-series
1
vote
2
answers
1683
MadeEasy Test Series: General Aptitude - Numerical Computation
Q.10 Given and Q = a,b,c are positive integers. What is the number of ordered triplets (a, b, c) such that a + 2b + c ≤ 40?
Akash Kanase
asked
in
Quantitative Aptitude
Dec 19, 2015
by
Akash Kanase
584
views
general-aptitude
made-easy-test-series
3
votes
1
answer
1684
MadeEasy Test Series: General Aptitude - Geometry
Q.5 In the given figure, triangles ABC and PQR are right angled triangles with angle C and Q being right angles. QR is parallel to AC and AB = 300 cm, PQ = 20 cm and QR = 100 cm. The length of side BC to the nearest integer is ___________ cm.
Akash Kanase
asked
in
Quantitative Aptitude
Dec 19, 2015
by
Akash Kanase
604
views
general-aptitude
geometry
made-easy-test-series
2
votes
1
answer
1685
MadeEasy Test Series: Calculus - Differentiability
Q.64 A function f (x) is differentiated twice such that its differential equation λ2f (x) – 2λf ′(x) + f ′′(x) = 0 provides two equal value of λ for all x. It f (0) = 1, f′(0) = 2, then f(x) at x = 1 will be _________. Given ans -> 7.39 (7.00 - 7.80)
Akash Kanase
asked
in
Calculus
Dec 19, 2015
by
Akash Kanase
488
views
made-easy-test-series
calculus
differentiation
2
votes
2
answers
1686
MadeEasy Test Series: Programming & DS - Programming in C
Q.43 Consider the following C program. Which of the following represent the output of above program? 4,500 4,501 5,500 3,500
Akash Kanase
asked
in
Programming in C
Dec 19, 2015
by
Akash Kanase
626
views
made-easy-test-series
programming-in-c
programming
2
votes
0
answers
1687
MadeEasy Test Series: CO & Architecture - Addressing Modes
Q.14 Which of the following is most relevant addressing mode used to write code in which reallocation done at run time? Indexed mode Indirect mode Direct mode Relative mode Related to https://gateoverflow.in/3578/gate2006-it_39 https://gateoverflow.in/1656/gate1998_1-19
Akash Kanase
asked
in
CO and Architecture
Dec 19, 2015
by
Akash Kanase
519
views
co-and-architecture
addressing-modes
made-easy-test-series
0
votes
1
answer
1688
MadeEasy Test Series: Digital Logic -Shift Registers
Q.42 Three 4 bit shift registers are connected in cascade as shown in figure below. Each register is applied with A 4 bit data 1011 is applied to the shift register 1. What is the minimum number of clock pulses required to get same input data at output are with same clock? 11 12 13 14 Please answer !
Akash Kanase
asked
in
Digital Logic
Dec 19, 2015
by
Akash Kanase
1.7k
views
digital-logic
shift-registers
made-easy-test-series
2
votes
1
answer
1689
MadeEasy Test Series: Theory of Computation- Finite Automata
Q.51 Consider the finite automaton is the following figure. What is the number of state to accept same language by DFA for above NFA (need not minimum)? 7 9 11 16 I think here minimum state required is 8. So 9 is correct answer !
Akash Kanase
asked
in
Theory of Computation
Dec 19, 2015
by
Akash Kanase
577
views
theory-of-computation
finite-automata
made-easy-test-series
1
vote
0
answers
1690
MadeEasy Test Series: CO & Architecture - Pipelining
Q.58 Consider 5 stage pipeline which allow all instructions except branch instruction. Program contain 30% conditional instructions out of which 75% are branch instruction. Processor stop fetching the following instruction after the branch instruction ... time. The processor is running with rate of ____________ (in MIPS). Given answer -> 92
Akash Kanase
asked
in
CO and Architecture
Dec 19, 2015
by
Akash Kanase
350
views
co-and-architecture
pipelining
made-easy-test-series
0
votes
1
answer
1691
Grammar is LALR or not
Akanksha Kesarwani
asked
in
Compiler Design
Dec 19, 2015
by
Akanksha Kesarwani
688
views
compiler-design
parsing
lr-parser
made-easy-test-series
0
votes
3
answers
1692
MadeEasy Test Series: CO & Architecture - Speedup
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by 30% and the speed of a fixed point unit has been increased by $20$%. The overall speedup achieved if the ratio of the ... operation used to take twice the time taken by fixed point operation in the original design(upto $2$ decimal places is __________.
sonu
asked
in
CO and Architecture
Dec 17, 2015
by
sonu
556
views
speedup
co-and-architecture
made-easy-test-series
0
votes
1
answer
1693
ME advanced | Probability question HASHING Chaning
Aspi R Osa
asked
in
Algorithms
Dec 15, 2015
by
Aspi R Osa
415
views
hashing
probability
numerical-answers
made-easy-test-series
0
votes
2
answers
1694
Test Series QS - Algorithms
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.
mysticPrince
asked
in
DS
Dec 8, 2015
by
mysticPrince
524
views
data-structures
binary-search-tree
numerical-answers
made-easy-test-series
3
votes
1
answer
1695
boolean expressions
The maximum number of boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x',y,z')=f(x,y,z) is
Jhunjhunuwala
asked
in
Digital Logic
Dec 7, 2015
by
Jhunjhunuwala
1.7k
views
boolean-algebra
digital-logic
made-easy-test-series
2
votes
2
answers
1696
what is the time complexity
priyavssut
asked
in
Algorithms
Dec 5, 2015
by
priyavssut
416
views
algorithms
time-complexity
made-easy-test-series
1
vote
2
answers
1697
Computing the value of P
Himanshu1
asked
in
Algorithms
Dec 4, 2015
by
Himanshu1
598
views
algorithms
identify-function
made-easy-test-series
3
votes
1
answer
1698
MadeEasy Test Series: General Aptitude - Percentage
Q.10 Venkat earns Rs 18,00,000 per annum which is spent under various heads as under: Food : 24% Transportation and House rent : 19% Clothing : 9% Miscellaneous heads : 22% Savings : 14% Loan installment : Rs 18,000 per month. ... to pay off his loan, then the increase in the monthly installment of loan that he can afford is Rs ______________ .
Akash Kanase
asked
in
Quantitative Aptitude
Dec 4, 2015
by
Akash Kanase
975
views
general-aptitude
percentage
made-easy-test-series
2
votes
1
answer
1699
MadeEasy Test Series: Algorithms - Time Complexity
Q.19 Consider the following function. What is the worst case running time of the function f for any positive value of n? O(1) O(n) O(n2) O(n3)
Akash Kanase
asked
in
Algorithms
Dec 4, 2015
by
Akash Kanase
497
views
algorithms
time-complexity
made-easy-test-series
2
votes
1
answer
1700
MadeEasy Test Series: General Aptitude - Fractions
Three boxes labeled A, B and C have a total of 249 marbles. If 3 dozen marbles are transferred from box A' to box B', box B' will have 5 times the number of marbles in box A'. Instead, if 21 marbles are transferred from box B' to box C', the number ... to box B' 30 from box B' to box A' 36 from box A' to box B' 36 from box B' to box A'
Akash Kanase
asked
in
Quantitative Aptitude
Dec 4, 2015
by
Akash Kanase
858
views
general-aptitude
fractions
made-easy-test-series
6
votes
3
answers
1701
What is the time complexity of job sequencing with deadline using greedy algorithm?
What is the time complexity of job sequencing with deadline using greedy algorithm? O(n) O(log n) O(n log n) O(n2) Made Easy Full Syllabus Test-6 : Basic Level : Practice Test-14 Q 19 Please give reference for this answer to this algorithm.
Akash Kanase
asked
in
Algorithms
Dec 1, 2015
by
Akash Kanase
23.4k
views
greedy-algorithm
activity-selection
made-easy-test-series
1
vote
1
answer
1702
Finding complexity in case ratio of two compexity is constant.
Given two positive functions f(n) and g(n). If $\frac{f(n)}{g(n)}=c$, for some constant c ≥ 0 and c is non-negative but not infinite then which of the following is correct? f(n) = O(g(n)) f(n) = θ (g(n)) ... are of same order. In that case they are both upper & lower bounds of each other ! Q 47 From Made Easy FLT 6-Practice Test 14
Akash Kanase
asked
in
Algorithms
Dec 1, 2015
by
Akash Kanase
691
views
algorithms
time-complexity
made-easy-test-series
1
vote
2
answers
1703
MadeEasy Test Series: Computer Networks - Flow Control Methods
Please help me to solve problem 8.
shikharV
asked
in
Computer Networks
Nov 21, 2015
by
shikharV
1.8k
views
made-easy-test-series
computer-networks
flow-control-methods
stop-and-wait
0
votes
3
answers
1704
Minimum cost spanning tree
Please explain why the answer is a)
dhingrak
asked
in
Algorithms
Dec 12, 2014
by
dhingrak
806
views
algorithms
spanning-tree
minimum-spanning-tree
made-easy-test-series
6
votes
2
answers
1705
MadeEasy Test Series: Programming & DS - Hashing
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used, what is the expected number of slots that ends not being empty?
Isha Karn
asked
in
DS
Dec 5, 2014
by
Isha Karn
3.1k
views
made-easy-test-series
data-structures
hashing
2
votes
4
answers
1706
MadeEasy Test Series: Algorithms - Time Complexity
i=0 for(i=1;i<=n;++i) for(j=1;j<=i*i;++j) if((j%i)==0) for(k=1;k<=j;++k) c=c+1; find time complexity of these program?
Siramdas Vamshidhar
asked
in
Algorithms
Nov 28, 2014
by
Siramdas Vamshidhar
1.0k
views
made-easy-test-series
algorithms
time-complexity
Page:
« prev
1
...
52
53
54
55
56
57
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged made-easy-test-series
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...