Which of the following points is/are true about Linked List data structure when

Question

Which of the following points is/are true about Linked List data structure when it is compared with array (a) It is easy to insert and delete elements in Linked List (b) Random access is allowed in a typical implementation of Linked Lists (c) The size of array has to be pre-decided, inked lists can change their size any time. 1. (d) All of the above 2. is/are linear data structure. a) double b) link list c nt d) array 3. In link list each node contains a and a to some other node a) value link b) value pointer ) none sis the number of elements in it b) Successor 4 A list' a) Length c) Predecessor d) none

Explanation / Answer

1)

Insertion in array easy when compare to linked list

Random access is not allowed in linked list and

we need to decide the size of array, and linked list size can be increased at any time

Ans : C

2)

Double and int are not data structures

we can have multiple dimensional array

Linked list is linear data structure

Ans : B

3) A linked list contains a value and link to next node

Ans : A

4) Length is number of elements in a list

Ans : B

1)

Insertion in array easy when compare to linked list

Random access is not allowed in linked list and

we need to decide the size of array, and linked list size can be increased at any time

Ans : C

2)

Double and int are not data structures

we can have multiple dimensional array

Linked list is linear data structure

Ans : B

3) A linked list contains a value and link to next node

Ans : A

4) Length is number of elements in a list

Ans : B

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.