Data Structures MCQs Quiz Multiple Choice Questions & Answers

1. Array is a Data Structures of type

1. Linear
2. Non Linear
3. Both A & B
4. None of this

2. Graph is a Data structure of type

1. Linear
2. Non Linear
3. Both A & B
4. None of this

3. Linear DS are .................... to implement than non Linear DS

1. Easy
2. Difficult
3. Unprintable
4. None of this

4. Every item is attached to its previous & next Item in .................... DS

1. Linear
2. Non linear
3. Both A & B
4. None of this

5. Linked List is .................... Data Structure

1. Linear
2. Non linear
3. Both A & B
4. None of this

6. Tree is .................... Data Structure

1. Linear
2. Non linear
3. Both A & B
4. None of this

7. Extra memory is required to store

1. Array
2. Linked List
3. Both A & B
4. None of this

8. How much memory is required to store Array than Linked List

1. More
2. Less
3. Equal
4. None of this

9. Linked list size require

1. fixed
2. variable
3. Both A & B
4. None of this

10. Searching is difficult in ....................

1. Array
2. Linked List
3. Both A & B
4. None of this

11. In singly linked list each node contains a value and a link to its

1. Successor
2. Predecessor
3. Both A & B
4. None of this

12. Singly Linked list go ....................

1. Forward
2. Backward
3. Both A & B
4. None of this

13. All the nodes in a linked list must have the same structure

1. 1
2. Unpredictable
3. None of this

14. Last node references to in a linked list

1. Head
2. Null
3. Pointer value
4. None of this

15. To represent a node we use which data type

1. enum
2. struct
3. int
4. float

16. Doubly linked list can be traversed in

1. Forward
2. Backward
3. Both A & B
4. None of this

17. Doubly linked list requires .................... space as compared with singly linked list

1. More
2. less
3. equal
4. None of this

18. In circular linked list node hold NULL value

1. 1
2. May be
3. None of this

19. .................... the linked list means we can visit all the nodes of the list starting with the node pointed by head

1. Insertion
2. Deletion
3. Traversing
4. Searching

20. Internal node are also called as .................... node

1. Terminal
2. Child
3. Root
4. Branch

21. A tree such that each node has at most two child nodes are called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

22. A tree such that each node has exactly two child nodes or no nodes is called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

23. A tree such that each node has exactly two child nodes and all leaf nodes are at the same level is called as .................... tree

1. Binary
2. Binary Search
3. Full Binary
4. Strictly Binary

24. In circular link list the link field of the last node points to

1. NULL
2. First node
3. next element location
4. itself

25. The linked list data structure usage offers saving in

1. time
2. space
3. both time & space
4. none

26. Visiting the root node first is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

27. Visiting the root node last is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

28. Visiting the root node just before visiting the right subtree is called

1. inorder traversal
2. preorder traversal
3. postorder traversal
4. none

29. Insertion and deletion of a node in the linked list can be done

1. at the beginning
2. at the end
3. any where in the linked list
4. not possible at all

30. An ordered collection of data items is called

1. list
2. sequential list
3. linked list
4. none

31. In comparision with array representation of list the insertion and deletion operation in linked list takes

1. less time
2. more time
3. equal time
4. none

32. In the linked list implementation the node carries infornation about

1. data
2. link
3. both A & B
4. none

33. To represent hierarchial relationship between elements,which data structure is suitable

1. array
2. structure
3. tree
4. queue

34. An extra node at the front of the list,which doesnt repersent an item in the list is called

1. Header node
2. List node
3. List header
4. Both a and c

35. A Linked list does not allow

1. Random access
2. Inseartion
3. Deletion
4. Inseartion at end

36. Array passed as an argument to a function is interpreted as

1. Address of the array
2. Values of the first elements of the array
3. Address of the first element of the array
4. Number of element of the array