Approved BSC Cse Obe Curriculum Summer 2018

East West University
Aftabnagar, Dhaka, Bangladesh

Department of Computer Science and Engineering (CSE)
Outcome-Based Curriculum of B. Sc. in CSE Program

(Effective from Summer 2018)
Vision Statement of CSE Department:

To be internationally renowned in Computer Science and Engineering and to exalt excellence in
education, research and industrial profession for sustainable transformation of the society.
Mission of CSE Department:

(i) To advance knowledge and learning of evolving challenges in Computer Science and
Engineering through quality education and research towards the development of the society.
(ii) To sustain an outstanding hub dedicated to excellence in teaching, learning, and research and
to become internationally recognized to meet national and international needs.
(iii)To enhance the quality of students with advanced knowledge and skills of Computer Science
and Engineering to meet contemporary industrial requirements.
Program Educational Objectives (PEOs) of B. Sc. in CSE Program:

Graduates of the B. Sc. in Computer Science and Engineering (CSE) program are expected to
attain the following Program Educational Objectives (PEO) within few years, such as 3-5 years,
of graduation.
PEO1 Graduates will establish themselves as leading computational professionals and
continue to learn and address evolving challenges in Computer Science and
Engineering.
PEO2 Graduates will engage in lifelong pursuit of knowledge and interdisciplinary
learning for industrial, research, and academic careers.
PEO3 Graduates will contribute to sustainable development and the well-being of society
through the use of Computer Science and Engineering principles, practices and tools
in an ethical and responsible manner.
Page 1 of 94
Program Outcomes (POs) of B. Sc. in CSE Program
Graduates of the B. Sc. in Computer Science and Engineering (CSE) program are expected to
attain the following Program Outcomes (POs) by the time of graduation.
PO1 Engineering Knowledge (Cognitive): Apply the knowledge of mathematics, science,
engineering fundamentals and an engineering specialization to the solution of complex
engineering problems.
PO2 Problem Analysis (Cognitive):Identify, formulate, research the literature and analyze
complex engineering problems and reach substantiated conclusions using first principles
of mathematics, the natural sciences and the engineering sciences.
PO3 Design/Development of Solutions (Cognitive, Affective):Design solutions for complex
engineering problems and design system components or processes that meet the specified
needs with appropriate consideration for public health and safety as well as cultural,
societal and environmental concerns.
PO4 Investigation (Cognitive, Psychomotor):Conduct investigations of complex problems,
considering design of experiments, analysis and interpretation of data and synthesis of
information to provide valid conclusions.
PO5 Modern Tool Usage (Psychomotor, Cognitive): Create, select and apply appropriate
techniques, resources and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the limitations.
PO6 The Engineer and Society (Affective): Apply reasoning informed by contextual
knowledge to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to professional engineering practice.
PO7 Environment and Sustainability (Affective, Cognitive): Understand the impact of
professional engineering solutions in societal and environmental contexts and
demonstrate the knowledge of, and need for sustainable development.
PO8 Ethics (Affective): Apply ethical principles and commit to professional ethics,
responsibilities and the norms of the engineering practice.
PO9 Individual Work and Teamwork (Psychomotor, Affective): Function effectively as an
individual and as a member or leader of diverse teams as well as in multidisciplinary
settings.
PO10 Communication (Psychomotor, Affective): Communicate effectively about complex
engineering activities with the engineering community and with society at large. Be able
to comprehend and write effective reports, design documentation, make effective
presentations and give and receive clear instructions.
PO11 Project Management and Finance (Cognitive, Psychomotor): Demonstrate
knowledge and understanding of the engineering and management principles and apply
these to one’s own work as a member or a leader of a team to manage projects in
multidisciplinary environments.
PO12 Life-Long Learning (Affective, Psychomotor): Recognize the need for and have the
preparation and ability to engage in independent, life-long learning in the broadest
context of technological change.
Page 2 of 94
Mapping of Program Outcomes (POs) to Program Educational Objectives (PEOs)
Program Outcomes (POs) Program Educational Objectives (PEOs)
PEO1 PEO2 PEO3
PO1: Engineering Knowledge X
PO2: Problem Analysis X
PO3: Design/Development of Solutions X
PO4: Investigation X
PO5: Modern Tool Usage X
PO6: The Engineer and Society X
PO7: Environment and Sustainability X
PO8: Ethics X
PO9: Individual Work and Teamwork X
PO10: Communication X
PO11: Project Management and Finance X
PO12: Life-Long Learning X
Page 3 of 94
Course Summery
Course Category Credits
Compulsory Language and General Education Courses 12
ElectiveGeneral Education Courses 9
Basic Science Courses 11
Mathematics and Statistics Courses 15
Core Computer Science and Engineering Courses 75
Capstone Project 6
Elective Computer Science and Engineering Courses 12
Total 140
List of Courses
Course Credits Prerequisite
Compulsory Language and General Education Courses 12
ENG101 Basic English 3
ENG 102 Composition and Communication Skills 3 ENG101
GEN224 Bangla Language 3 None
GEN226 Emergence of Bangladesh 3 ENG102
Elective General Education Courses 9

Social Science Courses (any one course) 3
ECO101 Principle of Microeconomics 3 None
GEN203 Ecological System and Environment 3 None
GEN214 Development Studies 3 ENG102
SOC317 Sociology of Science and Technology 3 None
Arts and Humanities Courses (any one course) 3
GEN201 Bangladesh Studies 3 ENG102
GEN204 Western Thought 3 None
GEN210 International Relation 3 ENG102
SOC211 Eastern Culture and Heritage 3 None
SOC217 Religion, Ethnicity, Culture and Development in 3 ENG102
South Asia
Business Courses (any one course) 3
ACT101 Financial Accounting 3 None
BUS321 Business for Engineering and Technology 3 ENG102
BUS231 Business Communication 3 ENG102
MGT321 Industrial Management 3 ENG102
MGT337 Production Operations Management 3 STA102
FIN101 Principle of Finance 3 STA102
MKT101 Principle of Marketing 3 None
Page 4 of 94
Basic Science Courses 11
PHY109 Engineering Physics-I (Introductory Classical 3+1=4 MAT102
Physics)
PHY209 Engineering Physics-II (Introductory Quantum 3+0=3 MAT205
Physics)
CHE109 Engineering Chemistry 3+1=4
Mathematics and Statistics Course 15

MAT101 Differential and Integral Calculus 3
MAT102 Differential Equations and Special Functions 3 MAT101
MAT104 Coordinate Geometry and Vector Analysis 3 MAT101
MAT205 Linear Algebra and Complex Variable 3 MAT102
STA102 Statistics and Probability 3
Core Computer Science and Engineering Courses 75

CSE103 Structured Programming 3+1.5=4.5
CSE106 Discrete Mathematics 3+0=3 CSE103
CSE110 Object Oriented Programming 3+1.5=4.5 CSE106
CSE200 Computer-Aided Engineering Drawing 0+1=1
CSE207 Data Structures 3+1=4 CSE110
CSE209 Electrical Circuits 3+1=4
CSE246 Algorithms 3+1.5=4.5 CSE207
CSE251 Electronic Circuits 3+1=4 CSE209
CSE302 Database Systems 3+1.5=4.5 CSE106
CSE325 Operating Systems 3+1=4 CSE246
CSE345 Digital Logic Design 3+1=4 CSE251
CSE347 Information System Analysis and Design 3+1=4 CSE302
CSE360 Computer Architecture 3+0=3 CSE325
CSE370 Mobile Programming 3+1=4 CSE246
CSE399 Cyber Ethics and Legal Framework 3+0=3
CSE405 Computer Networks 3+1=4 CSE246
CSE412 Software Engineering 3+1=4 CSE347
CSE442 Microprocessors and Microcontrollers 3+1=4 CSE360
CSE479 Web Programming 3+1=4 CSE302
CSE487 Computer and Cyber Security 3+0=3 CSE405
Capstone Project 6
CSE400 Capstone Project 0+6=6 Completed at least
105 credit hours
Page 5 of 94
Elective Computer Science and Engineering Courses (5 15
courses depending on major area)
Theory
CSE313 Theory of Computations 3+0=3 CSE246
CSE420 Computer Graphics 3+0=3 CSE246
CSE425 Numerical Methods 3+0=3 CSE103
CSE471 Compiler Design 3+0=3 CSE313
CSE483 Graph Theory 3+0=3 CSE246
CSE484 Computational Geometry 3+0=3 CSE246
Systems
CSE366 Artificial Intelligence 3+0=3 CSE246
CSE406 Internet of Things 3+0=3 CSE405
CSE420 Computer Graphics 3+0=3 CSE246
CSE422 Simulation and Modeling 3+0=3 CSE246
CSE452 Distributed Systems and Algorithms 3+0=3 CSE325
Data Science
CSE366 Artificial Intelligence 3+0=3 CSE246
CSE438 Digital Image Processing 3+0=3 CSE246
CSE475 Machine Learning 3+0=3 CSE366
CSE477 Data Mining 3+0=3 CSE366
CSE486 Bioinformatics Algorithms 3+0=3 CSE246
CSE487 Big Data Analytics 3+0=3 CSE302
Software Engineering
CSE423 Software Architecture 3+0=3 CSE412
CSE428 Human Computer Interactions 3+0=3 CSE412
CSE430 Software Testing and Quality Assurance 3+0=3 CSE412
CSE489 Mobile Application Development 3+0=3 CSE431
Communication
CSE350 Data Communications 3+0=3 CSE251
CSE453Wireless Networks 3+0=3 CSE405
CSE457 Cellular Networks 3+0=3 CSE405
Hardware
CSE355 Digital System Design 3+0=3 CSE345
CSE491 VLSI Design 3+0=3 CSE345
CSE492 Robotics 3+0=3 CSE366
CSE494 Embedded Systems 3+0=3 CSE442
Page 6 of 94
Major Area Criteria
Computer Science 3 courses from Theory group + 1 course from any other group
Computer 3 courses from Hardware group + 1 course from any other group
Engineering
Data Science 3 courses from Data Science group + 1 course from any other group
Software Engineering 3 courses from Software Engineering group + 1 course from any other
group
Page 7 of 94
Course Flow Chart
1st Year 2nd Year 3rd Year 4th Year
ENG101 Basic English (3) GEN224 Bangla Language Elective General Education CSE400 Capstone Project
(3) Course - II (3) (0+1)
MAT101 Differential and STA102 Statistics and CSE302 Database Systems CSE405 Computer
Integral Calculus (3) Probability (3) (3+1.5) Networks (3+1)
CSE103 Structured CSE200 Computer-Aided CSE325 Operating Systems Elective CSE Course - II
Programming (3+1.5) Engineering Drawing (0+1) (3+1) (3+0)
CSE209 Electrical Circuits Elective CSE Course - III

(3+1) (3+0)
ENG102 Composition and GEN226 Emergence of Elective General Education CSE400 Capstone Project
Communication Skills (3) Bangladesh (3) Course - III (3) (0+2)
MAT102 Differential MAT205 Linear Algebra CSE345 Digital Logic CSE412 Software
Equations and Special and Complex Variable (3) Design (3+1) Engineering (3+1)
Functions (3)
CSE106 Discrete CSE207 Data Structures CSE347 Information System CSE442 Microprocessors
Mathematics (3+0) (3+1) Analysis and Design (3+1) and Microcontrollers (3+1)
PHY109 Engineering CSE251 Electronic Circuits CSE370 Mobile Elective CSE Course - IV
Physics-I (3+1) (3+1) Programming (3+1) (3+0)
MAT104 Coordinate Elective General Education CSE360 Computer CSE400 Capstone Project
Geometry and Vector Course - I (3) Architecture (3+0) (0+3)
Analysis (3)
CHE109 Engineering PHY209 Engineering CSE399 Cyber Ethics and CSE479 Web Programming
Chemistry (3+1) Physics-II (3+0) Legal Framework (3+0) (3+1)
CSE110 Object Oriented CSE246 Algorithms (3+1.5) Elective CSE Course - I CSE487 Computer and
Programming (3+1.5) (3+0) Cyber Security (3+0)
Year Credits 35 35.5 35.5 34
Page 8 of 94
Core CSE Course to PO mapping
PO
Course 1 2 3 4 5 6 7 8 9 10 11 12
CSE103 X X X X X X
CSE106 X X X X X X
CSE110 X X X X X X X
CSE200 X X X X X X
CSE207 X X X X X X
CSE246 X X X X X X
CSE325 X X X X X X X X
CSE360 X X X X X X
CSE399 X X X X
CSE487 X X X X X X X X X
CSE400 X X X X X X X X X X X X
Page 9 of 94
Elective CSE Course to PO mapping
PO
Course 1 2 3 4 5 6 7 8 9 10 11 12
Group: Theory
CSE313 X X X X X X
CSE483 X X X X X X
CSE484 X X X X X X
Group: Systems
Group: Data Science
Group: Software Engineering
CSE430 X X X X X X
Group: Communication
Group: Harware
Page 10 of 94
Course Descriptions:Core Computer Science and Engineering Courses
CSE103 Structured Programming
Credit Hours and Teaching Scheme:

Theory Laboratory Total
Credit 3 1.5 4.5
Hours
Contact 3 Hours/Week for 13 3 Hours/Week for 13 6 Hours/Week for 13
Hours Weeks + Weeks Weeks +
Final Exam in the 14th Final Exam in the 14th
week week
Prerequisite:None
Course Objective:The purpose of this course is to introduce the students to computer

programming using structured language. The students will be able to enhance their analyzing and
problem-solving skills and use the same for writing programs using C language. Knowledge of
this course will be needed as prerequisite knowledge for future courses such as CSE106 Discrete
Mathematics, CSE110 Object Oriented Programming, CSE207 Data Structures, CSE246
Algorithms, CSE302 Database Systems, CSE366 Artificial Intelligence, CSE405 Computer
Networks and many others.
Course Outcomes (COs):

After completion of this course students will be able to:
CO1 Explain the fundamentals of programming and basic structure of C programming
language.
CO2 Compare and applythe appropriate decision making and control statements, arraysand
functions to solve computational problems.
CO3 Applyappropriate data structures like pointers, structures, unions, user defined data types,
and dynamic memory to solve computational problems.
CO4 Compare and apply language constructs and data structures; perform and demonstrate
skills and write report to design, build, and test moderately complex computational
problems.
Course Contents and Learning/Assessment Levels

Course Topic CO Learning/Assessment
Levels
Introduction to computers and programming languages, CO1 C2
data representation in computer, flowchart construction
for problem solving
Introduction to C Programming (input, output, variables, CO1 C2
data types, operators, expressions, assignments)
Conditional control statements (if, if-else, nested if-else, CO2 C2, C3
switch)
Page 11 of 94
Loop statement (while, for and do…while) and nested CO2 C2, C3
loop statement, break and continue statements
Introduction to arrays (arrays, declaring arrays, CO2 C2, C3
manipulating arrays)
Multidimensional array CO2 C2, C3
Characters and strings (various types of string CO2 C2, C3
manipulation)
Introduction to functions (function definitions, function CO2 C3
prototypes and argument, header files). Solving complex
problems in modular fashion using user defined function
Introduction to recursive definition and solving problem CO2 C3
using recursive function
Pointers (pointer variable declarations, pointer operators, CO3 C3
passing arguments to functions by reference with
pointers, pointer expressions and pointer arithmetic,
arrays of pointers, and function pointers)
Structures (structure definitions and initialization, CO3 C3
accessing structure members, structure with function and
pointer)
File management (files and streams, creating a file, CO3 C3
reading data from file, writing data to file, and updating
files)
Dynamic memory allocation and linked lists CO3 C3
Lab exercises CO4 C2, C3, P2, P3, A2
Mini project CO4 C3, C4, P2, P3, A2
Mapping of COs to POs:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X
Attributes of Complex Engineering Problems Involved

