Scribd
Upload
331 views6 pages

Data Structure Unit-5 Quiz

The document contains a 25 question quiz about data structures and graphs. The questions cover topics like the different types of graphs (directed, undirected, weighted), graph terminology (vertices, edges, adjacency), graph traversal algorithms (depth-first search, breadth-first search), minimum spanning trees (Prim's algorithm, Kruskal's algorithm), and graph representations (adjacency matrix, adjacency list). The answers to all 25 questions are provided at the end.

Uploaded by

Jaganath S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
331 views6 pages

Data Structure Unit-5 Quiz

The document contains a 25 question quiz about data structures and graphs. The questions cover topics like the different types of graphs (directed, undirected, weighted), graph terminology (vertices, edges, adjacency), graph traversal algorithms (depth-first search, breadth-first search), minimum spanning trees (Prim's algorithm, Kruskal's algorithm), and graph representations (adjacency matrix, adjacency list). The answers to all 25 questions are provided at the end.

Uploaded by

Jaganath S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

DATA STRUCTURE UNIT-5 QUIZ

Questions:-

1) The collection of nodes is known as:

A) Graph
B) Vertices
C) Line
D) Radix

2) A graph in which every edge is directed is


known as:

A) Linear graph
B) Directed graph
C) Un-directed graph
D) None of the above

3) A graph in which every edge is undirected is


Known as:

A) Linear graph
B) Directed graph
C) Un-directed graph
D) None of the above

4) Any two nodes which are connected by an


edge in a graph are called:

A) Join node
B) Un joined node
C) Adjacent node
D) Node

5) A graph in which weights are assigned to


every edge is known as:

A) Weighted graph
B) Non-weighted graph
C) Null graph
D) None of the above
6) In a directed graph, for any node v, the
number of edges which have v as their initial
node is called:

A) Indegree of a graph
B) Out degree of a graph
C) Adjacent side of a graph
D) Un directed graph

7) In a directed graph, for any node v, the


number of edges which have v as their
terminal node is called the indegree of the
node v is called:

A) Indegree of a graph
B) Out degree of a graph
C) Adjacent side of a graph
D) directed graph

8) Among the options one of the method is used


to represent a graph:

A) Breath first search


B) Depth first search
C) Adjacency matrix
D) None of the above

9) Traversing a graph to visit each vertex and


edge exactly once is known as:

A) Traversal
B) Graph Traversal
C) Adjacency matrix
D) Adjacency list

10) A path having minimum weight between two


vertices is known as:

A) Longest path
B) Shortest path
C) Minimum path
D) Maximum path
11) An array indexed by vertex number
containing linked lists is known as:

A) Adjacency list
B) Adjacency matrix
C) Adjacency degree
D) None of the above

12) A minimum-spanning-tree algorithm which


finds an edge of the least possible weight that
connects any two trees in the forest.

A) Prim's algorithm
B) Kruskal's algorithm
C) Dijsktra's algorithm
D) Tree sort algorithm

13) A greedy algorithm that finds a minimum


spanning tree for a weighted undirected
graph.

A) Prim's algorithm
B) Kruskal's algorithm
C) Dijsktra's algorithm
D) Tree sort algorithm

14) An algorithm for traversing or searching


tree or graph data structures. It starts at
the tree root, and explores all of the
neighbour nodes at the present depth prior
to moving on to the nodes at the next
depth level

A) Depth first search


B) Breath first search
C) Depth first traversal
D) Breath first traversal

15) An algorithm for traversing or searching


tree or graph data structures. The
algorithm starts at the root node
and explores as far as possible along
each branch before backtracking.
A) Depth first search
B) Breath first search
C) Depth first traversal
D) Breath first traversal

16) A subset of Graph G, which has all the


vertices covered with minimum possible
number of edges.

A) Binary tree
B) Traversal tree
C) Spanning tree
D) Non spanning tree

17) A graph G is completely connected if for


every pair of distinct vertices vi, vj there
exists an edge.

A) Directed graph
B) Un directed graph
C) Non-connected graph
D) Connected graph

18) Which one of the following has [one root


node and one parent node].

A) Graph
B) Linked list
C) Tree
D) Di-graph

19) Which one of the following doesn't have a


root node.

A) Graph
B) Linked list
C) Tree
D) Di-graph

20) Which type of model is a Graph:

A) Hierarchical model
B) Structural model
C) Network model
D) None of the models

21) Among the given applications which one


suits Graph:

A) Traversal of tree
B) Structural programing
C) Sorting of array
D) Coloring of maps

22) How many edges does a graph have ?

A) n
B) (n-1)
C) No.of edges depends upon graph.
D) None of the above

23) A special form of graph is known as:

A) Di-graph
B) Bi-graph
C) N-graph
D) Tree

24) Which type of graph doesn't have [no


loops, no circuits and no self-loops].

A) Tree
B) Directed graph
C) Traversal graph
D) Vertex graph

25) Two vertices in graph are known as:

A) Adjacency graph
B) Adjacency matrix
C) Adjacency vertices
D) Adjacency list
Answers:-

1) Graph (a)
2) Directed graph (b)
3) Un-Directed graph (c)
4) Adjacency node (c)
5) Weighted graph (a)
6) Out degree of a graph (b)
7) Indegree of a graph (a)
8) Adjacency matrix (c)
9) Graph traversal (b)
10) Shortest path (b)
11) Adjacency list (a)
12) Kruskal's algorithm (b)
13) Prim's algorithm (a)
14) Breath first search (b)
15) Depth first search (a)
16) Spanning tree (c)
17) Connected graph (d)
18) Tree (c)
19) Graph (a)
20) Network model (c)
21) Coloring of maps (d)
22) No.of.edges depends upon graph
23) Tree (d)
24) Tree (a)
25) Adjacency vertices (c)

You might also like