Data Structures Questions – Set 7

December 19, 2015

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.

Linear search is also called …….
(A) Interpolation Search
(B) Transpose Sequential Search
(C) Sequential Search
(D) None of the above
Answer
(C) Sequential Search
The Array as an Abstract Data Type (ADT) supports ….. operations.
(A) Store
(B) Retrieve
(C) Both (A) & (B)
(D) None of the above
Answer
(C) Both (A) & (B)
Each position of the hash table is called ……
(A) Bucket
(B) Entry
(C) Cell
(D) Slot
Answer
(D) Slot
The common way of keeping subsequent items within the table and computing possible positions is termed as …………
(A) Direct Chaining
(B) Open Addressing
(C) Both (A) & (B)
(D) None of the above
Answer
(B) Open Addressing
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
Answer
(A) Sentinel
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
Answer
(C) post order
Shell Sort is also called …….
(A) Partition exchange sort
(B) Diminishing increment sort
(C) Both (A) & (B)
(D) None of the above
Answer
(B) Diminishing increment sort
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
Answer
(B) O (n log n)
…… is a header list in which the last node points back to the header node.
(A) Circular Header linked list
(B) Grounded Header linked list
(C) Both (A) & (B)
(D) None of the above
Answer
(A) Circular Header linked list
A pointer that contains the address of a heap-dynamic variable is called …..
(A) Dangling pointer
(B) Null pointer
(C) Void pointer
(D) None of the above
Answer
(A) Dangling pointer