CO PO Attributes
CO1 PO1 Range of conflicting requirements
CO2 PO1, PO2, PO3 Range of conflicting requirements
CO4 PO2, PO3 Range of conflicting requirements
Attributes of Complex Engineering Activities Involved

CO PO Attributes
CO4 PO10 Range of resources, Level of interaction, and Familiarity
Page 12 of 94
CSE106 Discrete Mathematics

Credit Hours 3 0 3
Contact Hours 3 Hours/Week for 13 Weeks + 0 3 Hours/Week for 13 Weeks +
Final Exam in the 14th week Final Exam in the 14th week
Prerequisite: CSE103 Structured Programming
Course Objective: This course builds up the students’ ability to think and express logically and
mathematically. The course will address mathematical reasoning, combinatorial analysis,
algorithmic thinking, and discrete structures. Knowledge of this course will be needed as
prerequisite knowledge for future courses such as CSE 110 Objected Oriented Programming,
CSE207 Data Structures, CSE246 Algorithms, CSE302 Database Systems, CSE366 Artificial
Intelligence, CSE405 Computer Networks, and CSE471 Compiler Design.

CO1 Interpret and apply propositional logic, predicate logic, and theorem proving for
mathematical reasoning.
CO2 Interpret and apply counting, permutations, and combinations for combinatorial
analysis.
CO3 Interpret and apply the growth of functions, complexity analysis of algorithms, and
integer algorithms for algorithmic thinking; demonstratethis knowledge and write report
for realistic problem solving.
CO4 Interpret and apply discrete structures such as sets, functions, relations, graphs, and trees
for modeling discrete objects; demonstratethis knowledge and write report for realistic
problem solving.

Levels
Propositional Logic, Propositional Equivalences CO1 C2, C3
Predicates and Quantifiers, Nested Quantifiers CO1 C2, C3
Rules of Inference, Introduction to Proofs CO1 C3
Mathematical Induction CO1 C3
Sets, Set Operations CO4 C2, C3
Functions CO4 C2, C3
Relations and Their Properties CO4 C2, C3
The Basics of Counting, The Pigeonhole Principle, CO2 C2, C3
Permutations and Combinations
Algorithms, The Growth of Functions, Complexity of CO3 C2, C3
Algorithms
Page 13 of 94
The Integers and Division, Primes and Greatest Common CO3 C2, C3
Divisor
Graphs, Graph Terminologies and Special Types of CO4 C2, C3
Graphs, Representing Graphs and Graphs Isomorphism
Introduction to Trees CO4 C2, C3
Assignments with reports and presentations CO3, CO4 C3, P3, A2

CO1 X
CO2 X
CO3 X X X X X X
CO4 X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, familiarity of issues.
CO3 PO1, PO2 Range of conflicting requirements, depth of analysis required, familiarity of
issues.

CO PO Attributes
CO3 (Assignment) PO10 Range of resources, Level of interaction, Familiarity
CSE110 Object Oriented Programming

Credit 3 1.5 4.5
Hours
week week
Prerequisite:CSE106 Discrete Mathematics
Course Objective: This course presents a conceptual and practical introduction to object
oriented programming (OOP). The course will cover general principles of programming in object
oriented frameworks to enhance transferable skills, such as programming, designing, and
Page 14 of 94
problem-solving skills. This course introduces object oriented concepts and develops OOP
programs which provides solutions to real world object oriented problems. Knowledge of this
course will be needed as prerequisite knowledge for future courses, such as CSE207 Data
Structures, CSE246 Algorithms, CSE370 Mobile Programming, and CSE425 Numerical
Methods.

CO1 Identify issues related to the definition, creation and usage of classes and objects.
CO2 Use the principles of inheritance and polymorphism and analyseproblemsfor design of
abstract classes and interfaces.
CO3 Apply programming skills and examine key issues to the design of object oriented
software.
CO4 Choose software tool, perform and demonstrate skills, and write report to design, build,
and test realistic object orientedprograms.

Levels
Implementclasses, objects, member functions and data CO1 C2
members, and also incorporate separating interface
Design object oriented program using flow control and CO2 C3, C4
control structures
Design object oriented program using functions and CO2 C3, C4
recursions
Design object oriented program using arrays, character, CO2 C3, C4
pointers, and dynamic memory allocation
Design object oriented program to implement arrays of CO3 C3, C4
objects, friend functions, constructors and destructors with
dynamic memory allocation.
Design object oriented program to implement multiple, CO3 C3, C4
multilevel, hierarchical, and hybrid inheritance, and virtual
base classes
Design polymorphic object-oriented program to implement CO3 C3, C4
pointers to base class, virtual members abstract base
classes, and pure virtual members
Design object oriented program to implement operator CO3 C3, C4
overloading, templates, and exception handling
Lab exercises CO4 C3, P2, P3, A2
Page 15 of 94
CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes

CO PO Attributes
CO4 PO5, PO10 Range of resources, Level of interaction, and Familiarity
CSE200 Computer-Aided Engineering Drawing

Credit Hours 0 1 1
Contact Hours 0 2 Hours/Week for 13 Weeks 2 Hours/Week for 13 Weeks
Prerequisite:None
Course Objective:This course introduces students to the standards and conventions of

engineering drawing. This course emphasizes on the use of CAD software to generate computer
models and technical drawings. The fundamental principles of orthogonal projections as well as
isometric projections and views are also covered in this course.

CO1 Understandand use drawing instruments and geometric constructions in creating
engineering drawings.
CO2 Applyand examine orthographic sketching techniques, orthographic projections of lines,
planes and solids.
CO3 Apply and examineisometric sketching techniques, isometric projections and conversion
of views.
CO4 Use AutoCAD to draw sectional views and multi-view projections, perform and
demonstrate these skills and write report on a complete design.
Page 16 of 94
Levels
Introduction to drawing instruments, Lines, Lettering and CO1 C2
Dimensioning.
Scales: Plain, Diagonal and Vernier Scale. CO1 C2, C3
Curves used in engineering practice: ellipse, parabola, CO1 C2, C3
hyperbola
Orthographic Projection, First & Third angle projection CO2 C3, C4
methods.
Projection of Lines: Oblique Lines, Traces. Applications of CO2 C3, C4
Projection of Lines.
Projection of Planes: Polygonal Lamina, Circular Lamina. CO2 C3, C4
Projection of Solids: Cube, Prism, Pyramid, Cylinder, CO2 C3, C4
Cone. Suspended Solids.
Isometric Projections: Isometric Lines, Planes and Scale. CO3 C3, C4
Conversion of given 2D views to Isometric CO3 C3
Projection/View.
Conversion of given 3D View to 2D representation. CO3 C3
Auto CAD Drafting: Drafting Basics, Drawing Commands, CO4 C3
Modify Commands.
Auto CAD Drafting: 2D and Isometric drawing, 3D CO4 C3
geometric, surface and solid modeling.
Mini Project CO4 C3, P2, P3, A2

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, Familiarity of issues
CO2 PO1, PO2, PO3 Range of conflicting requirements,
CO3 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required

CO PO Attributes
CO4 PO5, PO10 Range of resources, Level of interaction, Innovation, and Familiarity
Page 17 of 94
CSE207 Data Structures

Credit 3 1 4
Hours
week week
Prerequisite:CSE110 Object Oriented Programming
Course Objective:The course develops students' skills for designing and analyzing linear and
non-linear data structures. It strengthens students' ability to identify and apply the suitable data
structure for solving real world problems. Knowledge of this course will be needed as
prerequisite knowledge for future courses such as CSE246 Algorithms, CSE366 Artificial
Intelligence, CSE405 Computer Networks, CSE471 Compiler Design.

CO1 Understand and apply basic data structures for storage and retrieval of ordered and
unordered data.
CO2 Implement and characterize algorithms for creation and manipulation of data structures
like stacks, queues, linked list, etc.
CO3 Interpret and apply appropriate data structures for implementing problem solving
algorithms such as searching, insertion, deletion, traversing mechanism, etc., on various
data structures.
CO4 Compute and Characterize the efficiency of data structures for complex problem-
solving algorithms; perform and demonstrate this knowledge and write report for
realistic problem solving.

Levels
Pointers, Structures, dynamic memory allocation and Abstract CO1 C2, C3
Data Type
Linked List Implementation and its application CO1 C3
Stack Implementation and its Application CO2 C3, C4
Queue Implementation and its Application CO2 C3, C4
Iterative Solution and Recursive Solution design CO1 C2, C3
Basic Tree Concepts, Tree Traversals, Binary Trees and their CO2 C2, C3
applications
Page 18 of 94
Binary Search Trees, Insert, Delete, Search and Traversal CO3 C2, C3
Algorithms
AVL Tree CO3 C3
Binary Heap and Priority queue CO4 C3, C4
Graph representation, Terminology, Graph traversal CO4 C3,C4
techniques
Spanning Tree, MST, Shortest Path Problem CO4 C3, C4
Hashing: Methods, Hashed Search CO3 C3
Lab Exercises CO4 C3,P2, P3, A2
Mini Project CO4 C3, C4, P2, P3, A2

CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, familiarity of issues
CO2 PO1, PO3 Range of conflicting requirements, familiarity of issues
CO3 PO1, PO2, PO3 Range of conflicting requirements, familiarity of issues
CO4 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required, depth
of knowledge required, familiarity of issues

CO PO Attributes
CO4 (Assignment) PO10 Range of resources, Level of interaction,
Familiarity
CO4 (Mini Project) PO10 Range of resources, Level of interaction,
Familiarity
CSE209 Electrical Circuits

Credit 3 1 4
Hours
Contact 3 Hours/Week for 13 Weeks 2 Hours/Week for 13 5 Hours/Week for 13 Weeks
Hours + Weeks +
Page 19 of 94
Prerequisite: None
Course Objective: This course provides the students with fundamental knowledge ofanalyzing
electrical circuits. This course also provides hands-on experience in building and testing
electrical circuits. Knowledge of this course will be needed as prerequisite knowledge for future
courses such as CSE251 Electronic Circuits, CSE 345 Digital Logic Design, CSE 350 Data
Communications, CSE 360 Computer Architecture, CSE 442 Microprocessor and
Microcontroller, and CSE 490 VLSI design.

CO1 Discuss the concepts and applications of different electrical circuit variables and
elements.
CO2 Explainand usefundamental laws and theorems for circuit analysis.
CO3 Apply and examinecircuit laws, theorems, and solution techniques for solving electrical
circuits.
CO4 Use software and circuit tools, perform and demonstrate skills and write report to
design, build and test electrical circuits.

Course Topic CO Learning/
Assessment Levels
Basic Concepts of DC circuit, charge and current, voltage, power CO1 C2
and energy, Circuit elements.
Ohm’s Law, Kirchhoff’s Voltage Law, Kirchhoff’s Current Law, CO2 C2, C3
Series-Parallel connections, Voltage and Current Division, Wye-
delta Transformations.
Circuit Analysis Methods: Nodal and Mesh methods CO3 C3
Linearity and Superposition, Source Transformation, Thevenin and CO2 C2, C3

Norton’s equivalents, Maximum power transfer.
Basic Concepts of AC circuit, Sinusoids, Phasors, Phasor CO1 C2
relationships for Circuit Elements, Impedance and admittance.
Kirchhoff’s laws in Frequency domain, Impedance Combinations, CO3 C2, C3
Superposition, Source Transformation, Thevenin and Norton
equivalents, Nodal and Mesh Analysis
Instantaneous and average power; Maximum average power CO3 C2
transfer, Effective or RMS value, apparent power and power
factor, Complex power
Page 20 of 94
Mini project CO4 C3, P2, P3, A2

CO1 X
CO2 X
CO3 X X
CO4 X X X X X

CO PO Attributes

CO PO Attributes
CO4 PO5, PO10 Range of resources, Level of interaction, and Familiarity
CSE246Algorithms

Credit 3 1.5 4.5
Hours
week week
Prerequisite: CSE207 Data Structures
Course Objective:This course introduces students to the general tools and techniques for
analyzing and designing computer algorithms. Initially necessary mathematical preliminaries
required for analyzing and designing computer algorithms are taught. Then this course
familiarizes students with several algorithmic approaches and corresponding problems.
Knowledge of this course will be needed as prerequisite knowledge for future courses such as
CSE366 Artificial Intelligence, CSE405 Computer Networks, and CSE471 Compiler Design.
Page 21 of 94
CO1 Discuss and determinethe computational complexities ofalgorithmsfor performance
analysis.
CO2 Discuss, applyand explainappropriate algorithmic design approaches for modeling
engineering and computational problems in different domains.
CO3 Apply major algorithmic techniques forgraph problems.
CO4 Choose and examinedifferent algorithms; perform and demonstrate skills and write
report to design, build, and testcomplex computational problems.

Levels
Introduction to algorithms, complexity analysis, asymptotic CO1 C2, C3
notations, typical running time functions, classifying
functions by their asymptotic growth rates etc.
Graphs, graph based algorithm - breadth-first search (BFS), CO3 C3
depth-first search (DFS), edge identification.
Modification of DFS to find the Topological sort, strongly CO3 C3
connected component, articulation points, bridges and bi-
connected components.
Sorting algorithms: selection sort, bubble sort, insertion CO1 C2, C3
sort, mergesort, quicksort, heap sort. Minimal spanning
tree: basic terminology, applications and algorithms
Single source shortest path algorithms: Dijkstra’s CO3 C3
algorithm, Bellman-Ford algorithm, shortest path in DAG.
Floyd-Warshall algorithm, Transitive closure. Algorithm CO3 C3
strategy, structure and problem types.
Divide and Conquer algorithms: Binary search, Closest CO2 C2, C3
pair of points, Counting inversion. Greedy algorithms:
Coin changing, fractional Knapsack, Huffman codes,
Optimal codes, Activity selection. Suitability of all these
algorithms in greedy approach.
Dynamic programming (DP) and Memorized algorithms: CO2 C2, C3
Longest increasing subsequence (LIS), 0-1 Knapsack,
Longest common subsequence (LCS), Rock climbing.
Network Flow, Max Flow, Min-Cut, Residual Network, CO2 C3, C4
Augmenting paths, Ford-Fulkerson and Edmonds-Karp
algorithms.
Euclid’s algorithm for GCD, Extended Euclid’s algorithm CO2 C2, C4
and Number theoretic algorithms.
Recurrence relation. Iteration, Substitution, Recursion tree CO1 C2, C3
and Master methods.
Page 22 of 94
Pattern matching and String matching algorithms (Rabin- CO2 C3, C4
Karp algorithm). Computing the transition function and
diagram for Strings.
P and NP classes, algorithm completeness, discussion on CO2 C3, C4
other complex techniques of algorithm design and analysis.

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X

CO PO Attributes
CO2 PO1,PO2, PO3 Range of conflicting requirements
CO3 PO1,PO2, PO3 Range of conflicting requirements, Depth of analysis required

