BSD 1303 Intro To Programming Outline

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

BSD 1303 Introduction to Computer Programming

Contact Hours 52 hours


Pre-requisite BIT 1206 Discrete Mathematics
Purpose/Aim To give students a thorough grounding in the key concepts,
techniques, and methods that have emerged over time as
programming has evolved into a process with increasing
formalized approaches.
Course Objective Up successfully completion of this course unit, the learner should
(Indicative Learning be able to demonstrate a satisfactory performance in the following
Outcomes areas:
▪ Placing context development in programming languages
and reasons for their evolutions
▪ Recognize and apply appropriate ways to control and
manipulate data
▪ Break down and formulate data into structures appropriate
for the problem to be addressed
▪ Define and apply a range of testing approaches to check
the correctness of programming code
▪ Put programming activities into the context of software
development as a whole with emphasis on the importance
of documentation
Course Content • History of Programming
1. Language models, evaluating languages,
chronology of programming, language
generations.
• Variables Controls Structures and calculations
1. Variable types and names, sequence, selection,
loops.
• Data Analysis and Problems
1. Program development process: program
specification, requirement analysis, design coding
and analysis, implementation and support.
structured diagrams, structured walkthrough
• Programming Techniques
1. Procedures and Functions, Arrays:- one
dimensional arrays, two dimensional array, array
processing.
• Testing
1. Why testing, levels of testing, unit, integration,
systems, acceptance testing, and installation tests.
Desk checking and dry running.
• Implementation
1. Traditional Systems lifecycle, SDLC, need for
documentation and coding standards, attributes of
a good documentation.

Lab 1
Given a problem, come up with a pseudo-code to represent the
solution to the problem.
Draw flowcharts to represent solution of the problem above

Lab 2
Given a problem, provide solution following the program
development lifecycle i.e. Problem definition, design, coding, etc.

Lab 3
Use Top-down problem-solving methodology to solve generic
problems
Introduction to concepts of structured programming e.g.
Variables declaration, Control structures, statements, expressions

Lab 4
Modularisation to provide solution to complex problems
including Functions and procedures

Lab 5
Given a problem, design Inputs prompts as well as output screens

Lab 6
Designing and analysing algorithms, Mathematical foundations
of algorithm design, Summations, Recurrences, Dynamic
programming
Learning & Teaching Lectures, tutorials and computer laboratory exercises
Methodologies
Instructional Classroom with audio visual aids
Materials/Equipment Computer laboratory
High-level programming language e.g. C
Course Assessment Type Weighting (%)
Examination 70
Continuous Assessment 30
Total 100
Recommended Title Author Publisher
Reading An introduction to Wu Thomas, McGraw-Hill (1997)
Programming Norman and
Theodore
Additional Reading C Programming Brian W. Prentice Hall PTR
Language (2nd Kernighan, Dennis (2003)
Edition) Ritchie, Dennis M.
Ritchie
An introduction to Cormen et al MIT Press (2000)
algorithms
Other Support Material A variety of multimedia systems and electronic information
resources as prescribed by the lecturer.
Various application manuals, URL search and journals.

You might also like