Scribd
Upload
12 views3 pages

ICT-Course Outline For Fall 2023

Uploaded by

f2023-269
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views3 pages

ICT-Course Outline For Fall 2023

Uploaded by

f2023-269
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Intro to Info & Comm Technologies (CSC-107) Instructor: Syed Nouman Ali Shah

Credit Hrs.: 4 (Lec 3, Lab 1) Semester: Fall 2023


Pre-requisite: Nil
Contact Hrs.: Sec C: Mon & Wed (2:00 – 3:30)

Course Objective:
This course provides students with an overview of computer technology. The topics include
hardware, software, internal working of computers, number systems and concepts of Algorithms
and Flowcharts. Students will become familiar with problem solving techniques and algorithm
development using tools like flowcharting and pseudo coding. Topics Include: Computer and its
components, Data Representation in Computers, Binary, Octal, Hexadecimal and decimal number
system, The programming Process, Introduction to Software development tools (Flowcharts), Data
definition. Data names and types, Data usage, Control Structures, Nested-if statements, Iteration
control structures Pseudo code: sequence, selection and iteration structures, Arrays and Functions.

Learning Outcomes:
1. Design an algorithmic solution to solve a problem
2. Create variables of appropriate types to store program data
3. Formulate program instructions to perform computations
4. Design and use selection structures in a program
5. Design and use repetition structures in a program
6. Create arrays to store large volume of data
7. Compose functions and integrate them in a program

Text Books:

A. Prelude to Programming Concepts and Design 5th Edition Stewart Venit and Elizabeth Drake
Reference Book:
B. A beginners Guide to Programming Logic and Design 7th edition Joyce Farell
Handouts

Course Outline and Schedule


Week Topics Text Book Tests
Mon Assignments

Wk-1 Introduction to Computers


11-Sep  brief history of Computers
 Computer Basics
 Types of Software’s A
Types of Programming Languages
Wk-2 Data Representation
18-Sep  Decimal and Binary Number Systems
 Converting decimal to binary A
 Converting binary to decimal
Wk-3 Data Representation Assign 1
25-Sep  Hexadecimal number systems
 Converting decimal to Hex
 Converting Hex to Decimal A
 Converting Binary to Hex
Wk-4 Data Representation Class Test 1
02-Oct  Integer Representation
 Unsigned Integer Format
 Sign Magnitude Format
 Ones complement
 Twos complement
Addition and Subtraction of Integers using Twos A
Complement
Wk-5 Introduction to Programming
09-Oct  Program development Life cycle
 Program Design
 Coding Documenting and Testing
 Commercial Programs, Testing and A
Documenting
Wk-6 Basic Programming Concepts Midterm 1
16-Oct  Processing Data and Data Output
 Data Types
 Integer Data
 Floating Point data A
 Boolean Data
Wk-7 Structured Programming Assign 2
23-Oct  Reading Flowcharts,
 symbols
 Control Structures A
 Programming Styles
Wk-8 Selection Structures
30-Oct  Types of Selection Structures
 Relational and Logical Operators A
 ASCII and string comparison
Wk-9 Selecting from several Alternatives Class Test 2
06-Nov  Nested-if and Case-like structure A
 Application of Selection Structures
 Problem Solving Using Selection Structures
Wk-10 Using Repetition Structures- Looping
13-Nov  Loop Basics
A
 Types of Loops
 Pre-Test and Post Test
 Counter controlled- The For loop
Wk-11 Sentinel Controlled Loops and Applications Assign 3
20-Nov  Input Data and Data Validation
A
 Computing Sums and Averages
 Problem Solving using Loops
Wk-12 More about Loops and Decisions Midterm 2
27-Nov  Combining Loops with Selection statements
A
 Random numbers (optional)
 Nested Loops
 Problem Solving using Nested Loops
Wk-13 Concept of Arrays: Lists
04-Dec  One Dimensional Arrays A
 Searching 1D Arrays
 Strings as Array of Characters
Wk-14 Modular Programming in Detail Class Test 3
11-Dec  Arguments and Parameters A
 Value and Reference Parameters
 User Defined Functions
Wk-15 Revision
18-Dec
Wk-16 Revision
25-Dec
Wk-17 Quiet Week (Exam Prep Week)
01-Jan
Wk-18 Final Exams
08-Jan
18-Jan Exam Scripts shown

19-Jan Declaration of Result (in CMS)

GRADING TABLE
Weightage of Assessments: ABSOLUTE SCALE if no. of students in
Final Exam are up to 20, otherwise
RELATIVE SCALE
Class Tests (3) 15 Range Percenta Points Grade
ge
Assignments (3) 15
85.00-100 85.00 4.00 A
Mid Term Tests (2) 25 81.50-84.99 81.50 3.67 A–
Final Exam 35 78.00-81.49 78.00 3.33 B+
Project 10 74.50-77.99 74.50 3.00 B
71.00-74.49 71.00 2.67 B–
Total 100 67.50-70.99 67.50 2.33 C+
64.00-67.49 64.00 2.00 C
60.50-63.99 60.50 1.67 C–
57.00-60.49 57.00 1.33 D+
50.00-56.99 50.00 1.00 D
0.00-49.99 Below 50 0.00 F

You might also like