CO PO Attributes
CO4 (Mini PO10 Range of resources, Level of interaction, Innovation, and
Project) Familiarity
CSE251 Electronic Circuits

Credit 3 1 4
Hours
week week
Prerequisite: CSE209 Electrical Circuits
Course Objective:This course provides fundamental knowledge of electronic devices such as

semiconductor diodes, operational amplifiers (op-amp), bipolar and field effect transistors and
their use in the design and analysis of useful electronic circuits. This course also emphasizes on
building, testing and analyzing performance of electronic circuits. Knowledge of this course will
be needed as prerequisite knowledge for future courses such as CSE345 Digital Logic Design,
Page 23 of 94
CSE350 Data Communications, CSE360 Computer Architecture, CSE442 Microprocessor and
Microcontrollers and CSE490 VLSI Design.

CO1 Understandthe operation and characteristics of different electronic circuit elements.
Discuss and determinethe responses of electronic circuits for appropriate
CO2
applications.
Applyand examine the concept of basic electronic devices to design different
CO3
electronic amplifiers and instrumental circuits.
Use software and circuit tools, perform and demonstrate skillsand write report to
CO4
design, build and test electronic circuits.

Levels
Operation and characteristics of semiconductor CO1 C2
diode,Load-line analysis.
Applications of Diode: Rectifier circuits. CO2 C2, C3
Applications of Diode: Clipperand Clamper. CO3 C3, C4
Operation and Characteristics of ideal Op amp, Comparator CO1 C2
circuits.
Application of Op amp: Inverting and non-inverting, CO2 C2, C3
Voltage follower, Adder and Difference amplifiers,
Integrator and Differentiator.
Design of different amplifier and instrumentation circuits CO3 C3, C4
using op-amps.
Device Structure and Physical Operation of BJT, Modes of CO1 C2
Operation, Current-Voltage Characteristics.
BJT as an amplifiers and switch, DC biasing and small CO2 C2, C3
signal operations of BJT.
Device Structure and Physical Operation of MOSFET, CO1 C2
Modes of Operation, Current-Voltage Characteristics,
Channel Length Modulation Effect.
MOSFET as an Amplifier and Switch, DC biasing and CO2 C2, C3
small signal operations of MOSFET.
Small signal equivalent models of MOSFET, Designing CO3 C3, C4
different circuit parameters of MOSFET.
Mini Project CO4 C3, P2, P3, A2
Page 24 of 94
CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X

CO PO Attributes

CO PO Attributes
CSE302 Database System
Credit Hours andTeaching Scheme:

Credit 3 1.5 4.5
Hours
Contact 3 Hours/Week for 13 Weeks 3 Hours/Week for 6 Hours/Week for 13 Weeks +
Hours + 13 Weeks Final Exam in the 14th week
Final Exam in the 14th week
Prerequisite:CSE106Discrete Mathematics
Course Objective:This course introduces the fundamental concepts and practices of designing
and implementing database system. It also enables the student to design and perform complex
query operations on relational databases. It builds the capability of optimizing the databases
efficiently by applying different techniques. Knowledge of this course will be needed as
prerequisite knowledge for future courses such as CSE347 Information System Design,
CSE412Software Engineering, CSE430Software Testing and Quality Assurance, and CSE487
Big Data Analytics.
Page 25 of 94
CO1 Understand basic concepts of relational database,constructand interpret algebraic
expressions to represent relations.
CO2 Performand organizedifferent query operations for data manipulation.
CO3 Discuss, use and examine different models and optimization techniques to design
efficient relational database system.
CO4 Useand examinesoftware tools, demonstrate skills and write report to design, build and
test real life database.

Levels
Introduction to Database Management Systems and CO1 C2
relational model
Writing Queries using SQL (basic to advanced level CO2 C3, C4
Structured Query Language)
Using relational algebra for representing relations CO1 C3, C4
Designing a database using E-R Model CO3 C3, C4
Database Indexing and Hashing Techniques CO3 C2, C3
Basic concept of transactions and concurrency control CO3 C2, C3
protocols
Database Normalization, Lossy Decomposition, CO3 C4
Functional Dependency, First, second and third normal
Form, Boyce-Codd Normal Form
Lab Exercises CO4 C3, C4, P3
Mini Project CO4 C3, C4, P3, A2

CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X X
Page 26 of 94
CO PO Attributes
CO1 PO1 Range of conflicting requirements, Depth of knowledge
required
CO2 PO1, PO2 Range of conflicting requirements, Depth of analysis required,
Familiarity of issues
CO3 PO1, PO2, PO3 Range of conflicting requirements, Depth of analysis required,

CO PO Attributes
CO4 (Mini Project) PO5, PO10 Range of resources, Level of interaction, Familiarity
CSE325: Operating Systems

Credit 3 1 4
Hours
Contact 3 Hours/Week for 13 Weeks + 2 Hours/Week 5 Hours/Week for 13 Weeks +
Hours Final Exam in the 14th week for 13 Weeks Final Exam in the 14th week
Prerequisite: None
Course Objective:This course introduces the principles and techniques for the design and
implementation of operating systems. This course also emphasizes the implementationof various
techniques required for management, scheduling, allocation and communication of resources
used in operating system.Knowledge of this course will be needed as prerequisite knowledge for
future courses such as CSE360 Computer Architectureand CSE452 Distributed Systems and
Algorithms.

CO1 Interpret,use, and characterizedifferent components of modern operating system for
examining design goals.
CO2 Describe, use, and characterizedifferent methods of resource management and
communication for operating system performance analysis.
CO3 Interpret,apply,and characterize resource management techniques for solving
resource constained problems.
CO4 Interprete, apply, characterize, and justify memory organization and I/O mangement
techniques; implement functional, pre-emptive, multi-tasking operating system
modules including scheduler, file manager, memory manager, storage manager, and
synchronization components; demonstrateand masterthese knowledge and write
report for realisticproblem solving.
Page 27 of 94
Course Topic CO Learning/AssessmentLevels
Basic concept of operating system CO1 C2, C3
Operating systems Hardware Interaction CO1 C2, C3, C4
Process and thread management CO2 C2, C3, C4
Inter Process Communication (IPC) CO2 C2, C3, C4
Scheduling algorithms for multi-tasking CO3 C2, C3
Mutual exclusion principles and deadlock CO3 C2, C3, C4
handling
Memory and I/O management CO4 C2, C3, C4, C5
Storage Management CO4 C2, C3, C4, C5
Implementing File Management CO3 C2, C3
Mini projects with reports and presentations CO4 C4, C5, C6, P3, P4, A3

CO1 X X
CO2 X X X
CO3 X X X
CO4 X X X X X X X X
Range of Complex Problem Solving

CO PO Attributes
CO2 PO1,PO2 Range of conflicting requirements, Consequences
CO3 PO1, PO3 Range of conflicting requirements, Depth of knowledge required,
Ezxtent of applicable codes, Interdependence, Consequences
CO4 PO1, PO2, Depth of analysis required, Depth of knowledge required,
PO3 Familiarity of issues, Extent of applicable codes, Interdependence
Range of Complex Engineering Activities

CO PO Attributes
CO4 PO5,PO10 Range of resources, Level of interaction, Innovation, Familiarity
CSE345 Digital Logic Design

Credit 3 1 4
Hours
Page 28 of 94
Prerequisite: CSE251Electronic Circuit
Course Objective:This course introduces the fundamental concepts and practices of gate-level
and MSI-level design of digital circuits. This course also emphasizes computer-aided design of
digital circuits using Verilog Hardware Description Language (HDL). Knowledge of this course
will be needed as prerequisite knowledge for future courses such as CSE360 Computer
Architecture and CSE442 Microprocessors and Microcontrollers.

CO1 Interpret and applybinary number system and Boolean algebra for design and analysis of
combinatorial and sequential circuits.
CO2 Apply and examine Boolean algebraic techniques for combinational circuit design and
analysis.
CO3 Apply and examine state transition techniques for sequential circuit design and analysis.
CO4 Choose software and hardware tools, perform and demonstrate skills, and write report
to design, build, and test digital circuits.

Levels
Binary number system, binary arithmetic, and Binary codes CO1 C2
Boolean algebra, Logic gates CO1 C2, C3
Minimization of Boolean functions using K-map CO1 C3
Combinational circuit design and analysis CO2 C3, C4
Design of parallel adder/subtractor CO2 C3
Design and use of encoder and decoder CO2 C3
Design and use of multiplexer and demultiplexer CO2 C3
Design of Combinational circuits using Verilog HDL CO2 C3
Flip-Flops CO3 C3
Representation and analysis of sequential circuits CO3 C3, C4
Design of sequential circuit CO3 C3
Design of registers CO3 C3
Design of counters CO3 C3
Design of sequential circuits using Verilog HDL CO3 C3

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X
Page 29 of 94
CO PO Attributes

CO PO Attributes
CSE347 Information System Analysis and Design

Credit 3 1 4
Hours
week week
Prerequisite: CSE302 Database Systems
Course Objective:This course introduces the knowledge and skills required to analyze and
design information system. This course will focus on analysis, design, development, and
implementation of organizational information systems. Knowledge of thiscourse will be needed
as prerequisite knowledge for future courses such as CSE412 Software Engineering, CSE423
Software Architecture, CSE425 Human Computer Interactions, and CSE430 Software Testing
and Quality Assurance.

CO1 Understandproject management and system development life cycle.
CO2 Analyze feasibility and construct application architecture and modeling.C3C4
CO3 Design and examineinformation systems.
CO4 Chooseand examinesoftware and hardware tools, perform and demonstrate skills, and
write report to design, build, and test information systems.

Levels
Introduction to Information System Analysis and Design CO1 C2
Project management CO1 C2
System development life cycle CO1 C2
Requirements analysis, sampling and investigating data CO2 C3
Page 30 of 94
Modeling system requirements CO2 C3
Feasibility Analysis CO2 C3
Application Architecture and Modeling CO2 C3, C4
Input-Output design and prototyping CO3 C3, C4
User Interface design CO3 C3, C4
Object‐Oriented Design and Modeling CO3 C3, C4

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO4 PO2, PO3 Range of conflicting requirements, familiarity of issues

CO PO Attributes
CSE360 Computer Architecture

Credit Hours 3 0 3
Prerequisite:CSE325 Operating Systems
Course Objective:The objective of this course is to study the structure, behaviour, and
characteristics of computer systems. This course will exhibit the design of the various functional
units of digital computers, discuss different types of memories and their properties, and introduce
basics of parallel computer architecture. Knowledge of this course will be needed as prerequisite
knowledge for future course, such as CSE442 Microprocessors and Microcontrollers and
CSE493 Embedded Systems.
Page 31 of 94
CO1 Understand the architectural concept of digital computers.
CO2 Understand,determine and analyze performance of processor, memory, and I/O
subsystems.
CO3 Understand, implement, examine, and justify instruction set design for performance
improvement, execute and demonstratethis knowledge,and write reportfor problem
solving.
CO4 Implement, examine, and justify processor and control unit design,executeand
demonstratethis knowledge, andwrite report to synthesize functional units of digital
computers.

Levels
Computer Fundamentals: development history of computer CO1 C2
hardware and software, review of computer functions and
sturctures, and performance evaluation of the computer
system
Computer interconnection structructures: bus CO2 C2, C3
interconnection, PCI, future Bus plus
Computer memory system: cache memory principles, CO2 C3, C4
element of cache design, Pentium and PowerPC cache
organization
Computer memory system: Internal memory, CO2 C3,C4
semiconductor main memory, error correction, advanced
DRAM organization
Computer memory system: external memory, magnetic CO2 C3
disk, RIAD, optical memory, and magnetic tape
Input/Output: External Devices, I/O modules, Programmed CO2 C3,C4
I/O, Interrupt-driven I/O
Input/Output: Direct memory access, I/O channels and CO2 C3, C4
processors, external interface
Computer Arithmetic: ALU, Interger representation and CO3 C2, C3
arithmetic, and floating point representation and arithmetic
Instruction Sets: Machine instruction, operands, operations, CO3 C4, C5
and assembly language, Instruction Sets: addressing, and
instruction format
CPU structure and function: processor and registers CO4 C4, C5
organization
CPU structure and function: instruction cycle and CO4 C3, C4
instruction pipelining
RISC: instruction execution, registers, and RISC CO4 C3, C4
architecture
Assignments with reports and presentations CO3, CO4 C4, C5, P2, P3, A2
Page 32 of 94
CO1 X
CO2 X X
CO3 X X X X X X
CO4 X X X X X X

CO PO Attributes
CO3 PO1, PO2,PO3 Range of conflicting requirements, depth of analysis required
CO4 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required

CO PO Attributes
CSE370 Mobile Programming

Credit 3 1 4
Hours
week week
Prerequisite:CSE110 Object Oriented Programming
Course Objective:The objective of this course is to build up the programming knowledge for
mobile devices. This course also emphasizes software and hardware interfacing, cross platform
programming, and networking and testing of mobile program.Knowledge of this course will be
needed as prerequisite knowledge for CSE489 Mobile Application Development.
Page 33 of 94
CO1 Understand the aspects of programming for mobile devices.
CO2 Understand and applysoftware and hardware interfacing for mobile programming.
CO3 Understand, use, and justify cross platform programming, networking and testing of
mobile devices.
CO4 Chooseand justifysoftware tools, perform and demonstrate skills, and write report to
design, build, and test software for mobile programming.

Levels
Introduction to Mobile programming CO1 C2
Exploring new hardware capabilities and requirement for CO1 C2
mobile programming
Mobile hardware and other interfacing aspect CO2 C2, C3
Software life cycle implementation in mobile devices CO2 C3
Mobile cross platform programming CO3 C2, C3
Design interfaces for mobile devices CO3 C2, C3
End user requirement handling CO3 C2, C3
Networking and testing of mobile program CO3 C3, C4

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, Depth of knowledge required,
familiarity of issues.
CO2 PO1, PO2, PO3 Range of conflicting requirements, Depth of knowledge required,
familiarity of issues, Interdependence.
Depth of analysis required, familiarity of issues, Interdependence.

CO PO Attributes
Page 34 of 94
CSE399Cyber Ethics and Legal Framework

Credit Hours 3 0 3
Prerequisite:none
Course Objective: This course builds up the concepts of ethical and legal framework in the
context of computing and information technology. With in-depth analysis of several moral and
legal issues related to computing and IT, this course prepares the student to act in compliance
with the ethical and applicable legal frameworks, towards becoming a professional.

CO1 Interpretand comply with the professional codes of conduct and ethical frameworks as
an ICT professional.
CO2 Describeand comply withthe legislation related to ICT and Computer Science and
Engineering.
CO3 Interpret, apply, and justify the standard ethical frameworks within computing.
CO4 Analyze, evaluate and formulate documents, terms and policies related to computing
profession, in accordance with the legal frameworks; demonstrate these knowledge and
write report justifying the actions and policies.

