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:

The data structure required for Breadth First Traversal on a graph is
In the given graph which edge should be removed to make it a Bipartite Graph?
Which of the following properties does a simple graph not hold?
The Breadth First Search traversal of a graph will result into?
The graphs G1 and G2 with their incidences matrices given are Isomorphic.

e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1



e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 1
Incidence matrix and Adjacency matrix of a graph will always have same dimensions?
The minimum number of edges in a connected cyclic graph on n vertices is
Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________
In a graph if e=(u, v) means
A connected graph T without any cycles is called ........
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.