www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
17

Data structures and Algorithms MCQ with Answers

17) The minimum number of edges in a connected cyclic graph on n vertices is

n-1

n

n+1

none of the above

Answer is:

n

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

18) The minimum number of colours needed to colour a graph having n (>3) vertices and 2 edges is

4

3

2

1

Answer is:

2

19) Which of the following is useful in traversing a given graph by breadth first search

stacks

set

List

Queue

Answer is:

Queue

20) Which of the following is useful in implementing quick sort

Stacks

set

List

Queue

Answer is:

Stacks

21) The maximum degree of any vertex in a simple graph with n vertices is

n

n-1

n+1

2n-1

Answer is:

n-1

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here