1

THE COPPERBELT UNIVERSITY

SCHOOL OF BUSINESS
BS/BSP 240
INTRODUCTION TO DATA PROCESSING

3.6. PROGRAMMING

3.6.1. Introduction

A program is a set of instructions that furnishes the computer with methods of how to carry out processing.
These programs are an explicit expression of how a computer should execute processing. Programming is
the act of developing the program code. It also involves the depiction, or expression of a problem for
subsequent translation into a computer language. A precise expression of that which is meant to be
executed by a computer in a given context. A logical expression of a problem is usually presented before
stipulation of the solution. Methods have been devised to communicate the various expressions of program
logic. Examples being pseudocode, algorithms, decision trees, decision tables, decision sequences, data
flow diagrams and decision flow diagrams.

3.6.2. Program Flowcharts

These are diagrammatic expressions of the operations or steps in a program. They visually depict the logic,
sequence and flow of programs.

Symbols used

Input/output

Processing /computer

Process flow

On page connectors

Off page connect

Terminal begin or end, start or stop

Decision

Pre-defined process
 2

Example of Program Flow chart

Begin

‘Input Data’

NO
Condition
met?

YES

Perform Calculation

Display
Results

End

Another Example of Program Flowchart

Start

Input details

?
Calculated
labour
Costs

Output labour
Costs

Stop

3.6.3 Control Structures

These are structures that determine the flow of execution of a program steps. They are used to alter the
course of program execution. The main control structure type are presented below( Sequence, Selection,
repetition)

Sequence
 3

Selections

NO YES
?

IF condition THEN Action, ELSE action

END IF

?
Case condition, action

Repetition

? WHILE
Condition action
END WHILE

REPEAT actions UNTIL condition

3.6.4. Decision Tables

These are tabular representation of decision logic. For any given situation a decision table lists all the
conditions (the ‘ifs’) that are possible in making a decision. It also lists the alternative actions (the ‘thens’).
Each unique relationship (if then this condition then take this action) is referred to as a decision rule.
 4

General form of a Decision Table

Stub Entry
Condition rule
Condition 1 2 3 4 5 6
(Specific Condition)

Action Rule
Action
(Specific action) 1 2 3 4 5 6

Example of Decision Table

a B c d
Credit approved N Y Y Y
Order ≤ stocks available - N Y Y
Order > 500 units - - N Y
Reject Order X
Back –Order X
Fill- Order X X
Give 20% discount X

3.6.5. Decision Trees

These depict the actions to be taken amongst given alternatives. They show the path of subsequent
decisions taken to depict the logic of flow of a program or system that has conditional events.

Example Of Decision Trees

Conditions Actions

Card Balance Commit 5% discount

Sufficient transaction

Order ≥10,000

Not sufficient Return card

Order
Placed
Card balance Commit trans
Sufficient

Order < 10,000

Not sufficient Return

 5

3.6.6. Algorithms
Algorithms are the textual description of program logic. They are designed to enable conversion into actual
program code easy and understandable. A good algorithm is easy to follow but brief.

Algorithm to Compute Continuous Assessment

[INPUT : TEST 1, TEST 2, TEST 3,

Q1, Q2, Q3, EXAM

PURPOSE : ALGORITHM TO CALCULATE THE OVERALL MARKS GIVEN TO A

BS240 STUDENT AT THE END OF THE YEAR

OUTPUT : FINAL RESULT (TOTAL MARKS), COMMENT ]

1. Enter T1, T2, T3, Q1, Q2, Q3, Exam

2. Calculate
T1 + T 2 + T 3
Total test = × ( 0 .2 )
3
3. Calculate
Q1 + Q 2 + Q3
Total Quiz = × ( 0 .2 )
3
4. Calculate
Exam total = Exam x 0.6
5. Calculate
Final Result = Exam Total + Total Quiz + Total Test
6. IF Final Result >49
Assign Comment = ‘Pass’
ELSE
Assign Comment = ‘fail’
7. Display {Print result to screen}
Final Result, Comment!
8. Stop

Another Algorithm Example (Revenue Calculation Algorithm)

[Input : Service charge, unit cost, number of installations, yards of cables used.

Purpose : Algorithm to calculate the revenue generated by the installation of a certain number of
yards of cable at a number of locations. For each installation there is a fixed basic service
charge and an additional charge for each foot of cable.

Output : Revenue generated

]
1 Enter S.C, U.C, Inst. MC

2 Calculate Feet Of Cable = 3 * Yards of Cable

3 Calculate Revenue = ( Inst * S.C) + U.C * Feet of Cable

4 Display Revenue
5 Stop.
 6

Exercises on Program logic construction

1. A publisher produces short books on topics in computing. These are published in two page sizes,
A4 and A5; they are also available in paperback or hardback. The selling price will depend on
these two factors and the expected sale. The A4 size books cost K5, 000 more than the
corresponding A5 book. The hardback copy costs K7, 000 more than a paperback copy. The
selling price of the paperback A5 copies is K25, 000 per copy if the expected sale is greater than
200 and K32, 000 otherwise.

Construct a decision table for this pricing scheme. Show that the table is complete and eliminate
any redundancy.

2. Design and write an Algorithm for a program that determines the selling price of a book in
question 1 above. It should be able to request for suitable input from the user.

3. Write a decision tree for the process of deciding the progression criteria or path of a second year
student in the school of business. You will have to consider most of the possibilities or alternatives
that lead to a student either progressing to third year or otherwise.

4. Design and draw a flowchart for a program that find the roots of a quadratic equation ax2+bx+c=0
where a, b and c are real numbers that are supplied by the user.

5. Design and write an Algorithm for the program in question (4) above.