MCQs on Linked list with answers
- Topics >>
- Placement papers >>
- Data Structure Placement papers - Model questions & answers-02/19/15
- « Previous
- Next »
Which of the following statements about linked lists is correct?
A) Once you have located the correct position, adding elements in the middle of a linked list is inefficient.
B) Visiting the elements of a linked list in random order is efficient.
C) When a node is removed, all nodes after the removed node must be moved down.
D) Linked lists should be used when you know the correct position and need to insert and remove elements efficiently.
Linked List
- Last Updated : 29 Sep, 2020
1234
Which of the following points is/are true about Linked List data structure when it is compared with array Data Structure
- Arrays have better cache locality that can make them better in terms of performance.
- It is easy to insert and delete elements in Linked List
- Random access is not allowed in a typical implementation of Linked Lists
- The size of array has to be pre-decided, linked lists can change their size any time.
- All of the above
Answer: All of the above
- Bookmark
- Add Comment
- Share With Friends
- Report