+91-9920808017
Take an Online Test - GK Test / Computer Organisation Test


Data Structures


Home >Computer Science MCQ >

Data Structures >

Graphs


Data Structures

Abstract Data Types
Algorithms
Binary Heaps & Binary Search trees

Hashing
Linked Lists
Queues
Sorting & Searching
Stacks
Trees

Artificial Intelligence

C Programming MCQ

Compiler Design

Computer Graphics

Computer Networks

Computer Organization Architecture

Data Mining

Data Warehousing MCQ

Database MCQ

Digital Logic

Mathematical Logic

Object Oriented Programming

Operating System

Software Engineering MCQ

Theory Of Computation MCQ

Unix

Web Technology

Windows Programming MCQ


 

 

Online Test





16:

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


A.

n


B.

n-1


C.

n+1


D.

2n-1


  Answer Report Discuss

17:

The number of edges in a regular graph of degree d and n vertices is


A.

maximum of n, d


B.

n+d


C.

nd


D.

nd/2


  Answer Report Discuss

18:

Let G be a non-planar graph with the minimum possible number of edges. Then G has


A.

9 edges and 5 vertices


B.

9 edges and 6 vertices


C.

10 edges and 5 vertices


D.

10 edges and 6 vertices


  Answer Report Discuss

19:

Which of the following graphs has an Eulerian circuit?


A.

Any k-regular graph where k is an even number


B.

A complete graph on 90 vertices


C.

The complement of a cycle on 25 vertices


D.

None of the above


  Answer Report Discuss

20:

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by


A.

Dijkstra's algorithm starting from S


B.

Warshall's algorithm


C.

Performing a DFS starting from S


D.

Performing a BFS starting from S


  Answer Report Discuss

  1 2 3 4 5