This document covers the introduction to data structures and algorithms, defining data structures as organized methods for managing data and algorithms as step-by-step problem-solving processes. It emphasizes the necessity of studying data structures for efficient data representation, reduced resource consumption, and developed software. Additionally, it outlines prerequisites, types of data structures, and general requirements for effective implementation.

1. Data Structure &
Algorithm
1.introduction to Data Structure and
algorithm

2.  What is Data structure?
 What is Algorithm?
 Why we need DS?
 What are prerequisites of DS?
 Types of data structure.
 Requirements?

3. what is Data structure?
Data Structure
Raw facts,figures. + Arrangement/sequence.
Definition:
“a special way to organizing and sorting data(Management)
so it can be use in efficient way”
“Sequence of step to solve a given problem”
e.g:
Making a cup of Tea.
what is Algorithm?

4. Algorithm

6. Why we need
DS?/why we study
it?
To represent data in more
efficient way.
• Less time
• Less space(memory)
To build software in this
way it consume less
power and take minimum
time .
Prerequisites??
Previous courses:
⋄ C/PF
⋄ C++/Oop
⋄ JAVA/Oop
Requirements??
 Time to perform
each operations
 Programming
effort
 interest
Most important you

7. Types of Data structure:
Primitive:
• Integer
• Character
• Float
• Double
Non-primitive:
Linear:
• Array
• Link list
• Queue
• stacks
Non-linear:
• Tree
• Graph

9. Help full content:
Code with herry
MysirG.com
VU
VU comsats
Wscube tehc programming concept
Jennys lecture