0% found this document useful (0 votes)
41 views4 pages

CSC 2112

Examination tool for computer science student
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views4 pages

CSC 2112

Examination tool for computer science student
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

SCHOOL OF BUSINESS AND TECHNOLOGY

COURSE OUTLINE MAY TO AUGUST 2024 TRIMESTER

COURSE CODE: CSC 2112 COURSE TITLE: INTRODUCTION TO


PROGRAMMING AND ALGORITHMS

CREDIT HOURS: 45 HOURS

COURSE LECTURER: SHABAN BAKARI

Cell Phone: 0719888815 email: [email protected]

Lecture Time: Wednesday 11.00 am – 2.00 pm

Course Objective
As a fundamental subject, this course equips the students with theory and practice on problem solving
techniques by using the structured approach. Students are required to develop programs using C
programming language, in order to solve simple to moderate problems. The course covers the following:
preprocessor directives, constants and variables, data types, input and output statements, text files, control
structures: sequential, selection and loop. It may also include arrays and basic library functions.

Prerequisite courses:
There are no formal prerequisites, but some familiarity with computers in general is assumed of all
students.

Expected Learning Outcome


By the end of the course unit, learners should be able to:
a) Design algorithms to solve simple problems,
b) Use those algorithms in the Processing programming environment,
c) Demonstrate the ability to correct, test and debug Processing programs, and
d) Explain how algorithms and Processing programs work.
Course Content

Page 1 of 4
Course Outline
WK TOPIC SUB-TOPICS METHOD
1 Introduction to  Introduction to a Program Lecture
Computers and  Computer Systems: Hardware Discussion and Lab Session
Programming and Software
 Programs and Programming
Languages
 Procedural and Object-Oriented
Programming
2 Problem-solving  Input, Processing, and Output Lecture
process and  The Programming Process Discussion and Lab Session
Problem-solving  System Development
techniques  Pseudocode
 Flowchart
 Structured chart
3 Introduction to C  Variables Lecture
 Identifiers Discussion and Lab Session
 Data types
 Basic arithmetic operators
4 Arithmetic  Mathematical Expressions Lecture
Expression  Type Conversion Discussion and Lab Session
 Overflow and Underflow
 Type Casting
 Named Constants
 Multiple Assignments and
Combined Assignment
5 Input/Output  Formatting Output Lecture
operations  Formatted Input Discussion
 Focus on debugging: Hand Group work and
tracing a Program presentations
 Focus problem solving: A case
study
 Introduction to File Input and
Output
6 CONTINOUS ASSESSMENT
TEST 1 (CAT 1)
7 Control  The if statement Lecture
structure:  The if/else statement Discussion and Lab Session
Selection/Bran  The if/else if statement
ch  The switch statement
 The break, continue statement
8 Control structure:  The for loop Lecture
Loop  The while-do loop Discussion and Lab Session
9 Control structure:  The do-while loop Lecture
Loop (CONT.)  Nested loop Discussion and Lab Session
10 CONTINOUS ASSESSMENT TEST 2

Page 2 of 4
(CAT 2)
11 Function:  Predefined/library function Lecture
 User-defined function Discussion and Lab Session
12 Arrays: one and  Declaration and definition Lecture and Lab Session
two-dimension.  Accessing arrays

13 Pointers 
What is a Pointer? Lecture, Discussion

Pointer Syntax Group Presentations

Pass By Reference

Pointers and Arrays
14& FINAL EXAMINATION Written
15

Teaching / Learning Methodologies


Lectures, Class exercise, Lessons, case studies, Discussion and Practical sessions

Instructional Materials and Equipment


White board, Overhead projector, Power point, Flip charts, Board markers, Handouts, Charts and
Transparencies and Felt Pens.

Course Assessment
Continuous Assessment Test (Attendance, Exercises, tests, group work) 30%
End of trimester examination 70%
Total 100%

Course Textbooks
1. H.M Deitel, P.J Deitel. C How to Program, 6th edition. 2007. Pearson Education.

Reference Texts
1. Byron, S. Gottfried. Programming with C. 2nd .Edition, 2007, McGraw Hill.
2. Delores M. Etter, Engineering Problem Solving, 3rd edition. 2004. Pearson (Prentice-Hall).
3. Jeri R. Hanly, Elliot B. Koffman, Problem Solving and Program Design in C , 5th edition. 2007.
Addison-Wesley.
4. Dayang Norhayati Abang Jawawi dan Rosbi Mamat, Pengenalan Mudah Pengaturcaraan C,2001.

Other support materials

Page 3 of 4
Lecturer In charge:

Name : SHABAN BAKARI Signature: …………………Date: ……………...

Approved for Circulation


Head of Department:
Name :………............................................Signature …………………Date………………

Mobile……………………………………Email:……………………………………………..

Dean of the school:

Name :……….......................Signature …………………Date………………

Mobile……………………………………Email:……………………………………………..

Class rep:
Name :……….......................Signature …………………Date………………

Mobile……………………………………Email:……………………………………………..

Page 4 of 4

You might also like