Learning/Assessment
Course Topic CO
Levels
Computer and Information Ethics at Stanford CO1 C2, C3
Encyclopedia of Philosophy
ACM Code of Ethics and Professional Conduct CO1 C2, C3
Software Engineering Code of Ethics and Professional CO1 C2, C3
Practice
Data Protection Act, Computer Misuse Act, Impact of CO2 C2, C3
the Computer Misuse Act
Copyright, Designs and Patents Act, Freedom of CO2 C2, C3
Information Act, Security of Internet Communications
Bangladesh: Information Communication Technology CO2 C2, C3
Act of 2006 and its amendment in 2013
Bangladesh: Copyright Act of 2000 CO2 C2, C3
Bangladesh: Telecommunication Regulatory Act of CO2 C2, C3
2001
Pornography: Pornography Act 2012 CO2 C2, C3
Page 35 of 94
Ethical Frameworks: Deontological Ethics (Duty-based CO3 C2, C3
ethics), Utilitarian ethics (Outcome-based ethics),
Aristotelian ethics (Virtue ethics)
Applications of Ethical Frameworks: Deontological CO3 C3, C4
Ethics (Duty-based ethics), Utilitarian ethics (Outcome-
based ethics), Aristotelian ethics (Virtue ethics)
Assignment with presentation (Analysis, Evaluation, and CO4 C4, C5, C6
Design of Terms of Service (ToS), End User License P3, A2
Agreement (EULA), Privacy Policy)

CO1 X X X
CO2 X
CO3 X X
CO4 X X X X

CO PO Attributes
CSE405Computer Network

Credit 3 1 4
Hours
week week
Prerequisite:CSE246 Algorithms
Course Objective:This course explores the field of computer networking and communication,
emphasizing network architecture and software issues. Student will learn the basic performance
and engineering trade-offs in the design and implementation of computer networks. Knowledge
of this course will be needed as prerequisite knowledge for future courses such as CSE406
Internet of Things,CSE453 Wireless Networks, and CSE457 Cellular Networks.
Page 36 of 94
CO1 Understand, use, and characterizenetwork layers and related issues for designing
computer networks.
CO2 Understand, use, analyze, and justifydifferent network algorithms and protocols for
effective design of computer networks.
CO3 Design networks and subnets with IP calculations.
CO4 Choose software tools, perform and demonstrate skills,and write report for designing,
testing, and evaluating complex computer networks.

Levels
Introduction to computer networks, layers, transmission CO1 C2
media
Data link layer design issues, framing. CO1 C2, C3
Protocol verification: finite state machine & petri net CO1 C3,C4
models
MAC, Channel allocation problem, CSMA/CD CO2 C3, C4,C5
Contention period, BEB CSMA CO2 C3,C4
Collision-free protocols: bit-map, binary countdown, CO2 C5
limited contention protocol
Introduction to network layer,distance vector routing, CO2 C2
count-to-infinity problem
Link state routing, Hierarchical routing, Broadcast & CO2 C2
Multicast routing
Internet Protocol (IP), IPv4 header, IP addresses and CO3 C3
subnets
Network address translation (NAT), ICMP, ARP, RARP, CO1 C3, C4
BOOTP, DHCP
QoS, leaky bucket algorithm, token bucket algorithms, CO2 C2
RSVP, Internetworking, tunneling, fragmentation
Congestion and congestion control algorithms in network CO3 C3
layer
Transport service, primitives, connection establishment, CO1 C3
data transfer & connection release
TCP/UDP header, Congestion control in Transport layer CO2 C3
Page 37 of 94
CO1 X
CO2 X X X
CO3 X X X X
CO4 X X X X X X

CO PO Attributes
CO3 PO1, PO2, PO3 Depth of knowledge required, Range of conflicting
requirements

CO PO Attributes
CSE 412 Software Engineering

Credit 3 1 4
Hours
Prerequisite: CSE347 Information System Analysis and Design
Course Objective: The objective of this course is to learn different principles and practices of
modern software engineering. It also builds the understanding of the challenges faced in the
industry and their resolutions. This course enhances the skills of using different modern tools and
languages to analyze, design and evaluate a real-life complex software system. These software
engineering knowledge will be needed in CSE430 Software Testing and Quality Assurance
course.

CO1 Identifyand useappropriate software development model for developing software
projects.
CO2 Understand and analyze software requirements and apply tools for software modeling.
CO3 Use and examine different software testing techniques and estimate project costs for
project evaluation.
CO4 Select, use, and justify different software tools; demonstrate skills and write report to
design, build, and test software for complex real-life applications.
Page 38 of 94
Levels
Introduction to Software Engineering, review of CO1 C2
Software development lifecycle (SDLC)
Overview of Software Process Models, Prototyping CO1 C2
Iterative process models, Incremental software CO1 C2, C3
development, Agile Software Development, Agile – UX
and Lean - UX, Extreme programming, SCRUM
Software requirements, Requirement analysis, CO2 C2, C3
Requirement elicitation techniques and Questionnaire
Designing
Software modeling, UML diagrams, Behavioral CO2 C3, C4
modeling: Use case diagram &class diagram
Interaction diagrams:Sequence and activity diagram CO2 C3, C4
Code complexity analysis: Cyclomatic complexity, CO3 C3, C4
Halstead’s complexity
Project cost estimation techniques, Functional Point CO3 C3, C4
Analysis, FP counting method for determining software
cost
Software Testing Basics- white box & black box testing, CO3 C4, C5
UAT, Integration and System Testing
Lab exercises CO4 C3, C4, P3, A2
Mini project CO4 C5, P3, A2

CO1 X
CO2 X X
CO3 X
CO4 X X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, Depth of knowledge required
CO2 PO2 Range of conflicting requirements, Depth of analysis required,
CO3 PO2
CO4 PO2, Extent of applicable codes, Depth of analysis required, Familiarity of
PO3 issues
Page 39 of 94
CO PO Attributes
CO2 (Assignment) PO5 Range of resources, Level of interaction
CO4 (Project) PO5, PO10 Range of resources, Level of interaction, Familiarity
CSE442 Microprocessors and Microcontrollers

Credits Hours 3 1 4
Contact Hours 3 Hours/Week for 13 2 Hours/Week for 5 Hours/Week for 13 Weeks +
Weeks + Final Exam in 13 Weeks Final Exam in the 14th week
the 14th Week
Prerequisite: CSE360 Computer Architecture
Course Objective: This course provides basic concept of architecture of microprocessor,

addressing mode, interfacing of bus and memory with microprocessor, and handling of
interrupts. The course also addresses interfacing of microcontroller with peripheral devices.
Knowledge of this course will be needed as prerequisite knowledge for CSE493 Embedded
Systems.

CO1 Understand, use, and examine the architecture and instruction sets of microprocessor.
CO2 Use and examineinterfacing of bus and memory with microprocessor.
CO3 Implement and examineinterfacing of microcontroller with peripheral devices.
CO4 Use, examine, and justifydifferent hardware and software tools;demonstrate skills, and
write report to design, build, and test microprocessor and microcontroller based systems.
Course Contents and Learning/Assessment Levels:

Levels
Introduction to microprocessors, Memory and I/O system CO1 C2
Architecture of Microprocessor and its Registers CO1 C3, C4
Addressing Modesof Microprocessor CO1 C3, C4
Hardware Specificationsof Microprocessor CO1 C3
Memory Interfacing CO2 C4
Interrupts handling CO2 C3
Microcontrollers and Embedded Processors, Structure and CO3 C3, C4
Functions of Microcontroller
Addressing Modes of Microcontrollers CO3 C3
Programming of Microcontroller using Assembly Language CO3 C4
Interfacing Microcontroller and Peripherals CO3 C3, C4
Interrupts of Microcontroller CO3 C4
Page 40 of 94
Lab exercises CO4 C3, C4, P3, A2
Mini project CO4 C5, P3, A2

CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO2 PO1,PO3 Range of conflicting requirements
CO3 PO1,PO2,PO3 Range of conflicting requirements
CO4 PO2, PO3 Range of conflicting requirements, Depth of analysis required,
Depth of knowledge required

CO PO Attributes
CO4 (Mini Project) PO5, PO10 Range of resources, Level of interaction, Innovation, and
Familiarity
CSE479 Web Programming

Credit 3 1 4
Hours
week week
Prerequisite: CSE302 Database Systems

Course Objective:The objective of this course is to build up knowledge on different tools and
techniques for real world web applications.Student will learn to develop static and dynamic web
applications.Knowledge of this course will be needed as prerequisite knowledge for CSE489
Mobile Application Development.
Page 41 of 94
CO1 Understand the basic concept and technology of web application development and its
architecture for developing static web applications.
CO2 Use web programming languages for developing dynamic web applications.
CO3 Apply and examine security tools and techniques for developing secured web
applications.
to design, build, and test web applications.

Levels
Web Fundamentals, Programming Languages CO1 C2
for the Web
HTML Basics and the working environment CO1 C2
Fundamentals of PHP language CO1 C2
HTML with PHP, forms, sessions,cookies, etc. CO2 C3
CSS and templates CO2 C3
Database manipulation in PHP CO2 C3
Programming the browser and forms withJavaScript CO2 C3
Dynamic programming using Asp.net CO2 C3
AJAX basics,DHTML CO3 C3
Security pitfalls and basic solutions CO3 C3, C4

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes

CO PO Attributes
Page 42 of 94
CSE487 Computer and Cyber Security

Credit Hours 3 0 3
Prerequisite: CSE405 Computer Networks
Course Objective:This course builds up the fundamental concepts of cryptography, computer

security and cyber security. Standard methodologies and tools for the evaluation and application
of organizational security policies related to confidentiality, integrity and availability will also be
covered.

CO1 Interpretthe basic concepts related to computer security, and identify security
vulnerabilities of networked systems.
CO2 Interpret and apply cryptographic algorithms for authentication, cryptanalysis and
steganography.
CO3 Interpret, use, and analyze the security threats on networked systems, assess the existing
state of security and deduce realistic security policies.
CO4 Examine and justifyrealistic prevention of intrusion and disaster recovery; demonstrate
this knowledge and write report justifying the actions and policies.

Levels
Fundamental concepts of computer security CO1 C2, C3
Well-known attack types and vulnerabilities CO1 C2
Social engineering attacks CO1 C2
Cryptography and classical cryptosystems CO2 C2, C3
Authentication protocols and Public Key CO2 C2, C3
Infrastructure
IPSec, VPNs, E-commerce issues CO2 C2, C3
Attack classification and vulnerability analysis CO3 C2, C4
Security models and policy issues CO3 C2, C4, C6
Security evaluation and auditing of networked CO3 C4, C5, C6
systems
Intrusion Detection, Prevention, Response, CO3 C2, C3
Containment (Digital forensic evidence) and Disaster
Recovery
Network defense tools: Firewalls, VPNs, Intrusion CO3 C2, C3
Detection, and filters
Page 43 of 94
Assignment with report and presentation CO4 C4, C5, P3, A2

CO1 X
CO2 X X X X X
CO3 X X
CO4 X X X X X X

CO PO Attributes
CO2 PO1, PO2, PO3 Range of conflicting requirements, familiarity of issues.
CO3 PO1, PO2 Range of conflicting requirements, depth of analysis required,
CO4 PO2, PO3 Range of conflicting requirements, familiarity of issues.

CO PO Attributes
CO4 (Assignment) PO5, PO10 Range of resources, Level of interaction, Familiarity
CSE400 Capstone Project

Credit Hours 0 1 in the 1st semester (X grade) 6
2 in the 2nd semester (X grade)
3 in the 3rd semester (grade on total 6 credits)
Contact Hours 0 2 Hours/Week for 13 Weeks in the 1st semester 156 Hours in a year
4 Hours/Week for 13 Weeks in the 2nd semester
6 Hours/Week for 13 Weeks in the 3rd semester
Prerequisite:Students must complete at least 105 credits.
Course Objective:Capstone is a metaphor used to describe a final achievement that builds upon
previous works and encapsulates them. This course is intended to provide a culminating
experience that allows a student to demonstrate proficiency in several of the learning outcomes
that are set forth by students’ degree program.Capstone project will integrate multidisciplinary
subjects and professional skills that are difficult to impart in a traditional lectured course.
Page 44 of 94
CO1 Identify and examine various problem domains (literature review); justify and finalize
problem statement; write project proposal for the capstone project.
CO2 Perform and completerequirement analysis; outline, justify, and finalize design
methodologies for the finalized project.
CO3 Design hardware and/or software for the finalized project incorporating societal,
environmental, and ethical considerations; build the proposed system incorporating
project management and financial principles and justify (test) the deliverable system.
CO4 Use different visualization tools andwrite and present (oral and/or poster) technical
report incorporating different evaluation matrices including efficiency, cost; and ethical,
societal, economic, and environmental impacts.
The capstone project will consists of the work on the topic finalized for the project. The project
must be done in a group of three to four students.
Work Component and Assessment Levels

Levels
Finalization of problem statement CO1 C2, C4, C5, C6, A2
Design methodology CO2 C4, C5, C6, P2, P3
Designing and building of deliverable system CO3 C3, P3, A3
Technical report and presentation CO4 C3, A2, A3

CO1 X X X X X
CO2 X X X X X X
CO3 X X X X X X X X X X
CO4 X X X X X X X X

CO PO Attributes
CO1 PO1, PO2, PO4 Range of conflicting requirements, Depth of analysis
required, Depth of knowledge required, Familiarity of issues,
Extent of applicable codes, Extent of stakeholder
involvement and level of conflicting requirements,
Consequences, Interdependence
CO2 PO1, PO2, PO4 Range of conflicting requirements, Depth of analysis
Page 45 of 94
CO3 PO1, PO2, PO3, Range of conflicting requirements, Depth of analysis
PO4 required, Depth of knowledge required, Familiarity of issues,
CO4 PO1 Range of conflicting requirements, Depth of analysis

CO PO Attributes
CO2 PO10 Range of resources, Level of interaction, Innovation, Consequences to
society and the environment, Familiarity
CO3 PO5 Range of resources, Level of interaction, Innovation, Consequences to
CO4 PO5, PO10 Range of resources, Level of interaction, Innovation, Consequences to
Page 46 of 94
Course Descriptions:Elective Computer Science and Engineering Courses
CSE313 Theory of Computation

Credit Hours 3 0 3
Prerequisite: CSE246 Algorithms
Course Objective: This is an elective course and builds up the students’ theoretical
understanding of different models of computation and their limitations. The course will address
Finite Automata and Regular Expressions, Context-Free Grammars and Pushdown Automata,
Turing Machines and Undecidability, and Complexity Theory. Knowledge of this course will be
needed as prerequisite knowledge for CSE471 Compiler Design course.

CO1 Demonstrate and use Finite Automata and Regular Expressions as model of
computation; use these knowledge and write report in real-life problem.
CO2 Demonstrate and use Context-Free Grammar and Pushdown Automata as model of
computation; use these knowledge and write report in real-life problem.
CO3 Demonstrate, use, and characterize Turing Machines and Undecidability as model of
real world computation and its limitation; use these knowledge and write report in real-
life problem.
CO4 Demonstrate and use Complexity Theory to determine resources required by an
algorithm; use these knowledge and write report in real-life problem.

Levels
Finite Automata CO1 C2, C3
Regular Expressions CO1 C2, C3
Nondeterminism CO1 C2, C3
Properties of Regular Languages CO1 C2, C3
Context-Free Grammars CO2 C2, C3
Pushdown Automata CO2 C2, C3
Grammars and Equivalences CO2 C2, C3
Properties of Context-Free Languages CO2 C2, C3
Turing Machines CO3 C2, C3
Variations of Turing Machines CO3 C2, C3
Decidable Problems CO3 C3, C4
Page 47 of 94
Undecidability CO3 C3, C4
Time Complexity CO4 C2, C3
Space Complexity CO4 C2, C3
NP-Completeness CO4 C2, C3
Assignments with reports and presentations CO1, CO2, C3, P3, A2
CO3, CO4

