SCHOOL OF LIBERAL ARTS & SCIENCES

American Degree Transfer Program

MODULE INFORMATION BOOKLET

PROGRAMMING FOR SCIENCES AND

ENGINEERING
CSCI 251
2019 SPRING SEMESTER
14 weeks

Prepared by:
Dr. Azeem

Checked by:

Dr. Wong Yau Hsiung

Stream Coordinator
Department of Mathematics & Computer Science
School of Liberal Arts and Sciences

14-January-2019

Effective Date Revision Page

25 May 2015 1.0 1 of 16
CONTENT PAGE NO.

Introduction 2

Learning Outcomes 3

Delivery Method 5

Assessment 7

Academic Policy 9

Scheme of Work 11

INTRODUCTION

This course provides the student with the opportunity to learn the basics of programming
and algorithm development using top-down design with syntax and semantics of the C
language. The course teaches the essentials of programming with a concentration on
Science and Engineering Applications. This course will introduce the essential ideas of C
programming and the breadth of discipline of computing. The fundamentals of language are
studied in detail. This course will cover few advanced features which include structures,
unions, Pointers, Data structures and file processing. No prior knowledge of C is required
but students are expected to have a good understanding of computing environment and
concepts.

Lecturers’ Detail:

Lecturer Name : Azeem

Email Address : azeem@taylors.edu.my
Telephone No : 603-56295258
Office : Room C9.30
Consultation Hour : Monday, Wednesday & Thursday 12:15 – 1:15 p.m.
Tuesday 11:00 a.m. - 12:00 p.m.

Effective Date Revision Page

25 May 2015 1.0 2 of 16
LEARNING OUTCOMES

Upon successful completion of this course, students should be able to:

1. Define the basic terminology used in computer programming

2. Write, compile and debug programs in C language.
3. Use different data types in a computer program.
4. Design programs involving decision structures, loops and functions.
5. Select appropriate program control structures and data types to enable coding of a
design in C.
6. Use a software development environment to implement programs.
7. Describe and identify the dynamics of memory by the use of pointers
8. Use different data structures and create/update basic data files
9. Correct syntactical and semantic errors in programs.
10. Exploit C for creating middle-sized applications based on the object-oriented
approach and generic programming concepts.

PRE-REQUISITE / ASSUMED KNOWLEDGE: - Please refer to Course Scheduling

MATH171(P) [for all majors] and ENGR196 (P) [for Engineering major only]

CO-REQUISITE (IF ANY): - Please refer to Course Scheduling

None

Effective Date Revision Page

25 May 2015 1.0 3 of 16
TAYLOR’S GRADUATE CAPABILITIES (TGCs)

This module hopes to prepare students with several important soft skills identified by the
university known ‘Taylor’s Graduate Capabilities (TGCs)’. There are eight (8) elements listed
under TGCs as follows:

A. KNOWLEDGE
TGC 1: Discipline Specific Knowledge
1.1 Able to put theories into practice.
1.2 Understand ethical issues in the context of the field of study.
1.3 Understand professional practice within the field of study.
B. COGNITIVE SKILLS
TGC 2: Lifelong Learning
2.1 Learn independently
2.2 Locate, extract, synthesize and utilize information effectively.
2.3 Be intellectually engaged
TGC 3: Thinking & Problem Solving skills
3.1 Think critically and creatively.
3.2 Define and analyze problems to arrive at effective solutions.

C. SOFT SKILLS
TGC 4: Communication Skills
4.1 Communicate appropriately in various settings and modes.

TGC 5: Interpersonal Skills

5.1 Understand team dynamics and work with others in a team.
5.2 Understand and assume leadership.

TGC 6: Intrapersonal Skills

6.1 Manage one self and be self-reliant.
6.2 Reflect on one’s actions and learning.
6.3 Embody Taylor’s core values.
TGC 7: Citizenship and Global Perspectives
7.1 Be aware of and form opinions from diverse perspectives.
7.2 Understand the value of civic responsibility and community engagement.

TGC8: Digital Literacy

8.1 Effective use of Information and Communications Technology (ICT) and related
technologies.

*Specifically, this module is designed to equip students with TGC1, TGC2, TGC3, and TGC8
as above.

Effective Date Revision Page

