1000+ Graph theory Multiple Choice Questions & Answers Pdf - 1

Question: 1

The terminal vertices of a path are of degree

(A) Zero

(B) One

(C) Two

(D) More than four

Question: 2

A graph with n vertices and n - 1 edges that is not a tree, is

(A) A circuit

(B) Euler

(C) Connected

(D) Disconnected

Question: 3

What is the true complexity of linear search algorithm over an array of n element?

(A) 0 (n)

(B) O(n / log₂ n)

(C) O(n²)

(D) (log₂n)

Question: 4

A vertex of degree one is called

(A) Coloured vertex

(B) Null vertex

(C) Pendent

(D) Isolated vertex

Question: 5

A full binary tree with n leaves contains

(A) n nodes

(B) log₂ n nodes

(C) 2ⁿ⁺¹ nodes

(D) 2ⁿ