Miscellaneous On Data Structures - Practice Test

[#396] What is the worst case complexity of quick hull?

(A) O(N)

(B) O(N log N)

(C) O(N 2 )

(D) O(log N)

Correct Answer

(C) O(N 2 )

[#397] Which of the following algorithms is the best approach for solving Huffman codes?

(A) greedy algorithm

(B) exhaustive search

(C) divide and conquer algorithm

(D) brute force algorithm

Correct Answer

(A) greedy algorithm

[#398] What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries?

(A) O(n)

(B) O(q)

(C) O(n*q)

(D) O(n+q)

Correct Answer

(C) O(n*q)

[#399] Fractional knapsack problem is solved most efficiently by which of the following algorithm?

(A) Divide and conquer

(B) Dynamic programming

(C) Greedy algorithm

(D) Backtracking

(E) Backtracking

(F) Greedy algorithm

(G) Dynamic programming

(H) Divide and conquer

Correct Answer

(C) Greedy algorithm
(F) Greedy algorithm

[#400] Which among the following problem uses the vertex cover approach?

(A) Traveling salesperson problem

(B) Assignment problem

(C) Activity selection problem

(D) Knapsack problem

Correct Answer

(A) Traveling salesperson problem

Miscellaneous On Data Structures - Study Mode

[#396] What is the worst case complexity of quick hull?

Correct Answer

[#397] Which of the following algorithms is the best approach for solving Huffman codes?

Correct Answer

[#398] What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries?

Correct Answer

[#399] Fractional knapsack problem is solved most efficiently by which of the following algorithm?

Correct Answer

[#400] Which among the following problem uses the vertex cover approach?

Correct Answer