Data Structure Objective Questions and Answers Pdf - 1

Question: 1

Which of the following data structure is more appropriate to represent a heap?

(A) Two-dimensional array

(B) Doubly linked list

(C) Linear Array

(D) Linked list

Ans: C

Linear Array

Question: 2

Minimum number of fields in each node of a doubly linked list is ____

(A) 2

(B) 3

(C) 4

(D) None of the above

Ans: B

3

Question: 3

A graph in which all vertices have equal degree is known as ____

(A) Complete graph

(B) Regular graph

(C) Multi graph

(D) Simple graph

Ans: A

Complete graph

Question: 4

A vertex of in-degree zero in a directed graph is called a/an

(A) Root vertex

(B) Isolated vertex

(C) Sink

(D) Articulation point

Ans: C

Sink

Question: 5

A graph is a tree if and only if graph is

(A) Directed graph

(B) Contains no cycles

(C) Planar

(D) Completely connected

Ans: B

Contains no cycles

Error Report!

Related Questions