You are on page 1of 3

UNIVERSITI TEKNOLOGI MARA

KAMPUS TAPAH PERAK


COURSE INFORMATION

Program
Course Code
Course Title
Credit Hours
Contact Hours
Status
Prerequisite
Semester
Lecturers
Room
Telephone

:
:
:
:
:
:
:
:
:
:
:

Diploma in Computer Science (CS 110)


CSC 118
Fundamentals of Algorithm Development
3
4 hours (3 hours lecture + 1 hour tutorial)
Core
None
____________________
Mr. Imran Md Jelas
98, UiTM Kampus Tapah
017 272 1803

Course Description:
This course will focus on algorithm development in problem solving. It will also introduce the students to
the techniques of problem solving using modular approach. Students are expected to develop the ability
to analyze problems and organize effective algorithmic solutions. This course will also provide the
overview of the computer system.
Course Outcomes:
After completing this course, the student should able to:

identify the computer system components


identify the steps in problem solving
apply algorithm representations in problem solving design
design appropriate algorithms to solve simple problems using modular approach

Assessment:
A. Coursework:
1. Test 1
2. Test 2
3. Quizzes ( 4 )
4. Assignments ( 4 )
5. Mini Project

B. Examination:
Final Exam

C. Passing Grade:

10 % (Individual)
10 % (Individual)
10 % (Individual)
10 % (Individual)
10 % (Individual)
50 %

50 %
100 %
C (50%)

SYLLABUS CONTENTS

No

Topics

Overview of a Computer System


Introduction to computer and its components
Computer Hardware and Software Computer Software

Introduction to Problem Solving using Computers


Typical Simple Problem Solving
Typical Real World Problems
Algorithm
o What is algorithm
o History of algorithm
o Algorithm and logical thinking
o Problem solving using different algorithms

Basic Concepts of Algorithm


Elements of an algorithm
Algorithm representations
o Flowchart
o Pseudo code

Introduction to Algorithm Design


Statements (processes)
Control structures
Identifiers, Variables and Constants
Fundamental Data types
Operators
Input - Output

Control Structure
Sequential
Selection
Iteration (Loops)

Algorithm Development
Module
o Modular Design
o Parameter passing
Approach
o Top down design
o Bottom up design
Stub
Stepwise refinement

Introduction to List
Properties of list
Operations using list

TEACHING METHODOLOGY
A combination of any of the following methods:
Lectures
Tutorials

TEXTBOOK
1. Joyce Farrell, Programming Logic and Design Introductory, Fifth Edition, Course Technology 2008.

RECOMMENDED REFERENCE
1. Maureen Sprankle, Jim Hubbard, Problem Solving & Programming Concepts, Eight Edition, Pearson
International Edition, 2009.
2. Nordin Abu Bakar, Suhana Sulong, Wan Dorishah Wan Abd. Manan, Asas Pembentukan Algoritma,
Ummah Media Sdn. Bhd.
3. David Harel, Algorithmic, the spirit of computing, 2nd Edition, Addison Wesley, 1992.
4. Haag, Stephen, Computing Concepts, Complete Edition, McGraw Hill, 2002.
5. Zak, Dianne, An Introduction to Programming with C++, 2nd edition, Course Technology, 2001.
6. Robertson, Lesley, Simple Programming Design, 3rd edition, Course Technology, 2000.
7. Uckan, Yuksel, Problem Solving Using C, 2nd edition, McGraw Hill, 1999.
8. Kenneth A. Lambert, Nance, Understanding Programming and Problem Solving with C++, West
Publishing, 1996.
9. Malik, D.S., C++ Programming: From Problem Analysis To Program Design, Course Technology, 2002.