LINEAR DATA STRUCTURES – LIST
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked
list implementation – singly linked lists- circularly linked lists- doubly-linked
lists –applications of lists –Polynomial Manipulation – All operations (Insertion,
Deletion,Merge, Traversal).
1
, What are data structures?
Data structures are a way of organising and storing data in a computer
program. They are essential for efficient data manipulation and retrieval,
and are used in a wide variety of applications, from simple data
processing tasks to complex algorithms and machine learning models.
Why are data structures important?
Data structures are important because they provide a way of organising
and manipulating data in a way that is efficient and easy to understand.
By choosing the right data structure for a given problem, developers can
optimise performance and reduce the time and resources required to
complete a task.
Types of data structures :
There are many types of data structures, each suited to different types of
problems and applications. Here are some common types of data
structures:
● Arrays:
A collection of elements of the same type, stored in contiguous memory
locations. Arrays are useful for simple data storage and retrieval tasks.
● Linked Lists:
A collection of elements, each of which contains a reference to the next
element in the list. Linked lists are useful for dynamic data structures
where elements may be added or removed frequently.
● Stacks:
A collection of elements, where the last element added is the first one to
be removed (Last In, First Out). Stacks are useful for implementing
algorithms where order of operations is important, such as evaluating
arithmetic expressions.
● Queues:
A collection of elements, where the first element added is the first one to
be removed (First In, First Out). Queues are useful for implementing
2
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked
list implementation – singly linked lists- circularly linked lists- doubly-linked
lists –applications of lists –Polynomial Manipulation – All operations (Insertion,
Deletion,Merge, Traversal).
1
, What are data structures?
Data structures are a way of organising and storing data in a computer
program. They are essential for efficient data manipulation and retrieval,
and are used in a wide variety of applications, from simple data
processing tasks to complex algorithms and machine learning models.
Why are data structures important?
Data structures are important because they provide a way of organising
and manipulating data in a way that is efficient and easy to understand.
By choosing the right data structure for a given problem, developers can
optimise performance and reduce the time and resources required to
complete a task.
Types of data structures :
There are many types of data structures, each suited to different types of
problems and applications. Here are some common types of data
structures:
● Arrays:
A collection of elements of the same type, stored in contiguous memory
locations. Arrays are useful for simple data storage and retrieval tasks.
● Linked Lists:
A collection of elements, each of which contains a reference to the next
element in the list. Linked lists are useful for dynamic data structures
where elements may be added or removed frequently.
● Stacks:
A collection of elements, where the last element added is the first one to
be removed (Last In, First Out). Stacks are useful for implementing
algorithms where order of operations is important, such as evaluating
arithmetic expressions.
● Queues:
A collection of elements, where the first element added is the first one to
be removed (First In, First Out). Queues are useful for implementing
2
