Register
This Combine all questions from Made Easy booklet

Recent questions tagged made-easy-booklet

0 votes
1 answer
31
Regular Expression
can you help me in question my answer is b it's correct or not, or where I'm wron Caption
can you help me in question my answer is b it's correct or not, or where I'm wron Caption
User Avatar
1 votes
0 answers
37
MADEEASYWORKBOOK 2019
Suppose Host A sends over a TCP connection to Host B one segment sequence number 38 and 4 bytes of data.What will be acknowledgements number for subsequent segment. 38 39 42 54
Suppose Host A sends over a TCP connection to Host B one segment sequence number 38 and 4 bytes of data.What will be acknowledgements number for subsequent segment.383942...
User Avatar
0 votes
1 answer
38
#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...
User Avatar
0 votes
1 answer
39
Made easy workbook question
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue? a. Binary heap b. Height balanced binary tree. c. Sorted array
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?a. Binary heapb. Height balanced binary tree.c. Sorted array
User Avatar
2 votes
3 answers
40
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n - 1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1} - (n+2)$ How?
Question:$T(1)=1$$T(n) = 2 T(n - 1) + n$evaluates to?Can anyone solve it by substitution method?Given answer $T(n) = 2^{n+1} - (n+2)$How?
User Avatar
0 votes
1 answer
41
Madeeasy workbook algorithm time complexity
Finding the running time of the following algorithm. $Procedure$ $A(n)$ $\textrm{ if (n}<=\textrm{2) then return 1 ;}$ $else$ $Return(A(\left \lceil \sqrt{n} \right \rceil))$
Finding the running time of the following algorithm.$Procedure$ $A(n)$ $\textrm{ if (n}<=\textrm{2) then return 1 ;}$ $else$ $Return(A(\left \lceil \sqrt{n} \right ...
User Avatar
0 votes
0 answers
42
Made Easy Booklet-Databases
Question 79
Question 79
User Avatar
1 votes
0 answers
43
Made Easy Workbook Database
User Avatar
0 votes
0 answers
44
How to find precedence?
User Avatar
0 votes
0 answers
54
MadeEasy Workbook: Operating System - Page Replacement
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm. 3,2,3, 0,8,4,2,5,0,9,8,3,2
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm.3,2,3, 0,8,4,2,5,0,9,8,3,2
User Avatar
Page: