[{"id":188391,"question":"A kind of expression where the operator is present between two operands called ________ expressions .","choices":[{"text":"Postfix","value":"A"},{"text":"Infix","value":"B"},{"text":"Prefix","value":"C"},{"text":"None of the above","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188390,"question":"\"+” is a _________operator.","choices":[{"text":"Unary","value":"A"},{"text":"Binary","value":"B"},{"text":"Ternary","value":"C"},{"text":"None of the above","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188389,"question":"it will be efficient to place stack elements at the start of the list because insertion and removal take\r\n_______time.","choices":[{"text":"Variable","value":"A"},{"text":"Constant","value":"B"},{"text":"Inconsistent","value":"C"},{"text":"None of the above","value":"D"},{"text":"<br>","value":"E"}],"correctAnswer":2},{"id":188388,"question":"A binary tree with 24 internal node has ____ external node.","choices":[{"text":"22","value":"A"},{"text":"23","value":"B"},{"text":"48","value":"C"},{"text":"25","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188387,"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 ____________\r\n","choices":[{"text":"the first occurrence of a 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},{"id":188386,"question":"Which of the given option is NOT a factor in Union by Size: ","choices":[{"text":"Maintain sizes (number of nodes) of all trees, and during union.","value":"A"},{"text":"Make smaller tree, the subtree of the larger one","value":"B"},{"text":"Make the larger tree, the subtree of the smaller one.","value":"C"},{"text":"Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k\r\nnodes","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188385,"question":"A complete binary tree of height ____ has nodes between 16-31.","choices":[{"text":"2","value":"A"},{"text":"3","value":"B"},{"text":"4","value":"C"},{"text":"5","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188384,"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},{"id":188383,"question":"_________ is a data structure that can grow easily dynamically at run time without having to copy existing\r\nelements.","choices":[{"text":"Array ()","value":"A"},{"text":"List","value":"B"},{"text":"Both of these","value":"C"},{"text":"None of these","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188382,"question":"Consider a min heap, represented by the following array:\r\n11,22,33,44,55\r\nAfter inserting a node with value 66.Which of the following is the updated min heap?","choices":[{"text":"11,22,33,44,55,66","value":"A"},{"text":"11,22,33,44,66,55","value":"B"},{"text":"11,22,33,66,44,55","value":"C"},{"text":"11,22,66,33,44,55","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188381,"question":"Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are\r\nnow guaranteed to be in their final spot (never to be moved again)?","choices":[{"text":"21","value":"A"},{"text":"41","value":"B"},{"text":"42","value":"C"},{"text":"53","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188380,"question":"Consider a min heap, represented by the following array:\r\n10,30,20,70,40,50,80,60\r\nAfter inserting a node with value 31.Which of the following is the updated min heap?","choices":[{"text":"10,30,20,31,40,50,80,60,70","value":"A"},{"text":"10,30,20,70,40,50,80,60,31","value":"B"},{"text":"10,31,20,30,40,50,80,60,31","value":"C"},{"text":"31,10,30,20,70,40,50,80,60","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188379,"question":"Which of the following statement is true about dummy node of threaded binary tree","choices":[{"text":"The left pointer of dummy node points to the itself while the right pointer points to the root of tree.","value":"A"},{"text":"The left pointer of dummy node points to the root node of the tree while the right pointer points\r\nitself i.e. to dummy node","value":"B"},{"text":"The left pointer of dummy node points to the root node of the tree while the right pointer is always\r\nNULL","value":"C"},{"text":"The right pointer of dummy node points to the itself while the left pointer is always NULL","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188378,"question":"Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original\r\nmessage","choices":[{"text":"Linked List","value":"A"},{"text":"Stack","value":"B"},{"text":"Queue","value":"C"},{"text":"Binary tree","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188377,"question":"Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?","choices":[{"text":"O(nlogn) sorts","value":"A"},{"text":"Interchange sort","value":"B"},{"text":"Average time is quadratic","value":"C"},{"text":"None of the given options.","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188376,"question":"A simple sorting algorithm like selection sort or bubble sort have a wrostcase of","choices":[{"text":"O(1) time because all lists take the same amount of time to sort","value":"A"},{"text":"O(n) time because it has to perform n swaps to order the list.","value":"B"},{"text":"O(n<sup>2</sup> ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these\r\nalgorithms can guarantee that 1 element is sorted.","value":"C"},{"text":"O(n<sup>3</sup> ) time, because the worst case has really random input which takes longer to sort.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188375,"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":"Heterogeneous","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188374,"question":"Union is a ___________ time operation","choices":[{"text":"Constant","value":"A"},{"text":"Polynomial","value":"B"},{"text":"Exponential","value":"C"},{"text":"None of the above","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188373,"question":"Which of the following is not an example of equivalence relation:","choices":[{"text":"Electrical Connectivity","value":"A"},{"text":"Set of people","value":"B"},{"text":"&lt;= relation","value":"C"},{"text":"Set of pixels","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188372,"question":"The definition of Transitivity property is","choices":[{"text":"For all element x member of S, x R x","value":"A"},{"text":"For all elements x and y, x R y if and only if y R x","value":"B"},{"text":"For all elements x, y and z, if x R y and y R z then x R z","value":"C"},{"text":"For all elements w, x, y and z, if x R y and w R z then x R z","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188371,"question":"A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to\r\nexternal nodes","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":188370,"question":"If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?","choices":[{"text":"N-1","value":"A"},{"text":"N","value":"B"},{"text":"N+1","value":"C"},{"text":"N+2","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188369,"question":"If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?","choices":[{"text":"54","value":"A"},{"text":"55","value":"B"},{"text":"56","value":"C"},{"text":"57","value":"D"},{"value":"E"}],"correctAnswer":4}]