Data Structures and Algorithms MCQs Test 4 Online For Preparation

Test Instructions

Data Structures and Algorithms MCQs Test 4 Online For Preparation

1. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called ?
A.
B.
C.
D.

2. An algorithm that calls itself directly or indirectly is known as ?
A.
B.
C.
D.

3. In a graph if e=(u, v) means ?
A.
B.
C.
D.

4. Which of the following sorting algorithm is of divide-and- conquer type ?
A.
B.
C.
D.

5. If every node u in G is adjacent to every other node v in G, A graph is said to be ?
A.
B.
C.
D.

6. In a graph if e=[u, v], Then u and v are called ?
A.
B.
C.
D.

7. A connected graph T without any cycles is called ?
A.
B.
C.
D.

8. In a Heap tree ?
A.
B.
C.
D.

9. The in order traversal of tree will yield a sorted listing of elements of tree in ?
A.
B.
C.
D.

10. The post order traversal of a binary tree is DEBFCA. Find out the per order traversal ?
A.
B.
C.
D.


 

Leave a Reply

Your email address will not be published. Required fields are marked *

Copy Paste blocker plugin by jaspreetchahal.org