TCS Graphs Quiz-1

Question 1

Time: 00:00:00
When we use the Google map for finding the path between two locations, so here location is a node and the path between these two nodes that are an edge, graph theory is used here for what type of the purpose?

For showing your current location

For showing your current location

For finding path

For finding path

For finding shortest path

For finding shortest path

none of them

none of them

Question 2

Time: 00:00:00
What is the following application, which uses a graph data structure?

A. Google Map

A. Google Map

B. Zomato

B. Zomato

C. Ola App

C. Ola App

D. All of above

D. All of above

Question 3

Time: 00:00:00
In facebook, we see an option of friend suggestion, so what type of concept used here?

Stack

Stack

Queue

Queue

Trees

Trees

Graph theory

Graph theory

Question 4

Time: 00:00:00
Which of the following data structure is non-linear type?

List

List

String

String

Graph

Graph

Stack

Stack

Question 5

Time: 00:00:00
How is the directed graph connect, if there is a path from each vertex to every other vertex in the digraph?

Tightly connected

Tightly connected

Loosely connected

Loosely connected

Strongly connected

Strongly connected

Weakly connected.

Weakly connected.

Question 6

Time: 00:00:00
 What are the ways to represent a graph?

Adjacency list

Adjacency list

Adjacency matrix

Adjacency matrix

Adjacency list and adjacency matrix

Adjacency list and adjacency matrix

None of them

None of them

Question 7

Time: 00:00:00
What is the complexity of an adjacency list and adjacency matrix of a graph G(V, E)?

O(n*m) and O(n+m)

O(n*m) and O(n+m)

O(n^m) and O(n+m)

O(n^m) and O(n+m)

O(n+m) and O(n*m)

O(n+m) and O(n*m)

O(m*n) and O(n^m)

O(m*n) and O(n^m)

Question 8

Time: 00:00:00
 What will be the order in which the vertices will be traversed, if BFS is applied on the graph, starting from the vertices b?

bachedgf

bachedgf

bcaedfgh

bcaedfgh

both A and B

both A and B

Neither A nor B

Neither A nor B

Question 9

Time: 00:00:00
What is the minimum time is required to visit the node f by using DFS?  the starting node is b.

6

6

5

5

4

4

7

7

Question 10

Time: 00:00:00
What is the time complexity to compute a cycle in a graph or reporting, that no such cycle exists here.?

O(V)

O(V)

O(E)

O(E)

O(V+E)

O(V+E)

O(V*E)

O(V*E)

null
null
×

Please login to report

Buy TCS Prog. Logic (C MCQ) Paid Materials

Join TCS Online Classes