Miscellaneous On Data Structures - Study Mode

Show All Answers

[#56] What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?

(A) O(C)

(B) O(log C)

(C) O(C log C)

(D) O(C 2 )

Correct Answer

(D) O(C 2 )

[#57] Running key cipher is harder to decipher than keyword cipher.

(A) true

(B) false

Correct Answer

(A) true

[#58] Including a parity bit along with the data surely detects the errors.

(A) true

(B) false

Correct Answer

(B) false

[#59] What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?

(A) O(N!)

(B) O(N! * N)

(C) O(log N)

(D) O(N)

Correct Answer

(B) O(N! * N)

[#60] Which of the following algorithm can be used to detect a cycle in a singly linked list?

(A) Simplex algorithm

(B) DSW algorithm

(C) Floyd's algorithm

(D) Aging algorithm

Correct Answer

(C) Floyd's algorithm