CO1 X X X X
CO2 X X X X
CO3 X X X X X X
CO4 X X X X X

CO PO Attributes
CO3 PO1, PO2, Range of conflicting requirements, depth of analysis required, familiarity of
PO3 issues.
CO4 PO1, PO2 Range of conflicting requirements, depth of analysis required,familiarity of
issues.

CO PO Attributes
CO1, CO2, CO3, CO4 PO10 Range of resources, Level of interaction,
(Assignment) Familiarity
CSE 350: Data Communications

Credits 3 0 3
Prerequisite:CSE 251 Electronic Circuits
Course Objective: This course includes the evolution trend of computer networks and the
procedure of transmitting data over the network by resolving the conflicting issues arising in the
course of transmission. The key aspects of transmission, interfacing, link control, and
multiplexing are examined.
Page 48 of 94
CO1 Interpret data communication concepts, backbone, protocols and architecture.
CO2 Apply and analyze data transmission mechanisms.
CO3 Apply and analyze different aspects of reliability in data communication; demonstrate
skills and write report on data communication problems.
CO4 Apply and examine data transformation techniques for effective data communication;
demonstrate skills and write report on data communication problems.

Levels
Data communication model, communication tasks CO1 C2
Introduction to network standard and protocols, Protocol CO1 C2

Architecture: OSI standard protocol, TCP/IP protocol suite
Analog and Digital Transmission CO2 C2
Transmission impairments, Channel Capacity: Nyquist, CO2 C2, C3
Shannons
Guided transmission media, Wireless transmission media, CO2 C2, C3
wireless propagation
Signal encoding techniques CO2 C3
Synchronous Transmission, Asynchronous Transmission CO3 C2, C3
Interfacing CO3 C2
Types of errors, Error detection: parity check, CRC, CO3 C2, C3
checksum
Error correction: Hamming code
Flow control techniques– stop-and-wait, sliding window, CO3 C2, C3
HDLC
ARQ techniques– stop-and-wait ARQ, go-back-n ARQ, CO3 C2, C3
selective reject
Multiplexing – FDM, TDM, WDM CO4 C4
Assignments with reports and presentations CO3, C3, P3, A2
CO4

CO1 X
CO2 X X
CO3 X X X X X X X
CO4 X X X X X X X
Page 49 of 94
CO PO Attributes
PO3 issues.
CO4 PO1, PO2, Range of conflicting requirements, familiarity of issues.
PO3

CO PO Attributes
CSE355 Digital System Design
Credit Hours & Teaching Scheme:

Credit Hours 3 0 3
Prerequisite: CSE345 Digital Logic Design
Course Objective: This course is an elective course and builds up the students’ ability to
understand advanced features of digital (combinational and sequential) circuits and design and
synthesize digital circuits using computer-aided techniques. The course will address advanced
features of digital circuits, designing and synthesizing digital circuits using Verilog Hardware
Description Language (HDL), and designing and synthesizing application specific integrated
circuits using Programmable Logic Devices (PLDs).

CO1 Interpret and apply advanced features of digital (combinational and sequential) circuits
as the pre-design concepts for computer-aided design of digital circuits.
CO2 Examine, choose, and develop Verilog HDL modeling techniques; perform and
demonstrate skills, and write report to design and test digital circuits.
CO3 Examine, choose, and develop Verilog HDL techniques; perform and demonstrate
skills, and write report to synthesize digital circuits.
CO4 Examine and choose Programmable Logic Devices (PLDs) and design digital circuits
using PLDs as Application Specific Integrated Circuits (ASICs).
Page 50 of 94
Levels
Hazards in Combinational circuits CO1 C2
Busses and three-state devices CO1 C2
Mealy and Moor type finite state machines (sequential CO1 C2
circuits)
Register Transfer Logic (RTL) design, Algorithmic State CO1 C2, C3
Machines (ASM)
Structural Verilog modeling of combinational circuits CO2 C3
Logic simulation, design verification, and test methodology CO2 C3
in Verilog-based designs.
Behavioral Verilog modeling of combinational circuits CO2 C3
Verilog-based design of datapath elements and datapath CO2 C4, C5, P2, P3, A2
controllers
Logic synthesis using Verilog CO3 C3
RTL synthesis using Verilog CO3 C3
High-level synthesis using Verilog CO3 C3
Verilog-based synthesis of datapath elements and datapath CO3 C4, C5, P2, P3, A2
controllers
Programmable Logic Array (PLA), Verilog modeling of CO4 C3
PLA
Programmable Array Logic (PAL), Verilog modeling of CO4 C3
PAL
Field-Programmable Gate Array (FPGA), Verilog-based CO4 C3
design for FPGA
ASIC synthesis with FPGA CO4 C4, C5
Mini project CO2, CO3 C4, C5, P2, P3, A2

CO1 X
CO2 X X X X X X X
CO3 X X X X X X X
CO4 X X X
Page 51 of 94
CO PO Attributes
CO1 PO1 Range of conflicting requirements, Depth of knowledge required, familiarity
of issues.
CO2 PO1, PO2, Range of conflicting requirements, Depth of knowledge required, familiarity
PO3 of issues, Interdependence.

CO PO Attributes
CSE366 Artificial Intelligence

Credit Hours 3 0 3
Course Objective:This course introduces the fundamental concepts and knowledge of Artificial
Intelligence (AI) principles and techniques, the state-of-the-art models and algorithms used to
undertake these problems. This course is also designed to expose students to the frontiers of AI-
intensive computing, while providing a sufficiently strong foundation to encourage further
research in machine learning. Knowledge of this course will be needed as prerequisite
knowledge for future courses such as CSE475 Machine Learning, CSE477Data Mining and
CSE492 Robotics.

CO1 Interpret and apply the key components and classical algorithms of artificial intelligence
for realistic problem solving.
CO2 Apply and examine game theoretical concepts and practices for solving non-conventional
real-life situations.
CO3 Apply and examine Genetic Algorithms and Artificial Neural Networks (ANN) for
solving complex search and optimization problems.
CO4 Use statistical methods and machine learning for solving complex AI related problems;
perform and demonstrate skills and write report on complex AI related problems.
Page 52 of 94
Levels
Introduction to Artificial Intelligence, Intelligent Agents CO1 C2
Solving problem by searching, Uniformed Search CO1 C2, C3
Strategies, Informed Search Strategies
Constraint Satisfaction Problem CO1 C3
Games and adversarial search, Games vs. single-agent CO2 C3, C4
search, Game tree, Alpha-beta pruning
Introduction of Genetic Algorithm, GA Terminology CO3 C3
First-Order Logic, Knowledge Engineering in First-Order CO2 C3
Logic
Planning, The Planning Problem, Planning Algorithms CO2 C3
Game Theory, Nash Equilibrium and Mixed Strategy CO2 C3
equilibrium
Uncertainty, Acting under Uncertainty, Basic Probability CO3 C3
Notation, Bayes’ Rule
Convolutional Neural Network, Convolution Layer CO3 C3, C4
Pooling Layer, Fully Connected Layer
Probabilistic Reasoning over Time, Hidden Markov CO3 C3
Models, Kalman Filters
Learning from Observations, Knowledge in Learning CO4 C3
Statistical Learning Methods CO4 C3
Reinforcement Learning CO4 C3

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X

CO PO Attributes

CO PO Attributes
Page 53 of 94
CSE406 Internet of Things

Credit Hours 3 0 3
Prerequisite:CSE405 Computer Network
Course Objective: This coursewill cover the building blocks of Internet of Things (IoTs) and
their characteristics. Domain specific IoTsand their real-world applications will be developed
here. This course also will introduce the programming aspects of IoTswith a view towards rapid
prototyping of complex IoT applications.

CO1 Understand the building blocks of IoTs and their characteristics with real-world
applications.
CO2 Understand, apply, and examinedifferentarchitectures for different levels of complex
IoT applications.
CO3 ExamineIoT data analytics and justifyvarious tools for IoT; perform and demonstrate
skills, and write report on realistic data analytics.
CO4 Choose and justify software and hardware tools, developsource code for various IoT
domains,perform and demonstrate skills, and write report on realistic IoT development.

Levels
Introduction to IoT CO1 C2
Basics of Networking CO1 C2
Communication Protocols CO1 C2
Sensor Networks: Machine-to-Machine CO1 C2
Communications
Interoperability in IoT: Integration of Sensors and CO2 C2
Actuators
Implementation of IoTwith programmable devices CO2 C3, C4
Software Defined Networking(SDN) for IoT: Data CO3 C4, C5
Handling and Analytics
Cloud Computing CO3 C4, C5
Fog Computing: Smart Cities and Smart Homes CO3 C4, C5
Connected Vehicles: Smart Grid CO3 C4, C5
Industrial IoT: Agriculture, Healthcare, Activity CO4 C4, C5, C6
Monitoring and related case studies
Page 54 of 94
Mini project CO3, CO4 C4, C5, C6, P2, P3, A2

CO1 X
CO2 X X X
CO3 X X X X X
CO4 X X X X X X

CO PO Attributes
of issues
PO3 of issues, Interdependence
PO3 of issues, Interdependence
CO4 PO3, PO4 Range of conflicting requirements, Depth of knowledge required, familiarity
of issues, Interdependence

CO PO Attributes
CO3 (Mini Project) PO5 Range of resources, Level of interaction, Familiarity
CSE420 Computer Graphics

Credit Hours 3 0 3
Course Objective: The course focuses on all aspects of fundamental computer graphics,
including 2D/3D object representations, transformations, modeling and rendering algorithms.
The course also aims to provide a good foundation for OpenGL programming, which is a widely
accepted standard for developing graphics applications. The course will assume a good
background in programming in C or C++ and a background in mathematics including familiarity
with the theory and use of coordinate geometry and of linear algebra such as matrix
multiplication.
Page 55 of 94
CO1 Understandcomputer graphics system and implement different graphics primitives for
drawing a graphics scene.
CO2 Understand, apply, and examinedifferent techniques of clipping, two dimensional
transformations, and three-dimensional transformations and viewing for manipulating
complex graphics scenario using OpenGL; perform and demonstrate these skills and
write reportfor realistic problem solving.
CO3 Understandand applythe basics of color perception and different color models used in
computer graphics.
CO4 Apply and Analyze different modeling, rendering, shading and animation techniques;
develop and justify program by integrating these techniques to create 3D objects using
OpenGL; perform and demonstrate these knowledge and write report for realistic
problem solving.

Levels
Introduction: History of computer graphics, graphics CO1 C2, C2
architectures and software.
Efficient implementation of different graphics primitives CO1 C2, C3
like Line and circle, and Ellipse.
Clipping, polygonal fill CO2 C2, C3
Geometric transformations: 2D transformations CO2 C2
(translation, rotation, scaling, shear), homogeneous
coordinates, concatenation, current transformation and
matrix stacks.
Geometric transformations: 3D transformations CO2 C2, C3
(translation, rotation, scaling)
Three dimensional viewing, specifying views, affine CO2 C2, C3
transformation in 3D, projective transformations.
Graphics Programming: Getting started with OpenGL, CO2 C3
Input and Interaction in OpenGL
Color perception, color models (RGB, CMY, HLS), color CO3 C2, C3
transformations. Color in OpenGL. RGB and Indexed
color.
Introduction to hidden surface removal (z buffer). CO4 C3
Generate realistic 3D color object using OpenGL CO4 C4
Curve and surface representation CO4 C3
Image rendering using ray tracing CO4 C3
CO4 C5, P2, P3, A2
Page 56 of 94
CO1 X X
CO2 X X X X X X X
CO3 X X
CO4 X X X X X X X

CO PO Attributes

CO PO Attributes
CSE422 Simulation and Modeling

Credit Hours 3 0 3
Prerequisite:CSE246 Algorithms
Course Objective: The course is an elective course and aims at giving the students the
knowledge of the basic concepts in the area of modeling and simulation. The course will focus
on modeling and simulation of discrete and continuous system. The course will address the
modeling and analyzing input and output for a simulation model and generating random numbers
for simulation experiments. Simulation tools will be used to conduct experiments.
Page 57 of 94
CO1 Understandand usefundamental concepts of computer simulation and its role in
engineering problem solving.
CO2 Understand random number variates and apply them to develop simulation models.
CO3 Compute and analyze the output from a terminating simulation of an engineering
problem. C3, C4
CO4 Chooseand examinesoftware tools, perform and demonstrate skills, and write report to
model and build a simulation model with basic operations and statistical analysis of
output.

Levels
Introduction to simulation modeling CO1 C2, C3
Review of basic probability and statistics CO1 C2, C3
Selecting input probability distributions CO2 C3
Random Number Generators CO2 C2, C3
Generating Random Variates CO2 C2, C3
Output Data Analysis for a Single System CO3 C3, C4
Verification/Validation CO3 C2, C4
Assignments & Mini Projects with reports and CO4 C3, C4, P2, P3, A2
presentations

CO1 X
CO2 X
CO3 X X X
CO4 X X X X X

CO PO Attributes
PO3 issues.

CO PO Attributes
CO4 (Assignment & Mini PO5, Range of resources, Level of interaction,
Project) PO10 Familiarity
Page 58 of 94
CSE423 Software Architecture
Credit Hours and Teaching Scheme

Credit Hours 3 0 3
Prerequisite: CSE412 Software Engineering
Course Objective: The objective of this course is to familiarize the students with the
fundamental concepts of software architecture, the proprieties and applicability of the different
architecture styles. Student will also learn popular design patterns, software components,
reusable architectures and the relations of all these concepts with the software reuse.
Course Outcomes (COs)

CO1 Understand and usethe various architecture styles for software systems.
CO2 Choose and evaluate alternative architectures in terms of design and reuse to solve
various complex software engineering problems.
CO3 Apply, examine, and justifydesign patterns, and methods and techniques of software
reuse.
CO4 Choose, examine, and justify software tools, perform and demonstrate skills, and write
report to build a software system following a architecture specification, selecting and
applying design patterns and using a component-based development method.

Levels
Introduction to fundamentals of software design, concepts, CO1 C2
and principles.
Micro and macro architectures: design patterns, CO1 C2, C3
frameworks and production lines
Types of software patterns: architecture patterns, design CO2 C3, C4
patterns, idiomatic structures
Architecture styles, reference models and architectures: CO2 C3, C4
pipes and filters, data abstraction, object-orientation, even-
based systems, layered systems, repositories, interpreters,
process-control systems.
Design, evaluation and refinement of software architectures CO3 C4, C5
Representation and Documentation of software CO3 C3
architectures
Reuse of software architectures: production lines, CO3 C4, C5
frameworks, software components
Page 59 of 94
Case Study: Simple and complex technological CO4 C3, C4, P2, P3, A2
architectures with report.
Assignment and Mini Project with report and presentation CO4 C4, C5, P2, P3, A2
Mapping of COs to POs

CO1 X X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO3 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required,

CO PO Attributes
CO4 (Assignment PO5, PO10 Range of resources, Level of interaction, Innovation, and
& Mini Project) Familiarity
CSE425 Numerical Methods
Credit Hours & Teaching Scheme:

