Unit 1
Definitions
Abstract Data Types
Data Structure Classification
Linear and Non Linear Data Structure
Static and Dynamic Data Structure
Persistent and Ephemeral Data Structure
Problem Solving
Difficulties in Problem Solving
Characteristic of Algorithm
Algorithm Design Tools
Pseudocode
Flowchart
Complexity
Space Complexity
Time Complexity
Asymptotic Notations
Big Oh Notation
Omega Notation
Theta Notation
Properties
Recurrence Relation
Solving Recurrence Relation
Substitution Method
Forward Substitution Method
Backward Substitution Method
Master's Method
Algorithmic Design Strategies
Brute Force
Divide and Conquer
Greedy Strategy
Backtracking
Unit 1 1
, Definitions
An algorithm is a finite set of instructions for performing a particular task. The
instructions are nothing but the statements in simple English language.
Logic Building is the process of trial and error which is followed to solve the given
problem.
Data Structure is the arrangement of data in some systematic manner.
Data refers to raw data or unprocessed data
Information is data that is processed in such a way that it will be meaningful to the
person who receives it.
Abstract Data Types
Abstract Data Type has a set of domains, set of functions and axioms in which only
what is to be done is mentioned but how it is done is not mentioned. All the
implementation details are hidden. In short,
The ADT consists of following things:
1. Data used with its data type
2. Declaration of functions which specify only the purpose
3. Behavior of function can be specified with the help of data and functions together.
Data Structure Classification
Unit 1 2
Unit 1
Definitions
Abstract Data Types
Data Structure Classification
Linear and Non Linear Data Structure
Static and Dynamic Data Structure
Persistent and Ephemeral Data Structure
Problem Solving
Difficulties in Problem Solving
Characteristic of Algorithm
Algorithm Design Tools
Pseudocode
Flowchart
Complexity
Space Complexity
Time Complexity
Asymptotic Notations
Big Oh Notation
Omega Notation
Theta Notation
Properties
Recurrence Relation
Solving Recurrence Relation
Substitution Method
Forward Substitution Method
Backward Substitution Method
Master's Method
Algorithmic Design Strategies
Brute Force
Divide and Conquer
Greedy Strategy
Backtracking
Unit 1 1
, Definitions
An algorithm is a finite set of instructions for performing a particular task. The
instructions are nothing but the statements in simple English language.
Logic Building is the process of trial and error which is followed to solve the given
problem.
Data Structure is the arrangement of data in some systematic manner.
Data refers to raw data or unprocessed data
Information is data that is processed in such a way that it will be meaningful to the
person who receives it.
Abstract Data Types
Abstract Data Type has a set of domains, set of functions and axioms in which only
what is to be done is mentioned but how it is done is not mentioned. All the
implementation details are hidden. In short,
The ADT consists of following things:
1. Data used with its data type
2. Declaration of functions which specify only the purpose
3. Behavior of function can be specified with the help of data and functions together.
Data Structure Classification
Unit 1 2
