You are on page 1of 9

University of Central Punjab

Faculty of Information Technology

BSCS, BSSE, BSAI, BSDS


PROGRAM (S) TO BE
EVALUATED
A. Course Description
Course Code
Course Title Introduction to Computing (Theory)
Credit Hours 4(3+1)
Prerequisites N/A
Assessment Instruments with Theory
Weights (homework, quizzes,  Class Participation 05%
midterms, final, programming  Quizzes 20%
assignments, lab work, etc.)  Assignments 15%
 Midterm Tests 20%
 Final 40%
Course Instructor
Course Coordinator
Office Hours
Plagiarism Policy All the parties involved in first cheating case will be awarded Zero for that
evaluation. Afterwards, all students involved in the second instance will be
awarded ZERO in the entire evaluation category.
Marks shall be up-loaded on portal and can be contested within a week or
would be considered final.
Course Tools Microsoft Visual Studio
Course Description This first course in Computer Science does not assume any previous
computer knowledge. It is designed to give an overview to computer
systems, desktop publishing tools and structured programming.
Its primary focus is on developing a problem-solving approach in the
students and concentrates on formulation of algorithms and translating them
into structured C++ programs.

Course Objectives Students should achieve the following basic objectives:


 Should be able to have the know-how of computer system.
 Should be able to convert simple problems into algorithms
 Should be able to convert an algorithm into a C++ program
 Should be able to program in C++ to solve simple problems
Textbook D.S. Malik.C++ Programming: From Problem Analysis to Program Design,
Cengage Learning; 8th edition
Reference Material C++ How to Program by Deitel and Deitel, 11th Edition, Prentice Hall
Publications, 2007.

Topics Covered in the Course, with Attached


Number of Lectures on Each Topic
(assume 15-week instruction and one-
hour lectures)

1 NCEAC.FORM.001.C
Programming Assignments Done in Yes (C++ Programs)
the Course
Class Time Spent on (in credit hours) Theory Problem Solution Social and Ethical Issues
Analysis Design
1 1 1 0.0
Oral and Written Communications Yes

CLO CLO Statement Taxonomy PLO


# Level
Understand fundamental problem-solving steps and logic constructs, by C2
1 2
graphical representations for visualizing processes. (Understand)
Solve basic problems using basics of selection statements, loops and C3
2 2
fundamental concepts of programming language (C++). (Apply)
Design and implement real-world problems using selection statements, loops, C3
3 3
and one-dimensional arrays in C++. (Apply)

2 NCEAC.FORM.001.C
Book
Evaluation CLO
Lecture Topics Referenc
Used Covered
e
Introduction of Computer Science

 Introduction: Objectives of the course


 Brief description of major
sub-fields/subjects of Computer Science
with reference to their usage in common
life.

Introduction to Computers

 What is a Computer?
 Applications of Computer

 Types of computer

 RAM
1st CH#1
 Input/Output Devices

 Storage

 CPU

 Introduction to Problem solving

 Algorithms Problem solving

 Flow Charts and Pseudo-codes

 Sequential – Problem Solving using


Flowcharts and Pseudo-codes (e.g., how
to make a tea, adding two numbers,
conversion of length from feet to inch,
convert temperature)

3 NCEAC.FORM.001.C
Hello World Program in C++

 Processing a C++ program/Execution


Flow
 Syntax of C++ (cout << “literal string \
n”)

 Syntax of C++ (cout << Numeric


Constant/Expression )

 Comments/ Importance of Comments

 Syntax Errors

 Syntax vs. Semantics

Arithmetic expression
CH#2
2nd
 Output Numbers (Literal Constants)
(cout << 2 << endl;)
 Arithmetic Operators (+, -, *, /, %)

 Defining Expression/Arithmetic
Expression

 Operator Precedence & Associativity

 Arithmetic Expression evaluation

 Output value of an Arithmetic


Expression (cout << 2*3 << endl;)

Problem Solving using Arithmetic Expression


(literal constants)

4 NCEAC.FORM.001.C
Variable

 Concept/Purpose of variable
 Concept of Type

 Declaration of variable/Syntax,
Semantics

 The rule for a valid identifier

 Initialization of variables

 Accessing values of a variable

 Assignment statement, Syntax/Semantics

 Arithmetic Expression involving


rd variables and/or literal constants Assignment 1
3 CH#2 C1
 Problem-solving using literal
constants, variables

Interactive Program (Taking Input from


Console)

 How to take input from the user.


 Syntax/Semantics of cin (Formatted
Input)

 Concept of white space (space, tab,


newline) and default working of cin

 Problem Solving using cin, variables,


