[{"id":188452,"question":"Suppose we are sorting an array of eight integers using quick sort ,and we have just finished the first partitioning with the array looking like this<div>2 5 1 7 9 12 11 10</div><div>Which statement is correct?</div>","choices":[{"text":"The pivot could be either the 7 or the 9.","value":"A"},{"text":"The pivot could be the 7, but it is not the 9.","value":"B"},{"text":"The pivot is not the 7, but it could be the 9","value":"C"},{"text":"Neither the 7 nor the 9 is the pivot.","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188451,"question":"We can build a heap in ________ time.","choices":[{"text":"Linear","value":"A"},{"text":"Exponential","value":"B"},{"text":"Polynomial","value":"C"},{"text":"None of the above","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188450,"question":"Consider a min heap, represented by the following array:\r\n3,4,6,7,5\r\nAfter calling the function deleteMin().Which of the following is the updated min heap?","choices":[{"text":"4,6,7,5\r\n","value":"A"},{"text":"6,7,5,4","value":"B"},{"text":"4,5,6,7 ","value":"C"},{"text":"4,6,5,7","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188449,"question":"Which of the following statement is NOT true about threaded binary tree?","choices":[{"text":"Right thread of the right-most node points to the dummy node","value":"A"},{"text":"Left thread of the left-most node points to the dummy node.","value":"B"},{"text":"The left pointer of dummy node points to the root node of the tree","value":"C"},{"text":"Left thread of the right-most node points to the dummy node.","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188448,"question":"By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and\r\nconsumes a lot of memory and time.","choices":[{"text":"Binary tree only","value":"A"},{"text":"Threaded binary tree","value":"B"},{"text":"Heap data structure","value":"C"},{"text":"Huffman encoding","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188447,"question":"Which of the following statement is correct?","choices":[{"text":"A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD\r\n(in actual sense, a link) to its INORDER successor.","value":"A"},{"text":"A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a\r\nTHREAD (in actual sense, a link) to its PREOREDR successor.","value":"B"},{"text":"A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a\r\nTHREAD (in actual sense, a link) to its INORDER successor.","value":"C"},{"text":"A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD\r\n(in actual sense, a link) to its POSTORDER successor.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188446,"question":"Binary Search is an algorithm of searching, used with the ______ data","choices":[{"text":"Sorted","value":"A"},{"text":"Unsorted","value":"B"},{"text":"Heterogeneous","value":"C"},{"text":"Random","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188445,"question":"Which of the following is NOT a correct statement about Table ADT.","choices":[{"text":"n a table, the type of information in columns may be different. yes","value":"A"},{"text":"A table consists of several columns, known as entities.","value":"B"},{"text":"The row of a table is called a record. ","value":"C"},{"text":"A major use of table is in databases where we build and use tables for keeping information.","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188444,"question":"Which one of the following is NOT the property of equivalence relation","choices":[{"text":"Reflexive","value":"A"},{"text":"Symmetric","value":"B"},{"text":"Transitive","value":"C"},{"text":"Associative","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188443,"question":"Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays\r\nbelow, determine the one that cannot possibly be a heap:","choices":[{"text":"7 6 5 4 3 2 1","value":"A"},{"text":"7 3 6 2 1 4 5","value":"B"},{"text":"7 6 4 3 5 2 1","value":"C"},{"text":"7 3 6 4 2 5 1","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188442,"question":"Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)","choices":[{"text":"Log<sub>2</sub>(n+1)","value":"A"},{"text":"Log<sub>2</sub>(n+1) -1","value":"B"},{"text":"1.44 Log<sub>2</sub>n","value":"C"},{"text":"1.66 Log<sub>2</sub>n","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188441,"question":"Every AVL is","choices":[{"text":"Binary tree","value":"A"},{"text":"Complete tree","value":"B"},{"text":"None of these","value":"C"},{"text":"Binary Search tree","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188440,"question":"Select the FALSE statement binary tree.","choices":[{"text":"Every binary tree has at least one node.","value":"A"},{"text":"Every non-empty tree has exactly one root node.","value":"B"},{"text":"Every node has at most two children.","value":"C"},{"text":"Every non-root node has exactly one parent.","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188439,"question":"_____ only removes items in reserve order as they were entered","choices":[{"text":"Stack","value":"A"},{"text":"Queue","value":"B"},{"text":"Both of these","value":"C"},{"text":"None of these","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188438,"question":"In case of deleting a node from AVL tree,rotation could be prolong to the root node.","choices":[{"text":"yes","value":"A"},{"text":"no","value":"B"},{"text":"not sure","value":"C"},{"value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188437,"question":"Here is an array of ten integers:\r\n5 3 8 9 1 7 0 2 6 4\r\nThe array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).","choices":[{"text":"0 3 8 9 1 7 5 2 6 4","value":"A"},{"text":"2 6 4 0 3 8 9 1 7 5","value":"B"},{"text":"2 6 4 9 1 7 0 3 8 5","value":"C"},{"text":"0 3 8 2 6 4 9 1 7 5","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188436,"question":"Suppose we have a hash table whose hash function is \"n% 12\",if the number 35 is already in the hash table which of the following numbers would cause a collision ?","choices":[{"text":"144","value":"A"},{"text":"145","value":"B"},{"text":"143","value":"C"},{"text":"148","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188435,"question":"We are given N items to build a heap ,this can be done with ______ successive inserts.","choices":[{"text":"N-1","value":"A"},{"text":"N","value":"B"},{"text":"N+1","value":"C"},{"text":"N+2","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188434,"question":"In complete binary tree the bottom level is filled from________","choices":[{"text":"Left to right","value":"A"},{"text":"Right to left","value":"B"},{"text":"Not filled at all","value":"C"},{"text":"None of the given option","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188433,"question":"The maximum number of external nodes for a binary tree of Height H is ____","choices":[{"text":"2<sup>h</sup>","value":"A"},{"text":"2<sup>h</sup>+1","value":"B"},{"text":"2<sup>h</sup>+2","value":"C"},{"text":"2<sup>h</sup>+3","value":"D"},{"value":"E"}],"correctAnswer":1}]