A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. State True or False.

i) An undirected graph which contains no cycles is called forest.

ii) A graph is said to be complete if there is an edge between every pair of vertices.
a. True, True
b. False, True
c. False, False
d. True, False
Answer:True, True
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: