Question

Linked list: 1) What are their respective logical and physical / storage structures .2) At least one application example combining data structure and algorithm should be given.

please answer these two questions properly

Answer 1

1. A linked list is a type of data structure in which the each of the element can be logically thought to be stored in structure and the structure contains the link (poniter) to the other structure. This forms series of structures. In case of linked list elements are not ordered by their position of placement in the physical memory, rather they're ordered on basis of logical links (address of next structure) which are stored in the structure itself. In physical memory each of the structure (nodes) can be placed anywhere in separate physical location, still they will be able to point to each other.

2. One real life example of a linked list can be the undo or redo operations. In case, when we work on any application and make constant changes, the recent states are stored in form of a linked list. Each undo takes us to previous node and redo takes us to the next node. Here the linked traversal algorithm is used to traverse the linked list in a direction for Continuous undo redo operations.