[{"id":188412,"question":"The arguments passed to a function should match in number, type and order with the parameters in the function\r\ndefinition.","choices":[{"text":"True","value":"A"},{"text":"False","value":"B"},{"text":"both","value":"C"},{"value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188411,"question":"Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?","choices":[{"text":"Elements in the first half of the array are less than or equal to elements in the second half of the array","value":"A"},{"text":"None of the given options","value":"B"},{"text":"The array elements form a heap.","value":"C"},{"text":"Elements in the second half of the array are less than or equal to elements in the first half of the array","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188410,"question":"The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.","choices":[{"text":"Remove","value":"A"},{"text":"Next","value":"B"},{"text":"Start","value":"C"},{"text":"Back","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188409,"question":"What is the formula of approixation for the depth of a heap with n nodes?","choices":[{"text":"log (base 2) of n","value":"A"},{"text":"The number of digits in n (base 10 )e,g 145 has three digit","value":"B"},{"text":"The square root of n","value":"C"},{"text":"n","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188408,"question":"Which of the following is not true regarding the maze generation ?","choices":[{"text":"Randomly remove walls until the entrance and exit cells are in same set","value":"A"},{"text":"Removing a wall is the same as doing union of operation","value":"B"},{"text":"Removing a randomly chosen wall if the cell is separatedare already in the same set","value":"C"},{"text":"Do not remove a randomly chosen wall if the cells it separates are already in the same set.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188407,"question":"Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays\r\nbelow; determine the one that cannot possibly be a heap:","choices":[{"text":"16, 18, 20, 22, 24, 28, 30","value":"A"},{"text":"16, 20, 18, 24, 22, 30, 28","value":"B"},{"text":"16, 24, 18, 28, 30, 20, 22","value":"C"},{"text":"16, 24, 20, 30, 28, 18, 22","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188406,"question":"A binary tree with 33 internal nodes has _______ links to internal nodes.\r\n","choices":[{"text":"31","value":"A"},{"text":"32","value":"B"},{"text":"33","value":"C"},{"text":"66","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188405,"question":"Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first\r\npartitioning with the array looking like this:\r\n2 5 1 7 9 12 11 10\r\nWhich statement is correct?","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":188404,"question":"If both pointers of the node in a binary tree are NULL then it will be a/an _______ .","choices":[{"text":"Inner node","value":"A"},{"text":"Leaf node","value":"B"},{"text":"Root node","value":"C"},{"text":"None of the given options","value":"D"},{"value":"E"}],"correctAnswer":2},{"id":188403,"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}]