Application Linked list
Application of Linked List
What is a linked List?
A linked
list is a linear data structure, in which the elements are not stored at
contiguous memory locations.
Applications -
The use of
Linked list is widespread in real life, but often goes unnoticed. Here are some
of the uses of Linked lists –
- Computer application –
- Graph representation – Due to the dynamic nature of modern graph applications, the graphs can either be sparse or too dense. Thus, Adjacency list is used for these representations
- CPU scheduling – In the preemptive scheduling of processes, based on priorities in the wait queue the processes are scheduled in the ready queue. Some architectures implement using priority queues and some implement using linked lists.
- In computational Geometry and computer graphics, the polygons are represented using doubly circular linked lists. It helps in the triangulation of polygons, finding the Voronoi diagrams, etc.
- In Blockchain and Distributed Ledger Technologies, each block contains the information of the parent block that is hashed. The head of the list can be related to the genesis block. The blockchain correctness can be verified by traversing the blocks.
- In Computer Networks, the packet transmission from one router to another router implements linked lists. Each router finds the next hop and the packet travels using the hop information and it reaches you.
- Real life –
- Music Playlist: Traversing the list in the forward direction and backward direction can be related to forwarding and rewinding the songs
- Web browser history, the back button, and the forward button can be related to the doubly linked list.
- A family tree can also be related to the tree data structure since the tree is one of the implementations of linked lists
- Image viewer – Previous and next images are linked, hence can be accessed by next and previous button
-Aadhiraj More
TY - K51
Course Project - Implementation of family tree using Generalized Linked List
Linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. As such it is favorable to store the large quantities of data as non-contiguous memory storage ensure maximum efficiency. To demonstrate this, we have implemented a family tree using a Generalized Linked List.
CP ppt- https://docs.google.com/presentation/d/1ha2nEE8rYtkyTg0WBMJwbuShAuBMbRM4gf2XtWDpMAY/edit?usp=sharing
Topic 1: What is GLL?
Saransh Kulkarni, K, 43, 1710532
Topic 2: Algorithm and Results
Aadhiraj More, K, 51, 1710501
Topic 3: Application of Linked Lists
Sarvesh Patki, K, 72, 1710269
Topic 4:
Chinmay Pathak, K, 56, 1710109
Blogger Handles of Teammates -
Saransh Kulkarni - https://oopblog1002.blogspot.com/
Sarvesh Patki - https://oopha2608.blogspot.com/
Chinmay Pathak -
Good Knowledgeable content, keep it up
ReplyDeleteVery nice
ReplyDeleteThank you
DeleteExcellent
ReplyDeleteThank you
DeleteVery good
ReplyDeleteThank you
DeleteGood work
ReplyDeleteThank you
DeleteVery informative 👌
ReplyDeleteThank you
Deletegreat content mate, very helpful !
ReplyDeleteThank You
Delete