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.

Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

Discussion Forum

Que. A connected graph T without any cycles is called
a. a tree graph
b. free tree
c. a tree
d. All of above
Answer:All of above
Akhand Kumar :(July 13, 2018) Good question
Click to Add Comment

Akhand Kumar :(July 13, 2018) Good question
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here