Register

Recent questions tagged made-easy-test-series

0 0 votes
0 0 answers
72
72 views
MADE EASY TEST SERIES MSQ
Which of the following statements about lexical error handling is/are TRUE?A. Lexical analyzers may use finite automata with error transitions to recognize malformed toke...
User Avatar
0 0 votes
0 0 answers
40
40 views
MADE EASY TEST SERIES
Code improving transformation can be done at which of the following stages?A. Source codeB. Intermediate codeC. Target codeD. All of these
User Avatar
0 0 votes
1 answers 1 answer
228
228 views
MadeEasy 2026 Mock test
User Avatar
3 3 votes
2 answers 2 answers
521
521 views
Minimum number of marbles to be drawn
A bag contains a large number of red, green, white and black marbles with atleast 24 of each colour, in how many ways one can select 24 of these marbles so that there are...
User Avatar
1 1 vote
0 0 answers
198
198 views
Dependency calculation
User Avatar
0 0 votes
0 0 answers
414
414 views
Hamilton cycle
check for hamiltonian cycle exist in which graphs?
User Avatar
2 2 votes
1 answers 1 answer
557
557 views
Minimum number of marbles to be drawn
A bag contain 5 red marbles, 8 blue marbles, 11 green marbles, 15 yellow marbles. We draw marbles uniformly at random without replacement from the bag. What is the minimu...
User Avatar
3 3 votes
1 answers 1 answer
513
513 views
Jump instruction
Consider a processor with a 4-byte jump instruction encountered at memory address 4096. If the jump instruction is in PC-relative mode and the instruction at memory addre...
User Avatar
3 3 votes
2 2 answers
452
452 views
Made Easy | Programming & Data Structures | TWT-2
A hash table of size 11 using the hash function h(x)=x mod 11 and quadratic probing with hi(x)=(h(x)+i^2)  mod 11 , i∈{0,1,2,…,10}.The key values are given in the followi...
User Avatar
2 2 votes
1 answers 1 answer
284
284 views
Made Easy | Programming & Data Structures | TWT2
Which of the following is/are dynamic data structure?A) Linked listB) StackC) ArrayD) Binary tree
User Avatar
2 2 votes
1 1 answer
533
533 views
MADE EASY test series 2026
User Avatar
0 0 votes
0 0 answers
427
427 views
Made easy test series
In this question why option C is correct and option B is wrong?
User Avatar
0 0 votes
1 1 answer
259
259 views
Data Structures
How can we implement a doubly linked list to build a stack and find the median? What would be the time complexity (insertion, deletion and median) ?
User Avatar
0 0 votes
0 0 answers
474
474 views
Made Easy Test Series 2025
Consider a database system where transactions are executed concurrently. If transaction T1 holds an exclusive lock on resource R1 and requests a shared lock on resource R...
User Avatar
0 0 votes
1 1 answer
275
275 views
MADE EASY
User Avatar
0 0 votes
0 0 answers
590
590 views
made easy test series(advance level test 3)
In a universally database, there are entity sets: Student (SID, Name, Dept), Professor (PID, Name, Dept), Course (CID, Title) and Project (ProjID, Topic). Student registe...
User Avatar
2 2 votes
2 answers 2 answers
419
419 views
Control Word : Made Easy Test Series 2025
 
User Avatar
1 1 vote
1 1 answer
194
194 views
CO and Architecture , Registers.
 
User Avatar
0 0 votes
1 answers 1 answer
380
380 views
No. of heap Data Structures.
 
User Avatar
1 1 vote
1 1 answer
343
343 views
made easy test series 2025
Identify Correct Asymptotic Behviour.
User Avatar
2 2 votes
1 answers 1 answer
730
730 views
Compiler Design SDT - ISRO MadeEasy mock
Consider the following SDT:S - T RR - {printf("*")} + T {printf("*")} R {printf("+")}T - num {printf("*")}R - ε {printf("+")}How many * will be printed before the first +...
User Avatar
1 1 vote
1 1 answer
383
383 views
combinaton and minimization made esy test series
The Boolean expression f (X, Y, Z) in its canonical form for the decoder circuit shown below:A..B..C.. 
User Avatar
2 2 votes
2 answers 2 answers
615
615 views
MADE EASY TEST SERIES 2025
WHICH OF THE FOLLOWING is/are TRUE FOR SYMBOL TABLE ??
User Avatar
0 0 votes
1 answers 1 answer
381
381 views
Made Easy Test Series Mock Test / Graph Theory
 Consider the following graph which represents 5 locations across a city and a person has to travel all of them starting from 1 and return back. What is the cost of the o...
User Avatar
1 1 vote
1 1 answer
365
365 views
made easy 2019
An implementation of a queue Q, using two S1 and S2 is given below:void enqueue(Q,x){ push(S1,x);}void dequeue(Q,x){ if (stack - empty(S2)) then if(stack- em...
User Avatar
0 0 votes
0 0 answers
455
455 views
MADE EASY TEST SERIES
Caption
User Avatar
0 0 votes
0 0 answers
13
13 views
MADE EASY TEST SERIES
User Avatar
2 2 votes
1 answers 1 answer
537
537 views
MADE EASY 2024 mock test 3
The number of binary search trees possible with 7 keys 10,20,30,40,50,60,70 such that the key with value 30 is at the second level of the tree is equal to ___________.
User Avatar
0 0 votes
0 0 answers
232
232 views
Made Easy
Consider the following interleaved schedule S involving transaction T₁, T₂ on data item X and Y.S: R₁(X); W₁(X); R₂(X); W₂(X); R₂(Y); W₂(Y); R₁(Y); W₁(Y); C₂, C₁Where R(X...
User Avatar
Page: