Data Structures Questions – Set 7

Dear Aspirants,
Welcome to the Professional Knowledge Section in Affairscloud.com. Here we are providing sample questions in Data Structures. It will be useful for the IBPS SO IT officer and SBI Assistant Manager(System). We have also included some important questions that are repeatedly asked in previous exams.

1. Linear search is also called …….
(A) Interpolation Search
(B) Transpose Sequential Search
(C) Sequential Search
(D) None of the above
(C) Sequential Search

2. The Array as an Abstract Data Type (ADT) supports ….. operations.
(A) Store
(B) Retrieve
(C) Both (A) & (B)
(D) None of the above
(C) Both (A) & (B)

3. Each position of the hash table is called ……
(A) Bucket
(B) Entry
(C) Cell
(D) Slot
(D) Slot

4. The common way of keeping subsequent items within the table and computing possible positions is termed as …………
(A) Direct Chaining
(C) Both (A) & (B)
(D) None of the above

5. An extra key inserted at the end of an Array is known as………
(A) Sentinel
(B) Stop key
(C) Both (A) & (B)
(D) None of the above
(A) Sentinel

6. In Binary Tree Traversal, the node is visited after both trees is called…….
(A) pre order
(B) In order
(C) post order
(D) None of the above
(C) post order

7. Shell Sort is also called …….
(A) Partition exchange sort
(B) Diminishing increment sort
(C) Both (A) & (B)
(D) None of the above
(B) Diminishing increment sort

8. The complexity of Merge sort algorithm is………
(A) O (log n)
(B) O (n log n)
(C) O (n^2)
(D) None of the above
(B) O (n log n)

9. …… is a header list in which the last node points back to the header node.
(C) Both (A) & (B)
(D) None of the above