Data Structure Important Questions and Answers
1. Each data item in a record may be a group item composed of sub - items :
those items which are indecomposable are called
A. Elementary items
B. Atoms
C. Scalars
D. All of the above
Ans - D. All of the above
2. Which of the following statements is false ?
A. Arrays are dense lists and static data structure
B. Data elements in linked list need not be stored in adjacent space in
memory
C. Pointers store next data element of a list
D. Linked lists are collection of the nodes that contain information part and
next pointer
Ans - C. Pointers store next data element of a list
3. Binary search algorithm cannot be applied to
A. Sorted binary trees
B. Sorted linear array
C. Pointer array
D. Sorted linked list
Ans- D. Sorted linked list
4. When new data are to be inserted into a data structure , but there is no
available space ; this situation is usually called
A. Housefull
B. Saturated
C. Underflow
D. Overflow
Ans- D. Overflow
5. The situation when in a linked list START = NULL is
A. Underflow
B. Overflow
C. Housefull
D. Saturated
Ans- A. Underflow
6. The following is two - way list
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. None of the above
Ans- D. None of the above
7. The following names does not relate to stacks
A. FIFO lists
B. LIFO list
C. Piles
D. Push - down lists
Ans- A. FIFO lists
8. In a binary tree , certain null entries are replaced by special pointers which
point to nodes higher in tree for efficiency . These special pointers are called
A. Leaf
B. Branch
C. Path
D. Thread
Ans - D. Thread
9. In a graph if e= ( u,v) means
A. e begins at u and ends at v
B. u is processor and v is successor
C. Both B and C are true
D. None is true
Ans- C. Both B and C are true
10. If every node u in G is adjacent to every other node v in G , A graph is said to be
A. Isolated
B. Complete
C. Finite
D. Strongly connected
Ans- B. Complete
11. A variable P is called pointer if
A. P points to the address of first element in DATA
B. P can store only memory addresses
C. P contain the DATA and the address of DATA
D. P contains the address of an element in DATA
Ans- D. P contains the address of an element in DATA
12. The Worst case occur in linear search algorithm when
A. Item is not in the array at all
B. Item is the last element in the array
C. Item is the last element in the array or is not there at all
D. None of the above
Ans- C. Item is the last element in the array or is not there at all
13. The Average case occur in linear search algorithm
A. When item is somewhere in the middle of the array
B. When item is not in the array at all
C. When item is the last element in the array
D. ALL of the above
Ans- A . When item is somewhere in the middle of the array
14. The complexity of the average case of an algorithm is
A. Much more complicated to analyze than that of worst case
B. Much more simpler to analyze than that of worst case
C. Sometimes more complicated and some other times simpler than that of
worst case
D. None of the above
Ans- A. Much more complicated to analyze than that of worst case
15. The following data structure allows deleting sate elements from front and
inserting at rear
A. Stacks
B. Queues
C. Deques
D. Binary search tree
Ans- B. Queues
16. This data structure allows deletion at both ends of the list but insertion at
only one end .
A. Input - restricted deque
B. Output - restricted deque
C. Priority deque
D. None of the above
Ans- A. Input - restricted deque
17. The following data structure is non - linear type
A. Strings
B. Lists
C. Stacks
D. None of the above
Ans- D. None of the above
18. The following data structure is linear type
A. Strings
B. Lists
C. Queues
D. None of the above
Ans- D. None of the above
19. To represent hierarchical relationship between elements , the following data structure is not suitable
A. Deque
B. Priority
C. Tree
D. All of the above
Ans- C. Tree
20. A binary tree whose every node has either zero or two children is called
A. Complete binary tree
B. Binary search tree
C. Extended binary tree
D. None of the above
Ans- C. Extended binary tree
21. The depth of a complete binary tree is given by
A. Dn =n log2n
B. Dn =n log2n + 1
C. Dn = log2n
D. Dn = log2n + 1
Ans- D. Dn = log2n + 1
22. The complexity of Binary Search algorithm is
A. O (n)
B. O(log)
C. O (n log n )
D. None of the above
Ans- B. O(log)
23. The complexity of Bubble sort algorithm is
A. O (n)
B. O(n
2
)
C. O (n log n )
D. None of the above
Ans - B. O(n
2
)
24. When in order trans versing a tree resulted E A C K F H D B G ; the
preorder traversal would return
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG
Ans- B. FAEKCDHGB
25. When representing any algebraic expression E the following uses only
binary operations in a 2 - tree
A. The variable in E will appear as external nodes and operations in internal
nodes
B. The operations in E will appear as external nodes and variables in internal
nodes
C. The variables and operations in E will appear only in internal nodes
D. None of the above
Ans- A. The variable in E will appear as external nodes and operations in
internal nodes
26. When converting binary tree into extended binary tree , all the original
nodes in binary tree are
A. Internal nodes on extended tree
B. External nodes on extended tree
C. Vanished on extended tree
D. None of the above
Ans- A. Internal nodes on extended tree
27. The post order traversal of a binary tree is DEBFCA . Find out the pre order traversal
A. ABFCDE
B. ADBFEC
C. ABDECF
D. None of the above
Ans- C. ABDECF
