Programming Fundamentals

Fall 2019

Instructor Dr. Mumraiz Kasi

Room No. 19 New Academic Block, FICT
Office Hours 11.30am – 02:00 pm
Email [email protected]
Website http://www.mumraizkasi.com

Course Basics

Credit Hours 3+1

Lectures No. of Lectures per week 02 Duration 180 minutes

Labs No. of Lab sessions per week 01 Duration 180 minutes

Course Distribution

Course Code CS-114

Department Computer Science
Semester 1st

Core / Elective Core

Prerequisite(s) None

Course Learning Outcomes (CLOs):

At the end of the course the students will be able to: Domain BT
Level*
1. Understand basic problem-solving steps and logic C 2
constructs
2. Apply basic programing concepts C 3
3. Apply selection and repetition control structures C 3
4. Design and implement algorithms to solve real world C 3
problems.

* BT= Bloom’s Taxonomy, C=Cognitive domain, P=Psychomotor domain, A=

Affective domain
Course Outline:
Introduction to problem solving, Introduction to programming, role of compiler and linker, introduction to
algorithms, basic data types and variables, input/output constructs, arithmetic, comparison and logical operators,
conditional statements and execution flow for conditional statements, repetitive statements and execution flow for
repetitive statements, lists and their memory organization, multi-dimensional lists, introduction to modular
programming, function definition and calling, string and string operations
Grading Breakup and Policy

Grading Breakup ● Mid exam 25%

● Assignments (3) 15%
● Quizzes (2) 10%
● Final exam 50%
Contests and grading revisions After the grades are reported, you can contest within
following timelines:

Homework, Quizzes, Programming: 2 days

Midterm and Final: 3 days

Examination Detail

Midterm Exam Duration: 60 minutes

Tentative Date:
Final Exam Duration: 180 minutes
Tentative Date:

Textbooks
REQUIRED TEXTS:

An introduction to Programming with C++ by Diane Zak

(edition: 8th)

Reference Books:
1. C How to Program, Paul Deitel and Harvey Deitel, Prentice Hall.
2. Programming in C, Stephen G. Kochan, Addison-Wesley Professional.
3. Java How to Program, Paul Deitel and Harvey Deitel, Prentice Hall.
4. C++ How to Programme, Paul Deitel and Harvey Deitel, Prentice Hall.
 Programming Fundamentals
Weekly Teaching Plan
Week Date Lec Topic Readings Labs
1 1-2  Introduction to Chapter 1
programming, why needed?
 terminology used in
programming
 Tasks performed by a
programmer
 Explain the history of
 Write simple algorithms
using the sequence,
selection, and repetition
structures

2 3-4  Explain the problem-solving Chapter 2

process
 Analyze a problem
 Complete an IPO chart
 pseudocode and flowcharts
 Desk-check an algorithm

3 5-6  Variable, a named constant, Chapter 3

and a literal constant
 How data is stored in
memory
Assignment # 1
 Variable name, data type,
announced
and initial value for a
memory location
 Declare a memory location
in C++

4 7-8  Input/output operations Chapter 4

 Display information on the
computer screen
 Arithmetic expressions
 Type cast a value
 Assignment statement
 Desk-check a program

5 9-10  Selection structure in Chapter 5

pseudocode and in a
flowchart
 Code a selection structure
using the if statement
 Include comparison
operators in a selection
structure’s condition
  Include logical operators in
a selection structure’s
condition

6 11-12  Nested selection structure in Chapter 6

pseudocode and in a
flowchart
 Code a nested selection
Quiz # 1
structure
 Include a multiple-
alternative selection
structure in pseudocode and
in a flowchart
 Code a multiple-alternative
selection structure in C++

7 13-14  Differentiate between a Chapter 7

pretest loop and a posttest
loop
 Include a pretest loop in Assignment # 2
announced
pseudocode
 Include a pretest loop in a
flowchart
 Code a pretest loop using
the C++ while statement
 Utilize counter and
accumulator variables
 Code a pretest loop using
the C++ for statement

8 15-16  Include a posttest loop in Chapter 8

pseudocode
 Include a posttest loop in a
flowchart
 Code a posttest loop using
the C++ do while statement
 Nest repetition structures

Mid Term Examination

9 17-18  Value returning Chapter 9

Functions
 Built in functions: power
using the pow function
 sqrt function


10 19-20  Create and invoke a Chapter 9

function that returns a
value
  Pass information by
value to a function
 Understand a variable’s
scope and lifetime
 Write a function
prototype

11 21-22  Create a void function Chapter 10

 Invoke a void function

Quiz # 2
12 23-24  Pass information by Chapter 10
reference to a function

13 25-26  Declare and initialize a Chapter 11

one-dimensional array •
 Enter data into a one-
dimensional array • Assignment # 3
Announced
 Display the contents of a
one-dimensional array •
 Pass a one-dimensional
array to a function •
 Calculate the total and
average of the values in a
one dimensional array

14 27-28  Using Array and Chapter 11

Repetitions structures to
populate and access array
items

15 29-30  String datatype Chapter 13

16 31-32  String datatype Chapter 13

Final Exam
 Programming Fundamentals
Fall 2019

Dr. Mumraiz Kasi

Course Contents, Weekly Lecture Slides, Assignments and Lab Handouts all available online on Moodle

Moodle: http://mumraizkasi.com/education/course/view.php?id=15
Guest Account Password: pf2019