Problem Solving Technique using Computer
Problem Solving Technique using Computer
TECHNIQUE
Made by:- Chirag Srivastava
PROBLEM SOLVING TECHNIQUE
USING COMPUTER
Debugging
& Testing
Program
PROBLEM ANALYSIS
Specifying
Problem analysis is the process of defining a problem
the and decomposing overall system into
Objective
smaller parts to identify possible inputs, processes and outputs associated with the problem.
This task is further subdivided into six subtasks namely:
Specifyi First, we need to know what problem
ng the is actually being solved. Making a
Output clear statement of the problem
Before identifying inputs required for depends upon the size and complexity
Specifying
the system, we need to identify what Input of the problem.
comes out of the system. Requireme
nts After having specified the outputs,
the input and data required for the
Specifying system need to be specified as
When output and inputs are Processing
Requireme well.
specified, we need to specify nts
process that converts specified
inputs into desired output Problem
Before concluding the program
Analysis
Documentat analysis stage, it is best to record
ion whatever has been done so far in the
After the successful completion of all the above first phase of program development.
four steps one needs to see whether the things Evaluatin
accomplished so far in the process of problem g the
Possibilit
solving are practical and feasible. y
PROGRAM DESIGN
The second stage in software development or problem solving using computer cycle is
program design. This stage consists of preparing algorithms, flowcharts and pseudocodes.
Generally, this stage intends to make the program more user friendly, feasible and optimized.
Programmer just requires a pen and pencil in this step in which the tasks are first converted
into a structured layout without the involvement of computer. This process of dividing a
program into modules and then into sub-modules is known as “top down” design approach.
Dividing a program into modules (functions) breaks down a given programming task into
small, independent and manageable tasks.
Progr
am
Desi
gn
Algorith Pseudocod
ms Flowchar es
ts
ALGORITHM INTRODUCTION
An algorithm is an effective step-by-step
procedure for solving a problem in a finite
number of steps. In other words, it is a
finite set of well-defined instructions or
step-by-step description of the procedure
written in human readable language for
solving a given problem. An algorithm
itself is division of a problem into small
steps which are ordered in sequence and
easily understandable. Algorithms are very
important to the way computers process
information, because a computer program
is basically an algorithm that tells
computer what specific tasks to perform in
what specific order to accomplish a specific
task. The same problem can be solved with
different methods. So, for solving the same
problem, different algorithms can be
designed. In these algorithms, number of
CHARACTERISTICS OF AN ALGORITHM
1. An algorithm will be enclosed by START (or BEGIN) and STOP (or END).
2. To accept data from user, generally used statements are INPUT, READ, GET or OBTAIN.
3. To display result or any message, generally used statements are PRINT, DISPLAY, or
WRITE.
4. Generally, COMPUTE or CALCULATE is used while describing mathematical expressions
and based on situation relevant operators can be used.
Example of an algorithms
Algorithm : Calculation of Simple Interest
Step 1: Start
Step 2: Read principle (P), time (T) and rate (R)
Step 3: Calculate I = P*T*R/100
Step 4: Print I as Interest
Step 5: Stop
ADVANTAGES AND DISADVANTAGES OF ALGORITHM
1. Pseudocode will be enclosed by START (or BEGIN) and STOP (or END).
2. Pseudocode should be concise so ignore unnecessary details.
3. To accept data from user, generally used statements are INPUT, READ, GET or OBTAIN.
4. To display result or any message, generally used statements are PRINT, DISPLAY, or WRITE.
5. Generally used keywords are capitalized while preparing pseudocode.
Pseudocode : Calculation of
Simple Interest
Step 1: START
Example for Pseudocode
Step 2: READ P, T, R
Step 3: I = P*T*R/100
Step 4: PRINT I
Step 5: STOP
ADVANTAGES AND DISADVANTAGES OF PSEUDOCODE
4.It must be able to detect unreasonable error conditions and report them to
the end
user or programmer without crashing the system.
Debugging Testing
The program documentation is the process of collecting information about the program. The
documentation process starts from the problem analysis phase to debugging and testing.
Documentation consists two types of documentation, they are:
1. Programmer's Documentation
2. User's Documentation
Programmer's Documentation
Programmer’s documentation contains all the technical details.
Without proper documentation it is very difficult even for the original programmer
to update and maintain the program.
A programmer’s documentation contains the necessary information that a
programmer requires to update and maintain the program.
These information includes:
1.Program analysis document, with a concise statement of program’s objectives, outputs and processing
procedures.
2.Program design documents with appropriate flowcharts and diagrams.
3.Program verification documents for outlining, checking, testing and correction procedures along with the list of
sample data and results.
4.Log used to document future program revision and maintenance activity.
User's Documentation
User documentation is required for the end user who installs and uses the program.
It consists instructions for installation of the program and user manual.
Made By:-
Coming Soon