Data Structures
SunBeam Institute of
Information & Technology,
Hinjwadi, Pune & Karad.
Sunbeam Infotech [Link]
Introduction
Educational Qualification:
1. [Link]. Electronics.
2. [Link] (Industrial Maths &
Computer Applications).
Work Experience:
1. 7 Yrs of teaching experience in
SunBeam, for PreCAT & CDAC
Courses.
2. 3+ Yrs of Industry Experience of
Software Development.
Technical Skills:
1. C Programming Language
2. C++ Programming Language
Mr. Sachin G. Pawar. 3. Data Structures
4. Operating System Concepts
Sunbeam Infotech [Link]
Data Structures
# DAY-01:
* Introduction:
- Cocept & Definition
- Types of data structures with examples
* Algorithms:
- What is an algorithm?
- Analysis of an algorithm: time complexity & space complexity
- Asymptotic analysis
* Array:
- Searching Algorithms:
1. Linear Search: Implementation
2. Binary Search: Implementation
Sunbeam Infotech [Link]
Data Structures
# DAY-02:
* Array:
- Sorting Algorithms:
1. Selection Sort : Algorithm & Implementation
2. Bubble Sort : Algorithm & Implementation
3. Insertion Sort : Algorithm & Implementation
# DAY-03:
* Array:
- Sorting Algorithms:
4. Quick Sort : Algorithm
5. Merge Sort : Algorithm
- Limitations of an Array data structure
Sunbeam Infotech [Link]
Data Structures
# DAY-03
* Linked List:
- Introduction: concept & definition
- Types of Linked List
- Implementation of Singly Linear Linked List Operations
# DAY-04:
* Linked List:
- Implementation of Singly Linear Linked List Operations
- Singly Circular Linked List: Concept
- Doubly Linear Linked List: Concept
- Doubly Circular Linked List: Concept
- Applications of Linked List
Sunbeam Infotech [Link]
Data Structures
# DAY-05
* Stack
- Introduction: concept & definition
- Implementation of a static stack by using an array
- Applications of Stack
- Stack applications algorithms:
1. Converstion infix expression into its equivalent prefix &
postfix.
2. Conversion of prefix into its equivalent postfix
3. Postfix evaluation
Sunbeam Infotech [Link]
Data Structures
# DAY-06:
* Queue
- Introduction: concept & definition
- Implementation of linear queue & circular queue
- Applications of queue
# DAY-07 & DAY-08:
* Tree Terminologies
* Graph Terminologies
Sunbeam Infotech [Link]
Introduction
Q. What is Data Structure?
It is a way to store data into the memory (i.e. into the main
memory) in an organized manner so that operations (like
insertion, deletion, searching, sorting, traversal etc...) can
be performed on it efficiently.
Q. Why there is a need of Data Structure?
To achieve three things in programming:
1. Efficiency
2. Reusability
3. Abstraction
Sunbeam Infotech [Link]
Introduction: DS Classification
Sunbeam Infotech [Link]
Introduction
Q. What is an Algorithm?
An algorithm is a finite set of instructions written in human understandable language (e.g.
like an english), if followed, acomplishesh a given task.
An algorithm is a finite set of instructions written in human understandable language (e.g.
like english) with some programming constraints, if followed, acomplishesh a given task,
such an algorithm is reffered as a pseudocode.
# Analysis of an algorithm:
Analysis of an algorithm is, to calculate how much computing time i.e. time complexity
and computer memory/space i.e. space complexity, it needs to run to completion.
1. Time Complexity: time complexity of an algorithm is the amount of time i.e. computer
time, it needs to run to completion.
2. Space Complexity: space complexity of an algorithm is the amount of space i.e.
computer memory, it needs to run to completion.
Sunbeam Infotech [Link]
Introduction
# Best Case Time Complexity:
If an algorithm takes minimum amount of time to complete its execution then it is reffered
as best case time complexity.
Big Omega (Ω)Ω)), notation can be used to represent best case time complexity of an
algorithm.
# Worst Case Time Complexity:
If an algorithm takes maximum amount of time to complete its execution then it is reffered
as worst case time complexity.
Big Oh (Ω)O), notation can be used to represent worst case time complexity of an algorithm.
# Average Case Time Complexity:
If an algorithm takes neither minimum nor maximum amount of time to complete its
execution then it is reffered as an average case time complexity.
Big Theta (Ω) θ ), notation can be used to represent worst case time complexity of an
algorithm.
Sunbeam Infotech [Link]
Array: Searching Algorithms
# Searching:
To search/find a key element in a given collection/list of elements.
Two seaching algorithms are there:
1. Linear Search
2. Binary Search
1. Linear Search: In this algorithm key element gets compared with each
element in a list/collection of elements sequentially from the first element either
match is not found or maximum till last element, if match is found it returns true
and if match not found it returns false.
Best Case Time Complexity : Ω)(Ω)1)
Worst Case Time Complexity : O(Ω)n)
Average Case Time Complexity : θ(Ω)n)
Sunbeam Infotech [Link]
Array: Searching Algorithms
2. Binary Search:
- This algorithm can be applied only on an array.
- Array elements must be sorted
- This algorithm uses divide-and-conquer stratergy.
Best Case Time Complexity : Ω)(Ω)1)
Worst Case Time Complexity : O(Ω)log n)
Average Case Time Complexity : θ(Ω)log n)
Sunbeam Infotech [Link]
