1
Consider the function: int fun(int n) { if (n==4) return n; else return 2*fun(n+1); } A MOD-16 ripple counter is holding the count $(1001)_2.$ What will be the count after "$(\text{fun}(2)+15)_{10}$" clock pulses? $(1000)_2$ $(1010)_2$ $(1011)_2$ $(1101)_2$
2
3
What is the maximum possible height of an AVL tree with 20 nodes?
4
(11+1111)* minimized number of states ???
5
Minimum number of tables required and explain how
6
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers One-third of the product of the $3$ consecutive integers One-sixth of the product of the $3$ consecutive integers None of the above
7
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus