Scribd
Upload
380 views20 pages

Algorithms & Data Structure: Kiran Waghmare

The document discusses algorithms and data structures. It covers the following topics: 1. Problem solving and computational thinking 2. Introduction to data structures and recursion 3. Common data structures like stacks, queues, linked lists, trees 4. Algorithms for searching, sorting, hashing 5. Graph algorithms and applications It also provides examples of recursion and recursive algorithms like towers of Hanoi. The goal is to introduce fundamental algorithm design strategies and data structures.

Uploaded by

Gayatri aptil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
380 views20 pages

Algorithms & Data Structure: Kiran Waghmare

The document discusses algorithms and data structures. It covers the following topics: 1. Problem solving and computational thinking 2. Introduction to data structures and recursion 3. Common data structures like stacks, queues, linked lists, trees 4. Algorithms for searching, sorting, hashing 5. Graph algorithms and applications It also provides examples of recursion and recursive algorithms like towers of Hanoi. The goal is to introduce fundamental algorithm design strategies and data structures.

Uploaded by

Gayatri aptil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Algorithms & Data

Structure
Kiran Waghmare

CDAC Mumbai: Kiran Waghmare 1


Module 2: Algorithms and Data Structures
• Text Book:
• Fundamentals of Data Structures in C++ by Horowitz, Sahani & Mehta
• Topics:
• 1.Problem Solving & Computational Thinking
• 2.Introduction to Data Structures & Recursion
• 3.Stacks
• 4.Queues
• 5.Linked List Data Structures
• 6.Trees & Applications
• 7.Introduction to Algorithms
• 8.Searching and Sorting
• 9.Hash Functions and Hash Tables
• 10.Graph & Applications
• 11.Algorithm Designs

CDAC Mumbai: Kiran Waghmare 2


CDAC Mumbai: Kiran Waghmare
Mind Map by Dr. M Sasikumar, 3
CDAC Mumbai
Agenda
• Problem Solving & Computational Thinking
• Algorithm & Data Structure
OODesign: ADTs
• Recursion
Base condition
Direct & indirect recursion
Memory allocation
Pros and Cons
Complexity analysis
Computational Thinking : Researcher
• Niklaus Wirth Linus Torvalds

CDAC Mumbai: Kiran Waghmare 5


Why Study Algorithms and Data Structures?
• World domination

6
Modern World of Computing
• Age of Big Data, birth of Data Science
• Digitization, communication, sensing, imaging…
• Entertainment, science, maps, health, environmental,
banking…

• Volume, variety, velocity, variability


• What all happens in 1 Internet minute?
7
8
CDAC Mumbai: Kiran Waghmare 9
CDAC Mumbai: Kiran Waghmare 10
Write Algorithm to prepare a Tea

CDAC Mumbai: Kiran Waghmare 11


Definition
• Data:
• Collection of Raw facts.
• Algorithm:
• Outline, the essence of a computational procedure, step-by-
step instructions.
• Program:
• An implementation of an algorithm in some programming
language
• Data Structure:
• Organization of data needed to solve the problem.
• The programmatic way of storing data so that data can be
used efficiently

CDAC Mumbai: Kiran Waghmare 12


CDAC Mumbai: Kiran Waghmare 13
Algorithm Design Strategies
• Brute force
• Divide and conquer
• Decrease and conquer
• Transform and conquer
• Greedy approach Invented or applied
by many genius in
• Dynamic programming CS
• Backtracking and branch and
bound
• Space and time tradeoffs
KW:CDAC Mumbai 14
CDAC Mumbai: Kiran Waghmare 15
Topics
1. Recursive definitions and Processes
2. Writing Recursive Programs
3. Efficiency in Recursion
4. Towers of Hanoi problem.
KW:CDAC Mumbai 17
• What is Recursion?
The process in which a function calls itself directly or
indirectly is called recursion and the corresponding function
is called as recursive function.
• Using recursive algorithm, certain problems can be solved
quite easily.
• Examples of such problems are
• Towers of Hanoi (TOH),
• Inorder/Preorder/Postorder Tree Traversals,
• DFS of Graph, etc.
CDAC Mumbai: Kiran Waghmare 18
How does Recursion works?

KW:CDAC Mumbai 19
CDAC Mumbai: Kiran Waghmare 20

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy