Week-8 Study the characteristic of diode rectifier in AC with the introduction to
oscilloscope.
Week-9 Study the characteristic of common base BJT.
Week-10 Study the characteristic of common emitter BJT
Week-11 Quiz
Week-12 Practice Lab-02
Week-13 Lab Test-02
Week-14 Viva Voce
ASSESSMENT STRATEGY
Components Grading CO Blooms Taxonomy
Conduct of Lab Tests/Class C3, C4, C5
25% CO1, CO2
Performance A3, A5, P2, P4
Continuous
C3, C4, C5
Assessment Report Writing/ Programming 15% CO1, CO2 A3, A5, P2, P4
(40%) Mid-Term Evaluation C4, C5
20% CO1
(exam/project/assignment) A3, A5
C3, C4, C5, C6
Viva Voce 10% CO1, CO2, CO3 A3, A5, A6, P2, P4
C3, C4, C5, C6
Final Evaluation (Lab Quiz) 30% CO1, CO2, CO3 A3, A5, A6, P2, P4
Total Marks 100%
(CO = Course Outcome, C = Cognitive Domain, P = Psychomotor Domain, A = Affective Domain)
REFERENCE BOOKS
1. Chapman, Stephen J. Electric machinery and power system fundamentals. USA: McGraw-Hill,2002.
2. Theraja, B. L., and A. K. Theraja. "A Text Book of Electrical Technology, AC & DC Machines in SI." Systems
of Unit, S. Chand & Company Ltd, Ram Nagar, New Delhi, India,2002.
3. Stephan J. Chapman ,Electrical Machinery Fundamental ,USA: McGraw-Hill,2004.
4. Sedra, Adel S., et al. Microelectronic circuits. New York,USA: Oxford University Press, 1998.
REFERENCE SITE
6.1. c. Department of CSE
Level 1 Term II
COURSE INFORMATION
: CSE 121
Course Code Lecture Contact Hours : 3.00
: Introduction to Computer Science and
Course Title Credit Hours : 3.00
Programming Language
PRE-REQUISITE
None
CURRICULUM STRUCTURE
85
Outcome Based Education (OBE)
SYNOPSIS/RATIONALE
To develop strong programming fundamentals for learners who want to solve complex problems
of real world by writing computer programs.
OBJECTIVES
1. To provide a basic idea of the programming concepts
2. To know the basic rules for implementing C programming.
3. To develop problem-solving skills to solve different problems and calculations using C programming.
LEARNING OUTCOMES
Upon completion of the course, the students will be able to
1. Explain the features of procedural language.
2. Apply C programming concepts such as control flow, conditional statements, composition of
structures, array, function etc. to solve real world problem.
3. Design algorithms in a systematic way to solve any problem which can be implemented using
C.
4. Develop the communication skill by presenting topics on programming phenomena.
COURSE OUTCOMES & GENERIC SKILLS
Corresponding Bloom’s Assessment
No. Course Learning Outcome CP CA KP
POs Taxonomy Methods
Explain the features of
CO1 PO1 C1-C3 1 - 1 T, MT, F
procedural language.
Apply C programming concepts
such as control flow, conditional
CO2 statements, composition of PO2 C4 3 2 T, MT, F
structures, array, function etc. to
solve real world problem.
Design algorithms in a systematic
CO3 way to solve any problem which PO3 C6 1,3 5 T, MT, F
can be implemented using C.
Develop the communication
CO4 skill by presenting topics on P10 A2 1 5 Pr, Q
programming phenomena.
(CP- Complex Problems, CA-Complex Activities, KP-Knowledge Profile, T – Test ; PR – Project ; Q –
Quiz; ASG – Assignment; Pr – Presentation; R - Report; F – Final Exam, MT- Mid Term Exam)
COURSE CONTENT
Programming concepts; Program development stages; Flow charts;
Structured programming language: data types, operators, bitwise operations, expressions, control
structures: if-else, switch-case, loop (for loop, while loop, do-while loop).
Input and Output: standard input and output, formatted input and output.
Functions and program structure: function basics, parameter passing conventions, scope rules,
storage classes, recursion, header files, the preprocessor, Pointer, and its uses, Arrays, Strings,
Multidimensional array;
86
User-defined data types: structures, unions, and enumerations.
File, Variable length argument list, Command line parameters, Error Handling, Linking, Library
Functions
SKILL MAPPING (CO-PO MAPPING)
PROGRAM OUTCOMES (PO)
No. Course Learning Outcome
1 2 3 4 5 6 7 8 9 10 11 12
Explain the features of
CO1 3
procedural language.
Apply C programming concepts
such as control flow, conditional
CO2 statements, composition of 3
structures, array, function etc. to
solve real world problem.
Design algorithms in a systematic
CO3 way to solve any problem which can 3
be implemented using C.
Develop the communication skill
CO4 by presenting topics on 2
programming phenomena.
(3 – High, 2- Medium, 1-low)
JUSTIFICATION FOR CO-PO MAPPING
Corresponding
Mapping Justification
Level of Matching
Achieving depth of knowledge on programming by solving
CO1-PO1 3 complex engineering problem and understanding of the features of
a programming languages.
Applying different concepts of C/MATLAB programming to find
CO2-PO2 3
the solution of complex problems.
Designing algorithm, identifying the problem statement and
CO3-PO3 3
formulating the problem to solve it.
Developing Communication skill on programming through quiz
CO4-PO10 2
and presentation.
TEACHING LEARNING STRATEGY
Teaching and Learning Activities Engagement
(hours)
Face-to-Face Learning
Lecture 42
Practical / Tutorial / Studio -
Student-Centered Learning -
87
Self-Directed Learning
Non-face-to-face learning 84
Revision 21
Formal Assessment
Continuous Assessment 2
Mid-Term 1
Final Examination 3
Total 153
TEACHING METHODOLOGY
Lecture and Discussion, Co-operative and Collaborative Method, Problem Based Method
COURSE SCHEDULE
Weeks Topics Remarks
Week-1 1. Introduction to Computer Programming. Class
2. Environment Setup and introduction with the IDE. Test 1,
3. Standard input and output. Final
4. Formatted input and output. Exam
Week-2 1. Introduction to data types, mathematical problems using data types, data type
conversion, operators, bitwise operation, and expressions.
2. Program development stages-flow chart.
Week-3 1. Introduction to the conditional statement (if-else, nested if-else, switch case).
2. Problem-solving with conditional statements.
Week-4 1. Introduction to the loop statement (for loop, while loop, do-while loop).
2. Problem-solving with loop statements. Class
Week-5 1. Functions and program structure: Function Basics, Parameter passing Test 2,
conventions, Scope Rules, Storage classes, Recursion. Final
2. Problem-solving with implementing Function. Exam
Week-6 1. Recursion
2. Problem-solving with recursions.
Week-7 1. String
2. Problem solving with string.
Week-8 1. Header files
2. Preprocessor Mid
3. Pointer and its uses. Term
4. Problem-solving with pointers.
Week-9 1. Arrays
2. Multidimensional array
3. Problem-solving with arrays.
Week-10 1. Structures
2. Problem-Solving with structures.
Week-11 1. Unions
2. Enumerations Class
Week-12 1. Opening, reading, writing, and closing a file. Test 3,
2. Problem-solving with implementing files.
88
Week-13 1. Variable length argument list Final
2. Command Line parameters Exam
3. Linking
4. Library Functions
Week-14 1. Error handling
2. Problem-solving with error handling
ASSESSMENT STRATEGY
Components Grading CO Blooms Taxonomy
Class Test/ Assignment
20% CO1, CO2, CO3 C1,C2,C3,C4,C6
Continuous (1-3)
Assessment Class Participation and
5+5= 10% CO1 C2
(40%) Class attendance
Mid term 10% CO2, CO3 C2, C6
Final Examination 60% CO1-CO3 C2, C3, C6
Total Marks 100%
(CO = Course Outcome, C = Cognitive Domain, P = Psychomotor Domain, A = Affective Domain)
89
REFERENCE BOOKS
1. Herbert Schildt, Teach Yourself C, 3rd Edition
2. Programming with C - Schaums Outline Series
3. Holly Moore , MATLAB for Engineers , Pearson Education Inc , 2018
4. Peter Norton, Computer Fundamentals, 6 th Edition McGraw-Hill Education, 2004
5. Herbert Schildt, C, The Complete Reference, 4th Edition
6. Dennis M. Ritchie, C Programming Language, 2nd Edition
7. David Houcque, Introduction to Matlab for Engineering Students , version-1.2
REFERENCE SITE
Level-1 Term-II
COURSE INFORMATION
Course Code : CSE 122
Lecture Contact Hours : 1.50
Course Title : Introduction to Computer Science and
Credit Hours : 0.75
Programming Language Sessional
PRE-REQUISITE
None
CURRICULUM STRUCTURE
Outcome Based Education (OBE)
SYNOPSIS/RATIONALE
The C Programming Sessional course is designed to practically introduce the fundamental
principles, mechanism of programming skills and develop basic programming skills to
program design and development. The lab begins with practicing introductory concepts of C
programming language and then covers other important topics related to C programming
language.
OBJECTIVES
5. To provide a basic idea of the programming concepts
6. To know the basic rules for implementing C programming.
7. To develop problem-solving skills to solve different problems and calculations using C
programming.
LEARNING OUTCOMES
Upon completion of the course, the students will be able to
8. Apply knowledge of algorithm to find roadmap to solve problems.
9. Apply knowledge of C concepts to implement solver program.
COURSE OUTCOMES & GENERIC SKILLS
Corresponding Bloom’s Assessment
No. Course Learning Outcome CP CA KP
POs Taxonomy Methods
Apply knowledge of
algorithm to find roadmap ASG, Q,
CO1 PO1 C3, A2 1 1 4
to solve problems. OE, T
90
Analyze the fundamental
ASG, Q,
CO2 principles, typical PO2 C3, A2 1 1 4
characteristics, and
OE, T
mechanisms of a structured
programming language
practically to implement and
solve problems.
Apply practical knowledge to
develop basic programming ASG,
CO3 PO6 C6 1,3 3 7
skills with respect to program Pr,R
design and development.
(CP- Complex Problems, CA-Complex Activities, KP-Knowledge Profile, T – Test ; PR – Project ; Q – Quiz; ASG –
Assignment; Pr – Presentation; R - Report; F – Final Exam, MT- Mid Term Exam, OE-Online Exam)
COURSE CONTENT
Programming concepts; Program development stages; Flow charts;
Structured programming language: data types, operators, bitwise operations, expressions, control
structures: if-else, switch-case, loop (for loop, while loop, do-while loop).
Input and Output: standard input and output, formatted input and output.
Functions and program structure: function basics, parameter passing conventions, scope rules,
storage classes, recursion, header files, the preprocessor, Pointer, and its uses, Arrays, Strings,
Multidimensional array;
User-defined data types: structures, unions, and enumerations.
File, Error Handling, Linking, Library Functions
1.
SKILL MAPPING (CO-PO 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. 3
Apply knowledge of C concepts to
CO2 implement solver program. 3
Apply practical knowledge to develop basic
CO3 programming skills with respect to program 3
design and development.
(3 – High, 2- Medium, 1-low)
JUSTIFICATION FOR CO-PO MAPPING
Corresponding
Mapping Justification
Level of Matching
In order to find out the roadmap of a complex engineering problem using c
CO1-PO1 3
programming, knowledge of algorithm is crucial.
In order to identify and formulate the problem for solver program concepts
CO2-PO2 3
of C should be applied properly.
91
Apply reasoning informed by contextual knowledge to assess societal,
CO3-PO6 3
health, safety, legal and cultural issues and the consequent responsibilities
relevant to professional engineering practice and solutions to complex
engineering problems.
TEACHING LEARNING STRATEGY
Teaching and Learning Activities Engagement
(hours)
Face-to-Face Learning
Lecture 21
Practical / Tutorial / Studio -
Student-Centered Learning -
Self-Directed Learning
Non-face-to-face learning 42
Revision 21
Formal Assessment
Continuous Assessment 2
Mid-Term 1
Final Examination 3
Total 90
TEACHING METHODOLOGY
Lecture and Discussion, Co-operative and Collaborative Method, Problem Based Method
COURSE SCHEDULE
Weeks Topics Remarks
Week-1 Basic Programming, IDE, Data Type, Operations
Week-2 If-else, switch case Evaluation 1
Week-3 Loop, Nested Loop
Array (1D, 2D) Evaluation 2
Week-4
Week-5 String, Function
Week-6 Structure, File Handling Evaluation 3
Week-7 Assignment: String, Strucutre Online Exam
ASSESSMENT STRATEGY
92
Components Grading CO Blooms Taxonomy
Continuous Lab performance and Report 10%
Assessment Online-1 50% CO1, CO2 C3, A2
(40%) Class Evaluation 20% CO2 C3, A2
Lab Quiz 20% CO1, CO2 C3, A2
Total Marks 100%
(CO = Course Outcome, C = Cognitive Domain, P = Psychomotor Domain, A = Affective Domain)
REFERENCE BOOKS
8. Herbert Schildt, Teach Yourself C, 3rd Edition
9. Programming with C - Schaums Outline Series
10. Peter Norton, Computer Fundamentals, 6 th Edition McGraw-Hill Education, 2004
11. Herbert Schildt, C, The Complete Reference, 4th Edition
12. Dennis M. Ritchie, C Programming Language, 2nd Edition
13. E Balagurusamy, Programming in Ansi C, 6th Edition.
REFERENCE SITE
93