This section contains more frequently asked Data Structure MCQs in the various competitive exams.
1. Which data structure allows deleting data elements from front and inserting at rear?
- Stacks
- Queues
- Deques
- Binary search tree
2. Identify the data structure which allows deletions at both ends of the list but insertion at only one enD
- Input-restricted deque
- Output-restricted deque
- Priority queues
- None of above
3. Which of the following data structure is non-linear type?
- Strings
- Lists
- Stacks
- None of above
4. Which of the following data structure is linear type?
- Strings
- Lists
- Queues
- All of above
5. To represent hierarchical relationship between elements, which data structure is suitable?
- Deque
- Priority
- Tree
- All of above
6. A binary tree whose every node has either zero or two children is called
- Complete binary tree
- Binary search tree
- Extended binary tree
- None of above
7. The depth of a complete binary tree is given by
- Dn = n log2n
- Dn = n log2n+1
- Dn = log2n
- Dn = log2n+1
8. When representing any algebraic expression E which uses only binary operations in a 2-tree
- the variable in E will appear as external nodes and operations in internal nodes
- the operations in E will appear as external nodes and variables in internal nodes
- the variables and operations in E will appear only in internal nodes
- the variables and operations in E will appear only in external nodes
9. A binary tree can easily be converted into q 2-tree
- by replacing each empty sub tree by a new internal node
- by inserting an internal nodes for non-empty node
- by inserting an external nodes for non-empty node
- by replacing each empty sub tree by a new external node
10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
- internal nodes on extended tree
- external nodes on extended tree
- vanished on extended tree
- None of above