Create Quiz

Coding Practice on Sorting Quiz Question

Coding Practice on Sorting Quiz Question

Coding Practice Sorting is a process of arranging items in ascending or descending order. This process can be implemented via many different algorithms quiz.

You can mute/unmute sounds from here

You May Get Result Of Coding Practice on Sorting Quiz Question

Coding Practice on Sorting Quiz Question
Coding Practice on Sorting Quiz Question
Coding Practice on Sorting Quiz Question
Coding Practice on Sorting Quiz Question
POST YOUR ANSWER (READ ANSWERS)

Quiz Questions And Answers

The running time of Dijkastra’s algorithm is

O(V2)
O(V+E)
O(n log n)
all of the above

kruskal’s algorithm uses-------- and prim’s algorithm uses------ in determining the MST

edges,vertex
vertex,edges
edges,edges
None

The running time of kruskal’s algorithm for MST

O(E)
O(V)
O(E log V)
all of the above

We can perform a topological sort in time -----------, since DFS takes ------ time.

ϴ (V+E), ϴ (E)
ϴ (E), ϴ (V+E)
ϴ (V+E), ϴ (V+E)
all of the above

The running time of BFS is------------

ϴ (1)
ϴ (n log n)
O(V+E)
ϴ (n2)

For------ insertion sort beats merge sort

n≥43
n≤23
n≤43
cannot say

Best case running time of quick sort is

O(n)
O(logn)
O(nlogn )
O(n2)

A characteristic of the data that binary search tree but the linear search ignores, is the

Order of the list
length of the list
maximum value in the list
mean of data values
ANSWERS

Currently, we have no comments. Be first to comment on this quiz.

Coding Practice on Sorting Quiz Question : Test Trivia

Ultimate impossible accurate personality honest Quiz Game

How do you rate this quiz?

Average rating 4.8 / 5. Vote: 5
Embed This Quiz
Copy the code below to embed this quiz