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

Question: 6

A binary tree whose every node has either zero or two children is called

(A) data structure

(B) extended binary tree

(C) binary search tree

(D) complete binary tree

Question: 7

A search technique where we keep expanding nodes with least accumulated cost so far is called

(A) breadth first

(B) branch and bound

(C) best first

(D) hill climbing

Question: 8

In linked representation of stack the null pointer of the last nodes in the list signals

(A) in between some value

(B) middle of the stack

(C) bottom of the stack

(D) beginning of the stack

Question: 9

______ is very useful in situation when data have to stored and then retrieved in reverse order.

(A) Link list

(B) List

(C) Queue

(D) Stack

Question: 10

How many Boolean functions of 3 variables are there

(A) 16

(B) 64

(C) 128

(D) 256