• compsciictofficeschukauniversity.jpg
  • computerlab3.jpg
  • computerscience.jpg
  • internscomputer.jpg

UNDERGRADUATE DEGREE PROGRAMMES 

COSC 221: STRUCTURED PROGRAMMING (30/30 CF 3.0)

COURSE PURPOSE: To introduce students to high-level structured programming using elementary features of a structured programming language.

EXPECTED LEARNING OUTCOMES

By the end of the course, students should be able to;

  1. Write, compile and debug programs in a structured programming language preferably C.
  2. Approach software development as a process ranging from problem specification, to algorithm design, to implementation.
  3. Apply basic programming concepts : constants, variables, expressions, data types, strings, arrays, structures, functions, iteration, file input and output, pointers, dynamic memory allocation, in formulation of mathematical models
  4. Design programs involving decision structures, loops and function
  5. Use different data structures and create/update basic data files.
  6. Document program code

COURSE CONTENT

Introduction to a high level block structured programming language.Memory: Pointers, Dynamic allocation, Memory Leaks, Garbage Collection; Basic Data Structures: Arrays, Records/Structs/Classes, Unions, Enumeration, Linked Lists; Modular Programming: Procedures, Functions, Namespaces, File Modules;I/O: Standard, Disk Files; Library Procedures: Standard, API. Programming language to be used is C or any structured programming language. Students should develop applications that read and write to text files

TEACHING AND LEARNING METHODS

Lectures, presentations, practicals, demonstration, group discussions, syndicate work/tutorials and Question/ Answer approach

INSTRUCTIONAL MATERIALS AND EQUIPMENT

Overhead projector, Power point, Flip charts, Hand-outs, Charts and Felt Pens.

REFERENCES

  • Kenigham, B., and Ritchie, D., (1988), The C programming language 2nd ed Prentice Hall
  • Kwale, F., (2009), Fundamentals of programming using C, Egerton University press - Egerton
  • Anany evitin, (2003), Introduction to design and analysis of algorithms, Pearson Addison Wesley
  • Dixon, W. J., BMDP Statistical Software Manual. Revised edition. Berkeley, Calif.: University of California Press, 1992.
  • Robert J. Schalkoff. Programming Languages and Methodologies. Jones & Bartlett Publishers; 2006.
  • Simon Bennett, Steve McRobb, Ray Farmer. Object-Oriented Systems Analysis and Design Using UML (Paperback) Object-Oriented Systems Analysis and Design Using UML. 3rdEdition. McGraw-Hill. 2006

EVALUATION

Assessment Marks
CAT’s & Assignment 30%
Final exam 70%
Pass Mark 40%

Please publish modules in offcanvas position.

ICT