Question

Compare sequential and linked organization

Answer 1

Sequential Organization

• It is hard to Insert and delete files and requires movement to do so.  
• Space is wasted.
• Expensive.
• It requires less space as only information is stored.
• It can not be extended or reduced as per the requirements.
• Similar amount of time is required to access every element.
• Elements are stored in consecutive memory locations.
• A direct route is present to reach element individually.

Linked Organization

• Insertions and deletions can be done easily without requiring any movement .
• Space is not wasted.
• Inexpensive.
• More space is required for the pointers which are also stored along with information.
• Size is not fixed.
• It can be extended or reduced according to requirements.
• Different amount of time is required to access every element.
• Elements might or might not be stored in consecutive memory locations.
• There is no direct route to reach an element.

Answer 2

Sequential allocation refers to the arrays or a contiguous block of memory.

The Linked allocation means the linked lists whose data structures are connected by various nodes.

A node carries at least two pieces of information, some data and a reference link.

All these reference data structures are not the only mean for linking data but the easiest to implement them.