Fall Semester L-1, T-2

COURSE INFORMATION
: CSE 122
Course Code Lecture Contact Hours : 1.50
: Introduction to Computer Science and
Course Title Credit Hours : 0.75
Programming Language Sessional
PRE-REQUISITE
None

CURRICULUM STRUCTURE
Outcome Based Education (OBE)
SYNOPSIS/RATIONALE
To practically develop strong programming fundamentals for learners who want to solve complex problems
of real world by writing computer programs.

OBJECTIVE
1. To demonstrate the basic concepts of computer programming in C/C++
2. To discuss how to think about the problems, their solutions and translate it to a programming language.

LEARNING OUTCOMES& GENERIC SKILLS

Correspo
Bloom’s Assessmen
No. Course Learning Outcome nding CP CA KP
Taxonomy t Methods
POs
Apply knowledge of algorithm to
CO
find roadmap to solve problems.
1
Apply knowledge of C/C++
CO concepts to implement solver
2 program.

(CP- Complex Problems, CA-Complex Activities, KP-Knowledge Profile – Test ; PR – Project ; Q – Quiz;
ASG – Assignment; Pr – Presentation; R - Report; F – Final Exam, MT- Mid Term Exam)

COURSE CONTENT

Introduction to digital computers. Programming languages, algorithms and flow charts. Structured
Programming using C. Variable and constants, operators, expressions, control statements, function,
arrays, pointers, structure unions. User defined data types. Input output and files. Object oriented
Programming using C++: Introduction, classes and objects. Polymorphism, function and operator
overloading, inheritance.

SKILL MAPPING
 PROGRAM OUTCOMES (PO)
No. Course Learning Outcome
1 2 3 4 5 6 7 8 9 10 11 12
Apply knowledge of algorithm to find
CO1 roadmap to solve problems.

Apply knowledge of C/C++ concepts to

CO2 implement solver program.

(3 – High, 2- Medium, 1-low)

Justification for CO-PO mapping:

Corresponding
Mapping Justification
Level of Matching
CO1-PO1

CO1-PO2

CO2-PO1

CO3-PO2

CO4-PO4

TEACHING LEARNING STRATEGY

Teaching and Learning Activities Engagement (hours)
Face-to-Face Learning
Lecture
Practical / Tutorial / Studio
Student-Centred Learning
Self-Directed Learning
Non-face-to-face learning
Revision
Formal Assessment
Continuous Assessment
Mid-Term
Final Examination
Total

TEACHING METHODOLOGY

Lecture and Discussion,

Co-operative and Collaborative Method, Problem Based Method

COURSE SCHEDULE
Week Lecture Lecture/Tutorial/Assignment Topic Assessment
1 Lec-1 Orientation with IDE, Viva
Building First Program, 
Compile  and Run
2 Lec-2 Problem solving with Variable and constants, operators, expressions, Evaluation
if-else
3 Lec-3 Problem solving with “if-else if” ladder, switch-case,  Evaluation
 4 Lec-4 Problem solving using for loop, while Loop, do while Online, Quiz
Pattern printing using nested loop
5 Lec-5 Problem solving using Arrays Online, Quiz
6 Lec-6 Problem solving using Function Online, Quiz
7 Lec-7 Problem solving using File Input/ Output and structures Online, Quiz

ASSESSMENT STRATEGY

CO Blooms Taxonomy
Components Grading
Continuou Test 1 0%
s Class
Assessmen Participation 5%
t (40%)
Mid term 15%
Final Exam 60%
Total Marks 100%

(CO = Course Outcome, C = Cognitive Domain, P = Psychomotor Domain, A = Affective Domain)

REFERENCE BOOKS

1. Teach Yourself C, Herbert Schildt, 3rd Edition

2. Programming with C - Schaums Outline Series
3. MATLAB for Engineers - Holly Moore, Pearson Education Inc , 2018
4. Computer Fundamentals by Peter Norton
5. C, The Complete Reference, Herbert Schildt, 4th Edition
6. C Programming Language, Dennis M. Ritchie. 2nd Edition
7. Introduction to Matlab for Engineering Students - David Houcque, version-1.2

REFERENCE SITE

None