3. Difference between various kind of data structure. (Array and linked )

Question

Accepted Answer

Array and linked list are two different data structures used for storing and accessing data.

Array is a collection of elements of the same data type stored in contiguous memory locations.
Linked list is a collection of nodes where each node contains data and a reference to the next node.
Arrays have fixed size, while linked lists can grow or shrink dynamically.
Accessing elements in an array is faster than in a linked list, but inserting or deleting elements is slower.
Linked lists are more efficient for inserting or deleting elements in the middle of the list.
Arrays are used for simple data structures like lists or matrices, while linked lists are used for more complex data structures like graphs or trees.

Accepted Answer

Arrays	Linked Lists
An array is a collection of elements of a similar data type.	Linked List is an ordered collection of elements of the same type in which each element is connected to the next using pointers.
Array elements can be accessed randomly using the array index.	Random accessing is not possible in linked lists. The elements will have to be accessed sequentially.
Data elements are stored in contiguous locations in memory.	New elements can be stored anywhere and a reference is created for the new element using pointers.
Insertion and Deletion operations are costlier since the memory locations are consecutive and fixed.	Insertion and Deletion operations are fast and easy in a linked list.
Memory is allocated during the compile time (Static memory allocation).	Memory is allocated during the run-time (Dynamic memory allocation).
Size of the array must be specified at the time of array declaration/initialization.	Size of a Linked list grows/shrinks as and when new elements are inserted/deleted.

Top Infosys Associate Software Engineer Trainee interview questions & answers