Course Syllabi

Course Title and Code CS 181 Computer Programming (II)

Semester Fall 2023

 Course Identification and General Information:

Department Computer Science Course Level 3

One theory class per week of 100 minutes each

Contact Hours Credit Hours 3
One Laboratory class per week of 100 minutes each

Web Address http://lms.qu.edu.sa

Class Location: CoC-102cs

 Course Instructor/Coordinator’s Name: Dr. Khalil Al-Shqeerat ([email protected]). Office

Hours: By appointments.

 Textbook Title, Author, and Year:

 C How to Program, 8/E edition, Deitel & Deitel. 2016

 Other Supplemental Materials:

 An Introduction to Programming in C, 4/E Guha, 2004.
 Problem Solving with C, Jones and Harrow’s, 2004.

 Specific Course Information:

o Catalog Description: Problem-solving, algorithmic design, Introduction to Programming,
Structured Program Development, Program Control, Functions, Arrays, Pointers, Structures, File
Processing, Assignments in algorithm design and translation of algorithms in high level language
like C language.
o Pre-requisites: CS111.
o Co-Requisites: None.
o Required, Elective, or Selected Elective: Required.

 Course Learning Outcomes: Summary of the main learning outcomes for enrolled students.
o Students will demonstrate an understanding of the history of computers and how computers using
programming languages to operate.
o Students will demonstrate through various programs the basic elements in C programming.
o Students will demonstrate effective decision making in programs.
o Students will use Looping in building programs.
o Students will declare, initialize, and use variable arrays in building programs.

Page 1 of 6
Students will use pointer variable declarations and initialization the relationship between pointers and
arrays. Students will use structure definitions, initializing structures, accessing members of structures and
using structures with functions

 ABET Student Outcomes Addressed by the Course:

This course provides the following outcomes with the following relationship:

Information Technology Student Outcomes Evaluation Status

1. Analyze a complex computing problem and to apply principles of computing and

H
other relevant disciplines to identify solutions.

2. Design, implement, and evaluate a computing-based solution to meet a given set of

computing requirements in the context of the program’s discipline.

3. Communicate effectively in a variety of professional contexts.

4. Recognize professional responsibilities and make informed judgments in computing

practice based on legal and ethical principles.

5. 5. Function effectively as a member or leader of a team engaged in activities

appropriate to the program’s discipline.

6. Identify and analyze user needs and to take them into account in the selection,
M
creation, integration, evaluation, and administration of computing-based systems.

Page 2 of 6
 Outcome Assessment:
1. Direct Assessment
☒ Midterm Written Exam
☒ Final Written Exam
☒ Projects
☒ Homework and Assignments

2. Indirect Assessment
☒ Post-Course Questionnaire

 Course Outline:
General Topic Weeks Contact Hours
 Introduction to C Programming and Structured Program 1+2 4
 C Program Control 3 2
 Functions 4+5 4
 Arrays 6+7 4
 Midterm Exam 8 2
 Pointers 9+10 4
 Character and strings 11 2
 Format input-output 12 2
 C Structures, Unions, Bit Manipulations, and Enumerations 13+14 4
 Files Processing 15 2
 Total contact hours 15 30

 Lab activities 30

Page 3 of 6
 Course Schedule:
Topics and/or Target Representative Assessments
Weeks Reference
Activities CLO(s) Questions
Introduction to C Chapter 2 How to write simple HW1
Programming and and computer programs in
Structured Program Chapter 3 C by using simple input
and output statements,
data types and
arithmetic operators?
1+2
How to develop
algorithms through the
process of top-down
and stepwise
refinement? How to use
the selection and
repetition statements in
C program?
C Program Control Chapters 4 What are the essentials HW2
of counter controlled
repetition? What are
the different types of
3
selection and repetition
statement? How to use
logical operators to
write a C program?

Functions Chapter 5 How to use math

functions to do
mathematical
operations in C? How to
write a user defined
4
function and learn how
the function call/
return mechanism is
supported by the
function.
Function (More Chapter 5 How to use math HW3
functions to do
example)
mathematical
operations in C? How to
write a user defined
5
function and learn how
the function call/
return mechanism is
supported by the
function.
Arrays Chapter 6 How to use the array
6
data structure to
represent lists and
tables of values?

Page 4 of 6
 Arrays (More Chapter 6 How to use the array Mid Exam
data structure to
7+8 example)
represent lists and
tables of values?
Pointers Chapter 7 What are the pointers Midterm Exam
and pointer operators?
9 How to use pointers to
pass arguments to
functions by reference?
Pointers(More Chapter 7 What are the pointers Lab(Homework)
and pointer operators?
example)
10 How to use pointers to
pass arguments to
functions by reference?
Character and Chapter 8 How to use the
standard library
strings
11 functions to deal with
character and strings in
C?
Format input- Chapter 9 How to use output and Lab(Homework
12
output input formatting.

C Structures, Chapter 10 How to create and use

structures, unions and
Unions, Bit
enumerations? How to
13+14 Manipulations, and pass structures to
Enumerations functions by value and
by reference?
Files Processing Chapter 11 Understand the Lab Project
concepts of files and
streams and how to
create and read data
15
using sequential-access
file processing and
using random-access
file processing?

16 Final Exam Week Final Exam

 Grading Policy:
Mark Distribution: Grading Scale:
Mid Terms Exams – 20% A+ (95% or more)
Quizzes & HWs– 20% A (90% - 94%)
Project – 10% B+ (85% - 89%)
Final Exam – 50% B (80% - 84%)
C+ (75% - 79%)
C (70% - 74%)
D+ (65% - 69%)
D (60% - 64%)
F (less than 60%)

Page 5 of 6
Assessment Descriptions: The students will be given two written midterm exams (each having 12.5% of total marks.
Students in groups (2/3 members/group) will be given some recent topics in security to research on and then
present their research project in class (15% of the total grade). Some home-work assignments will cover the core
concepts of the course (10% of the grade). Final exam (50% of the total grade) will be a written exam.

Attendance Policy: The policy for missing classes is same as the policy followed in QU. Excuses must be submitted within
one week of missing the class. Later arrival in the quiz or exam will not be excused.
Ethical Responsibilities: All assignments and programming exercises must be done by the student himself. A student
can discuss/consult or refer to any other person or resources, however, the final work must be his own and not
copied as is from others. Any copied assignment will receive a zero grade.

Late Submission Policy: Any assignments submitted late will lose 25% of the assigned grades for each day of delay.

Policy for Missed Exam: Mid-term/final exam may be retaken for students having valid medical excuses.

Page 6 of 6