SUBJECT CODE

TYPE THE SUBJECT NAME HERE

UNIT NO 1

LINEAR DATA STRUCTURES-I

1.1 ABSTRACT DATA TYPE (ADT’S)

II III

20ITPC301
DATA STRUCTURES (Common to CSE & IT)
 CS8391
DATA STRUCTURES (Common to CSE & IT)

UNIT I 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 operation(insertion, deletion, merge, traversal)
 CS8391
DATA STRUCTURES (Common to CSE & IT)

What is Data Structures?

 CS8391
DATA STRUCTURES (Common to CSE & IT)

LINEAR DATA STRUCTURES – LIST

Data:
A collection of facts, concepts, figures, observations, occurrences or instructions
in a formalized manner.
Information:
The meaning that is currently assigned to data by means of the conventions
applied to those data(i.e. processed data)
Record:
Collection of related fields.
Data type:
Set of elements that share common set of properties used to solve a program.
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Why we need to study Data Structures?

 CS8391
DATA STRUCTURES (Common to CSE & IT)

Introduction to DS
• Data structures are generally based on the ability of a computer to fetch and store
data at any place in its memory, specified by a pointer
• Thus, the array and record data structures are based on computing the addresses of
data items with arithmetic operations

What is Program?
A Set of Instructions -Data Structures + Algorithms
Data Structure = A Container stores Data
Algorithm = Logic + Control
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Why Data Structures?

Program = DS + Algorithm
• Data structures and Algorithms are the nuts-and-bolts used by programmers to store and manipulate
the data efficiently in computer memory.
• Data structure is a particular way of storing and organizing information in a computer so that it can be
retrieved and used most productively.
• An algorithm is a step by step method or instructions to solve a problem.
• Data is a basic fact of entity that is utilized in calculation or manipulation.
Example: Name of the person (Alphanumerical), Roll number of the student (Numerical).
• Structuring of data-Whether data is a single or group of values, it must be organized in a particular
fashion for computer processing (Storing, retrieving and manipulating).
• Different types of data structures can be applied to an application but, only some of them provide the
efficient results.
• No single data structure works well for all purpose, and so it is important to know the strengths and
limitations of several of them.
 CS8391
DATA STRUCTURES

Need of Data Structures :

As applications are getting complex and amount of data is increasing day by day, there may arise the
following problems:
Processor speed: To handle very large amount of data, high speed processing is required, but as the
data is growing day by day to the billions of files per entity, processor may fail to deal with that much
amount of data.
Data Search: Consider an inventory size of 106 items in a store, If our application needs to search for a
particular item, it needs to traverse 106 items every time, results in slowing down the search process.
Multiple requests: If thousands of users are searching the data simultaneously on a web server, then
there are the chances that a very large server can be failed during that process. In order to solve the
above problems, data structures are used. Data is organized to form a data structure in such a way that
all items are not required to be searched and required data can be searched instantly.
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Advantages of Data Structures :

• Efficiency
• Reusability
• Abstraction
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Data Structures:
Data Structure is the way of organizing, storing, and retrieving data and their relationship with
each other.
• Data: are simply a value are set of values of different type which is called data types like string,
integer, char etc.
• Structure: Way of organizing information, so that it is easier to use In simple words we can define
data structures as • Its a way organizing data in such a way so that data can be easier to use.
• A data structure is a particular way of organizing data in a computer so that it can be used
efficiently.
• A scheme for organizing related pieces of information.
Operations on Data Structures:
1.Traversal
2.Search
3.Insertion
4.Deletion
 CS8391
DATA STRUCTURES (Common to CSE & IT)

CLASSIFICATION OF DATA STRUCTURES

 CS8391
DATA STRUCTURES (Common to CSE & IT)

Primary Data Structures/Primitive Data Structures:

Primitive data structures include all the fundamental data structures that can be directly manipulated by
machine-level instructions. Some of the common primitive data structures include integer, character,
real, boolean etc
Secondary Data Structures/Non Primitive Data Structures:
Non primitive data structures, refer to all those data structures that are derived from one or more
primitive data structures. The objective of creating non-primitive data structures is to form sets of
homogeneous or heterogeneous data elements.
Linear Data Structures:
Linear data structures are data structures in which, all the data elements are arranged in linear or
sequential fashion. Examples of data structures include arrays, stacks, queues, linked lists, etc.
Non Linear Structures:
In non-linear data structures, there is definite order or sequence in which data elements are arranged.
For instance, a non-linear data structures could arrange data elements in a hierarchical fashion.
Examples of non-linear data structures are trees and graphs.
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Application of data structures:

The field of computer science will address the task of storing, accessing & manipulating
data. Data structures are widely applied in the following areas:
• Compiler design
• Operating system
• Statistical analysis package
• DBMS
• Numerical analysis
• Simulation
• Artificial intelligence Graphics
• System software design ,Robotics etc.,
 CS8391
DATA STRUCTURES (Common to CSE & IT)

Abstract Data type (ADT)

 CS8391
DATA STRUCTURES (Common to CSE & IT)
ABSTRACT DATA TYPES (ADTS):
An abstract Data type (ADT) is defined as a mathematical model with a collection of operations defined
on that model. Set of integers, together with the operations of union, intersection and set difference form
a example of an ADT. An ADT consists of data together with functions that operate on that data.
Advantages/Benefits of ADT:
•Modularity
•Reuse
•Code is easier to understand
•Implementation of ADT can be changed without requiring changes to the program that uses the ADT
 CS8391
DATA STRUCTURES (Common to CSE & IT)

ANY QUERIES