Data structure and algorithm MCQ’s Chapter 01

Posted by

Data structure and algorithm MCQ with answers. With 100% free PDF Download

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 above

2. Which of the following statement 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 the next data element of a list
(D) Linked lists are collection of the nodes that contain information part and next pointer

3. Binary search algorithm cannot be applied to
(A) Sorted binary trees
(B) Sorted linear array
(C) Pointer array
(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

5. The situation when in a linked list START=NULL is
(A) Underflow
(B) Overflow
(C) Housefull
(D) Saturated

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 above

7. The following name does not relate to stacks
(A) FIFO lists
(b) LIFO list
(C) Piles
(D) Push-down 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

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

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

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.

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 above

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 the above

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

15. The following data structure allows deleting data elements from front and inserting at rear
(A) Stacks
(B) Queues
(C) Deques
(D) Binary search tree

16. This data structure allows deletions at both ends of the list but insertion at only one end.
(A) Input-restricted deque
(B) Output-restricted deque
(C) Priority queues
(D) None of the above

17. The following data structure is non-linear type
(A) Strings
(B) Lists
(C) Stacks
(D) None of the above

18. The following data structure is linear type
(A) Strings
(B) Lists
(C) Queues
(D) All 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 above

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 above

Answer Sheet
1. (D) 2. (C) 3. (D) 4. (D) 5. (A)
6. (D) 7. (A) 8. (D) 9. (C) 10. (B)
11. (D) 12. (C) 13. (A) 14. (A) 15. (B)
16. (A) 17. (D) 18. (D) 19. (C) 20. (C)