This document provides an overview of data structures and algorithms. It defines an algorithm as a set of steps to solve a problem and notes they were named after Al-Khwarizmi, who introduced algorithms using instructions. It also defines data as values and information as processed data. The key points made are that data structures are methods for organizing and storing data efficiently, and that the combination of algorithms and data structures form computer programs. It outlines several common data types and introduces linear and non-linear data structures such as arrays, stacks, queues, linked lists, trees and graphs.

1. Data Structure And Algorithm
Prf. Purvi Prajapati
Department Of Information Technology
CSPIT, CHARUSAT

2. Outline
 Introduction
 Algorithm
 Data & Information
 Data Structure
 Data Type
 Types of Data Type
 Importance of Data Structure
 Types of Data Structure

3. Introduction
 Algorithm:
 a set of instructions for solving a problem in
a finite number of steps.
[From : https://www.dictionary.com]
 Step-by-step procedures required to solve a problem.
For example, to find the largest number in a list of
positive numbers.

4. Algorithm
Al Khawarizmi
 A great Iranian mathematician,
geographer and astronomer. He
introduced the zero, negative
numbers, algebra and the
decimal system. He also
invented mathematical
programming using a set of
instructions to perform
complex calculations.
 The term algorithm is named
after a variation of his name,
Algorithmi.

5. Algorithm
Algorithm is a step-by-step finite sequence of
instruction, to solve a well defined computational
problem for the given Input and expected Output.

6. Data & Information
 Data means value or a set of values.
 35
 21/12/2016,
 “CHARUSAT”
 12, 18, 24, 32
 Information means meaningful or processed data.
 35 Age of a person
 21/12/2016 Date of Birth
 “CHARUSAT” Name of the University
 12, 18, 14, 30 Marks of a subject
DATA
Procedure to
process data
Info-1
Info-2
Info-3
.
.
.
Info-n

7. Data Structure
 Data: Data is set of items
 Structure: How to organize data (A particular way of
organizing data in computer)
 A data structure is a method for organizing and
storing data, which would allow efficient data
retrieval and usage.

8. Data Structure
“I will, in fact, claim that the difference between a
bad programmer and a good one is whether he
considers his code or his data structures more
important. Bad programmers worry about the
code. Good programmers worry about data
structures and their relationships. ”
- Linus Torvalds (creator of Linux)

9. Algorithm + Data Structure = Program
-By Niklaus Wirth
 Program:
An implementation of
an algorithm in some
programming language

10. Data Type
 Data type is a term which refers to the kind of
data. That may appear in computation.
 35 Numeric (integer)
 21/12/2016 Date
 “CHARUSAT” String
 12, 18, 14, 30 Array of integers

11. Types of Data Type
Data Type
Built-in Data Type
(BDT)
Abstract / User-defined
DataType(ADT / UDT)
int
char
float
double
struct
union
class
Primitive
Non-
Primitive

12. Importance of Data Structure
 In computer, manipulation of primitive data
does not require any extra effort on the part of
user.
 In real-life applications, various kinds of data
other than primitive data are involved. So,
manipulation of real-life data requires following
tasks:
1. Storage representation of data
2. Retrieval of stored data
3. Transformation of data

13. Importance of Data Structure
 Data Structure is used for
 How the data should be organized in the memory
 How the flow of data should be controlled
 How efficiently it can be retrieved and manipulated
 How data should be designed and implemented to reduce
the complexity and increase the efficiency of the algorithm

14. Types of Data Structure
 Basically there are two types of Data Structures:
1) Primitive Data Structures
2) Non Primitive Data Structures
 Primitive Data Structures are in built data
structures for every programming languages.
 Non-Primitive Data Structures are user defined
data structures.

15. Types of Data Structure
DATA STRUCTURE
PRIMITIVE NON-PRIMITIVE
LINEAR NON-LINEAR
Array
Stack
Queue
Linked List
Tree
Graph
Table
Character
Integer
Floating point

16. Types of Non-primitive Data Structure
 Linear Data Structures :
 Elements are stored/accessed in sequential manner
from the computer’s memory.
 Non-linear Data Structures :
 Elements are stored randomly in computer’s memory.

17. References
 Classic Data structures, D. Samanta, Prentice-
Hall International.
 An Introduction to Data Structures with
Applications, Jean-Paul Tremblay, Paul G.
Sorenson, McGraw-hill.
 Data Structures using C & C++, Ten Baum,
Prentice-Hall International.
 Study materials prepared by Prof. Chintan
Gajjar.

18. Thank You…..