FCE 266 - Computer Science II

FCE 266   - Computer Science II


Objectives:  The course aims to develop the ability to select appropriate algorithms for problem-solving by computer.  The students will also be expected to become proficient in the use of one high-level structured language (e.g. PASCAL).  Appreciation of the need to follow good software engineering techniques will also be expected.


Detailed Course Outline:


Introduction to Computer Problem-Solving: Programs and algorithms, problem-solving aspect, top-down design.  Software tools for program development - editors, interpreters, compilers.  Fundamental Algorithms e.g., Exchanging the values of two variables, counting summation of a set of numbers, factorial computation base conversion etc.


Array techniques:  Array order reversal, finding the maximum number in set, finding the kth smallest element, removal of duplicates from an ordered array.  Data types and declarations: type integer, real, char, Boolean, enumerated and sub-range.


Statements, Expressions and Assignments.  Input and output of data.  Basic Control Structures: Compound statements, repetitive statements (while, repeat and for statements).


Procedures and Functions:  The procedure concept, block structure and scope.  Variable and value parameters.  Functions.  Information hiding and the layered model in software development.  Methods of documentation.


Structured data structures: Arrays, records and sets.  Files: the file concept, text files. Pointers: the pointer concept, programming a stack.

View as pdf