BIT 1208 STRUCTURED PROGRAMMING
Contact Hours 42
Pre-requisite BMA1201 DISCRETE MATHEMATICS
Purpose To present fundamental methodology and process for the analysis and design of a computer based
business information systems.
Objectives By the end of the course units the learner will be able to;
Describe the structured computer programming paradigm
Use data control structures and advanced computer algorithms
Apply a high-level C programming language for examples and illustration.
Write computer programs or commands to solve general problems
Course Content Structured programming - syntax, semantics, data types, expressions, statements, variable, input-
output, control structures
Sub-programming or modularization (to solve complex problems_ -functions and procedures
(sub routines)
Introducing functional and procedural observations and data abstractions
File management and programming standards
Writing correct and efficient programs
Designing and analyzing programs
Dynamic programming
Topics
Week 1 Introduction to Programming
Programming concepts
Programming Languages
Program Development and Design
Introduction to program development process
Week 2 Program design tools; algorithms, Flow charts and decision tress
Features of a good program
Types of Program errors
Week 3 Introduction to C Programming
Layout of a C program; explanation of the sections in the layout of a C program.
Data Types and Variables
Constants
Input and output operations
Expressions and Statements
Week 4 Operator types and operands
Type conversation (Casting)
Comments
System reserved words
Week 5 Control structures
Sequential
Loops; the for loop, the while loop and the do while loop
Selection structures; single if, else if, the nested if..else statements and
The Switch statement
Week 6 CAT ONE
Week 7 Functions
Concept; function
System functions and user- defined functions
Function prototypes/function declaration
Function definition/implementation
Function calls
Week 8 Argument passing; argument passing by value and argument passing by reference
Default values in argument
Functions Overloading
Inline Functions
Recursive functions; example-factorial of a number, the Fibonacci series
Week 9 -10 Arrays
Concept; array
Array declaration syntax
Ways of initializing the array elements
Accessing of the array elements
Manipulations on the array elements such as summing the array elements, searching
Week 11-12 Pointers
Concept; pointer
Pointer declaration syntax
Use of the address symbol with pointers to dereference a variable
Week 13-14 File processing
Introduction
Files and Streams
Creating a sequential-Access file
Reading Data from a sequential –access file
Updating sequential access file
Random access file
Creating a random access file
Writing data randomly to a random access file
Reading data sequentially from a random access file
Teaching Methodology Lecture
Tutorials
Case studies in development of business information systems.
Instructional Material/ Audio Visual aids in lecture rooms and theatre rooms
Equipment
Assessment A learner is assessed through ;
Continuous Assessment Tests (CATs) (30%)
End of semester examination (70%)
Required Text Books Wu T Norman Theodore 1997, An introduction to programming, MC Graw Hill
Balagurusamy E.,
Programming in ANSI C. TATA, MCGraw Huill Brian K.W. & Ritche D.M,
The C Programming language, Prentice-Hall, Baday K. ANSI C,
Problem solving and programming, Prentice-Hall Brian K.W. et al,
C programming Language 2nd edition, Prentice -Hall Cormen et al,
An introduction to Algorithms
Other Support Various application manuals and journals
Material
