Data Structures (3130702) MCQs

MCQs of Graph

Showing 1 to 6 out of 6 Questions
1.

Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

(a)

Leterally connected

(b)

Widely Connected
(c)

Unliterally connected
(d)

Literally connected
Answer:

Option (c)

2.

A connected graph T without any cycles is called ........

(a)

free graph
(b)

no cycle graph
(c)

non cycle graph
(d)

circular graph
Answer:

Option (a)

3.

In a graph if E=(u,v) means ......

(a)

u is adjacent to v and v is adjacent to u
(b)

E begins at u and ends at v
(c)

u is the predecessor and v is the successor
(d)

All of the mentioned
Answer:

Option (d)

4.

The Data structure used in standard implementation of Breadth First Search is?

(a)

Stack
(b)

Queue
(c)

Linked List
(d)

Tree
Answer:

Option (b)

5.

The Depth First Search traversal of a graph will result into?

(a)

Linked List
(b)

Tree
(c)

Graph with back edges
(d)

Array
Answer:

Option (b)

6.

In Depth First Search, how many times a node is visited?

(a)

Once
(b)

Twice
(c)

Equivalent to number of indegree of the node
(d)

Thrice
Answer:

Option (c)

Showing 1 to 6 out of 6 Questions