25 May 2015 1.0 4 of 16
DELIVERY METHOD

TEACHING AND LEARNING METHODS

√ LECTURES

Lectures are direct communication between students and lecturers in the lecture hall in
which the lecturer conveys information to the students. Two-way interaction is minimal as it
focuses on the explanation and discussion of the concepts, theories and examples related to
the topics.

Class attendance is compulsory. Students are advised to attend lectures because important
information related to the module such as syllabus as well as types and method of
assessment will be covered during the lecture sessions. Failure to attend lectures may lead
to confusion and misunderstanding on the module assessment and topics discussed in the
coming classes.

REMINDER: Students who fail to maintain a minimum of 80 percent attendance might be

barred from sitting for the final examination.

√ FLIPPED CLASSROOM

The flipped classroom is a pedagogical strategy in which the typical lecture and homework
elements of a course are reversed. Short video lectures or readings are viewed by students
at home before the class session, while in class time is devoted to exercises and discussions.

UNIT VALUE OF MODULE

3 credit hours

Effective Date Revision Page

25 May 2015 1.0 5 of 16
MAIN REFERENCE:

Deitel & Deitel(2016), " C How To Program", 8th edition, Prentice Hall

REFERENCE TEXT:

1. Samuel P. Harbison, “C A Reference manual”, 5/E, Prentice Hall

2. Brian W. Kernighan, Dennis M. Ritchie, "The C Programming Language", 2/E, Prentice Hall

ONLINE SUPPORT

 Taylor’s Integrated Moodle e-Learning System (TIMeS)

Taylor’s University provides a portal on Learning Management System known as Taylor’s

Integrated Moodle e-Learning System (TIMeS). Students can conveniently access to the
following module resources through TIMeS Portal.

 Module Information Booklet

 Lecture Slides
 Tutorial Questions and Quizzes
 Related documents such as Assignment Cover Form, Assignment Feedback
Form, etc.
 Important announcement such as exam date, assignments due date, class
postponement, etc.
 Other module information

Students are advised to visit TIMeS Portal every day to get latest information on the
module.

Students are advised to visit TIMeS Portal every day to get latest information on the
module.

Effective Date Revision Page

25 May 2015 1.0 6 of 16
ASSESSMENT

ASSESSMENT SUMMARY

Form of Length/ Marks Due Date Learning TGCs Achieved

Assessment Duration Outcomes
Attendance 14 weeks 10% Nil NA
and class
participation
Lab 3 hours 10% 4th and 9th 1 - 7
Exercises(2) Week

Tests(2) 3 hours 35% 6th and 12th 1 - 7

Week

Quizzes(2) 1.5 hours 10% 3rd and 8th 1 - 7

week

Project 3 Weeks 5% 12th - 14th 1 - 7

Week

Final 2 hours 30% 15th week 1-7

Examination

TOTAL 100%

ASSESSMENT COMPONENTS

Assignments/Projects
Assignments/Projects are individual or in groups where students will have to complete a
critical review and be able to write the code on their chosen topic. Students will experience
the complete top-down code review process using software development life cycle model.

Lab Exercises
Students will be expected to solve the sciences and engineering problems using algorithmic
approach.

Tests
Tests are individual assessments which will be conducted in class or online via TIMeS Portal
within certain period of time only. Students are required to answer all questions with in an
hour.

Effective Date Revision Page

25 May 2015 1.0 7 of 16
FINAL EXAMINATION
Final examination is a closed-book examination of two hours. It seeks to determine
students’ individual effectiveness in responding to specific questions under time-
constrained invigilated conditions. Students are required to answer all questions by shading
their answers onto the MCQ answer sheet provided and by answering short and essay
questions.

*Students are required to sit/attempt the final examination. Failure to do so would result
in a fail grade (F).

ASSESSMENT DETAILS
If a student is unable to participate in any assessment, notification should be given to the
lecturer concerned within 24 hours of the assessment time. By producing proper
documentation upon returning, the student can request for an assessment of equivalent
level within 3 days.

Students are awarded a final grade which corresponds with the marks obtained.

As this course is based 70% on continuous assessments and 30% Final Exam, students are
required to complete ALL assignments/projects, lab exercises, Tests,Quizzes and Final Exam
in order to PASS this course.

