What are the main differences between the linked list and linear array?
- 1 Answers
- 1070 Views
- I also Faced
- E-Mail Answers
Answer / Rohit Kumar
A linear array (also known as an array) is a contiguous sequence of memory locations, while a linked list is a collection of nodes that store data and pointers to other nodes. Linear arrays have faster access times due to their contiguous nature but are less flexible in terms of adding or removing elements. In contrast, linked lists are more flexible but have slower access times.
| Is This Answer Correct ? | 0 Yes | 0 No |
Name few collections map implementations?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Explain the Stack
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What is a data structure definition?
How do you do binary search?
Is map a data structure?
Does treeset allow duplicates?
Explain quick sort and merge sort algorithms.
What is the difference between collection and collections?
What actions are performed when a function returns?
Is quicksort faster than merge sort?
Windows 
