LESSON 1 DATA STRUCTURES
●Arrays
●Functions
●Conditional Statements
●Switch Case
●Printf/Scanf
Stacks- “last in, first out”
Queues- “first come, first serve” / “first in first out”
Trees- “root is on top”
Graphs- “relation”
Maps- “routes”
Sets- “collection”
➢DATA STRUCTURE
●Data
- “raw” / “unprocessed facts”
- may be arranged in many dierent ways.
- logical or mathematical model.
a.1) Linear Data Structure
●Static Data Structure
- Array (“store multiple items”
●Dynamic Data Structure
- Queue (“follows particular order” FIFO)
- Stack (“follows particular order” LIFO or FILO)
- Linked List (elements linked using pointers)
a.2) Non-linear Data Structure
●Tree (“finite set of data items” “top/root nodes”)
●Graph
➢LINEAR DATA STRUCTURE
- said to be linear if its elements combine to form any
specific order.
- There are basically two techniques of representing
such linear structure within memory.
●FIRST WAY
- provide the linear relationships among all the elements
represented by means of “linear memory allocation”
- These linear structures are termed as “arrays”.
●SECOND WAY
- to provide the linear relationship among all the
elements represented by using the “concept of pointers
or links”.
- These linear structures are termed as “linked lists”.
➢NON-LINEAR DATA STRUCTURE:
- (One to many, many to many)
●Tree
- Represented by a pointer to the topmost node
tree.
- No value = “null root”
- data often contain a hierarchical relationship
among various elements.
- a data structure that reflects this relationship is
termed as a rooted tree graph or a tree.
●Graph
- Capable of representing many kinds of
physical structures.
- data sometimes hold a relationship between the
pairs of elements which is not necessarily
following the hierarchical structure.
- Such data structure is termed as a Graph.
a.) Edge
b.) Vertices
a.) Directed Graph b.) Undirected Graph
➢TYPES OF GRAPHS
a.) Directed
b.) Undirected
c.) Simple
d.) Weighted
e.) Connected
f.) Non Connected
➢ARRAY
Declaration (int age;)
- Specify the type of its elements & the array
name.
- Existence of an entity in the program and its
location.
- Syntax: arrayName[arraysize];
Initialization (age = 20;)
- Process of “assigning value to the variable”.
- You can initialize an array at the time of
declaration by providing a comma-separated
list of values enclosed in curly braces {}.
- Number of values should match the size of the
array.
●Arrayname = name of the array
●Index = the position of the element starts w/ (0)
(elements)
0, 1, 2, 3, 4, (index)
➢ARRAY
- “container of data types”
- a container which can hold a fix number of items and
these should be of the same type.
- “store multiple items”
➢IMPORTANT TERMS TO UNDERSTAND THE
CONCEPT OF ARRAY.
●Element
- Each item stored in an array is called an
element.
●Index