strings
4th Selection Statement CH#4 Quiz 1 C1

 Need/Purpose of Selection
 Selection: if and if...else

 One-Way Selection

 Compound (Block of) Statements

 Comparing if...else Statements with a


Series of if Statements; Short-Circuit
Evaluation

 Solution/Algorithm development
(Pseudo-Code and Flow-Chart)

 Comparing Floating-Point Numbers for


Equality

 Associativity of Relational Operators

 Input Failure and the if Statement

 Confusion between the Equality Operator

5 NCEAC.FORM.001.C
(==) and the Assignment Operator (=)

 switch Structures (Pseudo-Code and


Flow-Chart)
Nested Selection

 Multiple Selections: Nested if


 Need for multi-way selection

 Compound Expression and nested if

 Compound Selection (e.g., Number is


negative, positive or equal to zero;
assigning grades to a student)

 Multiple Selections (e.g., check CH#4


5th whether a student has passed or failed &
and then assign grades to a student) CH#2

Operators

 Pre/Post-Increment
 Pre/Post-Decrement

 Order of Precedence

 Ascii values

 Type Conversion (Casting)


Loop Statement

 Why Is Repetition Needed?


 while Looping (Repetition) Structure

 Designing while Loops

 Case 1: Counter-Controlled while Loops

 Case 2: Sentinel-Controlled while Loops


CH#5 Assignment 2
6th C2
 Solution/Algorithm development
(Pseudo-Code and Flow-Chart)

 Case 3: Flag-Controlled while Loops

 More on Expressions in while Statements

 for Looping (Repetition) Structure

 do...while Looping (Repetition) Structure


7th  Choosing the Right Looping Structure CH#5 Quiz 2 C2

 break and continue Statements

 Solution/Algorithm development
(Pseudo-Code and Flow-Chart and Dry-
Run the loop).

6 NCEAC.FORM.001.C
 Problem Solving Using Loops

8th Revision Week

MID Term
MID Term Review

Nested Loop

 Need/Purpose of Nested Loop


 Both while (…) and for (…) syntax

 Algorithm development involving Nested


for loop

9th  Dry-run technique for nested-loop. CH#5

Nested Loop (shapes printing)

 Setting up Problem for nested loop


 Problem Solving involving nested-loop

 Dry-Run the nested-loop


1D Arrays

 Need for handling large data of the same


type.
 Declaration/initialization of arrays

 Explaining the array type and operations


allowed on array types.

 Accessing individual elements of arrays


th CH#8
10  Problem Solving involving arrays Assignment 3 C3

 Partial Initialization of Arrays During


Declaration

 Traversing an array (in both directions)

 Array Index Out of Bounds

 Dry-Run the program.

7 NCEAC.FORM.001.C
1D Array and condition statement

 Setting up Problem for if statement over


an array
 Problem Solving involving arrays and if
statement

 Dry-Run the program.


CH#8
11th & Quiz 3 C3
1D Arrays, selection and repetition (Search) CH#18
 Linear search
 Binary search
 Setting up a Problem for searching

 Dry-Run the program.

1D Array and Nested loop (Bubble sort)

 Setting up a Problem for sorting


 Dry-Run the nested-loop

1D Array and Nested loop


CH#8
12th  Setting up Problem for nested loop over &
an array CH#18
 Problem Solving involving arrays and
nested-loop

 Dry-Run the program.

13th 1D Array and Nested loop CH#8 Assignment 4 C3

 Setting up Problem for nested loop over


an array
 Problem Solving involving nested-loop
with/without arrays

 Dry-Run the nested-loop

Character Array (C-String) and Loops

 The need for handling non-numeric data


 Character Type and its conversion to
integer

 A character I/O

 Problem-solving involving characters,


Selection, and Loops (single and nested-
loops)

8 NCEAC.FORM.001.C
1D Character Arrays (C-String)

 The need for handling names


 Initializing Character Arrays (two
methods)

 Emphasizing null-terminator and it's an


implication

 Problem-solving involving characters


and loops (single and nested-loops)
14th CH#8 Quiz 4 C3
 Dry-Run the program.

1D Array Problem Solving

 Array-based Problem involving


Selection, Loops/Nested Loops and
involving both numeric and non-numeric
data
 Dry-Run the program.

1D Array Problem Solving

 Array-based Problem involving


Selection, Loops/Nested Loops involving
both numeric and non-numeric data
 Dry-Run the program.

1D Array Problem Solving


15th

 Array-based Problem involving


Selection, Loops/Nested Loops and
involving both numeric and non-numeric
data
 Dry-Run the program.

16th  Revision

9 NCEAC.FORM.001.C

You might also like