Scribd
Upload
20 views14 pages

data structure ppt

The document provides an overview of data structures, categorizing them into primitive and non-primitive types, with further classifications into linear and non-linear structures. It details various data structures such as arrays, linked lists, stacks, and queues, explaining their characteristics and functionalities. Additionally, it highlights the differences between static and dynamic data structures, as well as the operations associated with queues.

Uploaded by

adityakhakare2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views14 pages

data structure ppt

The document provides an overview of data structures, categorizing them into primitive and non-primitive types, with further classifications into linear and non-linear structures. It details various data structures such as arrays, linked lists, stacks, and queues, explaining their characteristics and functionalities. Additionally, it highlights the differences between static and dynamic data structures, as well as the operations associated with queues.

Uploaded by

adityakhakare2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

School of Computer Science & Engineering

• NAME : ATHARVA • Name : Aditya Khakare • Name : Mahesh Mali


TAGALPALLEWAR • PRN : 230105131336 • PRN : 230105131309
• Roll No : 69 • Roll No : 52
• PRN : 230105131325
• ROLL NO : 63

• Topic : Types Of Data Structure


• Subject : Computer Graphics
• Faculty Name : PROF. P.R.PATIL SIR
Contents to be covered :

Basic Classification of data structures


◦ Primitive Data Structures
◦ Non primitive Data Structures
◦ Classification Of Non Primitive DS :
◦ a. Linear Data Structures
◦ b. Non Linear Data Structures
◦ Classification Of Linear Data Structures :
◦ a. Static
◦ b. Dynamic
Data Structures

Non Primitive Data Primitive Data


Structure Structure

a.Integer.
Non Linear Data b.Boolean.
Linear Data Structure
Structure c.Character
d.Real
➢ Data Structure :-
Data Structure :-
The branch which helps to understand the basic concepts of
organising and storing data.

Data Structure Is The Structural Representation Of logical


relationship between data elements.

Data Structure Provides a framework for storing and


retriving of data , enabling efficient algorithms and programs
Primitive Data Structure :-
-These Data types are pre defined or
already defined to store the data
variables.

-These Data Types Starts With Lower Case.

-Ex :-
1. Boolean Data Types
2. Integer Data Types
3. Character Data Types
➢ Non Primitive Data Types :-
Defination :-
• The Data Types which are derived from the primitive data types.
• These Data Types are user defined.
• They are used to store compelx data structures, such as collections , objects
and references.
• These Data types starts with upper case.
Static
Linear D.S
Non dynamic
Primitive D.S
Non Linear Tress &
D.S Graphs
➢ Linear Data Structure :-
• Type Of Non primitive Data Structure in which data is stored in the sequential
manner.
• Each element is connected to its previous and next element.
• They are called “Linear” because their can be traversed in the straight line.

Types of linear data structure:-

• Array
• Link list
• Stacks
• Queues
• Vectors
Eg.1.Linked
List
Dynamic
Linear Data Eg.2.Stack
Structure
Static Eg.1.Array

The Size Of Data


Elements IS FIXED Then it
Static Data Structures :- Eg. Array
is called as static data
structure

Size of data elements is Eg. Linked list


Dynamic Data not fixed such data
Queue
Structures :- structures are called as
dynamic data structures Stack
➢ Non Linear Data Structure :-
• The Structures that organizations of data in a non-sequential manner.
• Where elements are connected through multiple relationships.
• They are called “Non-Linear” Because their elements cannot be traversed in a
straight line.

Types of Non Linear data structure:-


• Trees
• Graphs
• Heaps
• Hash Tables
• Adjacency List
• Tries
➢ Array :-
• In general array refers to orderly arrangement of data elements
• Array is a type of data structure that’s stores the data elements at the
adjacent
• Array is consider as linear data structure that’s stores the elements of
same data types
• Eg: int num {5} = {26,7,67,50,66}
• This declaration will create an array as shown below:

Num 26 7 67 50 66

0 1 2 3 4 5 Memory Locations
Array can be classified into three groups:

a.One dimensional array:


• It has only one row of element
• It is stored in ascending storage location

b.Two dimensional array:


• It consists of multiple rows and columns of data elements
• It Is also called as matrix

c.Multidimensional array:
• Multidimensional array can be defined as arrays of array
• Multidimensional arrays are not bounded to two indices or two dimensions
➢ Linked list :-
• It is a type of Dynamic data structure
• It is a Collection of nodes
• Each node contains data and reference to next node

Characteristics of linked list:


• Non contiguous Memory allocation
• Efficient Insertion & deletion
• Random access not possible
• Memory efficient
Types of linked list :-

a.Single Linked list:-


• Type of data structure that consist of nodes that are linked together in a
chain with each node containing a value and reference to the next node

b.Doubly linked list:-


• Type of data structure that stores data in a sequence of nodes each with
two link fields and one data field

c.Circular linked list:-


• Type of data structure that stores items in a circle where the last node
points back to the 1st node
Queue:-
• Type of linear data structure that follows the fifo [1st in 1st out]
• These means that the first element added to the queue will be the first one to be removed ,
similar to a line of people waiting for service
Operations performed by the queue:

a.Enqueue:-

• Adds an elements to the end of the queue

b.Dequeue:-
• Removes and returns the elements from the front of the queue

c.Peek:-
• Returns the element at the front of the queue without removing it

d.Isempty:-

• Checks if the queue is empty

e.Isfull:-

• Checks if the queue is full

You might also like