This document discusses linked lists and their implementation. It begins with an introduction that defines data structures and types of linear and non-linear data structures. It then defines linked lists as a collection of nodes where each node contains data and a link to the next node, forming a chain. The document describes the basic components of linked lists including nodes and how they are linked together. It also outlines common types of linked lists and basic operations that can be performed on linked lists such as creation, insertion, deletion, traversing, searching, and concatenation. Advantages and disadvantages of linked lists are provided as well as examples of applications that use linked lists.

1. MODERN INSTITUTE OF ENGINEERING &
TECHNOLOGY
RAJHAT, BANDEL, HOOGHLY
(Approved by AICTE, Affiliated to MAKAUT & WBSCTVESD)
CLASS ASSIGNMENT - 1
PPT ON : IMPLEMENTATION OF LINKED LIST
DEPT :- ELECTRICAL ENGINEERING
SUBJECT NAME :- DATA STRUCTURE & ALGORITHM
SUBJECT CODE :- OE-EE501A

2. INTRODUCTION
 Data structure:-
A data structure is a logical representation
of data and operation that can be performed on the data.
1. linear data structure.
2. Non linear data structure.
 Linear data structure is an order of data elements. They
are arrays, stacks, queues, and linked lists.

3. LINKED LIST
 A linked list is a way to store a collection of elements. Like an
array these can be character or integers. Each element in a
linked list is stored in the form of a node.
NODE:-
A node is a collection of two
sub-elements or parts. A data part that
stores the element and a next part that
stores the link to the next node.
LINKED LIST:-
A inked list is formed when many such nodes are linked
together to form a chain. Each node points to the next node present in
the order. The first node is always used as a reference to traverse the
list and is called HEAD. The last node points to NULL

4. WHAT ARE LINKED LISTS
 A linked list is a linear data structure.
 Nodes make up linked lists.
 Nodes are structures made up of data and a pointer to
another node.
 Usually the pointer is called

5. TYPES OF LINKED LISTS
 Single linked list.
 Double linked list.
 Circular linked list.
 Circular double linked list.

6. OPERATIONS ON LINKED LISTS
The basic operations on linked lists are: -
Creation
Insertion
Deletion
Traversing
Searching
Concatenation
Display

7. ADVANTAGES OF LINKED LISTS
We can dynamically allocate memory space as needed.
can release the unused space in the situation where the
allocated space seems to be more.
Operation related to data elements like insertions or deletion
are more simplified.
Operation like insertion or deletion are less time consuming.
 Linked lists provide flexibility in allowing the items to be
arranged efficiently.

8. DISADVANTAGES OF LINKED LISTS
It can't go backwards through the list.
It can't jump to the beginning of the list from the end.

9. APPLICATIONS OF LINKED LIST
Applications that have an MRU list (a linked list of file
names).
The cache in your browser that allows you to hit the BACK
button (a linked list of URLs).
Undo functionality in Photoshop or Word (a linked list of
state).
A stack, hash table, and binary tree can be implemented
using a doubly linked list.