[{"id":188422,"question":"The definition of transitive 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":188421,"question":"Which of the following method is helpful in creating the heap at once?","choices":[{"text":"insert","value":"A"},{"text":"add","value":"B"},{"text":"update","value":"C"},{"text":"preculateDown","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188420,"question":"If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?","choices":[{"text":"23","value":"A"},{"text":"24","value":"B"},{"text":"21","value":"C"},{"text":"22 (n-1)","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188419,"question":"If there are 56 internal nodes 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},{"id":188418,"question":"Compiler uses which one of the following to evaluate a mathematical equation","choices":[{"text":"Binary Tree","value":"A"},{"text":"Binary Search Tree","value":"B"},{"text":"Parse Tree","value":"C"},{"text":"AVL Tree","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188417,"question":"The difference between the binary tree and a binary search tree is that:<div><br></div>","choices":[{"text":"a binary search tree has two children per node whereas a binary tree can have none, one, or two\r\nchildren per node","value":"A"},{"text":"in binary search tree nodes are inserted based on the values they contain","value":"B"},{"text":"in binary tree nodes are inserted based on the values they contain","value":"C"},{"text":"none of these","value":"D"},{"value":"E"}],"correctAnswer":1},{"id":188416,"question":"Here is a small function definition:<div>void f(int i, int &amp;k)</div><div>{\r\ni</div><div>= 1;\r\nk = 2;</div><div>}</div><div>Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main\r\nprogram calls f(x,y); What are the values of x and y after the function f finishes?</div>","choices":[{"text":"Both x and y are still 0.","value":"A"},{"text":"Both x and y are still 0.","value":"B"},{"text":"x is still 0, but y is now 2.","value":"C"},{"text":"x is now 1, and y is now 2.","value":"D"},{"value":"E"}],"correctAnswer":3},{"id":188415,"question":"A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?","choices":[{"text":"Arrays","value":"A"},{"text":"LinkLists","value":"B"},{"text":"Binary Search Trees","value":"C"},{"text":"All of the given options","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188414,"question":"Suppose currentNode refers to a node in a linked list(using the Node class with member variables called data and next node),What statement changes currentNode so that it refers to the next node?","choices":[{"text":"currentNode ++;","value":"A"},{"text":"currentNode = nextNode;","value":"B"},{"text":"currentNode += nextNode;","value":"C"},{"text":"currentNode = currentNode-&gt;nextNode;","value":"D"},{"value":"E"}],"correctAnswer":4},{"id":188413,"question":"If numbers 5,222,4,48 are inserted in queue,which one will be removed first?","choices":[{"text":"48","value":"A"},{"text":"4","value":"B"},{"text":"222","value":"C"},{"text":"5","value":"D"},{"value":"E"}],"correctAnswer":4}]