Data Structure I Mock Test 10

10%

Question 1 of 10

1. The topological sorting of any DAG can be done in ________ time.

logarithmic

quadratic

cubic

linear

Question 1 of 10

Question 2 of 10

2. To create an adjacency list C++'s map container can be used.

False

True

Question 2 of 10

Question 3 of 10

3. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

O(V*V)

O(E*V)

O(V*V*V)

O(E*E)

Question 3 of 10

Question 4 of 10

4. Time complexity to check if an edge exists between two vertices would be ___________

O(1)

O(V*V)

O(E)

O(V+E)

Question 4 of 10

Question 5 of 10

5. All trees with n vertices consists of n-1 edges.

True

False

Question 5 of 10

Question 6 of 10

6. What is the advantage of using a dynamic set in direct addressing?

It saves time

It reduces code complexity

It saves space

It saves both time and space

Question 6 of 10

Question 7 of 10

7. Which of the following ways can be used to represent a graph?

No way to represent

Incidence Matrix

Adjacency List, Adjacency Matrix as well as Incidence Matrix

Adjacency List and Adjacency Matrix

Question 7 of 10

Question 8 of 10

8. What is the search complexity in direct addressing?

O(1)

O(nlogn)

O(logn)

O(n)

Question 8 of 10

Question 9 of 10

9. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

v = e-1

v=e

v + 1 = e

v = e+1

Question 9 of 10

Question 10 of 10

10. Which of the following properties does a simple graph not hold?

Must have no loops or multiple edges

Must have no multiple edges

Must be unweighted

Must be connected

Question 10 of 10