Credit Hours 3 0 3
Prerequisite:CSE103 Structured Programming
Course Objective:This course will emphasize the development of numerical algorithms to

provide solutions to common problems formulated in science and engineering. The primary
objective of the course is to develop the basic understanding of the construction of numerical
algorithms, and more importantly, the applicability and limits of their appropriate use.
Page 60 of 94
CO1 Understandthe basic numerical techniques for solving mathematicalsystems.
CO2 Implement numerical techniques to solve computational problems.
CO3 Apply and analyzenumerical techniques considering the accuracy of the techniques.
CO4 Deriveappropriate numerical techniques; perform and demonstrate those skills and
write report on solving complex engineering problems.

Levels
Basic idea of Numerical methods CO1 C2
Data and Information concept CO1 C2
Root Finding Methods (Bracketing Methods) CO2 C3
Root Finding Methods (Open-End Methods) CO3 C3, C4
Introduction to system of linear equations CO2 C3
Iterative methods for linear equations CO2 C3
Direct Solution of linear equations (existence of solution) CO3 C3, C4
Direct analytical methods for linear equations CO3 C3, C4
Curve fitting and Line curve fitting CO3 C3, C4
Interpolation with unequal intervals CO2 C3
Interpolation with equal intervals CO3 C3, C4
Numerical solution of ordinary differential equations CO4 C4
Numerical Integration CO4 C4

CO1 X
CO2 X X
CO3 X X
CO4 X X X X X X X

CO PO Attributes
CO4 PO1, PO2, PO3 Range of conflicting requirements, Depth of analysis required,
Depth of knowledge required
Page 61 of 94
CO PO Attributes
CSE428 Human Computer Interactions

Credit Hours 3 0 3
Prerequisite:CSE412 Software Engineering
Course Objective: This course builds up the students’ ability to design user interfaces based on
the capabilities of computer technology and the needs of human factors. They will learn to
evaluate and design usable and appropriate software based on the psychological, social, and
technical analysis. They will become familiar with the variety of design and evaluation methods
used in interaction design and will get experience with these techniques.

CO1 Explain, choose and distinguish the capabilities of both humans and computers from the
viewpoint of human information processing.
CO2 Analyze and identify user models, user support, socio-organizational issues, and
stakeholder requirements of HCI systems.
CO3 Choose, analyze, and justify the HCI design principles, standards, and guidelines for
designing HCI systems.
CO4 Apply, examine, select, and design advanced HCI methodologies and technologies for
realistic problem solving; perform and demonstrate skills and write report on realistic
interaction design.

Levels
Foundations of Human–Computer Interaction:Human CO1 C2, C3
Capabilities, The Computer, The Interaction, Paradigms
HCI Design Process: Interaction Design Basics, HCI in the CO1 C2, C4
Software Process, Design Rules, Universal Design
Implementation Support: Implementation Tools CO2 C4, C5
Users Models: Cognitive Models, Socio-organizational CO2 C4, C5
Issues and Stakeholder Requirements
Evaluation and User Support: Evaluation, User Support CO3 C3, C4
Page 62 of 94
Task Models and Dialogs: Analyzing Tasks, Dialog CO3 C4, C5
Notations and Design
Augmented Reality, Hypertext and Multimedia:Groupware CO4 C3, C4, C5, C6
and Computer-supported Collaborative Work, Ubiquitous
Computing, Virtual Reality and Augmented Reality,
Hypertext, Multimedia and the World Wide Web
Mini project CO4 C3, C4, C5, C6, P2, P3, A2

CO1 X
CO2 X
CO3 X X X X X X
CO4 X X X X X X

CO PO Attributes
PO3 issues.

CO PO Attributes
CSE430 Software Testing and Quality Assurance

Credit Hours 3 0 3
Contact Hours 3 Hours/Week for 13 Weeks 0 3 Hours/Week for 13 Weeks
+ +
Prerequisite:CSE412 Software Engineering
Page 63 of 94
Course Objective:This course is designed to enable a clear understanding and knowledge of the
software testing and quality control. It explores different SQA components, techniques, and
standards practiced as a part of software project management in the industry. Beside the
concepts, it will build the capacity of reviewing, planning and designing test cases based on
system requirements. It will develop the ability to use different testing techniques (black box and
white box) and available tools used in real life software projects.

CO1 Understand different software quality assurance and quality control activities and
standards for software projects.
CO2 Understand review and inspection techniques and formulate appropriate test plan and
test cases based on system specifications.
CO3 Understand different testing techniques and apply and identify appropriate testing for
real-life complex software projects.
CO4 Apply and examineautomated testing tools; demonstrate and adapt those skills; justify
and compare them for optimized quality control.

Levels
Software Quality, Quality Assurance and Quality CO1 C2
Control, SQA components
Quality standards, CMM and CMMI model, Software CO1 C2
Quality factors
Review and inspections, Formal technical reviews, Cost CO2 C2
estimations of review tasks
Software testing life cycle (STLC), Software test plan CO2 C2, C3
preparation, Test case design
Software testing objectives and strategies, Software test CO3 C2, C3
classifications, White box testing, Black box testing
Test case optimization, All Pair testing, Path testing, CO3 C3, C4
Boundary value analysis, Decision table testing
Assignment &Mini project CO4 C3, C4, P3, P4, A3, A4

CO1 X
CO2 X X
CO3 X
CO4 X X X X X
Page 64 of 94
CO PO Attributes
CO1 PO1 Depth of knowledge required

CO PO Attributes
CO2 PO5 Range of resources, Familiarity
CO4 (Project) PO5, PO10 Range of resources, Level of interaction, Familiarity
CSE438 Digital Image Processing

Credit Hours 3 0 3
Course Objective:This course is an introduction to digital image processing and image analysis
techniques and concepts. Topics include intensity transformations for image enhancement, two-
dimensional discrete Fourier transform, spatial and frequency domain linear image filtering,
nonlinear image filtering, binary image processing, edge detection, image segmentation, and
digital video processing basics.This course makes extensive use of MATLAB as an analysis,
design, and visualization tool.

CO1 Understand the digital image fundamentals and apply different image enhancement
techniques for improving the quality of the image.
CO2 Understand the basics of color model and apply them for smoothing, sharpening and/or
segmenting color image.
CO3 Understand, choose, examine, and devaluate different image segmentation and
morphological operation and image compression techniques; perform and demonstrate
these skills and write report for better representation and/or better storage of the image.
CO4 Choose, compare, and justify appropriate object detection and techniques for
understanding complex real life images; perform and demonstrate these skills and write
report for realistic problem solving.
Page 65 of 94
Levels
Digital Image Fundamentals: Elements of Visual CO1 C2
Perception, Light and the Electromagnetic Spectrum,
Image Sensing and Acquisition, Image Sampling and
Quantization, Some Basic Relationships between Pixels,
Linear and Nonlinear Operations.
Image Enhancement in the Spatial Domain: Basic Gray CO1 C2, C3
Level Transformations, Histogram Processing, Basics of
Spatial Filtering, Smoothing Spatial Filters, Sharpening
Spatial Filters.
Color Image Processing: Color Fundamentals, Color CO2 C2, C3
Models, Pseudocolor Image Processing, Basics of Full-
Color Image Processing, Color Transformations,
Smoothing and Sharpening, Color Segmentation.
Image Segmentation: Detection of Discontinuities, Edge CO3 C2, C3
Linking and Boundary Detection, Thresholding, Region-
Based Segmentation, Segmentation by Morphological
Watersheds.
Morphological Image Processing: Dilation and Erosion, CO3 C2, C3
Opening and Closing, Extensions to Gray-Scale Images.
Image, Video compression: Lossless compression vs. CO3 C2, C3
Lossy compression, Image coding JPEG, Video coding and
MPEG
Object Recognition: Representation, Learning, CO4 C3, C4
Recognition, BagofWordsmodel
Mini project CO3, CO4 C4, C5, P2, P3, A2

CO1 X X
CO2 X X X
CO3 X X X X X X X
CO4 X X X X X X X X
Page 66 of 94
CO PO Attributes
of issues.
of issues, Interdependence.

CO PO Attributes
CSE452 Distributed Systems and Algorithms

Credit Hours 3 0 3
Contact 3 Hours/Week for 13 Weeks + 0 3 Hours/Week for 13 Weeks +
Hours Final Exam in the 14th week Final Exam in the 14th week
Prerequisite: CSE 325 Operating Systems.
Course Objective: This course focuses on the principles, techniques, and practices relevant to
the design and implementation of distributed systems. Students will study major algorithms and
theoretical results and explore them in modern applications like cloud computing, pervasive
computing, Google file system, peer-to-peer systems and etc.

CO1 Interpret,apply, and examinedifferent theories, models and concepts for the design and
implementation of distributed systems.
CO2 Describe, apply, and analyze common problems and their solving algorithms for
modern distributed applications.
CO3 Identify, and analyze fundamental limitations and impossibility results for distributed
systems to avoid them during realistic problem solving.
CO4 Apply differentdistributed algorithmsfor real-world distributed computing
platforms;demonstrate this knowledge and write report for real-world distributed
computing platforms.
Page 67 of 94
Levels
Introduction to distributed systems and models of CO1 C2
distributed computation
Time, clocks, and synchronization CO1 C2, C3
Distributed objects and components CO1 C4
Distributed file system CO1 C3,C4
Remote invocation and indirect communication CO2 C4
Global state and snapshot recording algorithms CO2 C2, C3, C4
Distributed mutual exclusion algorithms CO2 C2, C3, C4
Deadlock detection in distributed systems CO2 C3, C4
Check pointing and rollback recover CO3 C3,C4
Consensus and agreement algorithms CO3 C3,C4
Assignment with report and presentation (case studies- CO4 C4, P3, A2
designing distributed system)

CO1 X X
CO2 X X X
CO3 X X X
CO4 X X X X X X X

CO PO Attributes
CO2 PO1, PO2, Range of conflicting requirements, depth of analysis required, familiarity
PO3 of issues.
PO3 of issues.
CO4 PO2,PO3, Range of conflicting requirements, depth of knowledge required,
PO4 familiarity of issues.

CO PO Attributes
CO4 PO5, PO10 Range of resources, Level of interaction, Familiarity, Innovation
Page 68 of 94
CSE453 Wireless Networks

Credit Hours 3 0 3
Course Objective:The objective of this course is to give an introduction to the fundamentals of

the wireless communications systems, the wireless network architectures, protocols, and
applications. This course will address topics of wireless communications and mobile computing
systems, signal propagation characteristics of wireless channels, wireless channel modelling,
frequency reuse/cellular/microcellular concepts, spread-spectrum modulation for wireless
systems, multiple access techniques, and wireless networking standards.

CO1 Comprehend, use, and characterize fundamentals of the wireless communications
systems.
CO2 Applyand characterizewireless network architecture’s protocols.
CO3 Understand, use, and examine wireless communications and mobile computing systems,
signals propagation characteristics of wireless channels and frequency reuse concepts;
implement these skills and write report.
CO4 Understand, apply, and examine satellite communications and wireless networking
standards; implement these skills and write report.

Levels
Overview of Wireless Communication Networking and CO1 C2
Mobile Computing
Historical perspectives, first and second generation cellular CO1 C2, C3, C4
systems, land mobile vs. satellite vs. indoor wireless
systems
Adaptation and mobility in wireless information systems, CO2 C3, C4
challenges of mobile computing, mathematical
preliminaries
Wireless Channel Modelling:Path-loss and shadow fading CO3 C2, C4
models
Rayleigh and Rician fading CO3 C2, C3
Coherence time, coherence bandwidth, frequency flat and CO3 C2, C3
selective fading
Page 69 of 94
Frequency reuse/cellular/microcellular concepts including CO4 C2, C3, C4
sectorization and cell splitting
Tracking and localization CO4 C3
Multiple Access Techniques: CO2 C2
TDMA, FDMA, CDMA, ALOHA, Slotted-ALOHA,
CSMA/CA, MACA, reservation protocols, 3G systems,
wireless LAN standards (IEEE 802.11)
WiMAX standards (IEEE 802.16), WPAN standards (IEEE CO2 C2, C3
802.15)
Satellite communications CO4 C2, C3
Hidden node problem, exposed node problem, Request to CO4 C2, C3, C4
send (RTS),Clear to send (CTS), Network allocation vector
(NAV)
Assignment with report and presentation CO3, CO4 C3, C4, P3, A2

CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
PO4 issues.

CO PO Attributes
CO4 PO5, Range of resources, Level of interaction, Innovation,
(Assignment) PO10 Familiarity
CSE457 Cellular Networks

Credit Hours 3 0 3

Page 70 of 94
Course Objective: The objective of this course is to give an introduction to the fundamentals of
the cellular concept and communications systems. This course will also address system design
fundamentals by introducing frequency reuse and channel assignment and handoff strategies.
Besides, co-channel interference and system capacity, trunking and improving coverage and
capacity will be its within coverage topic.

CO1 Comprehend fundamentals of the cellular communications systems.
CO2 Interpret, apply, and examine cellular architectures and protocols.
CO3 Interpret, apply, and examine cellular geometry to improve cellular capacity and
coverage.
CO4 Apply the learnt knowledge; demonstrate this knowledge and write reportfor solving
real-life problems.

Levels
Overview of wireless communication networking and CO1 C2
mobile computing
Overview of cellular communications CO1 C2
Cellular architectures, channels allocations, and CO2 C3,C4
assignment strategies
Channel planning and interference CO2 C2, C3
Power control for reducing interference CO2 C3
Trunking and grade of service CO2 C2
Cell geometry CO3 C3,C4
Cell splitting, sectoring CO3 C2, C3
Repeaters for range extension CO3 C3,C4
Microcell zone concept CO3 C2
Assignment with report and presentation CO4 C3, C4, P3, A2

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X X
Page 71 of 94
CO PO Attributes
CO3 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required,

CO PO Attributes
CSE471 Compiler Design

Credit Hours 3 0 3
Prerequisite:CSE313 Theory of Computations
Course Objective:The objective of this course is to learn basic principles and advanced
techniques of compiler design. The initial part of the course will focus on the classic techniques
of lexical analysis and scanning/screening, syntactic analysis like bottom-up and top-down
parsing techniques, semantic analysis, type-checking, abstract syntax tree and code generation.
The latter part will focus on intermediate representations and simple optimizations like register
allocation and instruction scheduling. Students will be exposed to compiler design tools and they
will develop a compiler of limited scope.

CO1 Understandand use Lexical Analyzer, Regular expression, and Finite Automata in
Lexical Analysis.
CO2 Understand, use, and examine various parsing technique, Syntax and Semantic
Analysis, Type checking.
CO3 Developand examine concept of Intermediate Code Generation and Code Optimization.
CO4 ChooseCompiler Construction Tools, perform and demonstrate skills, and write report
to Design and Build a simple Compiler.

Levels
Various phases of a Compiler, Lexical Analyzer, Regular CO1 C2
Expression, Transition Diagram,
Page 72 of 94
Finite Automata, NFA, Regular Expression to NFA CO1 C3
DFA, NFA to DFA (Subset Construction), DFA state CO2 C3
minimization
Context Free Grammar, Ambiguity, Left Recursion CO2 C2
Top Down Parsing CO2 C3, C4
Bottom Up Parsing CO2 C3, C4
Semantic Analysis CO2 C3
Run Time Environment CO3 C3, C4
Code Generation & Optimization CO3 C3, C4
Assignments and miniproject with reports and CO4 C3, P2, P3, A2
presentations

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X

