Top 350+ Solved Data Structures (DS) MCQ Questions Answer

a. To implement file systems

b. For separate chaining in hash-tables

c. To implement non-binary trees

d. Random Access of elements

a. We can navigate in both the directions

b. It requires more space than a singly linked list

c. The insertion and deletion of a node take a bit longer

d. Implementing a doubly linked list is easier than singly linked list

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(1)

a. You cannot have the ‘next’ pointer point to null in a circular linked list

b. It is faster to traverse the circular linked list

c. You may or may not have the ‘next’ pointer point to null in a circular linked list

d. Head node is known in circular linked list

a. O(n)

b. O(nlogn)

c. O(1)

d. O(n2)

a. Undo operation in a text editor

b. Recursive function calls

c. Allocating CPU to resources

d. Implement Hash Tables

a. Every node has a successor

b. Time complexity of inserting a new node at the head of the list is O(1)

c. Time complexity for deleting the last node is O(n)

d. We can traverse the whole circular linked list by starting from any point

a. Keep one node as head and traverse another temp node till the end to check if its ‘next points to head

b. Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

c. Cannot determine, you have to pre-define if the list contains cycles

d. Circular linked list itself represents a cycle. So no new cycles cannot be generated

a. Linked list

b. Node list

c. Primitive list

d. Unordered list

a. Pointer to character

b. Pointer to integer

c. Pointer to node

d. Node

a. h(k) = lowerbound(km)

b. h(k)= upperbound(mk)

c. h(k)= lowerbound(k)

d. h(k)= upperbound(k)

a. h(k) = k/m

b. h(k) = k mod m

c. h(k) = m/k

d. h(k) = m mod k

a. Any prime number

b. Any even number

c. 2p – 1

d. 2p

a. open addressing

b. universal hashing

c. hashing by division

d. hashing by multiplication

a. 19

b. 72

c. 15

d. 17