Register

Recent questions tagged made-easy-test-series

0 0 votes
4 answers 4 answers
1.9k
1.9k views
Masters theorem
User Avatar
3 3 votes
1 answers 1 answer
1.2k
1.2k views
ME TEST SERIES
Consider two arrays A[] and B[],if arrays A is in increasing order and array B is in decreasing order is input to join a algorithm. the output is an array C[1......2n] wh...
User Avatar
3 3 votes
2 answers 2 answers
2.0k
2.0k views
MadeEasy Subject Test: Algorithms - Graph Algorithms
Consider vertices V1 and V2 that are simultaneously on function call stack at some point during DFS from vertex s.Which of the following are always true for this digraph ...
User Avatar
3 3 votes
1 answers 1 answer
1.4k
1.4k views
MadeEasy Subject Test: CO & Architecture - Pipelining
User Avatar
1 1 vote
0 0 answers
1.1k
1.1k views
MadeEasy Subject Test: Programming & DS - Hashing
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
User Avatar
0 0 votes
3 3 answers
2.6k
2.6k views
Programming
Consider the following program segmentint main(){char *str = "GATECS";printf("%d", madeeasy(str));return 0;}int madeeasy(int *p1){int *p2 = p1;while(*++p1);return p1-p2;}...
User Avatar
1 1 vote
0 0 answers
1.2k
1.2k views
MadeEasy Subject Test: Compiler Design - Parsing
The given answer is 5,i am getting 616 in CLR and 10 in LALR.Please someone confirm?
User Avatar
0 0 votes
1 1 answer
1.3k
1.3k views
MadeEasy Subject Test: Computer Networks - Tcp
Why have they no taken MSS while calculating. The answer would have been different had they taken MSS into account.
User Avatar
0 0 votes
1 1 answer
817
817 views
MadeEasy Subject Test: Computer Networks - Network Addressing
Please Explain this
User Avatar
2 2 votes
1 1 answer
2.3k
2.3k views
MadeEasy Subject Test: Computer Networks - Congestion Control
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation dela...
User Avatar
2 2 votes
1 1 answer
1.9k
1.9k views
Algo:- Nuts and bolts
User Avatar
2 2 votes
1 1 answer
797
797 views
MadeEasy Subject Test: Digital Logic - Flip Flop
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the...
User Avatar
2 2 votes
1 1 answer
1.8k
1.8k views
MadeEasy Subject Test: Programming & DS - Binary Search Tree
Consider file system stores records as per binary search tree principles. If the postorder traversal of records is given by 2, 4, 3, 9, 13, 7, 6, 17, 20, 18, 15. The expe...
User Avatar
1 1 vote
2 2 answers
983
983 views
MadeEasy Subject Test: Operating System - Process Schedule
I encountered 1 question on context switching in Made Easy test series where it is mentioned:Scheduling policy is preemptive priority. Context switch time is 1 unit.So wh...
User Avatar
1 1 vote
1 1 answer
732
732 views
MadeEasy Subject Test: Databases - Transactions
User Avatar
2 2 votes
1 answers 1 answer
2.2k
2.2k views
compiler-design -tokens
User Avatar
2 2 votes
1 answers 1 answer
574
574 views
MadeEasy Subject Test: Compiler Design - Grammar
User Avatar
3 3 votes
2 2 answers
868
868 views
MadeEasy Subject Test: Compiler Design - Parsing
EXPLAIN...
User Avatar
1 1 vote
1 1 answer
855
855 views
made easy test
User Avatar
0 0 votes
0 0 answers
852
852 views
MadeEasy Subject Test: Operating System - Process Synchronization
The pic shows the question along with options:
User Avatar
0 0 votes
1 answers 1 answer
1.3k
1.3k views
MadeEasy Subject Test: Operating System - Resource Allocation
User Avatar
1 1 vote
1 answers 1 answer
913
913 views
MadeEasy Subject Test: Operating System - Process Synchronization
User Avatar
2 2 votes
2 2 answers
777
777 views
MadeEasy Subject Test: Theory of Computation - Recursive And Recursively Enumerable Languages
User Avatar
0 0 votes
1 answers 1 answer
808
808 views
MadeEasy Subject Test: Theory of Computation - Regular Expressions
sometimes questions like this will take more time plz anyone provide shortcut to this type ,this is easy but many time checking from 0 length to onward is very time consu...
User Avatar
0 0 votes
1 1 answer
560
560 views
MadeEasy Subject Test: Theory of Computation - Context Free Language
is there any short-cut to this type questions
User Avatar
0 0 votes
2 answers 2 answers
1.6k
1.6k views
MadeEasy Subject Test: Theory of Computation - Identify Class Language
User Avatar
0 0 votes
1 answers 1 answer
804
804 views
MadeEasy Subject Test: Computer Networks - Congestion Control
User Avatar
0 0 votes
0 0 answers
679
679 views
MadeEasy Subject Test: Compiler Design - Parsing
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
User Avatar
3 3 votes
1 answers 1 answer
1.5k
1.5k views
MadeEasy Subject Test: CO & Architecture - Conflict Misses
A computer system contains a main memory of 32 K size with 16-bit words. It also has a 4 K word cache divided into 4 slot sets with 64 words per slot. Assume that the cac...
User Avatar
Page: