The Superior University, Lahore

Faculty of Computer Science & Information Technology

Course Outline
Course Course Title Programming Fundamentals
Information Course ID Course Type Computing Core
Credit hours 3+1 Hours per week (C- 3-1
L)
Programs ADP Computer Science Preferred Semester
Date Version
Instructor Mr. Adnan Qaisar TA / Lab Engineer
Course This course offers an elementary grasp of the fundamentals of computer programming techniques and
Description problem solving techniques. Apart from general computing concepts it focuses on developing a problem
solving approach in the students and concentrates on formulation of algorithms and translating them into
structured C++ programs. It includes the following major topics
- Introduction to C++
- Data types and declaring and using variables
- Decision Control
- Repetitive Structures
- Functions, Call by Value, Call by reference, Recursion
- Arrays – Single and multi-dimensional arrays
- Passing arrays as an argument to the function.

The objective of this course is to enable students;

No. Objective Relation with
Program
Objectives
Course
1. To design algorithms to solve simple problem using tools like pseudo code, PO1, PO2
Objectives
flow charts, and desk checking
2. To implement algorithmic logic in programming language PO2
3. To correct, test and debug computer programs PO2
4. To explain how algorithms and computer programs work PO2
5. To demonstrate the basic structured programming in a team-oriented PO4, PO6
environment by conducting a term project
At the end of this course students will be able to;
No. Outcome BT Relation with
Level PLO
1. Apply basic programming principles in C++ programming language, C3 PLO1, PLO2,
Course construct C++ programming structure using programming PLO3
Learning fundamentals and principles.
Outcomes 2. Create programming designs which include step-by-step algorithms P7 PLO2, PLO3,
(CLO) and desk checking to validate problem solutions. PLO5
3. Demonstrate an understanding of structured design by implementing P4 PLO3,5,8
programs with functions and passing of parameters to solve more
complex problems and to promote the concept of efficient use of code.
Design and implement programs using arrays and string objects.
Lecture type Classroom Lectures, Lab Sessions, Project Presentation
Prerequisites NIL
Follow up Object Oriented Programming
Courses

Course Borland C++ V 5.0

Software
or Tool
Textbook Title Edition Authors Publisher Year ISBN
Object Oriented Programming in C++ 4th Robert The 0672323087
Lafore Waite’s
Group

Page 1 of 3
References C++ How To Program 10th Paul J. Pearson 0134448235
Deitel,
Harvey
Deitel

Assessment Assessment Weight Used to attain CLO Assessment Weight Used to attain CLO
Criteria Assignment 10% CLO-1,2 Quiz 10% CLO-1,2,3
(100%) Lab 10% CLO-1,2,3 Project / Presentation 10% CLO-1,2,3
Attendance 0% Participation 0%
Mid Term 20% CLO-1,2 Final 40% CLO-1,2,3
Methods of Assignments, Quizzes, Project, Midterm paper, final term paper
Evaluation
Notes -

Wee Topic Lectur Lecture Contents Relation with

k No. e No. CLO
W1. Introduction to C+ L1. − History of C++ Language, Translators, CLO1
+ − Basic program structure, Directives, Comments, Output
L2. using “cout”, Escape sequences, setw manipulator
W2. Introduction to C+ L3. − Declaration of a variable, memory concepts, integer CLO1
+ variable, floating point variables, initialization of variables.
Taking input from the user using cin.
− Arithmetic operators (+, - , * and /)
L4. − Algorithms, Pseudocode, Flow Charts. CLO3
W3. Introduction to C+ L5. − Modulus operator CLO1, CLO2
+ − Precedence of evaluation
− increment and decrement operator.
L6. − if statement, CLO2, CLO3
− if-else statement.
Decision Making
W4. Decision Making L7. − Relational Operators CLO2, CLO3
− Logical operators
L8. − Declaring character variables, initializing character
variables, taking input from the user
− Switch Statement
W5. Repetitive control L9. − Repetitive control structure CLO2, CLO3
statements L10. − Counter control loops
− For Loop
W6. Repetitive control L11. − Sentinel Control loops CLO2, CLO3
statements − While loop
L12.

W7. Repetitive control L13. − Do-While Loop CLO2, CLO3

statements
L14. − Revision of course

W8. Midterm Exam L15.

Week
− Mid Term Examination
L16.

W9. Functions L17. − Introduction CLO2, CLO3

− Built-in functions
L18. − User defined functions

W10. Functions L19. − Function Call by value CLO2, CLO3

− Function Call by reference
L20.
W11. Recursion L21. − Introduction CLO2, CLO3
− Recursive Function Call
L22.

W12. Pointers L23. − Pointers declaration CLO2, CLO3

− Reference of/Address of operator
L24. − Dynamic memory allocation/deal location

W13. Arrays L25. − Introduction CLO2, CLO3

− Single Dimensional Arrays
L26. − Using arrays as a character string
− String library functions
− Multiple Dimensional Arrays
W14. Arrays L27. CLO2, CLO3
− Passing as an argument to the function
L28. − Searching/Sorting arrays

W15. Files Handling L29. − Creating text files CLO2, CLO3

− Reading and writing on files
L30. CLO3

W16. Final exam L31. CLO2, CLO3

− Project Presentations/Viva
L32. CLO3