Question

Which one is true about Linked List data structure when it is compared with array.

a.
Random access is not allowed in a typical implementation of Linked Lists


b.
The size of array has to be pre-decided, linked lists can change their size any time.


c.
Arrays have better cache locality that can make them better in terms of performance.


d.
It is easy to insert and delete elements in Linked List.


e.
None

this are options

Answer 1

d ti is easy to insert and delete elements in linked list

Answer 2

Answer:

The correct answer to this question is it is easy to insert and delete elements on Linked List.

Explanation:

Given - Data structure when it is compared with the array.

To Find - a. Random access is not allowed in a typical implementation of Linked Lists.

b. The size of the array has to be pre-decided, linked lists can change their size at any time.

c. Arrays have better cache locality which can make them better in terms of performance.

d.It is easy to insert and delete elements on Linked List.

e.None

It is easy to insert and delete elements on Linked List is true about Linked List data structure when it is compared with the array.

#SPJ2