TSU

COLLEGE OF ENGINEERING, TECHNOLOGY & Computer Science

DEPARTMENT OF COMPUTER SCIENCE

BACK

      COURSE DESCRIPTION FOR COMP 3000: Computer Programming for Non-CS majors ( 3)

 

      Prerequisite: High School Algebra

 

    COURSE OBJECTIVES

      To teach the following topics:

1.           Computer hardware units and their functions.

2.           Data types.

3.           Problem solving methods and algorithm development.

4.           Translation of algorithms into programs. A number of algorithms will be implemented using the programming language selected for teaching the course.

5.           Basic constructs of a modern 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 procedural decomposition and algorithm development.

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

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

6.           Know some basic concepts of Object Oriented Design and Object Oriented Programming.

 
     MAIN TOPICOMP TO BE COVERED

1.           Introduction to Computer Hardware & Software (an overview).

2.           Numbering Systems including the binary and hexadecimal numbering systems.

3.           Methods of converting data between numbering systems.

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

5.           Problem solving methods and algorithm development and presentation.

6.           Storage Methods of data in computer memories.

7.           Introduction to algorithm translation(coding).

8.           Translating a simple algorithm involving input, output and computational expressions.

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

10.      Recursive functions and their uses.

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

12.      Relational and logical expressions.

13.      Control structures (decisions and loops) and their uses.

14.      Exceptions and exception handling.

15.      Programming examples.

16.      Processing sets of homogeneous data using one dimensional and two dimensional arrays.

17.      Use of matrices for solving sets of linear equations.

18.      Sorting and searching arrays.

19.      Introduction to Classes.