All students must adhere to the Taylor’s University’s Examinations, Assessment Policies and
Procedures manual available at http://portals.taylors.edu.my.

Effective Date Revision Page

25 May 2015 1.0 8 of 16
ACADEMIC POLICIES

Attendance
Class attendance is compulsory. Students are advised to attend lectures because important
information related to the module such as syllabus as well as types and method of
assessment will be covered during the lecture sessions. Failure to attend lectures may lead
to confusion and misunderstanding on the module assessment and topics discussed in the
coming classes. Only absences with valid reasons and documented proof will be accepted.

REMINDER: Students who fail to maintain a minimum of 80 percent attendance will be

barred from sitting for the final examination.

Plagiarism
Plagiarism is the use of someone else's language, ideas, information or original material
without acknowledging the source. All students are expected to attend a course on proper
usage of referencing.

Plagiarism is a serious offence and any individual (who is suspected of plagiarism) would be
referred to the Academic Integrity Committee of Taylor's University. Please refer to the
Student Handbook for further information.

Tardiness
POSITIVE ATTITUDE means, among others, being on time at the designated place. Tardiness
reflects bad planning and being rude to the person(s) who has/have been kept waiting.
Being late to class without valid reasons will be construed as unexcused absence (although
you will be allowed to attend the class).

Class conduct
No eating or drinking will be allowed during the lecture. All electronic devices (mobile
phones, tablets or laptops) should be turned off during lecture hours, unless permitted for
class use by the lecturer. If you have any questions during the lecture, do not hesitate to
raise your hand to clear your doubt. Class participation during discussion is encouraged.

Assignments
All assignments must be submitted on or before the scheduled date and time. Penalties will
be imposed for late submissions.

Repeat
Students are only allowed to repeat a course for a maximum of 3 times over the duration of
study, if they fail. Students are advised to retake the course if they obtain any grade below C
in the subsequent semester. A student has to obtain 70% or a min C grade in order to Pass
the course.

Effective Date Revision Page

25 May 2015 1.0 9 of 16
GRADING

Percentage Grade Points per Credit Hour Definition

97% - 100% A+ 4.00
90% - 96% A 4.00 Outstanding
87% - 89% A- 3.70
84% - 86% B+ 3.30
Very Good
80% - 83% B 3.00
77% - 79% B- 2.70 Good
74% - 76% C+ 2.30
Average
70% - 73% C 2.00
67% - 69% C- 1.70
64% - 66% D+ 1.30
Below Average
60% - 63% D 1.00
55% - 59% D- 0.70
0% - 54% F 0.00 Fail
N/A W N/A Withdraw
N/A I N/A Incomplete
N/A P N/A Pass

Effective Date Revision Page

25 May 2015 1.0 10 of 16
 SCHEME OF WORK

Course Schedule (the course instructor reserves the right to modify the work schedule as and when deemed necessary)

Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics
1 Introductory Concept 1, 2, 9 1. sharing detailed information Chapter 1 No Lab-Session
 C program development about the course, including the
environment objectives, course outcomes,
 C vs. C++ examinations, physical
 C vs. Java environment and methodology
 History of C with the students
 Importance of C 2. Lecture and discussion
 C program structure 3. Familiarize with the basic
programming environment in C
Language.

2-3 C Fundamental 1, 2,3, 9 1. Lecture and discussion

 Data types, Constant 2. Writing simple program. Chapter 2
variables 3. Review of decision
 Memory concept: Variable structures: if, if-else, switch.
declaration The loop constructs: while
 C statements repetition statement, nested
 A simple C program control structures, increment
 Arithmetic operators and decrement structures
 Relational and logical
operators, assignment
operators
 Conditional operator
 Math library and functions

Effective Date Revision Page

21 May 2015 1.0 11 of 16
Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics

3-4 Structure Program 1, 2,3, 1. Lecture and discussion Chapter 3 Quiz1 (5%)
Development 4,5,6, 9 2. Writing program with the use
 Selection, repetition control of control structure.
 Nested control structures 3. Discuss the feature of
 Counter-controlled Repetition essentials, counter
repetition controlled repetition, for
repetition statement, switch
multiple selection, do … while
repetition, break and continue,
logical operators.

