PF Outline
PF Outline
NCEAC
NCEAC.FORM.001-D
Course Description
Course Code CS-111
Course Title Programming Fundamentals
Credit Hours 3+1
Course Shakeel Ahmad
Instructors
Grading Absolute Grading
Policy
Policy about Retake of missed assessment items (other than midterm/ final exam) will not be held.
missed For a missed midterm/ final exam, an exam retake/ pre-take application and necessary
assessment evidence must be submitted to the department secretary The examination assessment
items in the and retake committee decides the exam retake/ pre-take cases.
course
Course Plagiarism in project or midterm/ final exam may result in an F grade in the course.
Plagiarism Plagiarism in an assignment will result in zero marks in the whole assignments category.
Policy
Prerequisite N/A
s by
Course(s) or
Topics
1 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
2 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
Course
Goals
A. Course Learning Outcomes (CLOs)
3 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
PLOs
1 2 3 4 5 6 7 8 9 10 11 12
1
CLOs 2
3
4 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
No. of
List of Topics Contact Hours
Topics Covered in Weeks
the Course - Problem-solving, Basic flowchart, block
diagram, and programming languages.
(Assume 15-week
- Primitive data types, input/output (hello
instruction and 3 1 3
world).
contact hours per
week) - Signed and unsigned data types,
constants, and variables.
- Arithmetic operators (+, -, *, /, % and
their compound counterparts) with their
2 6
associativity and precedence.
- Bitwise operators
- Conditional/selection structures.
- Comparison and logical operators.
- if, if. . .else and if else if structure. 2 6
- Switch statement, break statement.
- Ternary operator.
- Repetition structures.
- Pre/post increment/decrement
operators.
- while loop (sentinels + condition).
3 9
- Loop with for.
- Loop with do-while.
- Nesting of while, for loop, and continue
statement.
- Function prototypes, definition, and
1 3
calling.
- Introduction to Arrays.
- Array initialization and representation. 1.33 4
- Char arrays.
Midterm
- Multi-Dimensional Arrays (MDA).
MDA representation in memory.
- parameters passing by value and by 1.66 5
reference (passing arrays).
- Function calling order
- Pointers.
- const. vs. non-const. pointers, a pointer
to const. data vs. a pointer to non-
constant data. 2 6
- Using pointers.
- Dynamic memory allocation.
- Array of pointers.
- Header files (creating own file).
- Files handling 1 3
- Opening flags (app mode).
Total 15 45
Laboratory Yes, there are lab tasks with every lab of three hours.
Projects/Experiments
Done in the Course
5 NCEAC.FORM. 001.D
National Computing Education Accreditation Council
NCEAC
NCEAC.FORM.001-D
6 NCEAC.FORM. 001.D