1000+ Graph Theory Quiz with Answers Pdf - 1

Question: 1

A graph in which all nodes are of equal degree is called

(A) Regular graph

(B) Multigraph

(C) Non regular graph

(D) Complete graph

Question: 2

A simple graph in which there exists an edge between every pair of vertices is called

(A) Eular graph

(B) Complete graph

(C) Planner graph

(D) Incomplete graph

Question: 3

Which of the following sorting method is stable?

(A) Straight insertion sort

(B) Heap sort

(C) Shell sort

(D) Binary insertion sort

Question: 4

Preorder is nothing but

(A) Linear order

(B) Topological order

(C) Breadth first order

(D) Depth first order

Question: 5

In which tree, for every node the height of its left sub tree and right sub tree differ at least by one?

(A) Threaded binary tree

(B) Binary search tree

(C) Complete tree

(D) AVL tree