CO PO Attributes
CO2 PO1, PO2,PO3, Range of conflicting requirements, familiarity of issues.
CO3 PO1, PO2,PO3, Range of conflicting requirements, depth of analysis required, familiarity of
issues.

CO PO Attributes
CO4 (Assignment and Mini PO5, Range of resources, Level of interaction,
Project) PO10 Familiarity
CSE475 Machine Learning

Credit Hours 3 0 3
Prerequisite: CSE366 Artificial Intelligence
Page 73 of 94
Course Objective:This course will introduce the field of Machine Learning, in particular
focusing on the core concepts of supervised and unsupervised learning. Students will learn the
algorithms which underpin many popular Machine Learning techniques, as well as developing an
understanding of the theoretical relationships between these algorithms. The hands-on exercise
will concern the application of machine learning to a range of real-world problems.

CO1 Formulateand usemachine learning problems corresponding to different applications.
CO2 Understandand usea range of machine learning algorithms, both supervised and
unsupervised along with their strengths and weaknesses.
CO3 Understand, use, and determine appropriate machine learning methods/algorithms
suitable for different types of learning problems, i.e. know about their most important
weaknesses and advantages.
CO4 Examine and analyze appropriate software tools to implement algorithms in a range of
real-world applications; implement and write report to represent the analysis results.

Levels
Introduction to Machine Learning CO1 C2, C3
Supervised Learning Setup CO1 C2, C3
Linear Prediction: Regression CO2 C3
Classification: Decision Tree, Logistic Regression CO2 C3
Probabilistic Modeling: Bayesian Method, Naïve Bias CO2 C2, C3
Unsupervised Learning: Clustering, Apriori CO2 C2, C3
Principal component analysis CO2 C2, C3
Clustering: Partitioning, Hierarchical CO2 C2, C3
Artificial Neural Networks: perceptron, MLPs, back CO3 C3, C4
propagation, introduction to Deep Learning
Support Vector Machines CO3 C2, C3
Reinforcement learning and control CO3 C2, C4
Assignments and Mini Project with reports and CO4 C4, C5, P3, A2
presentations

CO1 X X
CO2 X X
CO3 X X
CO4 X X X X X X X
Page 74 of 94
CO PO Attributes
CO3 PO1, PO2 Range of conflicting requirements, depth of analysis required, familiarity of
issues.
CO4 PO2, PO3, Range of conflicting requirements, familiarity of issues.
PO4

