Scribd
Upload
2 views18 pages

Data Structures Am

Data structures are objects designed to organize and manage data efficiently, with examples including tables for stock information. Key types of data structures discussed are stacks (last-in-first-out), queues (first-in-first-out), and linked lists (which consist of nodes with value and pointer attributes). Each structure has primary functions and boundary conditions that must be evaluated.

Uploaded by

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

Data Structures Am

Data structures are objects designed to organize and manage data efficiently, with examples including tables for stock information. Key types of data structures discussed are stacks (last-in-first-out), queues (first-in-first-out), and linked lists (which consist of nodes with value and pointer attributes). Each structure has primary functions and boundary conditions that must be evaluated.

Uploaded by

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

ESC 112 AM

Class

Data
Structur
es
WHAT ARE DATA
STRUCTURES?
OBJECTS that you can define to make working with
data easy and efficient.
Example:
When you as a shopkeeper want to store the
information about your stock, you would do so in the
form of a table.
STRUCTURE OF
STRUCTURES
SYNTAX ATTRIBUTES FUNCTIONS
typedef struct Properties The
Name that creation
organize the function
{ stored data returns an
Can be of object of
int atri1; some user- the type
defined type Name
char Make the Auxiliar
process of y
atri2; working with functio
data ns
Structure Stacks are a last-in-first-
#1 Stacks out type of data structure
The primary functions of
a stack are:
Push
Pop

Pea
k
The
bounda
ry
conditio
STRUCTURE
#2
QUEUES
QUEUES ARE A FI RST-IN-FIRST-OUT
TYPE OF DATA STRUCTURE
THE PRI MARY FUNCTIONS OF A
QUEUE ARE: ENQUEUE
DEQUEUE
PEAK
THE BOUNDARY CONDITIONS
TO BE EVALUATED ARE
OVERFLOW
UNDERFLO
W
Structure The solution for infinite
data Based on the
#3 Linked auxiliary structure of
NODES
Lists individual elements of
the list
have two attributes,
value, and previous
pointer
Major algorithms useful in
We
listscan
areadd an element
to any
Traversing
point in the list.
Reversi
ng
Insertin
g
An
interesting
addition to
this
THANK
YOU!
Do you have any
questions for me
before we go?

You might also like