DS | Take the Quiz

1. When does the ArrayIndexOutOfBoundsException occur?

a) Compile-time

b) Run-time

c) Not an error

d) None of the mentioned

2. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.
Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list

a) I and II

b) I and III

c) I, II and III

d) I, II and IV

3. What is indexed skip list?

a) it stores width of link in place of element

b) it stores index values

c) array based linked list

d) indexed tree

4. What are the operations that could be performed in O(logn) time complexity by red-black tree?

a) insertion, deletion, finding predecessor, successor

b) only insertion

c) only finding predecessor, successor

d) for sorting

5. What is the time complexity of pop() operation when the stack is implemented using an array?

a) O(1)

b) O(n)

c) O(logn)

d) O(nlogn)

6. Which of the following options is an application of splay trees ?

a) networks

b) cache Implementation

c) send values

d) receive values

6. The nodes in a skip list may have many forward references. their number is determined

a) orthogonally

b) randomly

c) sequentially

d) probabilistically

8. To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

a) True

b) False

9. ‘Array implementation of Stack is not dynamic’, which of the following statements supports this argument?

a) a runtime exception halts execution

b) user unable to give the input for stack operations

c) space allocation for array is fixed and cannot be changed during run-time

d) all of the mentioned

10. When to choose Red-Black tree, AVL tree and B-trees?

a) retrieval, sorting and retrieval respectively

b) many searches, when managing more items respectively and many inserts respectively

c) sorting, sorting and retrieval respectively

d) many inserts, many searches and when managing more items respectively