All MCQs Tests - VU CS301 - Data Structures

Question 1: it will be efficient to place stack elements at the start of the list because insertion and removal take __________ time.

Question 2: New items are added at the __________ of the stack.

Question 3: If we want to find 3rd minimum element from an array of elements, then after applying buildHeap method, how many times deleteMin method will be called?

Question 4: An alternative name for the same object. A "nickname".

Question 5: Searching of an element in an AVL tree take minimum __________ time (where n is number of nodes in AVL tree)

Question 6: Which of the following statement is NOT true about find operation :

Question 7: A binary tree of N nodes has __________.

Question 8: next() method of List class is used to:

Question 9: A binary tree with 33 internal nodes has __________ links to internal nodes.

Question 10: Ahmad is cousin of Ali and Ali is also cousin of Ahmad"