1000+ Data structures and Algorithms Questions and Answers Pdf - 1

Question: 1

Sequential representation of binary tree uses

(A) single linear array

(B) two dimensional array

(C) three dimensional array

(D) array with pointers

Question: 2

In Binary trees nodes with no successor are called

(A) final nodes

(B) last nodes

(C) end nodes

(D) terminal nodes

Question: 3

The operation of processing each element in the list is known as

(A) traversal

(B) inserting

(C) merging

(D) sorting

Question: 4

One structure cannot be

(A) a member of a union

(B) a member of the same structure

(C) a member of some other structure

(D) all of these

Question: 5

Which data structure is used in breadth first search of a graph to hold nodes?

(A) array

(B) tree

(C) queue

(D) stack