1000+ Graph Theory Objective Questions and Answers Pdf - 1

Question: 1

Which of the following algorithms solves the all pair shortest path problem?

(A) Floyd’s algorithm

(B) Dijkstra’s algorithm

(C) Warshall’s algorithm

(D) Prim’s algorithm

Question: 2

What transversal techniques list the nodes of a binary search tree in ascending order?

(A) Pre-order

(B) Post order

(C) In-order

(D) None of these

Question: 3

A complete binary tree with the property that the values of each node is at least as large as the values at its children is called

(A) AVL tree

(B) Binary search tree

(C) Heap

(D) Completely balanced tree

Question: 4

A circuit in a connected graph which includes every vertex of the graph is called

(A) Hamilton

(B) Cheque

(C) Universal

(D) Euler

Question: 5

Which data structure is needed to convert infix notation to post fix notation?

(A) Queue

(B) Linear list

(C) Stack

(D) Tree