Program Development

Program development is the process of creating application programs. Program development life
cycle (PDLC), The process containing the six phases of program development:
 analyzing,
 designing,
 coding,
 debugging and testing, &
 Formalize
 Document and maintaining application software.

program development is a process in which objectives for the final product are laid out
 Programming is the process of creating a set of instructions that tell a computer how to
perform a task. Programming can be done using a variety of computer "languages," such as SQL,
Java, Python, and C++.

Syntax refers to the spelling and grammar of a programming language. Computers are
inflexible machines that understand what you type only if you type it in the exact form that the
computer expects. The expected form is called the syntax. Program with syntax errors cannot
execute.

A logic error (or logical error) is a mistake in a program's source code that results in
incorrect or unexpected behavior. It is a type of runtime error that may simply produce the
wrong output or may cause a program to crash while running. Many different types of
programming mistakes can cause logic errors
 Program development is the process of creating application programs. Program
development life cycle (PDLC) The process containing the five phases of program development:
analyzing, designing, coding, debugging and testing, and implementing and maintaining
application software.
 Steps In The Program Development
The following are six steps in the Program Development Life Cycle:

1. Analyze the problem. The computer user must figure out the problem, then decide
how to resolve the problem - choose a program.

2. Design the program. A flow chart is important to use during this step of the PDLC.
This is a visual diagram of the flow containing the program. This step will help you
break down the problem.

3. Code the program. This is using the language of programming to write the lines of
code. The code is called the listing or the source code. The computer user will run an
4. Debug the program. The computer user must debug. This is the process of finding the "bugs"
on the computer. The bugs are important to find because this is known as errors in a program.

5. Formalize the solution. One must run the program to make sure there are no syntax and logic
errors. Syntax are grammatical errors and logic errors are incorrect results.

6. Document and maintain the program. This step is the final step of gathering everything
together. Internal documentation is involved in this step because it explains the reasoning one
might of made a change in the program or how to write a program
 The program development steps or phases that we follow a sequence of steps to develop a
program in any programming language.

Generally, the program development steps contains 6 phases, they are as follows

1. Requirements

2. Analysis

3. Design

4. Coding

5. Testing

6. Maintenance
1. Requirements

we define the problem statement and we decide the boundaries of the problem.

Information about the problem must be stated clearly and unambiguously.

we need to understand the problem statement and gather the preliminary requirements.

Main objective of this phase is to eliminate unimportant aspects and identify the root problem

2. Analysis

All the factors like Input/output, processing requirement, memory requirements, error

handling, interfacing with other programs have to be taken into consideration in this stage.

It also determines the required format in which results should be displayed
3. Design

The software developer makes use of tools like algorithms and flowcharts to develop the design

of the program.

Algorithm

Flowchart

Algorithm is the list of instructions in a particular order to solve the problem

Flowcharts are used to get the pictorial representation of the algorithm

4. Coding

Once the design process is complete, converting algorithm to a program by selecting any one of
In this process we identify and eliminate all the syntax errors related to spelling, missing commas,

undefined labels etc.

For effective coding some of the guide lines are to be follow:

• Use of meaningful names and labels of variables

• Simple and clear expressions

• Modularity with emphasis on making modules generalized

• Making use of comments and indenting the code properly

• Avoiding jumps in the program to transfer control

5. Testing

The program is tested on a number of suitable test cases.

This ensures a thorough understanding of the specifications.

Running the program several times using different sets of data verifies whether a program works

correctly for every situation provided in the algorithm.

It is always useful to include the maximum and minimum values of all variables as test data.

6. Maintenance

Updating and correction of the program for changed conditions and field experience is accounted for in

maintenance.

Maintenance becomes essential in following situations:

• Change in specification

• Change in equipment
 ALGORITHM
A sequence of activities to be processed for getting desired output from a given input.

Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be

executed upon in order to get the expected results. The Algorithm are language-independent, i.e.
they are written in English like sentences that can be implemented in any language, and yet the
output will be the same

Properties of algorithm

1) Finiteness: An algorithm must always terminate after a finite number of steps. It means after
every step one reach closer to solution of the problem and after a finite number of steps algorithm
reaches to an end point.
2) Definiteness: Each step of an algorithm must be precisely defined. It is done by well thought
actions to be performed at each step of the algorithm. Also the actions are defined unambiguously
for each activity in the algorithm.

3) Input: Any operation you perform need some beginning value/quantities associated with
different activities in the operation. So the value/quantities are given to the algorithm before it
begins.

4) Output: One always expects output/result (expected value/quantities) in terms of output from
an algorithm. The result may be obtained at different stages of the algorithm. If some result is
from the intermediate stage of the operation then it is known as intermediate result and result
obtained at the end of algorithm is known as end result. The output is expected value/quantities
always have a specified relation to the inputs.
5) Effectiveness: Algorithms to be developed/written using basic operations. Actually operations
should be basic, so that even they can in principle be done exactly and in a finite amount of time by
a person, by using paper and pencil only.

Advantages

Easy to write.

Human readable techniques to understand the logic.

Algorithms for big problems can be written with moderate efforts.

Disadvantages

Difficult to debug.

difficult to show branching and looping.


 FLOWCHART
A flowchart is a pictorial or graphical representation of a process

Flowcharts normally use standard symbols to represent the different types of instructions.
These symbols are used to construct the flowchart and show the step-by-step solution to the
problem. The flow chart symbols are linked together with arrows showing the process flow
direction. This pictorial representation can give a step-by-step solution to the given problem.
General Rules for flowcharting:

1. All boxes of the flowchart are connected with Arrows. (Not lines)

2. Flowchart symbols have an entry point on the top of the symbol with no other entry points. The
exit point for all flowchart symbols is on the bottom except for the Decision symbol.

3. The Decision symbol has two exit points; these can be on the sides or the bottom and one side.

4. Generally a flowchart will flow from top to bottom. However, an upward flow can be shown as
long as it does not exceed 3 symbols.

5. Connectors are used to connect breaks in the flowchart. Examples are

From one page to another page.

An upward flow of more then 3 symbols

6. Subroutines and Interrupt programs have their own and independent flowcharts.
7. All flow charts start with a Terminal or Predefined Process (for interrupt programs or
subroutines) symbol.
8. All flowcharts end with a terminal or a contentious loop.

Advantages:
• Easy to draw.
• Easy to understand the logic.
• Easy to identify mistakes by the non-computer person.
• Easy to show branching and looping.
Disadvantages:
• Time-consuming.

• Difficult to modify.

• Very difficult to draw a flowchart for big or complex problems.

Flowchart Algorithm

 Block by block information diagram representing  Step by step instruction representing the process of
the data flow. any solution.

 It is a pictorial representation of a process.  It is a stepwise analysis of the work to be done.

 The solution is shown in a non-computer language

 The solution is shown in a graphical format.
like English.

 Easy to understand as compared to the algorithm.  It is somewhat difficult to understand.

 Easy to show branching and looping.  Difficult to show branching and looping.

 Flowchart for a big problem is impractical.  The algorithm can be written for any problem.

 Difficult to debug errors.  Easy to debug errors.

 It is difficult to write an algorithm as compared to

 It is easy to make a flowchart.
a flowchart.
Program to Display "Hello World"
Algorithm:
1. start
2. write "Hello World"
3. end

Flowchart:
Program using Variables:

When we want to process some information, we will save the values in variables. The following
program we will define some variables and initialize with values
Algorithm:
1. start
2. a:= 'S' b:= 10 c:= 25.80
3. write a,b,c
4. end
Flowchart: