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:

Size of the array need not be specified, when
The edit distance satisfies the axioms of a metric when the costs are non-negative.
Which of the following statements is/are correct ?
Trees are often used in implementing _________ and hence it is considered as prime application of trees.
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
Which of the following is an advantage of bit array?
Which of the following is an example of Postfix expression ?
A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
If an array is declared as
int a[4] = {3, 0, 1, 2}, then values assigned to a[0] & a[4] will be ________.
What is the worst case complexity of selection sort?
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.