InfyTQ Algorithms Quiz 2

Question 1

Time: 00:00:00
To solve the quick hull problem how many approaches can be applied.

1

1

2

2

3

3

4

4

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
From the given options which is not an application of Depth First Search?

For generating topological sort of a graph

For generating topological sort of a graph

For generating Strongly Connected Components of a directed graph

For generating Strongly Connected Components of a directed graph

Detecting cycles in the graph

Detecting cycles in the graph

Peer to Peer Networks

Peer to Peer Networks

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
Type of data structure used in the implementation of breadth-first search:

Stack

Stack

Queue

Queue

Linked List

Linked List

Tree

Tree

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 4

Time: 00:00:00
The time complexity of Kruskal’s algorithm is:

O(log V)

O(log V)

O(E log V)

O(E log V)

O(E2)

O(E2)

O(V log E)

O(V log E)

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
We cannot apply Dijkstra’s Algorithm on __?

Directed and weighted graphs

Directed and weighted graphs

Graphs having negative weight function

Graphs having negative weight function

Unweighted graphs

Unweighted graphs

Undirected and unweighted graphs

Undirected and unweighted graphs

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
If the implementation of the priority queue in the Huffman algorithm is done using linked lists than the running time complexity will be

O(C)

O(C)

O(log C)

O(log C)

O(C log C)

O(C log C)

O(C^2)

O(C^2)

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%

Comments