[{"id":188402,"question":"In a perfectly balanced tree the insertion of a node needs ________ .","choices":[{"text":"One rotation","value":"A"},{"text":"Two rotations","value":"B"},{"text":"Rotations equal to number of levels","value":"C"},{"text":"No rotation at all","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188401,"question":"Consider te following array\r\n 23 15 5 12 40 10 7\r\nAfter the first pass of a particular algorithm, the array looks like\r\n 15 5 12 23 10 7 40\r\nName the algorithm used","choices":[{"text":"Heap sort","value":"A"},{"text":"Selection sort","value":"B"},{"text":"Insertion sort","value":"C"},{"text":"Bubble sort (","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188399,"question":"There is/are ________ case/s for rotation in an AVL tree,","choices":[{"text":"1","value":"A"},{"text":"2","value":"B"},{"text":"3","value":"C"},{"text":"4","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188398,"question":"Which one is a self-referential data type? ","choices":[{"text":"Stack","value":"A"},{"text":"Queue","value":"B"},{"text":"Link list","value":"C"},{"text":"All of these","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188397,"question":"If a max heap is implemented using a partially filled array called data, and the array contains n elements (n &gt;\r\n0), where is the entry with the greatest value?","choices":[{"text":"Data[0]","value":"A"},{"text":"data[1]","value":"B"},{"text":"data[n-1]","value":"C"},{"text":"data[n]","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188396,"question":"If a complete binary tree has height h then its no. of nodes will be,","choices":[{"text":"Log (h)","value":"A"},{"text":"2<sup>h</sup>+1\r\n- 1","value":"B"},{"text":"Log (h) - 1","value":"C"},{"text":"2<sup>h</sup> - 1","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188395,"question":"If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good\r\ndata structure to use.","choices":[{"text":"Array","value":"A"},{"text":"List","value":"B"},{"text":"Both","value":"C"},{"text":"None of the above","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188394,"question":"Each node in a double link list has ,","choices":[{"text":"1 pointer","value":"A"},{"text":"2 pointer","value":"B"},{"text":"3 pointer","value":"C"},{"text":"4 pointers","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188393,"question":"A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external","choices":[{"text":"N+1, 2N, N-1","value":"A"},{"text":"N+1, N-1, 2N","value":"B"},{"text":"2N, N-1, N+1","value":"C"},{"text":"N-1, 2N, N+1","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188392,"question":"Here is a small function definition:\r\nvoid f(int i, int &amp;k)\r\n{\r\ni = 1;\r\nk = 2;\r\n}\r\nSuppose that a main program has two integer variables x and y, which are given the value 0. Then the main\r\nprogram calls f(x,y); What are the values of x and y after the function f finishes?","choices":[{"text":"Both x and y are still 0.","value":"A"},{"text":"x is now 1 but y is still 0","value":"B"},{"text":"x is still 0,but y is now 2","value":"C"},{"text":"x is now1 1 and y is now 2","value":"D"},{"value":"E"}],"correctAnswer":3}]