TSU

COLLEGE OF ENGINEERING, TECHNOLOGY & Computer Science

DEPARTMENT OF COMPUTER SCIENCE

BACK

 

COURSE DESCRIPTION FOR COMP 2630: Selective Programming Languages (1-3).

 

COURSE PREREQUISITE:          COMP 2040 (Introduction to Computers and Problem Solving)

 

COURSE OBJECTIVES

1.         Introduce students to computer hardware and software.

2.         Discuss data types.

3.         Discuss problem solving and algorithm development methods.

4.         Discuss methods of implementing programs. A number of algorithms will be developed and implemented using the selected programming language.

5.         All constructs of the selected programming language.

 

COMPETENCIES STUDENTS ARE EXPECTED TO MASTER

1.         Understand computer hardware units and their functions.

2.         Understand different data types handled by computers.

3.         Learn basics of problem decomposition and algorithm development.

4.         Be able to specify algorithms using pseudo codes and flowcharts.

5.         Learn and use statements of the selected programming language for coding algorithms.

6.          Learn methods of implementing programs using computers.

 
MAIN TOPICOMP TO BE COVERED

1.         Introduction to Computer Hardware & Software (Overview).

2.         Discussion of numbering systems including the binary and hexadecimal numbering systems.

3.         Methods of data Conversions between numbering systems.

4.         Review of computer hardware, especially memories and the central processing unit.

5.         Review of problem solving and algorithm development and presentation.

6.         Storage Methods of data in memory.

7.         Introduction to algorithm translation (coding).

8.         Translating simple algorithms involving input, output and computational expressions.

9.         Problem decomposition and the language constructs for subprograms (functions (methods)).

10.     Recursive functions.

11.     Input from files and output files and formatted outputs.

12.     Relational and logical expressions.

13.     Programming language control structures ( decisions and loops).

14.     Programming examples and their implementations.

15.     Processing sets of homogeneous data using one dimensional arrays(linear lists) and two dimensional arrays(matrices).

16.     Programs for solving sets of linear equations.

17.     Sorting and searching with arrays.