Question

Q 03. Linked lists are more efficient than arrays in 1. Sequential access 2. Element rearranging Ops: A. Only 2 B. Neither 1 nor 2 C. Only 1 D. Both 1 and 2
​

Answer 1

Answer:

D is the correct answer

mark me brilliant

Answer 2

Answer:

The correct answer is option (d).

Explanation:

Linked lists are data structures that are essentially a collection of links.

They consist of nodes and each node is connected to the next one by links.

As opposed to arrays, memory allocation in linked lists is dynamic whereas in the case of arrays, static memory allocation is performed.

Hence, linked lists are more efficient than arrays both in sequential access (due to the presence of node) and in element rearranging.

The correct answer is option (d).