CSCP1013 Introduction To Computing Theory
CSCP1013 Introduction To Computing Theory
BS-CS
PROGRAM (S) TO BE
EVALUATED
A. Course Description
Course Code CSCP1013
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 15%
assignments, lab work, etc.) Assignments 20%
Midterm Tests 20%
Final 40%
Course Instructor Ammar Haider
Course Coordinator Imran Arshad
Office Hours Monday (11:00 AM - 12:20 PM), Wednesday (11:00 AM - 12:20 PM) &
Friday (11:00 AM - 2:00 PM)
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.
1 NCEAC.FORM.001.C
hour lectures)
2 NCEAC.FORM.001.C
Book
Evaluation Relation
Lecture Topics Referenc
Used to CLO
e
Introduction of Computer Science
Introduction to Computers
What is a Computer?
Applications of Computer
Types of computer
RAM
1st CH#1 CLO_1
Input/Output Devices
Storage
CPU
3 NCEAC.FORM.001.C
Hello World Program in C++
Syntax Errors
Arithmetic expression
CH#2 CLO_1,
2nd
Output Numbers (Literal Constants) CLO_2
(cout << 2 << endl;)
Arithmetic Operators (+, -, *, /, %)
Defining Expression/Arithmetic
Expression
4 NCEAC.FORM.001.C
Variable
Concept/Purpose of variable
Concept of Type
Declaration of variable/Syntax,
Semantics
Initialization of variables
One-Way Selection
Solution/Algorithm development
(Pseudo-Code and Flow-Chart)
5 NCEAC.FORM.001.C
(==) and the Assignment Operator (=)
Operators
Pre/Post-Increment
Pre/Post-Decrement
Order of Precedence
Ascii values
Solution/Algorithm development
(Pseudo-Code and Flow-Chart and Dry-
Run the loop).
6 NCEAC.FORM.001.C
Problem Solving Using Loops
CLO_1,
CLO_2,
MID Term CLO_3
MID Term Review
Nested Loop
7 NCEAC.FORM.001.C
1D Array and condition statement
Linear search
Binary search
Setting up a Problem for searching
A character I/O
8 NCEAC.FORM.001.C
1D Character Arrays (C-String)
Revision CLO_2,
16th
CLO_3
9 NCEAC.FORM.001.C