Course Code CSCS1514

Course Title Introduction to Computing

Credit Hours 4 (3 + 1)
Prerequisites by N/A
Course(s) and Topics
Assessment Theory:
Instruments with  Assignments 20% (Min. count - 6)
Weights (homework,  Quizzes 15% (Min. count - 6)
quizzes, midterms,
final, programming  Midterm 20%
assignments, lab work,  Final 40%
etc.)  CP 05%
Lab:
 Labs 20% (Min. count - 6)
 Project 15%
 Midterm 20%
 Final 40%
 CP 05%
Semester Fall 2020
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 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.
Grading
Textbook (or  D.S. Malik.C++ Programming: From Problem Analysis to
Laboratory Manual Program Design, Cengage Learning; 8th edition
for Laboratory
Courses)
Reference Material  C++ How to Program by Deitel and Deitel, 11 th Edition, Prentice
Hall Publications, 2007.
Course Goals 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

Evaluation
Lecture Topics
Topic from the Book Used

Introduction of Computer Science

1st
 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 MS Word

 What is MS Word used for?

 Tabs of Word.
 Home Tab.
o Font size.
o Bold ,Italic, Underline
o Left line, Center line, right line
 Insert Tab.
o Tables
o Pictures
o Equations

 Introduction to Problem solving https://

www.edrawsoft.com/
 Algorithms Problem solving
en/explain-algorithm-
 Flow Charts and Pseudo-codes flowchart.html
2nd  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)
Hello World Program in C++

 Processing a C++ program/Execution Flow

 Syntax of C++ (cout << “literal string \n”) DS Malik,
3rd
 Syntax of C++ (cout << Numeric Constant/Expression ) Page 37 to 43
 Comments/ Importance of Comments Page 143 to 151
 Syntax Errors
 Syntax vs. Semantics

Arithmetic expression

 Output Numbers (Literal Constants) (cout << 2 <<

endl;)
 Arithmetic Operators (+, -, *, /, %)
 Defining Expression/Arithmetic Expression DS Malik,
4th
 Operator Precedence & Associativity Page 43 to 50
 Arithmetic Expression evaluation
 Output value of an Arithmetic Expression (cout << 2*3
<< endl;)
 Problem Solving using Arithmetic Expression
(literal constants
5rd Variable DS Malik,

Page 57 to 62
 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 variables and/or literal
constants
 Problem-solving using literal constants, variables
 Interactive Program (Taking Input from Console)

 How to take input from the user. DS Malik,

 Syntax/Semantics of cin (Formatted Input)
6 th
Page 124 to 132 Assignment 1
 Concept of white space (space, tab, newline) and
Page 143 to 151
default working of cin
 Problem Solving using cin, variables, strings

Selection Statement

 Need/Purpose of Selection
 Selection: if and if...else DS Malik,

7th
 One-Way Selection Page 183 to 193
 Compound (Block of) Statements Page 143 to 151
 Comparing if...else Statements with a Series of if Page 211 to 214
Statements; Short-Circuit Evaluation
 Solution/Algorithm development (Pseudo-Code and
Flow-Chart)
 Comparing Floating-Point Numbers for Equality
 Associativity of Relational Operators DS Malik,
 Input Failure and the if Statement Quiz 1
8 th
Page 221 to 223 Graded Lab 1
 Confusion between the Equality Operator (==) and the
Assignment Operator (=)
 switch Structures (Pseudo-Code and Flow-Chart)
Nested Selection

 Multiple Selections: Nested if

 Need for multi-way selection
DS Malik,
 Compound Expression and nested if
9 th
 Compound Selection (e.g., Number is negative, positive Page 194 to 198 Assignment 2
or equal to zero; assigning grades to a student) Page 199 to 204
 Multiple Selections (e.g., check whether a student has
passed or failed and then assign grades to a student)
 Solution/Algorithm development (Pseudo-Code and
Flow-Chart)
Operators

 Pre/Post-Increment DS Malik,
10 th
 Pre/Post-Decrement Page 50 to 55
 Order of Precedence Page 69 to 71
 Ascii values
 Type Conversion (Casting)
11th Loop Statement DS Malik, Quiz 2
Graded Lab2
Page 266 to 282
 Why Is Repetition Needed?
 while Looping (Repetition) Structure
 Designing while Loops
 Case 1: Counter-Controlled while Loops
 Case 2: Sentinel-Controlled while Loops
 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 DS Malik,
12th
 Choosing the Right Looping Structure Page 283 to 286 Assignment 3
 break and continue Statements Page 297 to 314
 Solution/Algorithm development (Pseudo-Code and
Flow-Chart and Dry-Run the loop).
 Dry-Run the loop.
Nested Loop

 Need/Purpose of Nested Loop DS Malik, Quiz 3

13th  Both while (…) and for (…) syntax
Page 315 to 320 Graded Lab 3
 Algorithm development involving Nested for loop
 Dry-run technique for nested-loop.

Nested Loop (shapes printing)

14th  Setting up Problem for nested loop

 Problem Solving involving nested-loop
 Dry-Run the nested-loop
DS Malik,
15th  Revision
Page 315 to 320
16th
 Revision

 MIDTERM

17th
 MIDTERM (Review)

1D Arrays

 Need for handling large data of the same type.

 Declaration/initialization of arrays
19th  Explaining the array type and operations allowed on
array types.
 Accessing individual elements of arrays
 Problem Solving involving arrays

 Partial Initialization of Arrays During Declaration

 Traversing an array (in both directions)
20th  Array Index Out of Bounds Assignment 4
 Dry-Run the program.

1D Array and condition statement

DS Malik,
21st  Setting up Problem for if statement over an array
 Problem Solving involving arrays and if statement Page 522 to 530
 Dry-Run the program.

22nd 1D Arrays, selection and repetition (Search) Quiz 4

Graded Lab 4
 Linear search
  Binary search
 Setting up a Problem for searching
 Dry-Run the program.
1D Array and Nested loop

 Setting up Problem for nested loop over an array DS Malik,

23rd
 Problem Solving involving arrays and nested-loop Page 531 to 534
 Dry-Run the program.

1D Array and Nested loop

 Setting up Problem for nested loop over an array DS Malik,

24th  Problem Solving involving nested-loop with/without Assignment 5
arrays Page 544 to 547
 Dry-Run the nested-loop

1D Array and Nested loop (Bubble sort)

Quiz 5
25th  Setting up a Problem for sorting Graded Lab 5
 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
26th  A character I/O Project
 Problem-solving involving characters, Selection, and
Loops (single and nested-loops)

1D Character Arrays (C-String)

 The need for handling names

 Initializing Character Arrays (two methods) DS Malik,
27th  Emphasizing null-terminator and it's an implication Assignment 6
Page 547 to 551
 Problem-solving involving characters and loops (single
and nested-loops)
 Dry-Run the program.

1D Array Problem Solving

 Array-based Problem involving Selection,

Quiz 6
28th
Loops/Nested Loops and involving both numeric and Graded Lab 6
non-numeric data
 Dry-Run the program.

1D Array Problem Solving

 Array-based Problem involving Selection, DS Malik,

29th Loops/Nested Loops involving both numeric and non-
numeric data Page 552 to 559
 Dry-Run the program.

30th 1D Array Problem Solving

 Array-based Problem involving Selection,

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

31th  Revision
32th  Revision