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. The total number of spanning trees that can be drawn using five labelled vertices is:
a. 125
b. 64
c. 36
d. 16
Answer:125
Priya :(June 08, 2019) What is the basic formula for Total number of spanning trees if No. Of vertices are given?
formula to find the total no of spanning tree if no vertices are given is n^(n-2)
Click to Add Comment
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

The number of different binary trees with 6 nodes is .............
Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?
Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):
Given a binary tree whose inorder and preorder traversal are given by

Inorder  : EICFBGDJHK
Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is
An ideal sort is an in-place-sort whose additional space requirement is ...............
Which algorithm has same average, worst case and best case time?
What is the time required to insert an element in a stack with linked implementation ?
Cyclometric complexity of a flow graph G with n vertices and e edges is
McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is
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.