G CS113 Introduction To Programming
G CS113 Introduction To Programming
G CS113 Introduction To Programming
CS-113Introduction to Programming
Course Code: CS-113 Semester: 1st
Credit Hours: 1+1 Prerequisite Codes: N/A
Instructor: Dr. Usman Younis Class: BEE-8D
Office: C-302 IAEC Building Telephone Ext: 2168
Lecture Days: Tuesday, Lab (TBA E-mail: [email protected]
Class Room: CR-13 Consulting Hours: 14:00 – 17:00 on Mondays
Lab Engineer: Mehwish Kiran Lab Engineer Email: [email protected]
Knowledge Group: Programming Updates on LMS: Weekly
Course Description:
The course introduces the fundamental concepts underlying modern computer programming. A
systematic approach is used to teach students how to write programs that solve well specified
problems. Emphasis is placed on the mastery of basic programming skills, with a considerable
attention to the fundamental building blocks of computer programs, and the associated concepts
and principles.
Course Objectives:
The learning objectives are:
1. Developing comprehensive knowledge about the fundamental principles, concepts and constructs
of modern computer programming.
2. Developing competencies for the design, coding and debugging of computer programs.
Page 1 of 4
National University of Sciences & Technology (NUST)
School of Electrical Engineering and Computer Science (SEECS)
Department of Computer Science
Assessments Details
Theory:50% Quizzes: 15%
Assignments: 10 %
OHT-1: 15 %
OHT-2: 15%
End Semester Exam:45 %
Books:
Text Book: 1. Paul J. Deitel and Harvey M. Deitel, C: How to Program, 8th Edition, Prentice Hall, 2015.
Reference 1. The C Programming Language (2nd Ed.) by Kernighan and Ritchie, 1988.
Books: 2. Code Complete (2nd Ed.) by Steve McConnell, 2004.
3. The Art of Computer Programming (TAOCP) by Donald E. Knuth, 1968.
Week Lecture
01 Introduction and history of programming languages
02 Flowcharts and pseudocode
03 Overview of C program
04 Statements, variables and data types
05 Operators and expressions
06 Selections
07 OHT-1
08 Relational and conditional operators
09 Repetition
10 “While”, “for” and “do while” loops in detail
11 Switch, break, continue
12 Logical operators
Page 2 of 4
National University of Sciences & Technology (NUST)
School of Electrical Engineering and Computer Science (SEECS)
Department of Computer Science
13 OHT-2
14 Scope of variables
15 Function definition and prototypes
16 Arrays
17 Arrays and functions
18 Advanced Topics
19 End Semester Exam
Grading Policy:
Quiz Policy: The quizzes may be unannounced and normally last for ten minutes. The question
framed is to test the concepts involved in last few lectures.
Assignment Policy: The course website will be the primary source for announcements and submitting
assignments.
Lab Conduct: The labs will be conducted for three hours every week. The lab handouts will be
shared on LMS. The students are required to submit their lab tasks at the end of lab
for evaluation. One submission per group will be required. However, students may
also be evaluated by oral viva during the lab.
Plagiarism: Collaboration and group wok is encouraged but each student is required to submit
his/her own contribution(s). Your writings must be your own thoughts. You must cite
and acknowledge all sources of information in your assignments. Cheating and
plagiarism will not be tolerated and will lead to strict penalties including zero marks in
assignments as well as referral to the Dean for appropriate action(s).
Page 3 of 4
National University of Sciences & Technology (NUST)
School of Electrical Engineering and Computer Science (SEECS)
Department of Computer Science
Program outcomes are the narrower statements that describe what students are expected to know and be
able to do by the time of graduation. These relate to the knowledge, skills and attitude that the students
acquire while progressing through the program. The program must demonstrate that by the time of
graduation the students have attained a certain set of knowledge, skills and behavioral traits, at least to
some acceptable minimum level. Specifically, it is to be demonstrated that the students have acquired the
following graduate attributes:
Page 4 of 4