Introduction To Data Structures - Study Mode

Show All Answers

[#41] Which data structure is used for breadth-first search (BFS)?

(A) Stack

(B) Queue

(C) Array

(D) Linked List

Correct Answer

(B) Queue

[#42] Which data structure is used for depth-first search (DFS)?

(A) Stack

(B) Queue

(C) Array

(D) Tree

Correct Answer

(A) Stack

[#43] Consider yourself to be in a planet where the computational power of chips to be slow. You have an array of size 10.You want to perform enqueue some element into this array. But you can perform only push and pop operations .Push and pop operation both take 1 sec respectively. The total time required to perform enQueue operation is?

(A) 20

(B) 40

(C) 42

(D) 43

Correct Answer

(D) 43

[#44] What would be the asymptotic time complexity to insert an element at the second position in the linked list?

(A) O(1)

(B) O(n)

(C) O(n 2 )

(D) O(n 3 )

Correct Answer

(A) O(1)

[#45] What is the time complexity of searching for an element in a circular linked list?

(A) O(n)

(B) O(nlogn)

(C) O(1)

(D) O(n 2 )

Correct Answer

(A) O(n)