TSU

COLLEGE OF ENGINEERING, TECHNOLOGY & COMPUTER SCIENCE

                    DEPARTMENT OF COMPUTER SCIENCE

 

COURSE DESCRIPTION: COMP 2140: Structured Problem Solving and Programming (3)

Prerequisite: COMP 2040 (introduction to Computers and Problem Solving)                 BACK

 

COURSE OBJECTIVES

1.       Introduction to Simple programming methods (functions) involving Input, output and computational expressions.

2.       Control constructs (decisions and loops).

3.       Procedural problem decomposition and programming multifunction problems.

4.       Arrays and bitwise operations.

5.       Text (string) type data processing.

 

COMPETENCY LEVEL

At the end of semester students who pass the course successfully will:

1.       Have a good understanding of coding problem solutions using a modern programming language.

2.       Will learn syntaxes and semantics of language constructs for decisions, loops, low level operations, functions (methods) and string type data processing.

3.       Will learn methods for processing sets of homogeneous data (arrays).

4.       Will learn use of an Integrated Development Environment for compiling, linking, executing and debugging programs.

 

MAIN TOPICOMP OF COURSE CONTENTDETAILED COURSE OUTLINE

1.       Quick review of some of the topics of COMP2040.

2.       Problem solving with decisions and coding related solutions. The programming language must be the same language used in COMP 2040.

3.       Brief review of some of the topics of COMP 2040.

4.       Problem solving with loops and coding the resulting solutions.

5.       Procedural decomposition of multifunction problems.

6.       Functions (methods) and their uses to code algorithms of multifunction problems.

7.       Pass by value and pass by reference data communication between functions.

8.       Inline and template functions.

9.       Scopes and life times of program components.

10.   Solving and coding a good number of multi-function problems.

11.   Language structures for bitwise operations.

12.   Introduction to pointers and arrays. Both static and dynamic one and two dimensional arrays must be discussed.

13.   Character and string data processing.

14.   Input from Files and output to files. Both sequential and direct File I/O methods must be covered.

 

NOTES:

  1. Programming structures must be related to programming language concepts. For example Backus-Naur. Forms and activations records must be covered.
  2. A large number of solutions must be programmed and implemented in the computer labs.