# Data Structures Questions – Set 11

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. Which of the following is a mathematical-model with a collection of operations?
A. Algorithm
B. Linear Search
C. Hashing
D. Abstract Data Type
E. None of these
2. The Standard Template Library (STL) uses which of the following binary relationships?
A. Linear ordering
B. Partial ordering
C. Hierarchical ordering
D. All of these
E. strict weak ordering
3. Which is the form of automatic memory management?
A. Concatenation
B. Dynamic Memory Allocation
C. Garbage Allocation
D. Throughput
E. None of these
4. Which is an effective technique to calculate the direct location of a data record?
A. Binary Search
B. Linear Search
C. Tree Search
D. Hashing
E. None of these
5. In a binary tree, if a node having two children is deleted, it is replaced by its ?
A. Preorder predecessor
B. Inorder successor
C. Preorder successor
D. Inorder predecessor
E. None of these
6. It is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible is known as?
A. Binary Search Tree
B. Full Binary Tree
C. Complete Binary Tree
D. Incomplete Binary Tree
E. None of these
7. It is a binary tree in which every node other than the leaves has two children is known as?
A. Binary Search Tree
B. Full Binary Tree
C. Complete Binary Tree
D. Incomplete Binary Tree
E. None of these
8. A full binary tree with n leaves contains how many nodes?
A. n leaf nodes
B. n-1 non leaf nodes
C. n non leaf nodes
D.n-1 leaf nodes
E. None of these
9. Which of the following takes O (1) time to find a data?
A. Binary Search
B. Linear Search
C. Tree Search
D. Hashing
E. None of these