Scribd
Upload
99 views24 pages

Data Structures and Algorithms

This document discusses algorithms and problem solving techniques. It covers: 1. The definition of an algorithm as a mathematical process with finite steps to solve a problem, and how algorithms are implemented as computer programs. 2. The basic steps for problem solving including understanding the problem, identifying variables and computations, testing, and validating solutions. 3. Top-down and bottom-up approaches for breaking down problems into subtasks, with top-down starting broadly and bottom-up starting with specific parts. 4. How algorithms are used to describe the instruction steps to solve problems, and how these can be implemented as computer programs.

Uploaded by

VenkataMurali Krishna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
99 views24 pages

Data Structures and Algorithms

This document discusses algorithms and problem solving techniques. It covers: 1. The definition of an algorithm as a mathematical process with finite steps to solve a problem, and how algorithms are implemented as computer programs. 2. The basic steps for problem solving including understanding the problem, identifying variables and computations, testing, and validating solutions. 3. Top-down and bottom-up approaches for breaking down problems into subtasks, with top-down starting broadly and bottom-up starting with specific parts. 4. How algorithms are used to describe the instruction steps to solve problems, and how these can be implemented as computer programs.

Uploaded by

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

DATA STRUCTURES AND

ALGORITHMS
BY
VENKATA MURALI KRISHNA V
DEPT OF CS,MGR COLLEGE,HOSUR
Algorithms(Analysis and Design)
Problem Solving
-Procedure for problem Solving
-Problem Definition and Examples
 Top –Down and Bottom-up Approaches to
algorithm design
Use of Algorithms in Problem Solving.
ALGORITHM
• General definition
– an algorithm is a mathematical process to solve a
problem using a finite number of steps.
– In the world of computers, an algorithm is the set
of instructions that defines not just what needs to
be done but how to do it.
Problem Solving
• Problem Solving is the process of breaking
down the problem into smaller parts each of
which can be solved step by step to obtain the
final solution.
• So, in order to solve a problem using
computer, one need to write step by step
solution first, this may be done by writing
instructions for each operation
Basic Steps for solving a problem

• Formulation the problem and deciding the


data types to be entered.
• Identifying the steps of computation that are
necessary for getting the solution.
• Identifying decision parts.
• Finding the result and verifying the values.
Procedure for Problem Solving
• Problem Solving is simply writing the basic Steps
and putting them into Correct Sequence to find the
result.
– Solving a problem involves Six Steps, they are
Step 1:-Understanding the Problem.
Step 2:-Construction of the list of Variables.
Step 3:-Design the layout for the output.
Step 4:-Select a Programming method best Suited to solve a
problem.
Step 5:-Test the Problem.
Step 6:-Validating the Program.
Step 1:-Understanding the problem
• First Solve the problem Manually(Paper work)
– For eg:- Find the Sum of first 6 even numbers?
– Solution
• The first Six even numbers are 2,4,6,8,10,and 12
• So,the sum of first 6 even number is 42.
Step 2:-Construction of the list of Variables

• In this step, the names chosen for the


variables should be an aid of memory.
– For eg:- the variable may be I,SUM,COUNT etc.
Step 3:- Output Design
• The Output format is specified in the problem
itself.
– Example:-The Out put format should have the following
Characteristics.
 Attractive
 Self explanatory
 Easy to read
Step 4:-Program Development
• So, now we draw a flow chart for the
procedure.
• Here we use Standard Symbols Should be used
for drawing a flow chart.
• If the problem is complex, we should divide it
into Several simpler parts.
• Then we finally write the code in high level
language
Step 5:- Testing the Program
• This means by giving the known values to the
variables and by checking the result and
compare the result with manually calculated
values.
• Find any logical errors.
Step 6:- Validating the program
• If the user may enter values which are not
expected by the program.
• Such values should be rejected by the
procedure this is known as validation of data.
– For Example:-
• Mark variable should be an integer value such type of
checks can be included to validate a program.
TOP-Down approach of Problem Solving

• Top-down design is a technique of breaking


down a problem into various subtasks.
• Each of these subtasks is further broken down
into separate subtasks and so on.

• Why we do means to reduce the complexity in


the problem.
• So,the top-down approach starting at the
general levels to gain an understanding of the
system and gradually moving down to levels of
greater detail.
• Top-down process involves working from the
most general form, down to the most specific
form.
• The design of modules is reflected in an
hierarchy chart
Advantages of Top-down
• Increased Comprehension of the problem.
• Unnecessary lower level detail are removed.
• Reduced debugging time.
Bottom-up approach of Problem Solving

• When faced with a large and complex


problem, it may be difficult to handle, it may
be easier to solve parts of the problem
individually, taking the easier aspects.
• Then, thereby gaining the experience to tackle
the more difficult tasks and finally join each of
the solution together. This is called bottom-up
approach.
Disadvantage of bottom -up
• There may be a lack of consistency among
modules.
Use of algorithms in problem solving

• A set of instructions which describes the steps


to be followed to carry out an activity is called
an algorithm of procedure for solving a
problem.
• If the algorithm is written in a language that
the computer can understand, then such a set
of instructions is called a program.
Developing an algorithm
• The process of developing an algorithm to
solve a specific problem is a trial and error
process that may need numerous attempts.
Characteristics of algorithmic Language

• The algorithm will be closely related to the


desired programming language.
• An algorithmic language should be viewed as
set of guidelines for building procedures but
not as a rigid set of rules
• So in Next class we will discuss about
– Design of algorithms and
– Implementation of algorithms
Thank you

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