4-5 Structure Program 1, 2,3, 1. Lecture and discussion Chapter 4 Lab Exercise1 (5%)
Development 4,5,6, 9 2. Writing program with the use
 Sentinel-controlled of control structure to solve real
repetition world problem.
 Break and continue 3. Discuss the feature of
statements Repetition essentials, counter
 Comma operator controlled repetition, for
 Increment and decrement repetition statement, switch
operator multiple selection, do … while
repetition, break and continue,
logical operators.

Effective Date Revision Page

25 May 2015 1.0 12 of 16
Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics
5- 6 Functions and Recursion 1, 2,3, 1. Lecture and discussion Chapter 5
 Function prototypes 4,5,6,7, 9 2. Writing program that include
 Accessing functions Function definition and function Test1 (15%)
 Passing arguments to call to solve real world problem.
functions 3. Discuss the feature of
 Passing arguments to Function.
functions 4. Discuss the various format
 Recursive Functions specifiers available in C
 Scope Rules

6 C Formatted Input/Output 1, 2,3, 1. Lecture and discussion

 Introduction 4,5,6,7, 9 2. Discuss the various format Chapter 9
 Formatting output with specifiers available in C
printf 3. Writing program that include
 Printing integers, Floating Format Specifiers and apply it
points, Strings and to solve real world problem.
Characters

Effective Date Revision Page

25 May 2015 1.0 13 of 16
Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics
7 -8 Arrays

 Defining and 1. Lecture and discussion

processing arrays
 Passing arrays to
functions
 Multidimensional
arrays
 Sorting and searching
2. Demonstrate the declaration Quiz2 5%
and initialization of arrays.
Passing arrays to functions. Chapter6
1, 2,3, 3. Writing program to initialize,
4,5,6,7,8,9 and operation on the array
4. Discuss the C program for
Sorting, Searching Single
Dimensional Arrays and
Multidimensional arrays

9 Pointers 1 Lecture and discussion

 Pointers declarations and
operators
 Pointer expressions and
arithmetic
 Passing pointers to
functions
 Pointers to arrays
2 Demonstrate the declaration
and initialization of pointers LabExercise2 (5%)
1, 2,3, 3 Writing program to
4,5,6,7,8,9 demonstrate the use of pointers, Chapter 7
4. Array-pointer referencing
duality. Strings. Dynamic
memory management.
Functions and pointers;
parameter passing conventions.
Pass-by-value and pass-by-
reference.

Effective Date Revision Page

25 May 2015 1.0 14 of 16
Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics
10 Pointers 1, 2,3, 1 Lecture and discussion Chapter 7
 Operations on Pointers 4,5,6,7,8,9, 2 Demonstrate the declaration
 Pointer vs. Arrays 10 and initialization of pointers
 Arrays of pointers 3 Writing program to
 Pointers to functions demonstrate the use of pointers,
 Pointer to pointers Array-pointer referencing
duality. Strings. Dynamic
memory management.
Functions and pointers;
parameter passing conventions.

11 Searching and sorting

 Linear Search 1, 2,3, 1. Lecture and discussion
 Binary Search 4,5,6, 2. Writing program to
 Selection Sort 7,8,9, 10 implement the Sorting and
 Merge Sort searching arrays. Chapter 7

Effective Date Revision Page

25 May 2015 1.0 15 of 16
Week Topic Learning Teaching & Learning Readings Assessments /Lab TGC
Outcomes Activities Topics

12-13  Data Structures Test2 (20%)

 Dynamic Memory
Allocation Chapter
 Linked lists 1. Lecture and discussion 12
 Stacks 7,8 2. Writing program to
 Queues implement the different data
 trees structures.

14 Revision of all Chapters with 1, 2,3, 1. Lecture and discussion All Project (5%)
Software Engineering 4,5,6,7,8,9, 2. Revision Chapters
approach: 10 3. Final Project Presentation Overall Attendance
Developing C program from all &
constructs learnt Participation(10%)

15 FINAL EXAM (COMPREHENSIVE 30%)

*Please take note that the course instructor reserves the right to modify the lecture schedule if the necessity arises.

Effective Date Revision Page

25 May 2015 1.0 16 of 16