Graphs Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Graphs Mcqs ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Graphs comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Graphs Mcqs

Computer MCQS

Sciences MCQS

1.
A complete graph can have ……………

N^2 spanning trees

n^(n-2) spanning trees

N^(n+1) spanning trees

N^n spanning trees

Answer Discus (0)

2.
In a graph if e=(u, v) means

U is adjacent to v but v is not adjacent to u

E begins at u and ends at v

U is processor and v is successor

Both b and c

Answer Discus (0)

4.
A connected graph T without any cycles is called ……..

Free graph

No cycle graph

Non cycle graph

Circular graph

Answer Discus (0)

6.
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Weakly connected

Strongly Connected

Tightly Connected

Linearly Connected

Answer Discus (0)

7.
A graph having an edge from each vertex to every other vertex is called a ___________

Tightly Connected

Strongly Connected

Weakly Connected

Loosely Connected

Answer Discus (0)

8.
A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

Vertices, edges

Edges, vertices

Vertices, paths

Graph node, edges

Answer Discus (0)

9.
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.

Partite

Bipartite

Rooted

Bisects

Answer Discus (0)

10.
A Graph Structured Stack is a _____________

Undirected Graph

Directed Graph

Directed Acyclic Graph

Regular Graph

Answer Discus (0)

11.
A graph with all vertices having equal degree is known as a __________

Multi Graph

Regular Graph

Simple Graph

Complete Graph

Answer Discus (0)

12.
A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

More than n

More than n

More than (n+1)/2

More than n(n-1)/2

Answer Discus (0)

13.
A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

Depth First Search

Breadth First Search

Trim’s algorithm

None of the mentioned

Answer Discus (0)

14.
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

Depth First Search

Breadth First Search

Trim’s algorithm

None of the mentioned

Answer Discus (0)

15.
A ……….. is a graph that has weights of costs associated with its edges.

Network

Weighted graph

Both A and B

None of the above

Answer Discus (0)

Engineering MCQS

General Subjects MCQS

0Shares
0
Scroll to Top