[{"id":188492,"question":"What requirement is placed on an array, so that binary search may be used to locate an entry?","choices":[{"text":" The array elements must form a heap.","value":"A"},{"text":"The array must have at least 2 entries","value":"B"},{"text":"The array must be sorted.","value":"C"},{"text":"The array‟s size must be a power of two.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188491,"question":"A complete binary tree of height ___ has node between 16 to 31.","choices":[{"text":"2","value":"A"},{"text":"3","value":"B"},{"text":"4","value":"C"},{"text":"5","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188490,"question":"Consider the following infix expression:\r\nx – y * a + b / c\r\nWhich of the following is a correct equivalent expression(s) for the above?\r\n","choices":[{"text":"x y -a * b +c /","value":"A"},{"text":"x *y a - b c / +","value":"B"},{"text":"x y a * - b c / +","value":"C"},{"text":" x y a * - b/ + c ","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188489,"question":"A complete binary tree of height 3 has between ________ nodes. ","choices":[{"text":"8 to 14","value":"A"},{"text":"8 to 15","value":"B"},{"text":"8 to 16","value":"C"},{"text":"8 to 17","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188488,"question":"A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.","choices":[{"text":"partially","value":"A"},{"text":"completely","value":"B"},{"text":"incompletely","value":"C"},{"text":"partly","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188487,"question":"Which of the following statement statement is true about dummy node of threaded binary type?","choices":[{"text":"This dummy node never has a value","value":"A"},{"text":"This dummy node has always some dummy values","value":"B"},{"text":"This dummy node has either no value or some dummy value","value":"C"},{"text":"This dummy node has always some integer value","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188486,"question":"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 __________ successor","choices":[{"text":"levelorder","value":"A"},{"text":"Preorder","value":"B"},{"text":"Inorder","value":"C"},{"text":"Postorder","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188485,"question":"Which of the following statement is correct property of binary trees?","choices":[{"text":"A binary tree with internal nodes has N+1 internal links","value":"A"},{"text":"A binary tree with N external nodes has 2N internal nodes.","value":"B"},{"text":"A binary tree with N internal nodes has N+ 1 external node.","value":"C"},{"text":"None of above statement is a property of the binary tree.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188484,"question":"While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.","choices":[{"text":"Equal to the small frequency","value":"A"},{"text":"Equal to the greater","value":"B"},{"text":"Equal to the sum of the two frequencies","value":"C"},{"text":"Equal to the difference of the two frequencies","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188483,"question":"Use of binary tree in compression of data is known as _______ ","choices":[{"text":"Traversal","value":"A"},{"text":"Heap","value":"B"},{"text":"Union","value":"C"},{"text":"Huffman encoding","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188482,"question":"If there are N elements in an array then the number of maximum steps needed to find an element using Binary\r\nSearch is _______","choices":[{"text":"N","value":"A"},{"text":"N<sup>2</sup>","value":"B"},{"text":"Nlog<sub>2 </sub>n","value":"C"},{"text":"log<sub>2</sub>N","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188481,"question":"A binary relation R over S is called an equivalence relation if it has following property(s)","choices":[{"text":"Reflexivity","value":"A"},{"text":"Symmetry","value":"B"},{"text":"Transitivity","value":"C"},{"text":"All of the given options","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188480,"question":"If a complete binary tree has n number of nodes then its height will be","choices":[{"text":"Log<sub>2</sub>(n+1)-1","value":"A"},{"text":"2<sup>n</sup>","value":"B"},{"text":"2<sup>n</sup>-1","value":"C"},{"value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188479,"question":"I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of\r\nthese pointers will change during an insertion into an EMPTY queue?\r\n","choices":[{"text":"Neither changes","value":"A"},{"text":"only front pointer charges","value":"B"},{"text":"Only rear pointer changes.","value":"C"},{"text":"Both change.\r\n Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change\r\nand point to 0.","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188478,"question":"A queen is a data structure where elements are,","choices":[{"text":"inserted at the front and removed from the back","value":"A"},{"text":"inserted and removed from the top.","value":"B"},{"text":"inserted at the back and removed from the front.","value":"C"},{"text":"inserted and removed from both ends.","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188477,"question":"Double link list is always has one NULL pointer","choices":[{"text":"True","value":"A"},{"text":"False","value":"B"},{"text":"Not Sure","value":"C"},{"value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188476,"question":"Which of the following statement is NOT correct?","choices":[{"text":"In linked list the elements are necessarily to be contiguous","value":"A"},{"text":"In the linked list the elements may locate at far positions in the memory","value":"B"},{"text":"in the linked list each elements also has he address of the elements next to it","value":"C"},{"text":"In an array the elements are contiguous ","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188475,"question":"In an array we can store data elements of different types","choices":[{"text":"True","value":"A"},{"text":"False","value":"B"},{"text":"Not sure","value":"C"},{"value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188474,"question":"Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains\r\nthe maximum element. What is the result of deleting 40 from this heap","choices":[{"text":"[50,32, 37,13, 28, 22, 36] according to max heap property","value":"A"},{"text":"[37, 28, 32, 22, 36, 13]","value":"B"},{"text":"[37, 36, 32, 28, 13, 22]","value":"C"},{"text":"[37, 32, 36, 13, 28, 22]","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188473,"question":"Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when\r\nusing a binary search for a value, the binary search always finds ____________","choices":[{"text":"the first occurance of value","value":"A"},{"text":"the second occurrence of a value","value":"B"},{"text":"may find first or second occurrence of a value.","value":"C"},{"text":"None of the given options","value":"D"},{"value":"E"}],"correctAnswer":1}]