ppt.....................................

ppt

1. Module-1 8Hours
INTRODUCTION TO DATA STRUCTURES:
Data Structures Definition and overview
Classifications (Primitive & Non-Primitive)
Data structure Operations
Review of pointers and dynamic Memory Allocation
ARRAYS and STRUCTURES: Arrays, Dynamic Allocated Arrays
Structures and Unions, Polynomials, Sparse Matrices, representation of
Multidimensional Arrays, Strings
STACKS: Stacks, Stacks Using Dynamic Arrays, Evaluation and conversion of
Expressions

2. Data structure is logical or mathematical model of
storing and organizing data in a particular way in a
computer.
In other words, a data structure is a way of organizing all
data items that considers not only the elements stored
but also their relationship to each other.

3. Data structure affects the design of both structural &
functional aspects of a program.
Program=algorithm + Data Structure
A algorithm is a step by step procedure to solve a
particular function.

4. Definingoperationsthatcanbeperformedon
data.
Representingdatainthememory.
Determiningamountofmemoryrequiredto
storeandtheamountoftimeneededtoprocess
thedata.

5. Computers are electronic data processing
machines and to solve a particular problem
we need to know:
How to represent data in computers?
How to access them?
What are the steps to be performed to get
the needed output?

6. Data structure are divided into two categories:
Primitive Data Structure
Non-Primitive Data Structure

7. Data structure
Primitive DS Non-Primitive DS
IntegerFloatCharacterPointerFloatIntegerFloat

8. Non-Primitive DS
Linear List Non-Linear List
Array
Link ListStack
Queue Graph Trees

9. These are the fundamental standard data types.
These are used to represent single value.
Integer, Floating-point number, Character constants,
string constants, pointers etc, fall in this category.