Register

Recent questions tagged made-easy-test-series

473
views
1 answers
0 votes
MadeEasy Test Series: Computer Networks - Sliding Window
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The sender and receiver window ... time required in this communication?a) 250 μsecb) 200 μsecc) 275 μsecd) 450 μsec
User Avatar
1.3k
views
2 answers
1 votes
What are the advantages of star topology?
(a) Less number of cables are required(b) More number of cables are required(c) It is a distributed topology(d) Security is high
User Avatar
1.6k
views
1 answers
3 votes
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 ... time of 4 unit, 12 unit and 8 unit respectively (units) is ______.
User Avatar
2.3k
views
2 answers
1 votes
MadeEasy Test Series: CO & Architecture - MicroProgramming
Q.27Consider 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 ... that answer should be multiple of 8 , if it is in bit !
User Avatar
639
views
2 answers
1 votes
MadeEasy Test Series: General Aptitude - Numerical Computation
Q.10Given and Q = a,b,c are positive integers. What is the number of ordered triplets (a, b, c) such that a + 2b + c ≤ 40?
User Avatar
645
views
1 answers
3 votes
MadeEasy Test Series: General Aptitude - Geometry
Q.5In 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 = ... and QR = 100 cm. The length of side BC to the nearest integer is ___________ cm.
User Avatar
513
views
1 answers
2 votes
MadeEasy Test Series: Calculus - Differentiability
Q.64A 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 ... then f(x) at x = 1 will be _________.Given ans ->7.39 (7.00 - 7.80)
User Avatar
668
views
2 answers
2 votes
MadeEasy Test Series: Programming & DS - Programming in C
Q.43Consider the following C program.Which of the following represent the output of above program?4,5004,5015,5003,500
User Avatar
542
views
0 answers
2 votes
MadeEasy Test Series: CO & Architecture - Addressing Modes
Q.14Which of the following is most relevant addressing mode used to write code in which reallocation done at run time?Indexed modeIndirect modeDirect ... ://gateoverflow.in/3578/gate2006-it_39https://gateoverflow.in/1656/gate1998_1-19
User Avatar
1.8k
views
1 answers
0 votes
MadeEasy Test Series: Digital Logic -Shift Registers
Q.42Three 4 bit shift registers are connected in cascade as shown in figure below. Each register is applied withA 4 bit data 1011 is applied to the ... required to get same input data at output are with same clock?11121314Please answer !
User Avatar
609
views
1 answers
2 votes
MadeEasy Test Series: Theory of Computation- Finite Automata
Q.51Consider 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)?791116I think here minimum state required is 8. So 9 is correct answer !
User Avatar
401
views
0 answers
1 votes
MadeEasy Test Series: CO & Architecture - Pipelining
Q.58Consider 5 stage pipeline which allow all instructions except branch instruction. Program contain 30% conditional instructions out of which 75% are branch instruction. ... running with rate of ____________ (in MIPS).Given answer -> 92
User Avatar
726
views
1 answers
0 votes
Grammar is LALR or not
User Avatar
614
views
3 answers
0 votes
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 ... by fixed point operation in the original design(upto $2$ decimal places is __________.
User Avatar
443
views
1 answers
0 votes
ME advanced | Probability question HASHING Chaning
User Avatar
553
views
2 answers
0 votes
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 ... occur on the search path from the root to node containing the value 50 are ________.
User Avatar
1.7k
views
1 answers
3 votes
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
User Avatar
459
views
2 answers
2 votes
what is the time complexity
User Avatar
691
views
2 answers
1 votes
Computing the value of P
User Avatar
1.0k
views
1 answers
3 votes
MadeEasy Test Series: General Aptitude - Percentage
Q.10Venkat earns Rs 18,00,000 per annum which is spent under various heads as under: ... his loan, then the increase in the monthly installment of loan that he can afford is Rs ______________ .
User Avatar
535
views
1 answers
2 votes
MadeEasy Test Series: Algorithms - Time Complexity
Q.19Consider 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)
User Avatar
923
views
1 answers
2 votes
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 ... to box A'36 from box A' to box B'36 from box B' to box A'
User Avatar
25.1k
views
3 answers
6 votes
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 EasyFull Syllabus Test-6 : Basic Level : Practice Test-14Q 19Please give reference for this answer to this algorithm.
User Avatar
741
views
1 answers
1 votes
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 ... they are both upper & lower bounds of each other !Q 47From Made Easy FLT 6-Practice Test 14
User Avatar
1.9k
views
2 answers
1 votes
MadeEasy Test Series: Computer Networks - Flow Control Methods
Please help me to solve problem 8.
User Avatar
872
views
3 answers
0 votes
Minimum cost spanning tree
Please explain why the answer is a)
User Avatar
3.3k
views
2 answers
6 votes
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?
User Avatar
1.1k
views
4 answers
2 votes
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?
User Avatar
Page: