1.
AAT-1
Linked Lists
Data Structures and Applications-21CS35
Students Names:
PRAGATI BAIRAGI(1BY21IS107)
PRAMOD KUMAR(1BY21IS108)
PRATYUSH RAJ(1BY21IS115)
Under the guidance of:
Dr. SHANTHI D L
ASSISTANT PROFESSOR,
2022-23
ODD Semester
Department of Information Science & Engineering
1

2.
Contents
• Introduction
• Motivation
• List of applications
• Detailed description of an application
• Results and discussion
• References
Department of Information Science & Engineering
2

3.
3
A linked list is a linear data structure that stores a collection of
data elements dynamically.Nodes represent those data
elements, and links or pointers connect each node.Each node
consists of two fields, the information stored in a linked list and
a pointer that stores the address of its next node.The last node
contains null in its second field because it will point to no
node.A linked list can grow and shrink its size, as per the
requirement.It does not waste memory space
Introduction: What is a Linked List?

4.
30.11.2021 4
A linked list depicts that each node consists of two fields.
The first field consists of data, and the second field
consists of pointers that point to another
node.representation-of-linked-listHere, the start pointer
stores the address of the first node, and at the end, there
is a null pointer that states the end of the Linked List
Representation of Linked list:

5.
30.11.2021 5
Representation of Linked ListA linked list is a chain of nodes, and each
node has the following parts:
Data – Stores the information
Next – Stores the address to next node

6.
30.11.2021 6
Motivation
The main motivation of linked list is that we can make
arrays, but their functionality is slightly limited and
can be difficult to work with Biggest issue: size
management We can do dynamic arrays but can be
cumbersome to add more cells if needed Internal re
structuring is difficult: To insert or delete elements
after array creation and population we must move
potentially many elements around

7.
30.11.2021 7
Types of Linked lists
The linked list mainly has three types, they
are:
Singly Linked List
Doubly Linked List
Circular Linked List
Circular Doubly Linked List

8.
30.11.2021 8
A singly linked list is the most common type of linked
list. Each node has data and an address field that
contains a reference to the next node.
Singly Linked lists

9.
30.11.2021 9
Doubly Linked List is a variation of Linked list in which
navigation is possible in both ways, either forward and
backward easily as compared to Single Linked List.
Double linked list

10.
30.11.2021 10
Circular Linked list
The circular linked list is a linked list where all nodes are
connected to form a circle. In a circular linked list, the
first node and the last node are connected to each
other which forms a circle.

11.
30.11.2021 11
Applications of linked list in computer science: Implementation
of stacks and queues . Implementation of graphs: Adjacency list
representation of graphs is the most popular which uses a
linked list to store adjacent vertices . Dynamic memory
allocation: We use a linked list of free blocks . Maintaining a
directory of names.
Applications

12.
30.11.2021 12