Course Details

1. Identify and differentiate data types, variables and constants. Recognise and interpret precedence rules.
2. Analyse and decompose a problem into parts. Translate problem into flow-charts and pseudo-code design methods.
3. Develop and apply correct syntax in programs.
4. Identify syntax and logic errors in a program.
5. Identify when decision and repetition structures have to be used and choose the appropriate one for each case.
6. Apply standard search algorithms.
7. Demonstrate user-friendliness in program development and determine test procedures.

Basic concepts of imperative programming.

Program development through data representation and construction of algorithms using selection, iteration, and sequence.

Information representation in programs (types and variables).

Statements, assignments and operations.

Conditional and repetitive statements.

Principles of algorithmic design.

Composite data type (arrays, structures),

Data input/output.

• J.R. Hanly and E.B. Koffman, Problem Solving and Program Design in C, 5th Edition, Addison Wesley.

• M. Deitel, Paul J. Deitel, C: How to Program, 3rd Edition, Prentice Hall, 2000.