NATIONAL UNIVERSITY
of Computer & Emerging Sciences, Lahore
Department of Computer Science
CS118 – Programming Fundamentals
FALL 2020
Instructor Name: Shakeel Zafar TA Name:
Email address: Shakeel.zafar@nu.edu.pk Email address:
Office Location/Number: M109-In front of Lab -04
Office Hours: M/Tue/W, 9:00 – 11:00AM
Course Information
Program: BS (CS) Credit Hours: 3 + 1 (Lab) Course Type: Core
Class Meeting Time: Section H: Thu- Sat 8:00 – 9:30 AM
Class Venue: E&M-9
Course Description/Objectives/Goals:
To introduce the notion of algorithms.
To develop problem solving and logic building skills in students.
To introduce the basic concepts of programming in C++, including basic data types, expressions,
iterations, functions and arrays.
Course Learning Outcomes (CLOs):
At the end of the course students will be able to: Domain BT* Level
Understand basic problem solving steps and logic constructs C 2
Apply basic programming concepts C 3
Design and implement algorithms to solve real world C 3
problems and should be able to translate a problem
statement into pseudo-code/C++ code
* BT= Bloom’s Taxonomy, C=Cognitive domain, P=Psychomotor domain, A= Affective domain
Bloom's taxonomy Levels: 1. Knowledge, 2. Comprehension, 3. Application, 4. Analysis, 5. Synthesis, 6. Evaluation
Course Textbook
1. C++ Programming: Program Design Including Data Structures, by D. S. Malik (8th Edition)
2. C++: How to Program? by Deitle & Deitle (9th Edition)
Additional references and books related to the course:
1. Theory and Problems of Programming with C++ by John R. Hubbard, 2nd Edition
2. Programming and Problem Solving with C++, Nell Dale
3. www.learncpp.com
Tentative Weekly Schedule
Week 1 Lecture 1 Lecture 2
Problem Solving and Programming Introduction to Computing, Thinking logically, Solving logical
Introduction Basic Computer architecture, problems.
Computational Problems, Programming Language, Program
Algorithms and Problem Solving Compiler and Linker, Basic output,
Concept of variables.
Week 2 Lecture 1 Lecture 2
Simple C++ Programs C++ simple datatypes (int, float, C++ Operators (Arithmetic, Logical,
double, char, bool), variables and Relational)
declaration, assignment operator, Use of operators for different
input, output. datatypes.
Week 3 Lecture 1 Lecture 2
Simple C++ Programs Precedence of Operators. Logical decision making and solving
Designing complex expressions for logical problems with selection
mathematical type conversion structure.
problems. Typecasting in C++.
Week 4 Lecture 1 Lecture 2
Simple C++ Programs If/Else Programs with if/else statements Programs with nested if/else
statements
MID 1
Week 6 Lecture 1 Lecture 2
Loops Repetitions using while loops Problems on while loops
Week 7 Lecture 1 Lecture 2
Nested Loops Repetitions using while and for Problems on nested loops
loops
Week 7 Lecture 1 Lecture 1
Nested Loops and If/Else Repetitions with selection structure Nested loops with selection structure
Week 8 Lecture 1 Lecture 2
Functions Function definition and Calling: Types of parameters (value and
Parameters and return types; reference) stack rolling and unrolling.
Week 9 Lecture 1 Lecture 2
Functions Reading and Writing from text files How to define and use fixed sized
& File I/O Collections of data arrays. Arrays, if/else and loops
Week 10 Lecture 1 Lecture 2
CStrings Linear and Binary Search, Array Character arrays and CStrings
Reversal, Detecting Palindromes
MID 2
Week 11 Lecture 1 Lecture 2
Arrays, functions Character arrays and CStrings Functions with 1D array parameters
Week 12 Lecture 1 Lecture 2
Functions with nested loops Bubble Sort & Selection Sort Substring Finding
Week 13 Lecture 1 Lecture 2
Multidimensional arrays How multidimensional arrays are Programs with multidimensional
stored and used arrays, e.g. matrix addition and
multiplication
Week 14 Lecture 1 Lecture 2
Char Arrays with functions 2D char arrays Bitwise Operators
(Tentative) Grading Criteria:
1. Assignments + Homework (10 %)
2. Quizzes (10 %)
3. Midterms (25 %)
4. Project (10 %)
5. Final Exam (45 %)
o Grading scheme for this course is Absolute under application of CS department's grading
policies.
o Minimum requirement to pass this course is to obtain at least 50% absolute marks
Course Policies:
o Quizzes may be announced or surprise.
o No Makeup Quizzes.
o All assignments and homework must be done individually.
o Late Submissions of assignments will not be accepted.
o Plagiarism in any work (Quiz, Assignment, Midterms, Project and Final Exam) from any
source, Internet or a Student will result in deduction of absolute marks or F grade.
o Minimum 80% attendance is required for appearing in the Final exams.