CO PO Attributes
CO4 (Assignment & Mini PO5, PO10 Range of resources, Level of interaction,
CSE477 Data Mining

Credit Hours 3 0 3
Prerequisite: CSE366 Artificial Intelligence
Course Objective: The objective of the course is to introduce the basic concepts of Data Mining
techniques to students. The course focuses on examining the type of data to be mined and
applying preprocessing methods to raw data. The course emphasizes on discovering interesting
patterns, analyzing supervised and unsupervised models and estimating the accuracy of the
algorithms. The students will also be introduced to various Data Mining tools.

CO1 Process raw input data to provide suitable input for a range of data mining algorithms.
CO2 Discover and measure interesting patterns from different kinds of databases.
CO3 Evaluate and select appropriate data-mining algorithms and apply, and interpret and
report the output appropriately.
CO4 Choose and justify software tools;perform and demonstrate skills, and write report to
design and implement Data-mining application using sample, realistic data sets.

Course Topic CO
Learning/Assessment
Levels
Introduction to Data Mining, Data Mining Goals, Stages of CO1 C3
the Data Mining Process, Data Mining Techniques, Knowledge
Representation Methods
Page 75 of 94
Data preprocessing: Data cleaning, Data transformation, Data CO1 C3
reduction
Data mining knowledge representation, Representing input data CO2 C3, C4
and output knowledge
Association rules, Correlation analysis CO2 C3, C4
Classification, Basic learning/mining tasks, Decision trees, CO2 C3, C4
Covering rules
Prediction, The prediction task, Statistical classification, CO2 C3, C4
Instance-based methods, Linear models
Clustering, Basic issues in clustering, First conceptual CO3 C4
clustering system, Hierarchical methods, Conceptual clustering.
Advanced techniques, Data Mining software and CO3 C4
applications Text mining, Web mining
Assignment and Mini Project with Report and Presentation CO4 C4, C5, P2, P3, A2

CO1 X X
CO2 X X X
CO3 X X X
CO4 X X X X X X X

CO PO Attributes
CO3 PO1, PO2, PO3 Range of conflicting requirements, depth of analysis required, familiarity
of issues.

CO PO Attributes
CO4 (Assignment & Mini PO5, PO10 Range of resources, Level of interaction,
CSE483 Graph Theory

Credit Hours 3 0 3
Page 76 of 94
Course Objective: This course is an elective course and will help the students to gain basic
knowledge of the structure of graphs and the techniques used to analyze problems in graph
theoryand discretestructures. The course will cover fundamental concepts, such as graphs, cycle,
path, circuit, trees, matching and factors, connectivity and coloring, and network.

CO1 Understand fundamentals of graphs and analyze different properties of Eulerian and
Hamiltonian graphs.
CO2 Explain, and apply different theorem related to spanning tree, maximum matching, and
maximum coverage problems.
CO3 Explain, apply andexaminedifferent theorem related to cuts and connectivity, networks
flow problem.
CO4 Explain, apply andexaminedifferent graph coloring theorems; perform and
demonstrate skill and write report on graph coloring theorems.

Levels
Basic definitions, isomorphisms, walks, cycles and CO1 C2
bipartite graphs
Components, cut-edges, Eulerian graphs, vertex degrees CO1 C2
and degree sequences, directed graphs
Eulerian digraphs, trees and distance CO1 C2
Counting spanning trees and the matrix tree theorem, CO2 C2, C3
minimal spanning trees and shortest paths
Matchings, Hall's theorem and coverings, maximum CO2 C2, C3
matchings, factors
Cuts and connectivity CO3 C2, C3
Network flow problems, max-flow min-cut theorem CO3 C4
Vertex colorings, bounds on chromatic numbers and CO4 C2, C3
Mycielski's construction
Chromatic polynomials, chordal graphs, planar graphs CO4 C2, C3
Euler's formula and Kuratowski's theorem, five and four CO4 C2, C3
color theorems

CO1 X X X
CO2 X X X
CO3 X X X
CO4 X X X X X X
Page 77 of 94
CO PO Attributes
PO3 of issues
PO3 of issues
PO3 of issues
PO3 of issues

CO PO Attributes
CO4 (Mini Project) PO10 Range of resources, Level of interaction, Familiarity
CSE484 Computational Geometry

Credit Hours 3 0 3
Course Objective: This course introduces concepts, data structures and techniques of
computational geometry, and enhances the students’ ability to mathematically analyze real-life
geometric problems. The course covers properties of geometric objects, algorithms, complexity
analysis and correctness of algorithms, and real-life applications of algorithms.

CO1 Understand, apply, and analyzepolygon triangulations, orthogonal range searching, and
point location algorithms.
CO2 Interpret, apply, and analyzevoronoi diagrams, arrangements and duality, and delaunay
triangulations.
CO3 Interpret, apply, and analyze linear programming, randomized algorithms, and graph
drawing.
CO4 Apply the learnt knowledge for solving real-life problems; demonstrate this knowledge
and write reports.
Page 78 of 94
Course Topic CO Learning/Assessmen
t Levels
Introducing geometric objects, overview of computational CO1 C2
geometric algorithms,polygon triangulations
Convex hull: algorithms, complexity and correctness, real-life CO1 C2, C3, C4
applications (both in 2-d and 3-d spaces)
Polygon triangulations and art gallery theorem CO1 C2, C3
Orthogonal range searching: data structures and algorithms CO1 C2, C3
Point location algorithms CO1 C2, C3
Voronoi diagram: definitions and properties, algorithms CO2 C2, C3
Arrangements and duality: supersampling in ray tracing CO2 C4
Delaunay triangulations CO2 C4
Linear programming CO3 C3, C4
Randomized algorithms CO3 C3, C4
Graph drawing CO3 C2, C3
Assignment with report and presentation CO4 C3, P3, A2

CO1 X
CO2 X X
CO3 X X
CO4 X X X X X X

CO PO Attributes

CO PO Attributes
Page 79 of 94
CSE486 Bioinformatics Algorithms

Credit Hours 3 0 3
Course Objective:This is an interdisciplinary course that introduces computational techniques

for solving biological problems. The course also emphasizes understanding of biological
problems, computational algorithms to solve these problems, and do some mathematics for the
analysis of these algorithms.

CO1 Interpret, apply, and examinedifferent searching and clustering techniques on biological
data for answering biological queries. C2, C3, C4
CO2 Interpret, apply, and examine sequence alignment techniques for understanding protein
families, and the emerging field of phylogenomics. C2, C3, C4
CO3 Interpret, apply, and examine protein structure prediction, classification and analysis
techniques for learning the functionalities of proteins. C2, C3, C4
CO4 Interpret, apply, examine, and justifybiological network for learning relationships
within such networks; demonstrate knowledge of this course for real-life problem
solving and write reports.

Levels
Introduction to biology, bioinformatics, and biological database CO1 C2, C3
Biological database searching, clustering and evolutionary tree CO1 C2, C3, C4
algorithms
Sequence alignment algorithms: pairwise, MSA, BLAST and CO2 C2, C3, C4
FASTA
Protein folding and protein structure modeling, alignment and CO3 C2, C3, C4
prediction
Gene regulatory network analysis CO4 C3, C4
Protein networks: montecarlo sampling and randomized graph CO4 C2, C3, C4
walk.
Assignments with report and presentation CO4 C4, C5, P3, A2
Page 80 of 94
CO1 X
CO2 X
CO3 X
CO4 X X X X X X

CO PO Attributes
CO3 PO2 Range of conflicting requirements, depth of knowledge required, familiarity
of issues, consequences.
CO4 PO2,PO3 Range of conflicting requirements, depth of analysis required, familiarity of
issues, Interdependence.

CO PO Attributes
CO4 PO5, PO10 Range of resources, level of interaction, familiarity
CSE487 Big Data Analytics

Credit Hours 3 0 3
Prerequisite:CSE301 Database Systems
Course Objective: This course builds up the student’s ability to understand the key aspects of
big data platform, problems, and applications. The course will emphasize on identification and
analysis on large-scale machine learning methods as well as modern tool, such as Hadoop in the
context of big data analysis.
Page 81 of 94
CO1 Describe the landscape and the V’s of Big Data for real world Big Data problems.
CO2 Apply and examine different tools and techniques for storing, managing, and analyzing
big data; adapt the skills and write report to use the necessary tools for handling a variety
of big data analytics.
CO3 Applyand examinethe core concepts of machine learning techniques in the context of big
data for realistic problem solving; adapt the skills and write report to use the necessary
tools for handling a variety of big data analytics.
CO4 Understand, apply, examine, and justifythe relationship among big data components;
adapt the skills and write report to use the necessary tools for handling a variety of big
data analytics.

Levels
Introduction to Big Data, Big Data Skills and Sources CO1 C2
of Big Data
Characteristics of Big Data - The Four V's CO1 C2
Key aspects of a Big Data Platform, Storage and CO1 C2
Analytics, Governance for Big Data
Data and Data Science; Relational Databases and SQL CO2 C3, C4
Data Cleansing and Preparation CO2 C3, C4
Data Summarization and Visualization; Descriptive CO2 C3, C4
Statistics and Correlation
Association Analysis and Cluster Analysis CO3 C3, C4
Linear Regression, Principles of Classification; CO3 C3, C4
Decision Trees; and Linear Classifiers
Neural Networks and R CO4 C3, C5
Introduction to Hadoop, Hadoop components CO4 C2, C3
(MapReduce/Pig/Hive/HBase)
Cloud and Big Data CO4 C3, C4, C5
Assignments with reports and presentations CO2, CO3, CO4 C4, C5, P3, A2

CO1 X
CO2 X X X
CO3 X X X X X X
CO4 X X X X X X
Page 82 of 94
CO PO Attributes
PO3 issues.

CO PO Attributes
CSE489 Mobile Application Development

Credit Hours 3 0 3
Prerequisite:CSE431 Mobile Programming
Course Objective: This course introduces studentsto programming technologies, design and
development related to mobile applications. Students are introduced to the survey of current
mobile platforms, mobile application development environments, mobile device input methods,
as well as developing applications for different mobile platforms. Students will design and build
variety of applications throughout the course to reinforce learning and to develop real
competency.

CO1 Describe and apply different mobile application models and patterns for developing
mobile software application.
CO2 Describe, apply, and examinemobile development framework to the development of a
mobile application for realistic application creation.
CO3 Use, analyze, and justify advanced programming competency for developing a
maintainable and efficient cloud based mobile application.
CO4 Choose software tools,designsoftware for mobile programming;demonstratethese skills,
and write report to design, build, and test software for mobile programming.
Page 83 of 94
Levels
Mobile Phones and Network Technologies CO1 C2, C3
Android Programming, Android Application Frameworks CO1 C2, C3
Building a Simple User Interface CO1 C3
Activities and Intents, Services CO2 C3
Broadcast Receivers CO2 C2, C4
Data Persistence CO2 C2, C3
Processes and Threads CO2 C4
Asynchronous Tasks CO3 C3, C4
Internet Resources CO3 C4, C5
Apps Publishing and Business Models CO3 C5
iOS platform, Objective-C, Application development in CO3 C4, C5
iOS
Mini project CO4 C5, C6, P3, A2

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X X X X

CO PO Attributes
of issues.
of issues, Interdependence.

CO PO Attributes
Page 84 of 94
CSE491 VLSI Design

Credits 3 1 4
Hours Weeks Weeks Weeks
Prerequisite: CSE345 Digital Logic Design
Course Objective:The course is designed to provide the students with basic theories and
techniques of VLSI design in CMOS technology. This course covers the fundamental concepts
and structure of designing VLSI systems including CMOS devices and circuits, standard CMOS
fabrication processes, CMOS design rules, static and dynamic logic structures, CMOS chip
layout, low power techniques and structural design methods of VLSI architecture. This course
also emphasizes computer-aided design and synthesis of complex digital circuits using Verilog
and physical layout tools.

Interpret the characteristics of CMOS circuit construction and the comparison
CO1
between different state-of-the-art CMOS technologies and processes.
Interpret and apply CMOS technology-specific layout rules in the placement and
CO2 routing of logic components and their interconnect, and examine the functionality,
timing, power and parasitic effects.
Apply and examine hardware modeling techniques for combinational and sequential
CO3
circuit design.
Use, examine, and justify Verilog hardware description language and physical layout
CO4 tools, perform and demonstrate skills and write report to design, test and synthesize
complex digital circuits.

Levels
Introduction to VLSI and digital IC CO1 C2
CMOS transistor theory and non-ideal transistor CO1 C2
characteristics
Circuits, fabrication and layout CO2 C2, C3
DC and transient response CO2 C2
Logical effort, interconnecting engineering and parasitic CO2 C3, C4
Combinational and sequential circuit design CO3 C3, C4
Arithmetic circuits in CMOS VLSI CO3 C3, C4
Data path functional units CO3 C3, C4
Memories and programmable logic CO3 C3, C4
VLSI clocking/low power CO2 C2, C3, C4
Page 85 of 94
Mini Project CO4 C3, C4, C5, P2, P3, A2

CO1 X
CO2 X X
CO3 X X X
CO4 X X X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, Depth of knowledge required,
familiarity of issues

CO PO Attributes
CSE492 Robotics

Credit Hours 3 0 3
Contact 3 Hours/Week for 13 Weeks + 0 3 Hours/Week for 13 Weeks +
Hours Final Exam in the 14th week Final Exam in the 14th week
Prerequisite: CSE 442 Microprocessors and Microcontrollers
Course Objective: The objective of this course is to introduce students to the field of Robotics
and stimulate their interests through a variety of multidisciplinary topics necessary to understand
the fundamentals of designing, building, and programming robots. The course will address
fundamental mathematical modeling of robots-kinematics, inverse kinematics, sensors and
sensor processing algorithms, different control architectures, their management and
programming strategies.
Page 86 of 94
CO1 Learn fundamental mathematical and computational models; and solveand
analyzekinematic problems involving robot manipulators and mobile robots.
CO2 Familiarizewith robot sensors, sensor processing algorithms and navigation planning
approaches; use them andexamine their engineering trade-offs.
CO3 Understand robot actuator movements and controlling managements; and explore the
computational challenges within robotic tasks.
CO4 Use, examine, and justify control programming strategies of industrial systems;
demonstrate these knowledge and write reportto develop simple mobile robot.

Levels
Introduction of Robotics and Robot Mechanical Structure CO1 C2
Kinematics and inverse kinematic problems CO1 C2, C3, C4
Actuators and Sensors CO2 C2, C3, C4
Trajectory Planning CO2 C2, C3, C4
Motion Planning CO2 C2, C3, C4
Control Architecture CO3 C2, C3
Motion Control CO3 C2, C3
Force Control CO3 C2, C3
Visual Servoing CO3 C2, C3
Mini Project CO4 C4, C5, C6, P3, A2

CO1 X
CO2 X X
CO3 X X
CO4 X X X X X X X X

CO PO Attributes
CO1 PO1 Range of conflicting requirements, depth of knowledge required,
familiarity of issues, consequences.
CO3 PO1, PO2 Range of conflicting requirements, familiarity of issues, consequences.
Page 87 of 94
CO PO Attributes
CO4 PO5, Range of resources, Level of interaction, Innovation, Familiarity
(Mini Project) PO10
CSE494 Embedded Systems

Credit Hours 3 0 3
Prerequisite: CSE442 Microprocessors and Microcontrollers
Course Objective: This course is an elective course and build up students’ ability to understand
fundamental concepts of embedded systems, techniques and tools for integrating hardware and
software components in embedded system design. The course will also emphasize on testing and
debugging approaches for verification of embedded systems.

CO1 Understand characteristics and internal architecture of embedded systems.
CO2 Apply and examineprogramming, testing and debugging approaches and tools to develop
and verify embedded systems.
CO3 Apply and examine the concepts of real time operating systems to design embedded
systems.
to develop embedded systems.

Levels
Introduction to embedded systems, Major CO1 C2
components and applications of Embedded system
Architecture of processors in embedded system, memory CO1 C2
organization and real-world interfacing
Device Drivers and interrupt service mechanism CO1 C2
Develop embedded systems using assembly and high- CO2 C3
level languages
Sequential and Data Flow graph modeling for program CO2 C3, C4
analysis
State machine modeling for program analysis CO2 C3, C4
Concurrent process modeling for program analysis CO2 C3, C4
Page 88 of 94
Testing, Simulation and Debugging techniques and tools CO2 C3
to design and verify embedded systems
Task scheduling algorithms in real time operating system CO3 C3, C4
environment
Design procedure of embedded system using real time CO3 C3
operating system concepts
Case studies: Embedded system design for automobile, CO3 C3
smart card, digital camera, and home electronics using
real time operating system concepts

CO1 X
CO2 X X X
CO3 X X X
CO4 X X X X X

CO PO Attributes
CO2 PO1, PO2, PO3 Range of conflicting requirements, Familiarity of issues, depth
of analysis required
CO3 PO1, PO2, PO3 Range of conflicting requirements, Familiarity of issues, depth
of analysis required

CO PO Attributes
Page 89 of 94
Outcome Assessment:
1. A student achieves a specific CO of a course if the student obtains at least 70% of the
allocated mark for that CO. For example consider CO1 of CSE103 course. If a student of
CSE103 course obtains at least 70% of the allocated mark for CO1, then the student achieves
CO1 of CSE 103 course.
2. A specific CO of a course-section is achieved if at least 60% students of that course-section
achieve that CO. For example consider that there are 30 students in CSE103 (Section 1)
course. If 30×0.6 = 18 students achieve CO1, then the CO1 of CSE103 (Section 1) course is
achieved. For counting 60% of students a fraction less than 0.5 will be ignored and a fraction
equal to or greater than 0.5 will be rounded up to the next integer.
3. A student achieves a specific PO of a course if the student obtains at least 70% of the total
allocated mark for all COs under that PO. For example consider PO1 of CSE103 course. PO1
has 3 COs under it such as CO1, CO2, and CO3. If a student obtains at least 70% of the total
allocated mark for CO1, CO2, and CO3, then the student achieves PO1 of CSE 103 course.
4. A specific PO of a course-section is achieved if at least 60% students of that course-section
achieve that PO. For example consider that there are 30 students in CSE103 (Section 1)
course. If 30×0.6 = 18 students achieve PO1, then the PO1 of CSE103 (Section 1) course is
achieved. For counting 60% of students a fraction less than 0.5 will be ignored and a fraction
equal to or greater than 0.5 will be rounded up to the next integer.
5. At the time of graduation a student achieves a specific PO if the student achieves that PO in
at least 60% of courses having that PO. For example consider PO1. Several courses map to
PO1, say 20 courses map to PO1. If a student achieves PO1 in at least 20×0.6 = 12 courses
having PO1, then the student achieves PO1 at the time of graduation. For counting 60% of
courses a fraction less than 0.5 will be ignored and a fraction equal to or greater than 0.5 will
be rounded up to the next integer.
6. At the time of graduation a batch of students (batch based on admission year and semester)
achieves a specific PO if at least 60% students of that batch achieve that PO. For example
consider that 100 students of a batch complete graduation. If 100×0.6 = 60 students achieve
PO1, then that batch of students achieve PO1 at the time of graduation. For counting 60% of
students a fraction less than 0.5 will be ignored and a fraction equal to or greater than 0.5 will
be rounded up to the next integer.
7. The program's POs are achieved for a batch of students if students of that batch achieve all
POs of the program.
Page 90 of 94
Appendices
Range of Complex Engineering Problem Solving

Complex engineering problems as required in PO1, PO2, PO3, and PO4 are problems that cannot
be resolved without in-depth engineering knowledge and have some or all of the following
characteristics.
Attribute Complex Problems
Range of conflicting Involve wide-ranging or conflicting technical, engineering and
requirements other issues
Depth of analysis required Have no obvious solution and require abstract thinking and
originality in analysis to formulate suitable models.
Depth of knowledge required Requires research-based knowledge, much of which is at, or
informed by, the forefront of Computer Science and
Engineering and that allows a fundamental-based, first-
principles analytical approach.
Familiarity of issues Involve infrequently encountered issues.
Extent of applicable codes Are outside problems encompassed by standards and codes of
practice for professional Computer Science and Engineering.
Extent of stakeholder Involve diverse groups of stakeholders with widely varying
involvement and level of needs.
conflicting requirements
Consequences Have significant consequences in a range of contexts.
Interdependence Are high-level problems that include many component parts or
sub-problems.
Range of Complex Engineering Activities

Complex engineering activities as required in PO5 and PO10 are engineering activities or
projects that have some or all of the following characteristics.
Attribute Complex Problems
Range of resources Involve the use of diverse resources (for this purpose, resources
include people, money, equipment, materials, information and
technologies)
Level of interaction Require resolution of significant problems arising from interactions
between wide-ranging or conflicting technical, engineering or other
issues
Innovation Involve creative use of Computer Science and Engineering
principles and research-based knowledge in novel ways
Consequences to society Have significant consequences in a range of contexts, characterized
and the environment by difficulty of prediction and mitigation
Familiarity Outside problems encompassed by standards and codes of practice
for professional Computer Science and Engineering
Page 91 of 94
Learning/Assessment Domains
Cognitive Domain(Anderson and Krathwohl’s Taxonomy 2001):

The cognitive domain involves the development of our mental skills and the acquisition of
knowledge.
Level Category Meaning Keywords
C1 Remembering Recognizing or recalling knowl Define, describe, draw, find,
edge from memory. identify, label, list, match, name,
Remembering is when memory quote, recall, recite, tell, write
is used to produce or retrieve
definitions, facts, or lists, or to
recite previously learned
information.
C2 Understanding Constructing meaning from Classify, compare, exemplify,
different types of functions be conclude, demonstrate, discuss,
they written or graphic explain, identify, illustrate,
messages or activities like interpret, paraphrase, predict, report
interpreting, exemplifying,
classifying, summarizing,
inferring, comparing, or
explaining.
C3 Applying Carrying out or using a Apply, change, choose, compute,
procedure through executing, or dramatize, implement, interview,
implementing. Applying relates prepare, produce, role play, select,
to or refers to situations where show, transfer, use
learned material is used through
products like models,
presentations, interviews or
simulations.
C4 Analyzing Breaking materials or concepts Analyze, characterize, classify,
into parts, determining how the compare, contrast, debate,
parts relate to one another or deconstruct, deduce, differentiate,
how they interrelate, or how the discriminate, distinguish, examine,
parts relate to an overall organize, outline, relate, research,
structure or purpose. Mental separate, structure
actions included in this function
are differentiating, organizing,
and attributing, as well as being
able to distinguish between the
components or parts. When one
is analyzing, he/she can
illustrate this mental function
by creating spreadsheets,
surveys, charts, or diagrams, or
graphic representations.
Page 92 of 94
C5 Evaluating Making judgments based on Appraise, argue, assess, choose,
criteria and standards through conclude, critique, decide, evaluate,
checking and critiquing. judge, justify, predict, prioritize,
Critiques, recommendations, prove, rank, rate, select, monitor
and reports are some of the
products that can be created to
demonstrate the processes of
evaluation.
C6 Creating Putting elements together to Construct, design, develop,
form a coherent or functional generate, hypothesize, invent, plan,
whole; reorganizing elements produce, compose, create, make,
into a new pattern or structure perform, plan, produce
through generating, planning, or
producing. Creating requires
users to put parts together in a
new way, or synthesize parts
into something new and
different creating a new form or
product. This process is the
most difficult mental function.
Psychomotor DomainDave’s Taxonomy 1975:

The psychomotor domain includes physical movement, coordination, and use of the motor-skill
areas.
P1 Imitation Copy action of another; observe Relate, Repeat, Choose, Copy,
and replicate. Follow, Show, Identify, Isolate.
P2 Manipulation Reproduce activity from Copy, response, trace, Show,
instruction or memory Start, Perform, Execute,
Recreate.
P3 Precision Execute skills reliably; Assemble, Implement,
independent of help. Organize, Calibrate,
Demonstrate, Build, Perfect,
Control, Complete, Measure.
P4 Articulation Adapt and integrate expertise to Modify, Master, Develop,
satisfy a non-standard objective. Adapt, Formulate, Coordinate,
Combine, Solve, Integrate.
P5 Naturalization Automated, unconscious mastery Design, Rank, Manage,
of activity and related skills at Compose, Develop, Specify,
strategic level. Construct, Invent.
Page 93 of 94
Affective Domain(Krathwohl, Bloom, Masia’s Taxonomy 1973):
The affective domain includes the manner in which we deal with things emotionally, such as
feelings, values, appreciation, enthusiasms, motivations, and attitudes.
A1 Receiving Willingness to participate in an Locate, Give, Point to, Follow,
activity to attend to a stimulus; Sit erect, Hold, Name, reply,
getting and holding the attention of Identify, Choose
students.
A2 Responding Actively participates; demonstrates Label, Answer, Perform, Write,
interest in an object, activity or Conform, Assist, Recite, Report,
phenomena; seeks or pursues this Read, Greet, Help, Present,
object, activity or phenomena. Compile.
A3 Valuing Value or worth attached to an Work, Form, Follow, Join,
object, activity or phenomena; Invite, Justify, Study, Explain,
varies from simple acceptance to Share, Propose, Select,
commitment. Complete, Describe, read,
report, Differentiate, Initiate.
A4 Organizing Compare and contrast, and resolve Relate, Synthesize, Identify,
conflict to build a consistent value Prepare, Defend, Generalize,
system; emphasis on comparing Modify, Integrate, Order,
and synthesizing values. Compare, Complete, Organize,
Adhere, Arrange, Combine,
Explain, Alter.
A5 Internalizing Adopt a value system for a length Influence, Propose, Use,
of time that contributes to a Quality, Revise, Serve, Solve,
particular “lifestyle” (i.e. directs Modify, Display, Practice,
behavior). Listen, Question, Perform, Act,
Discriminate, Verify
Page 94 of 94

Approved BSC Cse Obe Curriculum Summer 2018

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Approved BSC Cse Obe Curriculum Summer 2018

Uploaded by

Copyright:

Available Formats

East West University

Aftabnagar, Dhaka, Bangladesh

Outcome-Based Curriculum of B. Sc. in CSE Program

Vision Statement of CSE Department:

Mission of CSE Department:

Program Educational Objectives (PEOs) of B. Sc. in CSE Program:

Elective General Education Courses 9

Mathematics and Statistics Course 15

Core Computer Science and Engineering Courses 75

CSE209 Electrical Circuits Elective CSE Course - III

Year Credits 35 35.5 35.5 34

CSE103 Structured Programming

Credit Hours and Teaching Scheme:

Course Objective:The purpose of this course is to introduce the students to computer

Course Outcomes (COs):

Course Contents and Learning/Assessment Levels

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

Credit Hours and Teaching Scheme:

Prerequisite: CSE103 Structured Programming

Course Outcomes (COs):

Course Contents and Learning/Assessment Levels

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

CSE110 Object Oriented Programming

Credit Hours and Teaching Scheme:

Prerequisite:CSE106 Discrete Mathematics

Course Outcomes (COs):

Course Contents and Learning/Assessment Levels

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

CSE200 Computer-Aided Engineering Drawing

Credit Hours and Teaching Scheme:

Course Objective:This course introduces students to the standards and conventions of

Course Outcomes (COs):

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

Credit Hours and Teaching Scheme:

Prerequisite:CSE110 Object Oriented Programming

Course Outcomes (COs):

Course Contents and Learning/Assessment Levels

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

CSE209 Electrical Circuits

Credit Hours and Teaching Scheme:

Course Outcomes (COs):

Course Contents and Learning/Assessment Levels

Linearity and Superposition, Source Transformation, Thevenin and CO2 C2, C3

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

Credit Hours and Teaching Scheme:

Prerequisite: CSE207 Data Structures

Course Contents and Learning/Assessment Levels

Mapping of COs to POs:

Attributes of Complex Engineering Problems Involved

Attributes of Complex Engineering Activities Involved

CSE251 Electronic Circuits

Credit Hours and Teaching Scheme: