[{"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}]