Miscellaneous On Data Structures - Study Mode

Show All Answers

[#361] What will be the time complexity of update query operation in an array of size n when we use square root optimization?

(A) O(√n)

(B) O(n)

(C) O(1)

(D) O(n 2 )

Correct Answer

(C) O(1)

[#362] Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank? Vertex_Cover(G = (V, E))
{
A = { }
while (E!=0)
{
pick any edge (u, v) from E
add u and v to A
________________
}
return A
}

(A) remove every edge incident on either u or v

(B) add every edge incident on u

(C) delete the vertex

(D) delete adjacent edge

Correct Answer

(A) remove every edge incident on either u or v

[#363] Who invented the concept of inclusion-exclusion principle?

(A) Abraham de Moivre

(B) Daniel Silva

(C) J.J. Sylvester

(D) Sieve

Correct Answer

(A) Abraham de Moivre

[#364] In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a . . . . . . . . frame memory.

(A) k-1

(B) k

(C) k+1

(D) k(k+1)

Correct Answer

(C) k+1

[#365] What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)?

(A) n

(B) n + 1

(C) n - 1

(D) 2n + 1

Correct Answer

(C) n - 1