Latestcse
Latestcse
Latestcse
Syllabus
for
Bachelor of Science in
Computer Science and Engineering
Department of
Computer Science and Engineering
Faculty of Electrical and Computer Engineering (ECE)
Edition:
First Edition : 2015
Second Edition : 2020
Third Edition : 2023
Copyright:
© 2023 Dept. of CSE, BAUET; All Rights Reserved.
Cover Concept:
Mithun Kumar, Assistant Professor, Dept. of CSE.
Cover Design:
Md. Ruhul Amin Lemon
Printed by:
Uttoran Offset Printing Press, Rajshahi.
Disclaimer:
All the contents published in this syllabus are the property of Department of
Computer Science and Engineering, BAUET. The users of this syllabus are
prohibited to reuse, copy, distribute or republish any part of contents in any
manner without written permission from the head of the department. The purpose of
the syllabus of undergraduate studies is to provide guidance to concerned students
and teachers in the Department of Computer Science and Engineering.
ID Number:
Address:
Mobile No:
Preface to 3rd Edition
This preface introduces the Outcome Based Education (OBE) Curriculum for the Computer
Science and Engineering Program, a comprehensive framework designed to align educational
objectives with the needs of the industry and society according to BNQF (Bangladesh National
Qualifications Framework) and UGC guidelines. Some new courses have been incorporated in
this edition and some courses have been updated according to the requirements of UGC’s new
guidelines, BAETE (Board of Accreditation for Engineering and Technical Education) as
well as BAC (Bangladesh Accreditation Council). Other important changes in this curriculum
are that students can choose their elective courses from the 3rd year 2nd semester so that they will
be able to select the specialized field of interest. One of the most salient features of this curriculum
is Integrated Design Projects (Software Development Project-I & II) through which students will
solve complex engineering problems.
OBE emphasizes the outcomes of education, focusing on the demonstrable knowledge, skills, and
competencies that students should acquire by the end of their program. The OBE approach
outlined in this curriculum seeks to bridge the gap between academia and industry by providing
students with a well-rounded education that combines theoretical foundations with practical
application. By clearly defining learning outcomes, curriculum designers and educators can shape
the teaching and learning process to ensure that students develop the necessary abilities and
mindset to succeed in their professional careers. The OBE framework places a strong emphasis on
active learning, critical thinking, problem-solving, and teamwork. It encourages educators to adopt
innovative teaching methodologies, such as project-based learning, experiential learning, and
collaborative activities, to facilitate deeper understanding and engagement among students.
Additionally, this curriculum will promotes the integration of emerging technologies and industry
best practices, enabling students to stay abreast of the latest trends and advancements in the field.
The OBE Curriculum for Computer Science and Engineering Program of BAUET will encourage
a holistic development of students, fostering not only technical expertise but also essential
transferable skills, such as communication, collaboration, and adaptability. It promotes the
cultivation of a growth mindset and a lifelong learning attitude, enabling graduates to continuously
evolve and thrive in a rapidly changing technological landscape. BAUET, as an educational
institutions strive to produce well-rounded graduates who are equipped to address the complex
challenges of the digital era, the Outcome Based Education Curriculum for Computer Science and
Engineering Program offers a roadmap for curricular transformation. By aligning educational
outcomes with industry expectations, this framework empowers institutions to deliver a relevant,
engaging, and future-proof education that prepares students to become competent professionals
and innovative problem solvers.
I hope that this OBE Curriculum for Computer Science and Engineering Program will inspire and
guide educational institutions in their pursuit of excellence and equip students with the skills and
mindset needed to shape the future of the computing field.
The University aspires to transform into a center of excellence in Science, Engineering and
Technology program by providing innovative, multi-disciplinary courses and extensive
research facilities to the young generation of the country and beyond. It endeavors to make
the University a hub of knowledge and be recognized as a leading university in the country.
The Mission of the BAUET is to provide state-of-the-art education and research in science,
engineering and other relevant programs to develop human resources for the socio-economic
well-being of the society.
To create skilled and competent professionals in the field of Computer Science and
Engineering with high morals to meet national and global needs through creative research
and innovations.
1
DM4 To embed leadership qualities amongst the students to follow successful
professional career paths and to pursue advanced studies in computer
engineering and a life-long learner in cutting-edge developments in the
field of computing and Information Technology (Statement-4).
i. Graduates will apply their knowledge and skills to succeed in their careers
and/or obtain advanced degrees.
ii. Graduates will behave ethically and responsibly and will remain informed
and involved as full participants in their profession and society.
iii. Graduates will creatively solve problems, communicate effectively and
successfully function in diverse and inclusive multi-disciplinary teams.
The B.Sc. Engineering courses in Computer Science and Engineering program shall be
offered over a period of four academic years, each of a normal duration of one calendar
year. The four academic years shall be designated as 1st Year, 2nd Year, 3rd Year and 4th
Year in succeeding higher levels of study. The academic year will be divided into two
semesters (1st Semester and 2nd Semester) each having duration of 24 weeks. Under no
circumstances, any student shall be allowed to continue his/her study for B.Sc. in CSE
degree for more than six academic years. A student will be required to have 80%
attendance of the total number of periods of lectures/tutorials/laboratory classes held
during the semester in every course to appear as a regular candidate at that semester final
examinations. The courses offered for Bachelor of Science in Computer Science and
Engineering program will consist of theories, laboratories, viva-voce, quizzes/class tests,
assignments, presentations, case studies, industrial training, mini projects (laboratory
courses), Software Development Project (I and II) and Final Year Design Project
(FYDP)/Thesis are of 41 theory courses, 35 laboratory courses. Minimum 161 credits
and Cumulative Grade Point Average (CGPA) 2.25 out of 4.00 are required to
obtain the degree.
2
1.11.Graduate Attributes (based on need assessment)
Learning
Outcome Level Descriptors
Domain
Fundamental F1.
Skills Demonstrate knowledge and critical understanding of the well-
established principles of his/her field of study and of the way in which
those principles have developed;
F2.
Apply underlying concepts and principles outside the context in which
they were first studied, where appropriate, the application of those
principles in an employment context;
F3.
Apply knowledge and skills in addressing issues/solving problems
with minimal supervision;
F4.
Evaluate critically the appropriateness of different approaches to
solving problems in his/her field of study;
F5.
Support supervision of junior staff via a mentor or a leader/manager;
and
F6.
Display advanced digital literacy which is adequate to perform
complex tasks and bring about solutions.
Social Skills S1.
Communicate and interact effectively and clearly, ideas, information,
problems and solutions as a team to peers, experts and non-experts in
Bangla and English;
S2.
Express her/himself fluently and spontaneously in English and
Bangla;
S3.
Use language flexibly and effectively for social, academic and
professional purposes;
S4.
Produce clear, well structured, detailed text on complex subjects,
showing controlled use of organizational patterns, connectors and
cohesive devices in advanced proficiency level of Bangla and English;
S5.
Demonstrate the ability to incorporate entrepreneurial skills in
planning daily activities; and
S6.
Display advanced civic literacy and knowledge, exercising civic
rights and obligations at all levels as well as participating in changes
for the improvement of Bangladesh society.
3
Thinking Skills T1.
Exercise very substantial degree of autonomy and often significant
responsibility in making judgments/decisions towards the
management of self, others and for the allocation of substantial
resources; and
T2.
Demonstrate professional knowledge and practical skills in both
technical and management to lead a team in inexperienced
environment.
Personal Skills P1.
Engage in self-direction and self-enterprise skills;
P2.
Demonstrate social, professional, environmental and ethical
practice/values;
P3.
Show-case global knowledge and competencies to fulfil employment,
entrepreneurial and lifelong learning skills; and
P4.
Contribute significantly to the society.
Program Learning Outcomes (PLOs) represent the knowledge, skills and attitudes the
students should have at the end of a four-year engineering program. The Bachelor of
Computer Science and Engineering (CSE) program will have following learning outcomes:
4
PLOs PO Statements
PLO1 Engineering knowledge: Apply knowledge of mathematics, natural
science, engineering fundamentals and an engineering specialization to
the solution of complex engineering problems.
PLO2 Problem Analysis: Identify, formulate, research literature and analyze
complex engineering problems reaching substantiated conclusions using
first principles of mathematics, natural sciences and engineering sciences.
PLO3 Design/development of solutions: Design solutions for complex
engineering problems and design systems, components or processes that
meet specified needs with appropriate consideration for public health and
safety, cultural, societal, and environmental considerations.
PLO4 Investigation: Conduct investigations of complex problems using
research-based knowledge and research methods including design of
experiments, analysis and interpretation of data, and synthesis of
information to provide valid conclusions.
PLO5 Modern tool usage: Create, select and apply appropriate techniques,
resources, and modern engineering and IT tools, including prediction and
modelling, to complex engineering problems, with an understanding of
the limitations.
PLO6 The engineer and society: Apply reasoning informed by contextual
knowledge to assess societal, health, safety, legal and cultural issues and
the consequent responsibilities relevant to professional engineering
practice and solutions to complex engineering problems.
PLO7 Environment and sustainability: Understand and evaluate the
sustainability and impact of professional engineering work in the solution
of complex engineering problems in societal and environmental contexts.
PLO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of engineering practice.
PLO9 Individual work and teamwork: Function effectively as an individual,
and as a member or leader in diverse teams and in multi-disciplinary
settings.
PLO10 Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such
as being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear
instructions.
PLO11 Project management and finance: Demonstrate knowledge and
understanding of engineering management principles and economic
decision- making and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary
environments.
PLO12 Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest
context of technological change.
5
1.14.Mapping Mission of the Department with PEOs
Departmental mission
statements
statement 1
statement 2
statement 3
statement 4
PEO PEO statements
No.
Graduates of the Computer Science and Engineering program are expected to attain or
achieve the following Program Educational Objectives within 3 to 5 years of graduation:
8
1.16. Mapping Courses with the PLOs
Course
Course
PLO10
PLO11
PLO12
PLO 1
PLO 2
PLO 3
PLO 4
PLO 5
PLO 6
PLO 7
PLO 9
PPO 8
Code
Code
According
(Dept.)
to BNQF
1st Year 1st Semester
0611 CSE-1100 ✓ ✓ ✓
0533 PHY-1101 ✓ ✓
0533 PHY-1102 ✓ ✓ ✓
0531 CHEM-1101 ✓ ✓ ✓ ✓
0531 CHEM-1102 ✓ ✓ ✓
0541 MATH-1141 ✓ ✓ ✓
0232 HUM-1150 ✓ ✓
0222 GED-1151 ✓ ✓ ✓
0713 EEE-1161 ✓ ✓
0713 EEE-1162 ✓ ✓ ✓
1st Year 2nd Semester
0613 CSE-1211 ✓ ✓ ✓
0613 CSE-1212 ✓ ✓ ✓ ✓ ✓ ✓ ✓
0541 CSE-1213 ✓ ✓ ✓
0541 MATH-1241 ✓ ✓
0714 EEE-1261 ✓ ✓ ✓
0714 EEE-1262 ✓ ✓
0715 ME-1270 ✓ ✓ ✓ ✓
0232 HUM-1250 ✓ ✓ ✓ ✓ ✓ ✓
0223
GED-1251 ✓ ✓ ✓ ✓
0521
2nd Year 1st Semester
0613 CSE-2101 ✓ ✓ ✓ ✓
0613 CSE-2102 ✓ ✓ ✓ ✓ ✓
0613 CSE-2103 ✓ ✓ ✓ ✓
0613 CSE-2104 ✓ ✓ ✓ ✓ ✓
0612 CSE-2105 ✓ ✓ ✓ ✓
0612 CSE-2106 ✓ ✓ ✓ ✓ ✓ ✓
0611 CSE-2107 ✓ ✓ ✓
0611 CSE-2108 ✓ ✓ ✓ ✓ ✓
0541 MATH-2141 ✓ ✓
2nd Year 2nd Semester
0613 CSE-2211 ✓ ✓ ✓
0613 CSE-2212 ✓ ✓ ✓ ✓ ✓ ✓
9
0612 CSE-2213 ✓ ✓ ✓
0612 CSE-2214 ✓ ✓ ✓ ✓ ✓ ✓
0611 CSE-2215 ✓ ✓ ✓ ✓
0613 CSE-2216 ✓ ✓ ✓ ✓
0713 EEE-2261 ✓ ✓
0713 EEE-2262 ✓ ✓
0541 MATH-2241 ✓ ✓
0411 ✓ ✓ ✓ ✓ ✓
0412 GED-2251
0413
3rd Year 1st Semester
0613 CSE-3101 ✓ ✓ ✓
0613 CSE-3102 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓
0612 CSE-3103 ✓ ✓ ✓ ✓
0612 CSE-3104 ✓ ✓ ✓ ✓ ✓ ✓
0613 CSE-3105 ✓ ✓ ✓ ✓
0613 CSE-3106 ✓ ✓ ✓ ✓ ✓ ✓
0613 CSE-3108 ✓ ✓ ✓ ✓ ✓
0613 CSE-3110 ✓ ✓ ✓ ✓ ✓
0541 MATH-3141 ✓ ✓ ✓
0311
GED-3151 ✓ ✓ ✓
0314
3rd Year 2nd Semester
0613 CSE-3200 ✓ ✓ ✓ ✓ ✓ ✓
0611 CSE-3211 ✓ ✓ ✓
0611 CSE-3212 ✓ ✓ ✓ ✓ ✓
0613 CSE-3213 ✓ ✓ ✓
0613 CSE-3214 ✓ ✓ ✓ ✓
0611 CSE-3215 ✓ ✓ ✓
0611 CSE-3216 ✓ ✓ ✓ ✓ ✓
0542 MATH-3241 ✓ ✓ ✓
0031 CSE-3224 ✓ ✓ ✓ ✓
Elective (2T+1L)
0413 CSE-3217 ✓ ✓ ✓ ✓
0611 CSE-3219 ✓ ✓ ✓ ✓ ✓
0611 CSE-3221 ✓ ✓ ✓ ✓
0613 CSE-3223 ✓ ✓ ✓ ✓
0613 CSE-3225 ✓ ✓ ✓
0613 CSE-3226 ✓ ✓ ✓ ✓
0613 CSE-3227 ✓ ✓ ✓ ✓
10
0613 CSE-3228 ✓ ✓ ✓
0613 CSE-3229 ✓ ✓ ✓
0613 CSE-3230 ✓ ✓ ✓ ✓ ✓ ✓
0613 CSE-3231 ✓ ✓ ✓
0613 CSE-3232 ✓ ✓ ✓ ✓ ✓
4th Year 1st Semester
061 CSE-4000 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓
0613 CSE-4100 ✓ ✓ ✓ ✓ ✓ ✓
0612 CSE-4101 ✓ ✓ ✓
0612 CSE-4102 ✓ ✓ ✓ ✓ ✓
0612 CSE-4103 ✓ ✓ ✓ ✓
0613 CSE-4105 ✓ ✓ ✓ ✓ ✓
Elective (2T+1L)
0611 CSE-4107 ✓ ✓ ✓ ✓ ✓
0413 CSE-4109 ✓ ✓ ✓ ✓ ✓
0611 CSE-4111 ✓ ✓ ✓
0613 CSE-4113 ✓ ✓ ✓ ✓
0613 CSE-4115 ✓ ✓ ✓ ✓
0613 CSE-4116 ✓ ✓ ✓ ✓
0613 CSE-4117 ✓ ✓ ✓ ✓
0613 CSE-4118 ✓ ✓ ✓ ✓
0613 CSE-4119 ✓ ✓ ✓
0613 CSE-4120 ✓ ✓ ✓
4th Year 2nd Semester
061 CSE-4000 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓
0613 CSE-4211 ✓ ✓ ✓
0613 CSE-4212 ✓ ✓ ✓
0413 GED-4251 ✓ ✓ ✓ ✓
Elective (2T+1L)
0613 CSE-4213 ✓ ✓ ✓
0612 CSE-4215 ✓ ✓ ✓ ✓
0612 CSE-4217 ✓ ✓
0611 CSE-4219 ✓ ✓ ✓ ✓
0611 CSE-4221 ✓ ✓ ✓ ✓ ✓
0611 CSE-4222 ✓ ✓ ✓ ✓ ✓ ✓
0612 CSE-4223 ✓ ✓ ✓ ✓
0612 CSE-4224 ✓ ✓ ✓ ✓ ✓ ✓
0611 CSE-4225 ✓ ✓ ✓ ✓
0611 CSE-4226 ✓ ✓ ✓ ✓ ✓
11
Chapter-2
Structure of the syllabus
80 𝑋 55𝑚𝑖𝑛 𝑋 14 𝑊𝑒𝑒𝑘𝑠
=
1540 𝑚𝑖𝑛𝑢𝑡𝑒𝑠
12
= 40 𝑐𝑟𝑒𝑑𝑖𝑡 ℎ𝑜𝑢𝑟
Total calculated credit hour= Total credit hour for theory + Total credit hour for
laboratory
= (120 + 40+1*) 𝐶𝑟𝑒𝑑𝑖𝑡 𝐻𝑜𝑢𝑟 = 161 𝐶𝑟𝑒𝑑𝑖𝑡 𝐻𝑜𝑢𝑟
*One credit hour extra added for industrial attachment.
Calculated credit hour 161 𝑐𝑟𝑒𝑑𝑖𝑡 ℎ𝑜𝑢𝑟>140 𝑐𝑟𝑒𝑑𝑖𝑡 ℎ𝑜𝑢𝑟, which satisfied the
program compliance criteria according to BNQF.
2.4. Total class weeks in a Year/Semester:
There will be two Semesters: 1st Semester and 2nd Semester. 1st Semester will be of 24
weeks and 2nd Semester will be of 28 weeks (Total 52 weeks). An Academic Calendar
will be provided to all the enrolled students to make them familiar to all academic
events. The holiday will also be included in the calendar. Duration of 1 st Semester and
2nd Semester will be as follows:
1st Semester:
Sl. Events Durations
1. Classes before Mid Semester 7 weeks
2. Mid Semester Break 1 week
3. Classes after Mid Semester 7 weeks
4. Lab Test Week 1 week
5. Preparatory Leave 2 weeks
6. Semester Final Examination 3 weeks
7. Result Publication and Semester End Vacation 3 weeks
Total: 24 weeks
2nd Semester:
Sl. Events Durations
1. Classes before Mid Semester 7 weeks
2. Mid Semester Break 1 week
3. Classes after Mid Semester 7 weeks
4. Lab Test Week 1 week
5. Preparatory Leave 2 weeks
6. Semester Final Examination 3 weeks
7. Result Publication and Semester End Vacation 3 weeks
8. Industrial Training 4 weeks
Total: 28 weeks
Note: Those who will not be able to clear any of the courses (only theoretical) of any
discipline in a particular Semester (1st Semester and 2nd Semester) will be required to appear
at the referred examination (Re-examination) for fulfilling the condition as per policy to clear
the subject(s).
Course Title
Pre-requisite
Laboratory
BNQF
Dept.)
Code
Credits
Sl.
Theory
Course Title
(Dept.)
Pre-requisite
Laboratory
Credits
BNQF
Code
Theory
Sl.
Course Title
Course Code
Pre-requisite
Laboratory
BNQF
(Dept.)
Code
Credits
Theory
Sl.
Pre-requisite
Course Title
(Dept.)
Laboratory
Credits
BNQF
Code
Theory
Sl.
Hours/Week
Course Code
Pre-requisite
Course Title
(Dept.)
Laboratory
Credits
BNQF
Code
Theory
Sl.
16
0613 Data Structures and
13. CSE-2211 3.00 - 3.00 CSE-2101
Algorithms-II
0613 Data Structures and
14. CSE-2212 - 3.00 1.50
Algorithms-II Laboratory
15. 0612 CSE-2213 Data Communication 3.00 - 3.00
0612 Data Communication
16. CSE-2214 - 1.50 0.75
Laboratory
0611 Computer Organization and
17. CSE-2215 3.00 - 3.00
Architecture
0613 Java Programming
18. CSE-2216 - 2.00 1.00 CSE-2103
Laboratory
0613 Software Engineering and
19. CSE-3101 3.00 - 3.00
Information System Design
0613 Software Engineering and
20. CSE-3102 Information System Design - 2.00 1.00
Laboratory
21. 0612 CSE-3103 Computer Network 3.00 - 3.00
0612 Computer Network
22. CSE-3104 - 3.00 1.50
Laboratory
23. 0613 CSE-3105 Operating Systems 3.00 - 3.00
0613 Operating Systems
24. CSE-3106 - 3.00 1.50
Laboratory
0613 Web Programming
25. CSE-3108 - 2.00 1.00
Laboratory
0613 Mobile Application
26. CSE-3110 - 2.00 1.00
Development Laboratory
0613 Software Development
27. CSE-3200 - 1.50 0.75
Project – I*
0611 Microprocessors, Micro-
28. CSE-3211 controllers and Assembly 3.00 - 3.00
Language
0611 Microprocessors, Micro-
29. CSE-3212 controllers and Assembly - 1.50 0.75
Language Laboratory
30. 0613 CSE-3213 Artificial Intelligence 3.00 - 3.00
0613 Artificial Intelligence
31. CSE-3214 - 1.50 0.75
Laboratory
0611 Automata Theory and
32. CSE-3215 3.00 - 3.00
Compiler Design
0611 Automata Theory and
33. CSE-3216 - 1.50 0.75
Compiler Design Laboratory
34. 0031 CSE-3224 Industrial Training** - 2.00 1.00
0613 Software Development
35. CSE-4100 - 1.50 0.75 CSE-3200
Project – II*
36. 0612 CSE-4101 Digital Signal Processing 3.00 - 3.00
17
0612 Digital Signal Processing
37. CSE-4102 - 1.50 0.75
Laboratory
0612 Cellular and Wireless
38. CSE-4103 3.00 - 3.00
Communication
0613 Data Science and
39. CSE-4105 3.00 - 3.00
Applications
0613 Computer Graphics and
40. CSE-4211 3.00 - 3.00
Multimedia Systems
0613 Computer Graphics and
41. CSE-4212 Multimedia Systems - 1.50 0.75
Laboratory
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
(Dept.)
BNQF
Code
Theory
Sl.
Laboratory
Credits
Course
BNQF
Code
Code
Theory
Sl.
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Code
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
19
7th Semester Elective-IV: (01Theory +01 Laboratory)
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
20
0611 Internet of Things (IoT)
2. CSE-4222 - 1.50 0.75
Laboratory
0612 Advanced Database
3. CSE-4223 3.00 - 3.00
Management Systems
0612 Advanced Database
4. CSE-4224 Management Systems - 1.50 0.75
Laboratory
5. 0611 CSE-4225 Pattern Recognition 3.00 - 3.00
0611 Pattern Recognition
6. CSE-4226 - 1.50 0.75
Laboratory
Hours/Week
Pre-requisite
Course Code
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
21
Chapter-3
Course Requirements for the B.Sc. in CSE
Year/Semester wise distribution of courses
22
1st Year 1st Semester
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
1. 0613 Structured
CSE-1211 3.00 - 3.00
Programming
2. 0613 Structured
CSE-1212 Programming - 3.00 1.50
Laboratory
3. 0541 CSE-1213 Discrete Mathematics 3.00 - 3.00
4. 0541 Ordinary, Partial
MATH-1241 Differential Equations 3.00 - 3.00
and Coordinate
23
Geometry
5. 0714 Electronic Devices and
EEE-1261 3.00 - 3.00 EEE-1161
Circuits
6. 0714 Electronic Devices and
EEE-1262 - 1.50 0.75
Circuits Laboratory
7. 0715 Basic Mechanical
ME-1270 Engineering and - 3.00 1.50
Drawing Laboratory
8. 0232 Technical and
HUM-1250 Communicative - 3.00 1.50 Hum-1150
English-II Laboratory
9. 0223 Society, Ethics and
GED-1251 3.00 - 3.00
0521 Environment
Total: 15.00 10.50 20.25
Pre-requisite
Course Code
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
24
2nd Year 2nd Semester
Hours/Week
Course Code
Course Title
requisite
Laboratory
Credits
BNQF
Code
Pre-
Theory
Sl.
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
25
0613 Software Engineering
2. CSE-3102 and Information System - 2.00 1.00
Design Laboratory
3. 0612 CSE-3103 Computer Network 3.00 - 3.00
0612 Computer Network
4. CSE-3104 - 3.00 1.50
Laboratory
5. 0613 CSE-3105 Operating Systems 3.00 - 3.00
0613 Operating Systems
6. CSE-3106 - 3.00 1.50
Laboratory
0613 Web Programming
7. CSE-3108 - 2.00 1.00
Laboratory
0613 Mobile Application
8. CSE-3110 Development - 2.00 1.00
Laboratory
9. 0541 MATH-3141 Numerical Analysis 3.00 - 3.00
0311 Engineering Economics 3.00 3.00
10. GED-3151
0314 and Sociology
Total: 15.00 12.00 21.00
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Hours/Week
Course Code
Pre-requisite
Course Title
Credits
BNQF
Code
Laboratory
Sl.
Theory
1. 0031 CSE-3224 Industrial Training** - 2.00 1.00
*Note: Each student has to complete two Software Development Project (CSE-3200
and CSE-4100) and topics or fields of the project work will be decided by the
department.
**Note: Industrial Training (CSE-3224) will be conducted at any convenient time or
after the 3rd Year, 2nd Semester final examination for the duration of 04 weeks as
applicable or will be decided by the department. Evaluation report from industry has
to be submitted at the end of the training and to be incorporated in the tabulation
sheet accordingly.
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
***Note: Each student has to complete Final Year Design Project (FYDP)/Thesis
(CSE-4000) in the combined duration of two semester (7th and 8th semester). All
students and concerned supervisors has to follow standard guidelines prepared for
Final Year Design Project (FYDP)/Thesis.
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Pre-requisite
Course Code
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
30
8th Semester Elective-VI (One Course including laboratory):
Hours/Week
Course Code
Pre-requisite
Course Title
Laboratory
Credits
BNQF
Code
Theory
Sl.
31
Chapter-4
Detail outline of undergraduate course offered by the dept. of CSE
32
BNQF Code: 0533 Contact Hours/Week: 3.00
Course Code: PHY-1101
Course Title: Physics Credit Hour: 3.00
Rationale:
Enable to use the understanding to predict how an object will behave under particular
conditions and to help improving the functionalities of everyday objects.
Course Contents:
Waves & Oscillations: Differential equation of simple harmonic oscillator, total energy and
average energy, Combination of simple harmonic oscillations, spring-mass system, damped
oscillation, forced oscillation, resonance, stationary wave, phase velocity, group velocity,
Wave motion, wave energy.
Optics and Laser: Theories of light: Interference of light, Young’s double slit experiment,
Fresnel’s biprism. Interference in thin films, Newton’s rings, Interferometers, Diffraction of
light: Fresnel and Fraunhofer diffractions, Diffraction by single slit, diffraction by double
slits, diffraction gratings, Resolving power of optical instruments, Polarization of light:
production and analysis of polarized light, polarization by double refraction, Brewster’s law,
Maluslaw, Nicoleprism, optical activity and polarimeter. Laser, spontaneous and stimulated
emission, Helium-Neon laser, laser applications, Fiber optics.
Heat and thermodynamics: Principal of temperature measurements, resistance
thermometer, thermos-electric thermometer, pyrometer. Kinetic theory of gases: Maxwell’s
distribution of molecular speeds, mean free path, equipartition of energy, Brownian motion,
Vander Weal’s equation of state, review of the first law of the thermodynamics and it’s
application, reversible and irreversible process, second law of thermodynamics, Carnot
cycle, efficiency of heat engines, Carnot’s Theorem, entropy and disorder, thermodynamic
functions, Maxwell relations, Clausius-Clapeyron equation, Gibbs phase rule, third law of
thermodynamics.
Structure of Matter: Crystalline and non-crystalline solids, single crystal and polycrystal
solids, unit cell, crystal systems, co-ordinations number, crystal planes and directions,
sodium chloride and CsCl structure, packing factor, Miller indices, relation between inter-
planar spacing and Miller indices, Bragg’s law, methods of determination of inter-planar
spacing from diffraction patterns; Defects in Solids: Point defect, line defects, Bonds in
solids, inter atomic distances, calculation of cohesive and bonding energy; Introduction to
Band Theory: Distinction between metal, semiconductor and insulator
Reference Book (s):
1. Physics for Engineers, Part-1 & Part-2 (4th ed)- Dr. Giasuddin Ahmad, Hafiz Book Centre(2000).
2. Wave sand oscillations (2nded)-Brijlal and Subramannyam, Vikas Publishing House PvtLtd(1994).
3. A Text Book of Optics - Brijlal and N. Subrahmanyam, S. Chand (2006).
4. Fundamental of Optics (3rd ed)-Jenkine and White, McGraw Hill(1957).
5. Fundamentals of Physics (10th ed)-Halliday, Resnick and Walker, Wiley(2013).
6. Physics part-I & II (2nd ed) - Resnick and Halliday, John Wiley & Sons, Inc.(1968).
33
BNQF Code:0533 Contact Hours/Week: 1.50
Course Code: PHY-1102
Course Title: Physics Laboratory Credit Hour: 0.75
Rationale:
Laboratory works based on PHY 1101
Course Contents:
Determination of the moment of inertia of a fly-wheel about its axis of rotation. Determination
of angle of a prism and hence calculation of refractive index of the material of it.
Determination of the mechanical equivalent of heat, J by Joule’s Calorimeter. Determination
of the spring constant and the effective mass of a loaded spring and hence to calculate the
modulus of rigidity of it. Determination of velocity of sound in air by resonance tube method.
Determination of the wavelength of the monochromatic light by Newton’s ring method.
Determination of the acceleration due to gravity “g” by means of a compound pendulum.
Determination of the specific heat of a solid by the method of mixture. Determination of the
thermal conductivity of a bad conductor by Lee’s method. Determination of the wavelengths
of various spectral lines by a spectrometer using a plane diffraction grating
Reference Book (s):
1. Physics for Engineers, Part-1 & Part-2 (4th ed)- Dr. Giasuddin Ahmad, Hafiz Book Centre(2000).
2. Wave sand oscillations (2nded)-Brijlal and Subramannyam, Vikas Publishing House PvtLtd(1994).
3. A Text Book of Optics - Brijlal and N. Subrahmanyam, S. Chand (2006).
4. Fundamental of Optics (3rd ed)-Jenkine and White, McGraw Hill(1957).
5. Fundamentals of Physics (10th ed)-Halliday, Resnick and Walker, Wiley(2013).
6. Physics part-I & II (2nd ed) - Resnick and Halliday, John Wiley & Sons, Inc.(1968).
35
Maximum and Minimum: Increasing and Decreasing of a Function, Turning Point, Point
of Inflation, Concave Up and Down, Maximum and Minimum of Different kind of Functions.
Partial Differentiations and Geometric Applications of Differentiations: Multivariable
Function, Partial Differentiations of multivariable functions, Tangent and Normal equations
for different kind of function at a point.
Integration: Formula of integration, Integration by methods of substitution, Integration by
parts, Integration of special function, Integration of partial fraction
Definite Integration and Applications of Integration: Properties of definite integration,
Beta and Gamma Function, Successive integration, Evaluate the Arc Length, Surface Area,
Area and Volume.
Reference Book (s):
1. Calculus - Haward Anton (9th ed)- Stephen Davis, Wiley(2012).
2. Differential Calculus- B. C. Das and B.N.Mukherjee
3. Integral Calculus- B. C. Das and B.N.Mukherjee
4. Differential and Integral Calculus (5th ed)-MatinChakraborty, Dhaka Standard Publication(2015).
5. A Text Book on Integral Calculus (4th ed)- Mohammad, Bhattacharjee&Latif, Dhaka(2010).
36
University Press.
2. Dixon,R.J.(1987).Complete course in English.(Book4).New Delhi, India: Prentice Hall of India.
(For book presentation)
3. S.M.Amanullah- A Guide to Correct Speech, Albatross Publications
4. R.C. Sharma & Krisna Mohan- Buisness Correspondence and Report Writing, Tata McGraw- Hill
Publication Ltd
5. Materials provided by the instructor.
37
6. Bangladesh Studies and Culture- Sumon Das & M.N. Mohabbat, Human Publications
7. History of Emergence of Bangladesh- Muntasir Mamun & Mahbubur Rahman, UGC
39
1st Year 2nd Semester
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-1211
Course Title: Structured Programming Credit Hour:0.75
Rationale:
To introduce the fundamental principles, mechanism of programming skills and develop
basic programming skills to program design and development.
Course Contents:
Programming concepts: Programming and coding; Program development stages;
Compilers, interpreters and IDE; Syntax and semantics; Flowcharts;
Structured programming language: Data types, Operators, Expressions, Control
structures;
Functions and program structure: Function basics, Parameter passing conventions, scope
rules and storage classes; Header files, User defined header files; Preprocessor; Pointer and
it’s uses; Arrays; Multidimensional Arrays; Strings;
User defined data types: Structures, Unions, Enumeration;
Input and Output: Standard input and output, Formatted input and output, Fileaccess;
Variable length argument list; Command line parameters; Error Handling; Exception
Handling; Linking; Library functions; Type casting;
Memory allocation: Static and Dynamic; Recursive Functions;
Introduction to data structure: Stack, Queue; File I/O; Graphics.
Reference Book(s):
1. Teach Yourself C – Herbert Schidlt
2. Programming in Ansi C - E Balagurusamy
3. C: The Complete Reference – Herbert Schildt
4. C Programming Language – Dennis M.Ritche
40
BNQF Code:0612 Contact Hours/Week: 3.00
Course Code: CSE-1213
Course Title: Discrete Mathematics Credit Hour:3.00
Rationale:
The course is designed to develop logical thinking and its application to computer science (to
emphasize the importance of proving statements correctly and de-emphasize the hand-waving
approach towards correctness of an argument). The subject enhances one’s ability to reason
and ability to present a coherent and mathematically accurate argument.
Course Contents:
Mathematical Logic: Propositional calculus and predicate calculus, Mathematical reasoning
and proof techniques
Set Theory: Sets, Relations, Partially ordered sets, Functions
Counting: Permutations, Combinations, Principles of inclusion and exclusion, Pascal’s
triangle, Discrete Probability, Recurrence relations and recursive algorithms, Growth of
functions, pigeonhole Principle and applications, Advance Counting Techniques
Graph: Introduction to graph, graph terminology, representing graph and graph
isomorphism, paths, reachability, connectivity, Euler and Hamilton path, shortest
path problems, Graph coloring, matrix representation of graph
Trees: Introduction of trees, application of trees, tree traversal, labeling trees, spanning trees,
minimal spanning tree.
Algebraic structures: Rings and groups, Monoid Groups, Abelian group,
properties of groups, Permutation Groups, Subgroups, Cyclic Group.
Reference Book(s):
1. Discrete Mathematics & Its Applications- Kenneth H Rosen
2. Discrete Mathematics with Applications -Thomas Koshy
3. Combinatories: Theory and Applications - V. Krishnamurthy, East-West Press.
4. Discrete Mathematics - Seymour Lipschutz, M. Lipson, Tata Mc GrawHill
5. Discrete Matheamatical Structures - Kolman, Busby Ross, Prentice Hall International
44
BNQF Code:0223, 0521 Contact Hours/Week:
Course Code: GED-1251 3.00
Course Title: Society, Ethics and Credit Hour:3.00
Environment
Rationale:
This course provides students with an understanding of the impact of technology on society
and the environment. The course examines ethical issues governing social, technological and
environmental policies, and the impact of their implementation. Students will learn to
analyze, question and resolve ethical dilemmas by developing a personal framework for
ethical and moral decision-making. They will explore your responsibilities in your personal
and professional lives, in the community and in the global environment. Class discussions
will include: privacy versus law enforcement, access to information, freedom of speech
versus control of content, stem cell research and medical advances in the context of culture,
global warming, green energies and sustainable technologies.
Course Contents:
Engineering Ethics and Codes: Introduction to Ethics, Theories of Ethics, Principles of
Engineering Ethics, Employers and employees, inter-professional relationship, Fundamental
Canons, NSPE codes, IEEE codes, ACM codes, Institutionalization of ethical conduct,
Ethical Dilemmas
Technology and Computer Ethics: Computer crime and cyber security, Privacy and
Confidentiality issue in CSE, Legal framework, Copyright laws, ICT Act, Right to
Information, Patents, Ethical challenges for CSE engineers with advancement of modern
technology in society, Case studies related ethical issues in ICT.
Engineering Ethics and Professionalism: Responsible professionals, corporations, The
origin of ethical thought, Ethics and the law, Moral reasoning and codes of ethics, ethical
decision making strategies, codes of ethics and case studies, moral issues and ethical theories.
Social issues on Environmental Protection and Law: Sustainable development goal
(SDGs), Environment and natural resources, Global environmental problems, environmental
ethics, Pollution, Solution and prevention, Environmental policy and protection tools, Waste:
problem and solutions, Urban environment, Industrialization, Climate change, Voluntary
tools in the environmental protection, impact of environmental laws in solving environmental
problems, Environmental legislation and its importance, Environmental ethics and social
responsibility, Importance of sustainability assessment tools and institutions before and after
laws are adopted.
Reference Book(s):
1. Charles B. Fleddermann, “Engineering Ethics”, Fourth Edition, 2012.
2. Mike W. Martin, Roland Schinzinger, “Introduction to Engineering Ethics”, Second Edition, 2010
3. Introduction to Engineering Ethics (3rd Edition) - Schinzinger and Martin; McGraw Hill.
4. Environmental Engineering: Principles and Practice - Wiley
45
2nd Year 1st Semester
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-2101
Course Title: Data Structures and Algorithms-I Credit Hour:3.00
Rationale:
This course introduces students to the basic concepts of Data Structures, developing
Programming Skills for Advanced Data Structures such as Stack, Queue, Trees, Hash Tables,
and Priority Queues etc. Demonstrate programming problems and improve the knowledge of
Algorithms.
Course Contents:
Introduction: Internal data representation; Abstract data types; Introduction to algorithms.
Asymptotic analysis: Growth of functions, O, Ω and Θ notations; Correctness proof and
techniques for analysis of algorithms; Master Theorem.
Elementary data structures: Arrays, linked lists, stacks, queues, trees and tree traversals,
graphs and graph representations, heaps, binary search trees.
Graph Traversals: DFS, BFS, Applications of DFS and BFS.
Sorting: Heapsort, merge sort, quicksort; Data structures for
set operations.
Methods for the design of efficient algorithms: Divide and conquer, greedy methods,
dynamic programming.
Reference Book(s):
1. Classic Data Structures 2nd Ed – Debasis Samanta
2. Data Structures using C 2nd Ed – Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein
3. Data Structures (Schaum's Outline Series), Tata McGraw-Hill- Seymour Lipshultz
48
BNQF Code:0612 Contact Hours/Week: 3.00
Course Code: CSE-2106
Course Title: Database Systems Credit Hour:1.50
Laboratory
Rationale:
This course is designed to introduce the basic concepts of database, learn the foundations of
database systems, focusing on basics such as the relational algebra and data model, schema
normalization, query optimization, and database designing.
Course Contents:
Introduction to SQL: Overview of the SQL query, Language, SQL data definition, Basic
structure of SQL, Queries, Null values, Aggregate functions, Modification of the database.
Intermediate SQL: Join expressions, Views, Transactions, Integrity constraints, SQL data
types and schemas.
Advanced SQL: Accessing SQL from a programming language, Functions and procedures,
Triggers, Recursive Queries, Advanced aggregation features.
Reference Book(s):
1. Database System Concept, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Fourth Edition
2. Files and Databases- An Introduction, Peter D. Smith and G.M. Barnes, Addison- Wesley
3. Database Management Systems, Raghu Ramakrishnan and Johannes Gehrke,Third edition
51
2nd Year 2nd Semester
52
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-2212
Course Title: Data Structure and Credit Hour: 1.50
Algorithms-II Laboratory
Rationale:
The Data Structure and Algorithm-II course is designed to provide hands on implementation
of commonly used data structures and algorithms. The lab begins with the implementation of
some commonly used data structures and then covers the implementation of some important
algorithms with required modifications and optimizations.
Course Contents:
Linear Time Sorting: Radix Sort, Bucket Sort, Proof of Correctness of Sorting algorithms
Basic Concept of STL: Vector, Set, Map, Pair, Priority Queue
Algorithms: Greedy Algorithm Properties, BFS, DFS, Fractional Knapsack Problem,
Minimum Spanning Tree: Kruskal and Prims Algorithm, Single Source Shortest Path:
Dijkstra’s Algorithm, Proof of correctness, Topological Sort, Backtracking: 8 Queen
problem
Dynamic Programming: Dynamic Algorithm Properties, 0-1 Knapsack, Single Source
Shortest Path: Bellman-Ford Algorithm, All pair of shortest path: Floyd Warshall
Algorithm, Flow Algorithm: Ford-Fulkerson Algorithm
Reference Book(s):
1. Introduction to Algorithms (3rd ed) – Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest;
Clifford Stein (2017 )
54
BNQF Code:0611 Contact Hours/Week: 3.00
Course Code: CSE-2215
Course Title: Computer Organization and Credit Hour:3.00
Architecture
Rationale:
This course introduces students to the basic concepts of computers, their design and how they
work. It encompasses the definition of the machine’s instruction set architecture, its use in
creating a program, and its implementation in hardware. The course addresses the bridge
between gate logic and executable software, and includes programming both in assembly
language (representing software) and HDL (representing hardware).
Course Contents:
Fundamentals of Computer Design: Introduction to Von Neumann Organization, RISC
and CISC Machines, Computer Design, Processor Design, HDL for Simple CPU
Implementation, Information representation, Measuring performance, Instructions and Data
Access Methods, Operations and Operands of Computer Hardware, Representing
Instruction, Addressing Styles; Arithmetic Logic Unit (ALU) Operations, Floating Point
Operations
Processor design: Data Paths-single Cycle and Multi Cycle Implementations, Arithmetic
and Logic Unit (ALU) and Register Set Design, CPU Instruction Set Design, Addressing
Modes, Assembly Language and Assembler Design, Stack Implementation for Supporting
Function Calling with Parameters, Interrupts, Exceptions, Operating System Calls and I/O
Operations, Bus Architecture, Turbo Boost Technology
Memory organization: Cache Memory: Computer Memory System Overview, Cache
Memory Principles, Elements of Cache Design, Pentium 4 Cache Organization, ARM Cache
Organization,
Internal Memory: Memory organization, ARM Cache Organization, cache, Error Correction,
virtual memory, channels; Concepts of DMA and Interrupts, Advanced DRAM
Organization;
External Memory: Magnetic Disk, RAID, Solid State Drives, Optical Memory, Magnetic
Tape, Input/ Output: External Devices, I/O Modules, Programmed I/O, Interrupt Driven I/O,
Direct Memory Access, I/O Channels and Processors, Thunderbolt and Infini Band
Multiprocessors: Types of Multiprocessors, Performance, Single Bus Multiprocessors,
Multiprocessors Connected by Network, Clusters.
Pipelining and Parallel Processing: Pipelining, Pipeline Hazards, Branch Prediction,
Speculative Execution, Instruction Level Parallelism, Superscalar Processor, Parallel
Processing, Threading.
Parallel Organization: Multiple Processor Organizations, Symmetric Multiprocessors,
Cache Coherence and the MESI Protocol, Multithreading and Chip Multiprocessors, Non-
uniform Memory Access, Vector Computation
Reference Book(s):
1. Computer Organization and Architecture - William Stalling
2. Computer Organization and Design - David APatterson
3. Structured Computer Organization - Andrew S.Tanenbaum
4. Computer Architecture and Organization, McGraw-Hill- John P. Hayes
5. Computer Organization, McGraw-Hill- Carl Hamacher, ZvonkoVranesic and Safwat Zaky
55
BNQF Code:0613 Contact Hours/Week: 2.00
Course Code: CSE-2216
Course Title: Java Programming Credit Hour:1.00
Laboratory
Rationale:
The Java Programming Laboratory course is designed to provide a comprehensive
knowledge about Objects, Class, Inheritance, Polymorphism, and Encapsulation to do
programming in an effective manner and solve practical life problems by building real-
time projects.
Course Contents:
Object-Oriented Programming (JAVA): Basic concepts on Java, basic operation,
command line, objects and classes in Java, class inheritance, encapsulation,
polymorphism, exception handling, abstract classes, interfaces, Java Array, String, JAVA
I/O (serialization) and stream, Generic Class and methods, Collection Frameworks,
Concurrency, Swing components and swing Layouts.
Reference Book(s):
1. Java, The Complete Reference (9th ed) - Herbert Schildt
57
BNQF Code:0411,0412,0413 Contact Hours/Week: 3.00
Course Code: GED-2251
Course Title: Project Management and Credit Hour:3.00
Finance
Rationale:
Project Management and Finance course has been designed to understand the overlapping
connection between engineering and management with financial matters through the study
of Smart Technologies, Project Management and financial matters in an organization which
will equip with the skills to understand the application of computing technology in real-
world situations
Course Contents:
Engineering Management: Principles of management; Introduction to Project
Management: Project Integration Management, Project Scope Management, Project Time
Management, Project Cost Management, Project Quality Management, Project Human
Resource Management, Project Risk Management; MIS: Introduction, Decision Support
Systems, MIS in decision making, Concept of Invention, Innovation, and Entrepreneurship;
Cost Management: elements of cost of products, allocation of overhead costs, marginal
costing, standard costing, cost planning and control, budget and budgetary control;
Development and planning process: annual development plan, National budget;
Accounting in Action: Meaning & Definition Of Accounting, Users And Uses Of
Accounting, Why Ethics Is A Fundamental Accounting Concept, Accounting Standards And
The Measurement Principles- Monetary Unit Assumption And The Economic Entity
Assumption, Accounting Equation, The Effects Of Business Transactions On The
Accounting Equation, The Five Financial Statements And How They Are Prepared, Ethics
In Accounting, Engineering Accounting; Financial management: objectives, strategy,
financing, performance analysis of the enterprise, investment appraisal, criteria of
investment; Marketing Management: Concepts, strategy, sales promotion, patent laws;
Technology Management: Management of innovation and changes, technology life cycle,
Case studies;
Reference Book(s):
1. Effective Project Management: Traditional, Agile, Extreme Paperback – Illustrated, 4 February
2014 by Robert K. Wysocki (Author)
2. The Art of Project Management Paperback – Import, 6 May 2005 by Scott Berkun (Author)
3. Project Management Absolute Beginner's Guide Paperback – Illustrated, 6 February 2017
by Greg Horine (Author)
58
3rd Year 1st Semester
61
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-3105
Course Title: Operating Systems Credit Hour: 3.00
Rationale:
The Operating System (OS) course is designed to provide a comprehensive understanding to
the modern Operating Systems. The course begins with the history of operating system and
the review of computer hardware and concentrates on operating system concepts, system
structure, process and threads, memory management, file system and related security aspects.
It also deals with multiprocessor systems, virtualizations and cloud service.
Course Contents:
Introduction to Operating System: Operating System Concepts, Its Role in
Computer Systems, Computer System Structure, Fundamental of Different Types of
Computer System, Operating System Structure and Operation, Kernel, System Call,
Protection and Security.
Process Management: Process concept, Model and Implementation, Process Scheduling,
Process State, Co- operating Processes.
Threads: Basics Concept, Multithreading Models, Threading Issues.
CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithm (SJF, FIFO,
round robin, etc.), Algorithm Evaluation.
Concurrency and Synchronization: Inter-Process Communication and Inter-Thread
Communication, Critical Region, Critical Section Problems and Solutions.
Memory Management: Memory Portioning, With and Without Swapping, Virtual Memory
– Paging and Segmentation, Demand Paging, Page Replacement Algorithms,
Implementation
File Systems: Files, Directories, Security, Protection.
Deadlocks: Modeling, Detection and Recovery, Prevention and Avoidance.
Secondary-Storage: Structure, Disk Scheduling, RAID Structure, I/O Hardware, Polling.
Interrupts, Direct Memory Access, Application I/O Interface,
Others: Case Study of Some Operating Systems, Introduction to the Different Smart Device
Operating System and Their Usage.
Reference Book(s):
1. Modern Operating Systems (4th ed) - Andrew S. Tanenbaum; Prentice Hall(2014)
2. Operating Systems Concepts, Wiley Publisher- Abraham Silberschatz and Peter Baer Galvin
3. Operating systems, McGraw-Hill- Madnick and J. Donovon
Unix System Programming in C++, Prentice Hall Publication- Terrence
62
Course Contents:
Introduction: Development of Linux Operating System, Installation of Linux in various
modes, Installation of windows application programs on Linux, Basic Linux Command
Linux Kernels and Office Environments: Compilation
Shell Programming: variables, statements, loop, array, functions etc;
Memory management: preemptive and non- preemptive algorithms and implementation
Inter process communication and Process scheduling: algorithms and implementation
Mutual exclusion and deadlock: algorithms and implementation
Security of Windows and UNIX like OS: hardening and security issues.
Reference Book(s):
1. Modern Operating Systems (4th ed) - Andrew S. Tanenbaum; Prentice Hall(2014)
2. “UNIX Shell Programming” – Kanetkar
63
BNQF Code:0613 Contact Hours/Week: 2.00
Course Code: CSE-3110
Course Title: Mobile Application Development Credit Hour:1.00
Laboratory
Rationale:
To achieve and impart holistic technical education using the best of infrastructure,
outstanding technical skill into competent and confident engineers and evolving the center
of excellence through creative and innovative idea about the real-life android application
development that will help student’s further lifelong learning experience and serve the nation
for the development based on technology based service.
Course Contents:
Introduction to Mobile Development Frameworks and Tools: Fully Centralized
Frameworks and Tools, N-Tier Client–Server Frameworks and Tools, J2ME, WAP, Symbian
EPOC, iPhone, Android, Windows CE.
Android application development: Getting started with android programming, Android
architecture, Application framework and libraries, Android runtime, Linux kernel, Android
user interface, Data persistence, Messaging and networking, Location Based Services,
Developing android services, Android application publishing
Security Issues in mobile computing: Security threats, Ensuring consistency and reliability.
Reference Book(s):
1. Handbook on Mobile and Ubiquitous Computing: Status and Perspective (1st
Edition) - Laurence T. Yang, EviSYukur and Seng W. Loke; CRC Press(2013)
2. Android Studio 3.0 Development Essentials (1st Edition) - Android 8 Edition;
Create Space Independent Publishing Platform(2017)
65
3rd Year 2nd Semester
BNQF Code:0613 Course Code: CSE-3200 Contact Hours/Week: 3.00
Course Title: Software Development Project – I* Credit Hour:1.50
Rationale:
The Individual Software Development Project – I course is designed to make its
learners able to solve advanced level industry problems and develop real time projects
professionally.
Course Contents:
Requirement Analysis and Design segment of Software Development Life Cycle,
Analyzing Software Design Specification, Developing Software Design Specification,
UML Diagrams, Designing UI of the application for SDS, Understanding software
Development pipeline, role of a Project Manager over all life cycle of a project
Reference Book(s):
1. Design Patterns: Elements Of Reusable Object Oriented Software, Erich Gamma, et al., new
edition 2015
2. Clean Architecture: A Craftsman’s Guide to Software Structure and Design, Robert C. Martin,
Prentice Hall, 2017
3. Clean Code: A Handbook of Agile Software Craftsmanship, Robert C. Martin, Prentice Hall, 2008
67
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-3213
Course Title: Artificial Intelligence Credit Hour:3.00
Rationale:
Artificial Intelligence course provides an introduction to the general appreciation of the
goals, subareas, achievements and difficulties of artificial intelligence, with a special
focus on basic search algorithms for problem solving, logic-based reasoning methods,
knowledge representation techniques, game playing theories as well as various forms of
learning including perceptron, decision tree, artificial neural net and genetic algorithm.
Course Contents:
Introduction to Artificial Intelligence and Intelligent Agent: Introduction, history of
AI, goals, philosophy, subareas, achievements and difficulties of AI, programming
without and with AI, applications, intelligence, types of intelligence, difference between
human and machine intelligence, intelligent agents, characteristics, structure of agents
and its functions, turing test, agent’s interaction with environments, rationality.
Reasoning Under Uncertainty: Logics of non-monotonic reasoning, implementation,
basic probability notation, bayes rule, certainty factors and rule-based systems, bayesian
networks, dempster, shafer theory, fuzzy logic, fuzzy set operations.
Knowledge Representation: Approaches and issues in knowledge representation,
knowledge, propositional logic, predicate logic, unification, resolution principle,
inference rules, pursing with grammar, purse tree, associative network, conceptual
graphs, frame structure, transition network, introduction to natural language processing.
Planning and Learning: Understand various searching techniques, conditional
planning, continuous planning, multi-agent planning, forms of learning, supervised
learning, unsupervised learning, inductive learning, reinforcement learning, game
playing theories, perceptron learning, learning decision trees, belief networks, neural net
learning, robotics.
Reference Book(s):
1. Artificial Intelligence: A Modern Approach (3rd Edition) – Stuart Jonathan
Russell, Peter Norvig; Prentice Hall (2010)
2. Artificial Intelligence: A New synthesis – Nils J. Nilsson; Routledge
3. Introduction to Turbo Prolog – Carl Townsend
68
Reference Book(s):
1. Artificial Intelligence: A Modern Approach (3rd Edition) – Stuart Jonathan
Russell, Peter Norvig; Prentice Hall (2010)
2. Artificial Intelligence: A New synthesis – Nils J. Nilsson; Routledge
3. Introduction to Turbo Prolog – Carl Townsend
70
Probability Distributions: Discrete probability distributions -binomial, Poisson,
negative binominal distributions and their properties continuous probability distributions-
uniform, normal, exponential distributions and their properties, stochastic process.
Queuing Theory and Model: Stochastic process, discrete time Markov chain and
continuous time, Markov chains (birth-death process) queuing models (birth- death
model, Monrovian model).
M/M/1, M/M/C, M/G/1, M/D/1, G/M/1 solution of network of queue-closed queuing
models and approximate models, application of queuing models in computer science.
Queuing Model: M/M/1, M/M/C, M/G/1, M/D/1, G/M/1 solution of network of queue-
closed queuing models and approximate models, application of queuing models in
computer science.
Reference Book(s):
1. Introduction to Probability Models-Sheldon M. Ross, 9th Edition.
2. Introduction to Probability-Dimitri P. Bertsekas and John N.Tsitsiklis
3. Probability Theory-Monindra Kumar Roy
4. An Introduction to Statistics and Probability- M. Nurul Islam
5. An Introduction to the Theory of Statistics-R.N.Shil
Elective Courses
(Department will offer some courses in 6th semester in which student can
select one theory courses as Elective-I and theory with laboratory course as
Elective-II)
71
Detection: Fault detection and location in combinational and sequential circuits; Test:
Fault test generation for combinational and sequential circuits; Fault modelling: Faults
in memory, memory test pattern and reliability; Performance monitoring: self-
checking circuits, burst error correction and triple modular redundancy, Defect: defect
avoidance, defect circumvention, shield and hardening, yields enhancement, degradation
Allowance;
Reference Book(s):
1. Design and Analysis of Fault Tolerant Digital System (1st Edition) - Barry W. Johnson; Addison
Wesley(1989)
2. Dependable Computing: A Multilevel Approach – Behrooz Parhami
3. Fault-Tolerant Systems (1st Edition) - Israel Koren, C. Mani Krishna; Morgan Kauffman (2010)
73
BNQF Code:0611 Contact Hours/Week: 3.00
Course Code: CSE-3223
Course Title: Advanced Algorithms Credit Hour: 3.00
Rationale:
This course motivates to implement advanced methods of algorithmic design, analysis,
and implementation. techniques that include amortization, randomization, word-level
parallelism, bit scaling, dynamic programming, network flow, linear programming,
fixed-parameter algorithms, approximation algorithms etc. to identify which algorithm
will provide efficient result for a specific problem or context.
Course Contents:
Randomized Algorithms: Las Vegas and Monte Carlo Algorithms; Randomized Data
Structures: Skip Lists; Amortized Analysis: Different methods, Applications in
Fibonacci Heaps; Lower Bounds: Decision Trees, Information Theoretic Lower
Bounds, Adversary Arguments; Approximation Algorithms: Approximation Schemes,
Hardness of Approximation; Fixed Parameter Tractability: Parameterized
Complexity, Techniques of designing Fixed Parameter Algorithms, Examples; Online
Algorithms: Competitive Analysis, Online Paging Problem, k-server Problem; External
Memory Algorithms; Advanced Data Structures: Linear and Non-linear Methods.
Reference Book(s):
1. An Introduction to Computational Learning Theory - Michael J. Kearns , Umesh Vazirani; The
MIT Press(1994)
2. Algorithm Design (1st Edition) - Jon Kleinberg , ÉvaTardos; Pearson(2012)
3. Randomized Algorithms (1st Edition) - Rajeev Motwani , Prabhakar Raghavan; Cambridge
University Press(1995)
4. Probability and Computing: Randomized Algorithms and Probabilistic Analysis - Michael
Mitzenmacher, Eli Upfal; Cambridge University Press(2005)
74
Image Restoration: Image Degradation/Restoration process, Noise models, Restoration
in presence of noise, Inverse filtering, Minimum mean square filtering, Geometric mean
filter, Geometric transformations.
Color Image Processing: Color Fundamentals, Color models, Basis of full color image
processing, Color transformations.
Image Compression: Fundamentals, Image compression models, Error free
compression, Lossy compression.
Morphological Image Processing: Preliminaries, Dilations, and erosion, opening and
closing, Some basic morphological algorithms
Image Segmentation: Detection of discontinuities, Edge linking and boundary
detection, Thresholding, Region oriented segmentation.
Representation, Description and Recognition: Representation-chain codes, polygonal
approximation and skeletons, Boundary descriptors-simple descriptors, shape numbers,
Regional descriptors- simple, topological descriptors, Pattern and Pattern classes
Recognition based on matching techniques.
Reference Book(s):
1. Digital Image Processing (3rd/2nd Edition) - R. C. Gonzalez and R.E. Woods; Pearson
Prentice Hall(2009)
2. Fundamentals of Digital Image Processing, Academic Press-A. K. Jain
3. Digital Image Processing, Wiley-Interscience-William K. Pratt
75
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-3227
Course Title: Simulation and Modeling Credit Hour: 3.00
Rationale:
This course motivates to enable a substitute of physical experimentation that is often
utilized when conducting experiments on a real system which is impossible or
impractical, often because of cost or time and instead uses mathematical knowledge and
computer's computation power to solve real-world problems reasonably and in a time
efficient manner.
Course Contents:
Simulation modelling basics: systems, models and simulation; Classification of
simulation model; Steps in a simulation study; Concepts in discrete-event simulation:
event scheduling vs. process interaction approaches, Time-advance mechanism,
organization of a discrete-event simulation model; Continuous simulation models;
Combined discrete-continuous models; Monte Carlo simulation; Simulation of queuing
systems. Building valid and credible simulation models: validation principles and
techniques, statistical procedures for comparing real-world observations and simulated
outputs, input modeling; Generating random numbers and random variants; Output
analysis. Simulation languages; Analysis and modeling of
some practical systems: Random Number Generator, Random Variables, Probability
Distribution.
Reference Book(s):
1. Simulation Modeling and Analysis (5th Edition) - Law A. M., Kelton W. D.; McGraw
Hill (2014)
2. Computer Aided Modeling and simulation - J. A.Spriet
3. Computer Simulation and Modeling - R. S.Lehman
4. System Simulation - G.Cordon
76
BNQF Code:0613 Contact Hours/Week: 3.00
Course Code: CSE-3229
Course Title: VLSI Design Credit Hour: 3.00
Rationale:
This course is designed to enhance students' understanding of the theory and
fundamentals of silicon fabrication, the design principles and logical considerations of
designing silicon chips, and finally, to develop an understanding of design considerations
and the overall process of VLSI systems and their fabrication. This course is also
intended to enable students to contribute to VLSI system designing and to have a better
understanding of the different characteristics of such circuits.
Course Contents:
VLSI design methodology: Top-down design approach, Technology trends.
MOS Technology: Introduction to MOS technology, Operation of MOS transistor as a
switch and amplifier, MOS, NMOS, CMOS inverters, pass transistor and Pass gates, DC
and transient characteristics.
Fabrication Process and Layout: NMOS, CMOS, Bi-CMOS process.
Design Rules: Introduction to BiCMOS Circuits, Complex CMOS Gates, CMOS layout
design rules and stick diagrams
CMOS Building Blocks: Adder, Comparator, Multiplier, Counter, and Shifter. Design
Methodology and Tools.
Geometric and stick diagrams and Hardware modeling: PLA, FPGA, cell-based and
full custom design methods, System-on chip design, Hardware modeling, Logic
Networks.
Design style: FPGA and PLDs.
Reference Book(s):
1. Modern 1.Modern VLSI Design: System-on-Chip Design (3rd Edition) - Wayne Wolf;
Prentice Hall(2002)
2. CMOS VLSI Design- A Circuit and System Perspective (3rd Edition) - Neil H.E.
Weste, David Harris and Ayan Banerjee; Pearson(2009)
77
Reference Book(s):
1. Modern 1.Modern VLSI Design: System-on-Chip Design (3rd Edition) - Wayne Wolf;
Prentice Hall (2002)
2. CMOS VLSI Design- A Circuit and System Perspective (3rd Edition) - Neil H.E.
Weste, David Harris and Ayan Banerjee; Pearson (2009)
79
4th Year 1st Semester
Reference Book(s):
1. Digital Signal Processing - John G. Proakis & Dimitris Manolakis
2. Discrete-Time Signal processing - Allan Oppenheim & Ronald Schafer
3. Digital Signal Processing-A practical approach - Emmanuel C. Ifeachor BarrieW.Jervis
4. Signals and Systems - Rodger Ziemer & William Tranter
82
Introduction of Data:
Sources of data, data collection and types of data, Sampling from a population, Data errors
and appropriateness/Cleaning Data, The role of data in decision making at various levels of
society.
Methods of Data Analysis:
Distributions (including measures of central tendency and spread), Expressions, names, and
tables, Joins, Arrays, Functions, Modelling/mining the data.
Interpreting results of the data analysis/Data Interpretation: Correlation, Chance,
Decisions and error probabilities, Classification, Confidence intervals, Simulations,
Empirical, Categorical, and Numerical Distributions, Assessing Models.
Communicate data-driven insights in multiple media modes: Data visualization -
(including graphs, charts, and histograms - univariate qualitative, univariate quantitative,
bivariate), Communication of the Data Science Findings and What It Means, Converting
data into actionable information and the role of data in decision making at various levels of
society.
Ethical Aspects: Accuracy, Misrepresentation, Privacy, Security.
Additional topics: A/B Testing, Experiments, Hypothesis testing, Regression/Least
squares, Prediction intervals, Inference for the true slope, Bootstrap, Bagging, Clustering,
Frequent Patterns (Shopping Basket Analysis), Information Retrieval, Anomaly Detection
Legal issues surrounding data, Causality and Experiments.
Reference Book(s):
1. Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting Data 1st
Edition, Kindle Edition
2. Smarter Data Science: Succeeding with Enterprise-Grade Data and AI Projects, by Neal Fishman,
Cole Stryker, and Grady Booch
3. Data Science for Dummies (2nd Edition), by Lillian Pierson
Elective Courses
(Department will offer some courses in 7th semester in which student can
select one theory courses as Elective-III and theory with laboratory course as
Elective-IV)
83
Domains, Access Control Lists, Capabilities.
Formal Models of Secure Systems: Multilevel Security, Covert Channels.
Cryptography: Overview, Symmetric cipher, Classical encryption technique, Block cipher
and the data encryption standard (DES), Triple DES, Introduction to finite fields, Advanced
Encryption Standard, Contemporary Symmetric Ciphers, confidentiality using symmetric
encryption public, Key encryption and Hash functions, Public-key Cryptography, RSA
algorithm, Key management, Diffie-Hellman key exchange, Other Public Key
Cryptosystem, Message Authentication and Hash function, Hash Algorithm, Digital
Signatures, Trusted Platform Modules.
Authentication: Authentication using a physical object, Authentication using biometrics.
Exploiting Software: Buffer Overflow Attacks, Format String Attacks, Dangling Pointers,
Null Pointer Dereference Attacks, Integer Overflow Attacks, Command Injection Attacks,
Time of Check to Time of Use Attacks.
Insider Attacks: Logic Bombs, Back Doors, Login Spoofing; Malware: Trojan Horses,
Viruses, Worms, Spyware, Rootkits;
Defenses: Firewalls, Antivirus and Anti-Antivirus Techniques, Code Signing, Jailing,
Model-Based Intrusion Detection, Encapsulating Mobile Code, Java Security.
Network Security: Network Security practice, Authentication application, Wireless
Network Security, Electrical Mail security, IP security and Web security; Research on
Security and Case Study.
Reference Book(s):
1. Cryptography and Network Security – William Stallings;
2. Cryptography and Network Security- Behrouz A.Forouzan
86
Reinforcement Learning, Feature, Hypothesis, Prediction Model, Evaluation Metrics,
Optimization and Brief Review of Required Mathematics.
Classification and regression: Nearest Neighbor algorithm, Linear Discriminant Analysis
(LDA), Linear Regression, Logistic Regression.
Decision Tree Learning: ID3, CART, Overfitting Issue, Incorporating Continuous-
Valued Attributes, Measures for Selecting Attributes, Handling Training Examples with
Missing Attribute Values.
Bayesian Learning: Naïve Bayes classifier, Bayesian Networks.
Support Vector Machine: Maximum Margin Classification, Soft Margin Optimization,
Gradient Ascent, Sequential Minimal Optimization, Support Vector Machine for Binary
and Multiclass Classification, Hyperparameter Tuning.
Clustering: K-means, K-medoids, Density-based Hierarchical Clustering, Mixture of
Gaussians and Expectation Maximization.
Ensemble Methods: Bagging, Boosting: Adaboost, Random Forests.
Artificial Neural Networks: Perceptron Learning Rule, Multilayer Perceptron, Loss
Function, Backpropagation, Backpropagation with time, Activation Functions, Loss
Functions, Gradient Descent Optimization, Adam, Bias Variance and Error analysis,
Regularization (L1, L2, Dropout), Kohenen Self-organizing Maps
Applications: Student should develop a predictive modeling application on imaging,
natural language or IoT data.
Reference Book(s):
1. Pattern Recognition and Machine Learning - Christopher M. Bishop; Springer
2. Machine Learning - Tom Mitchell, Mc Graw Hill
3. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by Geron Aurelien
4. Fundamentals of Machine Learning for Predictive Data Analytics by John D.
Kelleher, Brian Mac Namee, and Aoife D’Arcy
87
Machines: SVM, Victorian Kernels, Multiple Kernel Learning, One-Class Kernel
Machine, Kernel Dimensionality Reduction;
Design and Analysis of ML Experiment: Randomization, Interval Estimation, K-Fold
Cross-Validated Paired t Test, Binomial Test, Approximate Normal Test.
Reference Book(s):
1. Pattern Recognition and Machine Learning - Christopher M. Bishop; Springer
2. Machine Learning - Tom Mitchell, Mc Graw Hill
3. Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by
Geron Aurelien
4. Fundamentals of Machine Learning for Predictive Data Analytics by John D.
Kelleher, Brian Mac Namee, and Aoife D’Arcy
88
Reference Book(s):
1. Data Mining: Concepts and Techniques - Jiawei Han, Micheline Kamber, and Jian Pei, (Morgan
Kaufmann)
2. Data Mining and Data Warehousing - Bharat Bhushan Agarwal, Sumit Prakash Tayal
3. Data Warehousing, Data Mining, and OLAP - Alex Berson and Stephen J.Smith
89
Microprogramming, SAP-1, SAP-2;
Introduction to Embedded Systems.
Reference Book(s):
1. "Digital Principles and System Design" by Sanjay Kumar Suman and Bhagyalakshmi
2. "Digital System Design Using Programmable Logic Devices" by Lala Parag K
3. "Digital Systems: Principles and Applications" by Ronald J Tocci and Neal S Widmer
90
4th Year 2nd Semester
91
Multimedia System Architecture: Objects for Multimedia System: Text; Images and
graphics: Basic concepts, Computer image processing; Sound/ Audio: Basic concepts,
Music, MIDI, Speech; Video and animation: Basic concepts, Computer-based animation
Data
Compression Techniques: JPEG; H.261 (px64); MPEG; Intel’s DVI; Microsoft AVI;
Audio compression; Fractal compression Multimedia File Standards: RTF; TIFF; RIFF;
MIDI; JPEG DIB; AVI video; MPEG.
Multimedia Storage and Retrieval Technology: Magnetic media technology; Optical
media technology: Basic technology, CD Digital audio, CD-ROM, its architecture and
further development, CD-Write only (CD-WO), CD- Magnetic optical (CD-MO).
Architecture and Multimedia Communication Systems: Pen input; Video and image
display systems; Specialized processors: DSP; Memory systems; Multimedia board
solutions; Multimedia communication system; Multimedia database system (MDBMS)
User Interfaces: General design; Video and Audio at the user interface
Multimedia Applications: Imaging; Image/Voice processing and recognition; Optical
character recognition; Communication: Tele-service, Messaging; Entertainment: Virtual
reality, Interactive audio and video, Games. Audio and video conferencing, video on
demand, voice over IP.
Reference Book(s):
1. Introduction to Computer Graphics, Author: Foley J D and others
2. Computer Graphics, Author: Angel E.
3. Computer Graphics, Author: Hearn D and Baker M P
4. Multimedia systems, Author: Stimetz
5. Multimedia: Computing, Communications & Applications, Author: Ralf Steinmetz and Klara
Nahrstedt
6. Multimedia Systems Design, Author: Prabhat K. Andleigh and Kiran Thakrar.
7. The Complete Animation Course: The Principles, Practice and Techniques of Successful
Animation by Chris Patmore.
92
BNQF Code:0413 Contact Hours/Week: 2.00
Course Code: GED-4251
Course Title: Engineering Management and Leadership Credit Hour:2.00
Rationale:
The course is designed to make students understand the overlapping connection between
engineering and management in an organization through the study of varied management
practices and leadership traits as an engineer.
Course Contents:
Introduction to Leadership and Management: Definition of leadership and management,
basic difference between a leader and a manager, relation of leaders and managers with
respect to efficiency and effectiveness, qualities of leader and managers with examples from
history; Management Fundamentals: Definition of management & manager, levels of
management, management functions and skills, Mintzberg‘s managerial roles, Henri
Fayol‘s management principles, strategic management; Leadership & Motivation:
Motivation, Maslow‘s hierarchy needs, theory of X & Y, motivators and hygiene factors,
goal setting theory, reinforcement theory, equity theory, expectancy theory, Leadership
styles, leadership trait theory, managerial grid, contemporary leadership, conflicts
negotiation, leadership issues in 21st century, cross cultural leadership, engineer as a leader
and some simple case discussions on leadership (positive and toxic leadership) in the class
(Interactive Learning); Organizational Management: Organization, departmentalization,
chain of command, unity of command, cross functional area, authority, centralization and
decentralization, traditional & contemporary organization, matrix project structure, learning
structure, organizing collaboration; Planning and goal setting: Foundation of planning;
goals of plan, types of goal, types of goal & plan, goal setting, MBO, well written goal;
Control: Controlling process, controlling for organizational performance, types of control:
(feed-forward, feedback & concurrent), balanced scorecard, contemporary issues in control,
workplace concern & workplace violence, Change and Innovation: Change and
innovation, internal and external for change, changing process, creativity vs innovation;
Attitude: Components of Attitude, behaviour model and characteristics model; behaviour
vs. attitude, job attitude, job involvement, job satisfaction and customer satisfaction;
Personality: Personality determinants: heredity and environment, Myers-Briggs Type
Indicator, Big five personality model, personality traits (core self-evaluation,
Machiavellianism, narcissism, self-monitoring, risk taking, proactive personality);
Perception and Individual Decision Making: Factors influencing perception, attribution
theory, errors/biases in attribution, Factors of individual decision making, rational decision
making, bounded rationality, satisfice, common errors in decision making, creativity in
decision making; Understanding Work Team: Work group, work team, problem solving
team, self-managed work team, cross functional team, virtual team, team effectiveness,
team challenges; HR Management: Process of Human Resource Planning, forecasting
demand for labour, staffing, internal supply of labour, performance appraisal; Operations
Management: Project managing basics, goals and boundary of project, WBS, scheduling
a project, Demand and supply forecasting, inventory control; Information Technology and
Management: Management Information System (MIS), Enterprise Resource Planning
(ERP) - For introductory knowledge;
93
Reference Book(s):
1. The Manager's Path: A Guide for Tech Leaders Navigating Growth and Change 1st Edition by
Camille Fournie
2. High Output Management by Andrew S. Grove
3. The Five Dysfunctions of a Team: A Leadership Fable by Patrick Lencioni
Elective Courses
(Department will offer some courses in 8th semester in which student can
select one theory courses as Elective-V and theory with laboratory course as
Elective-VI)
94
BNQF Code:0612 Contact Hours/Week: 3.00
Course Code: CSE-4215
Course Title: Green Computing Credit Hour:3.00
Rationale:
The objective of this course is to make the students aware about impact of information
technology and computing industry on the environment/ecology and how can they
contribute in saving the mother earth by aligning their buying/operating/disposal practices
in respect of computing and IT gadgets.
Course Contents:
The concept, importance and issues involved in Green Computing/ Information
Technology; Carbon footprint in manufacturing of computing and IT products; other
effluents in IT manufacturing; the concept of design for environment;
Carbon footprint in operations of IT/computing gadget; green IT usage; Data centre and
server farms design, power, cooling and location; virtualization; BPR for sustainable
IT/computing.
Disposal practices in e-waste; e-waste recycling, formal vs. informal e-waste recycling;
extended producer responsibility; IT for paperless offices; IT for saving travel cost, time
and environment;
Electronic waste management regulations in Bangladesh; IEEE 1680 standard for green
computing.
Reference Book(s):
1. Green Computing: Tools and Techniques for Saving Energy, Money, and Resources By Bud E.
Smith
2. Green Computing Strategies for Competitive Advantage and Business Sustainability Mehdi
Khosrow-Pour, D.B.A.
96
BNQF Code:0611 Contact Hours/Week: 3.00
Course Code: CSE-4221
Course Title: Internet of Things (IoT) Credit Hour:3.00
Rationale:
The Internet of Things (IoT) course introduces the emergence of IoT and its contribution
in providing effective solution for an industrial environment. The course provides a
comprehensive discussion on the fundamentals of the technology, architecture,
challenges and issues (security, safety) of an overall IoT system.
Course Contents:
Evolution of IoT: history and emergence of IoT; Applications of IoT: case studies on a
number of industries - power, water, healthcare, transportation, oil and gas, construction,
agriculture, gene sequencers, mining and race cars. The IoT landscape: devices, wireless
networks, cloud, sensors, architectures; Introduction to IoT and embedded systems:
introductory concept of IoT and big data, cloud computing and edge computing; IoT
system architectures: IoT-oriented standards, protocols and databases; IoT devices: the
IoT device design space and platform design; Event-driven system: IoT event analysis;
IoT network model: single-hub network and multi-hub network; Industrial IoT:
industrial 4.0, IoT architecture, applications and basic challenges; Security and safety:
system security, network security, generic application security, privacy and
dependability; Security testing of IoT systems: fuzz testing for security – white-box
fuzzing, black-box fuzzing, fuzzing industrial control network systems.
Reference Book(s):
1. Internet of Things: A Hands-On Approach - Vijay Madisetti and ArshdeepBahga, VPTedition1,
2014.
2. Designing for Emerging- UX for Genomics, Robotics, and the Internet of Things Technologies –
Jonathan Follett, O’Reilly, 2014
97
IoT devices: the IoT device design space and platform design; Event-driven system:
IoT event analysis; IoT network model: single-hub network and multi-hub network;
Security and safety: system security, network security, generic application security,
privacy and dependability; Orientation and usage of modern tools: programming in
C/C++ (for programming the edge device), programming in Python using such
frameworks as TensorFlow (for ML-related tasks), containerized apps deployment using
Kubernetes, docker, computer networks, Apache Kafka, ElasticSearch, Kibana, Apache
Flink, Linux administration and familiarity with Amazon web technologies.
Reference Book(s):
1. Internet of Things: A Hands-On Approach - Vijay Madisetti and ArshdeepBahga, VPTedition1,
2014.
2. Designing for Emerging- UX for Genomics, Robotics, and the Internet of Things Technologies –
Jonathan Follett, O’Reilly, 2014
98
Course Contents:
Introduction: Oracle Installation, Authentication, Security, Table Creation, SQL:
Simple Query, Data Expressions, Join, Constraints, Advanced Query (GROUP Function
etc.), Subqueries, Single-row function, Numeric function, Manipulation function,
Conversion function, Nesting of function, Abstract data type, PL/SQL: Introduction to
PL/SQL, Database Trigger/ Procedure, Packages, Indexing, View.Object oriented
database, Distributed database, Management of distributed transactions, concurrency
control, reliability, administration, Management of multimedia database systems,
reliability; database ware-housing/data mining: basic concepts and algorithms.
Reference Book(s):
1. Database Systems: The Complete Book (2nd Edition) - Hector Garcia-Molina, Jeffrey D. Ullman
and Jennifer Widom; Pearson(2008)
2. Concurrency control and Recovery in Database Systems (1st Edition) - P. a Bernstein and N.
Goodman; Addison-Weasley (1987)
100
Chapter-5
Grading/Evaluation System
5.1 Grading Policy:
The total performance of a student in a given course is based on a scheme of continuous
assessment. For theory course this continuous assessment is made through a set of
quizzes/class tests, observations/class participation, homework/assignment and a semester
final examination. The assessment in laboratory courses is made by evaluating
performance of the student at work during the class, viva-voce during laboratory hours and
quizzes. Each course has a certain number of credits, which describes its corresponding
weightages. A letter grade with a specified number of grade points is awarded in each
course for which a student is registered. A student's performance is measured by the
number of credits completed satisfactorily and by the weighted average of the grade points
earned. A minimum Grade Point Average (GPA) is essential for satisfactory progress. A
minimum number of earned credits also have to be acquired in order to qualify for the
degree. Letter grades and corresponding grade points will be awarded in accordance with
the provisions (as per University Grant Commission-UGC grading system) shown below:
101
5.2 Distribution of Marks:
Theory Courses:
Thirty percent (30%) marks of theoretical course shall be allotted for continuous
assessment, i.e., quiz, class tests, home assignments, class evaluation and class
participation and 70% shall be allotted to the Semester Final Examination. The Final
examination is conducted centrally by the University. Distribution of marks for a given
course if as follows.
Category Marks %
Class participation/Presentation skill 5
Class performance 5
Homework/Assignment 5
Class tests 15
Final Examination (Maximum 3 Hours) 70
Total 100
Laboratory Courses:
Laboratory courses are designed and conducted by the concerned departments.
Examination on laboratory/practical subjects will be conducted by the respective
department before the commencement of semester final examination. The date of practical
examination will be fixed by the respective department. Students will be evaluated in the
laboratory courses on the basis of the followings (all or as decided by the Examination Sub-
Committee):
Students failing in laboratory/practical course will have to register that course at his next
upcoming convenient semester with a course registration fee fixed by the BAUET
authority but within maximum period of six academic years.
For B.Sc. in CSE program, the marks distribution of laboratory courses will be distributed
according to the type of the laboratory course. The distributions of marks for three types
of laboratory are given below:
102
Written test/Quiz 20
Viva voce 10
Attendance 10
Data Sheet/Home Assignments/Report 10
Class Performance /Continuous Evaluation 20
Total 100
Grade Point Average (GPA) is the weighted average of the grade points obtained of all the
courses passed/completed by a student. For example, if a student passes/completes n
courses in a semester having credits of C1, C2, … , Cn and his grade points in these courses
are G1,G2, … , Gn respectively then
103
GPA =
The Cumulative Grade Point Average (CGPA) is the weighted average of the GPA obtained
in all semesters passed/completed by a student. For example, if a student passes/
completes n semester having total credits of TC1, TC2, … , TCn and his GPA in these
semesters are GPA1, GPA2, … , GPAn respectively then
CGPA=
A Numerical Example
Suppose a student has completed 09 (nine) courses in a semester and obtained the following
grades:
GPA= 56.4375/18.50=3.05
Suppose a student has completed 04 (four) semesters and obtained the following GPA:
104
Chapter-6
Rules and regulations for undergraduate program
6.1 Course Appraisal and Lesson Plan:
All faculty members must have to prepare their respective Course Appraisal and Lesson plan
for the entire course before the semester begins. They are advised to leave a copy of the
Course Appraisal set to the Head of the Department for review by the Course Committee
(i.e. PSAC).
Each student must register for the courses to be taken before the commencement of each
semester. Late registration is permitted only during the first week of classes. Late registration
after this date will not be accepted unless the student submits a written application to the
registrar through the concerned Head of the department explaining the reasons for delay.
Acceptable reasons may be medical problems with supporting documents or some other
academic commitments that prohibit enrolment prior to the last date of registration.
Students who fail to register during the designated dates for registration are charged a late
registration fee of Tk. 400.00 (Four hundred only) for each semester. Penalty for late
registration will not be waived.
BAUET has strict rules regarding the issues of attendance in class and discipline.
6.12 Minimum Earned Credit and CGPA (Cumulative Grade Point Average) Required
for Obtaining a Degree:
The number for class test of a course shall be at least n+1 where n is the number of credits
of the course. Class test will be conducted by the subject teacher. Course teacher must
announce results within 10 days of holding the examination. Checked scripts will be shown
to the students. If a student misses the class test for acceptable reason, the course teacher
may make arrangements to take the test of the students.
The courses in which a student has obtained 'D' or a higher grade will be counted as credits
earned by her/him. Any course in which a student has obtained 'F' grade will not be counted
as credits earned by her/him.
If there is any decimal marks in any of the examinations like class test, tutorial, term paper,
viva voce, course final examination, instead of rounding off the decimal figure in the result
of every subject/sessional, it is to be rounded off only once during tabulation while
converting the total marks to summation of all the subject/sessional marks. To round off, 0.5
and above is to be converted to next higher whole number(Integer) and less than 0.5 is to be
converted to previous whole number (For example 58.5% would be 59% and 58.49% would
58%).
107
6.18 Rounding off the GPA/CGPA:
The GPA/CGPA is not to be rounded off like the total marks of each subject sessional, but
it is to be rounded off after two figures of decimal. To round of 3.555 and above after two
figure of decimal, it is to be rounded off as 3.56 and 3.554 and below after two figure of
decimal, it is to be rounded off as 3.55.
The number of Grade sheets to be issued is 08 (eight) for a regular student. Backlog, re-
registered courses, sessional courses result will be included in that particular semester result
in which the student appeared.
6.21 Transcript:
Transcripts will be given after approval of the authority of BAUET, academic council and
syndicate. Partial transcripts may be given to students with the assigned payment and
verification fixed by the authority.
6.22 Certificate:
A copy of provisional before original certificate may be given after approval of the authority
of BAUET, academic council and syndicate. Provisional certificates, however, should be
surrendered during receiving the original certificate.
6.23 Awards:
a. Degree with Honors: Candidates for Bachelor’s Degree will be awarded the
degree with honors if their overall CGPA is 3.75 and above.
b. Gold Medal: Gold medal will be awarded to all students earning CGPA 4 at the
end of the entire program.
c. VC’s List: VC’s list will be awarded to all students earning 3.90 and above at the
end of each academic level, and all graduating students earning 3.90 and above
considering results of entire program.
d. Dean’s List: Dean’s list will be awarded to all students earning CGPA 3.75 - 3.90
at the end of each academic year for 1, 2, 3 and all graduating students earning
CGPA 3.75 - 3.90 considering results of entire program.
e. Other Scholarships and Stipends: This will be considered by the university
authority in due course of time.
**Students must have above 90% attendance to be considered in the Dean’s list and VC’s
list of recognition.
[N.B. Contradiction among the existing Examination Policy, Syllabus and Standing
Instruction (SI) will be solved by a team headed by the honorable VC]
108
Chapter 7
Courses Offered to Other Departments
109
Appendix-A
Learning Domain
The Learning Domain (LD) consists of three sub-domains i.e. cognitive, affective, and
psychomotor and their categories. The students will be evaluated through different methods
based on the sub-domains. The attributes of the sub-domains are described in the following
tables.
Cognitive sub-domain:
LD Category Description
C1 Remembering Recognizing or recalling knowledge from memory.
Remembering is when memory is used to produce definitions,
facts, or lists, or recite or retrieve material.
C2 Understanding Constructing meaning from different types of functions be they
have written or graphic messages activities like interpreting,
exemplifying classifying, summarizing, inferring, comparing,
and explaining.
C3 Applying Carrying out or using a procedure through executing, or
implementing. Applying related and refers to situations where
learned material is used through products like models,
presentations, interviews or simulations.
C4 Analyzing Breaking material or concepts into parts, determining how the
parts relate or interrelate to one another or to an overall structure
or purpose. Mental 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.
C5 Evaluating Making judgments based on criteria and standards through
checking and critiquing. Critiques, recommendations, and
reports are some of the products that can be created to
demonstrate the processes of evaluation. In the newer taxonomy
evaluation comes before creating as it is often a necessary part
of the precursory behavior before creating something.
C6 Creating Putting elements together to form a coherent or functional
whole; reorganizing elements into a new pattern or structure
through generating, planning, or producing. Creating requires
users to put parts together in a new way or synthesize parts into
something new and different a new form or product. This
process is the most difficult mental function in the new
taxonomy.
110
Affective sub-domain:
LD Category Description
A1 Receiving This refers to the learner‘s sensitivity to the existence of stimuli–
awareness, willingness to receive, or selected attention.
A2 Responding This refers to the learners ‘active attention to stimuli and his/her
motivation to learn – acquiescence, willing responses, or feelings
of satisfaction.
A3 Valuing This refers to the learner‘s beliefs and attitudes of worth –
acceptance, preference, or commitment. An acceptance,
preference, or commitment to value.
A4 Organization This refers to the learner‘s internalization of values and beliefs
involving (1) the conceptualization of values; and (2) the
organization of a value system. As values or beliefs become
internalized, the leaner organizes them according to priority.
A5 Characterization This refers to the learner‘s highest of internalization and relates
to behavior that reflects (1) a generalized set of values; and (2)
a characterization or a philosophy about life. At this level, the
learner is capable of practicing and acting on their values or
beliefs.
Psychomotor sub-domain:
LD Category Description
P1 Perception The ability to use sensory cues to guide motor activity. This
ranges from sensory stimulation, through cue selection, to
translation.
P2 Set Readiness to act. It includes mental, physical, and emotional sets.
These three sets are dispositions that predetermine a person's
response to different situations (sometimes called mindsets).
P3 Guided The early stages in learning a complex skill that includes
Response imitation and trial and error. Adequacy of performance is
achieved by practicing.
P4 Mechanism This is the intermediate stage in learning a complex skill. Learned
responses have become habitual and the movements can be
performed with some confidence and proficiency.
P5 Complex / The skillful performance of motor acts that involve complex
Overt Response movement patterns. Proficiency is indicated by a quick, accurate,
and highly coordinated performance, requiring a minimum of
energy. This category includes performing without hesitation and
automatic performance. For example, players often utter sounds
of satisfaction or expletives as soon as they hit a tennis ball or
throw a football because they can tell by the feel of the act what
the result will produce.
111
P6 Adaptation Skills are well developed and the individual can modify
movement patterns to fit special requirements.
P7 Origination Creating new movement patterns to fit a particular situation or
specific problem. Learning outcomes emphasize creativity based
on highly developed skills.
112
Appendix-B
Equivalence Table
113
15. Mathematics-II 0541 Ordinary, Partial
(Ordinary, Partial Differential
Differential Equations and
MATH-1243 3.00 MATH-1241 3.00
Equations and Coordinate
Coordinate Geometry
Geometry)
16. Electronic Devices 0714 Electronic
EEE-2163 and 3.00 EEE-1261 Devices and 3.00
Circuits Circuits
17. 0714 Electronic
Electronic Devices
Devices and
EEE-2164 and 0.75 EEE-1262 0.75
Circuits
Circuits Laboratory
Laboratory
18. --- --- ---- 0715 Basic Mechanical
Engineering and
ME-1270 1.50
Drawing
Laboratory
19. Technical and 0232 Communicative
HUM-1152 Communicative 1.50 HUM-1250 English-II 1.50
English Sessional Laboratory
20. Professional Ethics 0223 Society, Ethics
HUM-3157 and Environmental 2.00 0521 GED-1251 and Environment 3.00
Protection
21. Data Structures and 0613 Data Structures
CSE-2103 3.00 CSE-2101 3.00
Algorithms-I and Algorithms-I
22. Data Structures and 0613 Data Structures
CSE-2104 Algorithms-I 1.50 CSE-2102 and Algorithms-I 1.50
Sessional Laboratory
23. Object Oriented 0613 Object Oriented
CSE-2105 3.00 CSE-2103 3.00
Programming Programming
24. Object Oriented 0613 Object Oriented
CSE-2106 Programming 1.50 CSE-2104 Programming 1.50
Sessional Laboratory
25. Database 0612 Database Systems
CSE-2211 Management 3.00 CSE-2105 3.00
Systems
26. Database 0612 Database Systems
CSE-2212 Management 1.50 CSE-2106 Laboratory 1.50
Systems Sessional
27. Digital Logic 0611 Digital Logic
CSE-2101 3.00 CSE-2107 3.00
Design Design
28. 0611 Digital Logic
Digital Logic
CSE-2102 0.75 CSE-2108 Design 1.50
Design Sessional
Laboratory
29. MATH- Vector Analysis, 0541 Vector Analysis,
3.00 MATH-2141 3.00
2145 Matrices and Matrices and
114
Fourier Analysis Laplace
Transformation
30. Data Structures and 0613 Data Structures
CSE-2213 3.00 CSE-2211 3.00
Algorithms-II and Algorithms-II
31. Data Structures and 0613 Data Structures
CSE-2214 Algorithms-II 1.50 CSE-2212 and Algorithms-II 1.50
Sessional Laboratory
32. Data and 0612 Data
CSE-3105 Telecommunicatio 3.00 CSE-2213 Communication 3.00
n
33. Data and 0612 Data
CSE-3106 Telecommunicatio 0.75 CSE-2214 Communication 0.75
n Sessional Laboratory
34. 0611 Computer
Computer
CSE-3213 3.00 CSE-2215 Organization and 3.00
Architecture
Architecture
35. --- --- ---- 0613 Java
CSE-2216 Programming 1.00
Laboratory
36. Electrical Drives 0713 Electrical Drives
EEE-2265 and 3.00 EEE-2261 and 3.00
Instrumentation Instrumentation
37. Electrical Drives 0713 Electrical Drives
and and
EEE-2266 0.75 EEE-2262 0.75
Instrumentation Instrumentation
Sessional Laboratory
38. Complex Variable 0541 Complex Variable
MATH- MATH-
and Laplace 3.00 and Fourier 3.00
2247 2241
Transformation Analysis
39. --- --- ---- 0411 Project
0412 GED-2251 Management and 3.00
0413 Finance
40. Software 0613 Software
Engineering and Engineering and
CSE-3103 3.00 CSE-3101 3.00
Information Information
System Design System Design
41. Software 0613 Software
Engineering and Engineering and
CSE-3104 Information 0.75 CSE-3102 Information 1.00
System Design System Design
Sessional Laboratory
42. 0612 Computer
CSE-3211 Computer Network 3.00 CSE-3103 3.00
Network
43. 0612 Computer
Computer Network
CSE-3212 1.50 CSE-3104 Network 1.50
Sessional
Laboratory
115
44. 0613 Operating
CSE-3107 Operating System 3.00 CSE-3105 3.00
Systems
45. 0613 Operating
Operating System
CSE-3108 1.50 CSE-3106 Systems 1.50
Sessional
Laboratory
46. 0613 Web
Web Programming
CSE-3110 1.50 CSE-3108 Programming 1.00
Sessional
Laboratory
47. ---- ---- --- 0613 Mobile
Application
CSE-3110 1.00
Development
Laboratory
48. Numerical 0541 Numerical
CSE-3101 3.00 MATH-3141 3.00
Analysis Analysis
49. Engineering 0311 Engineering 3.0
HUM-3259 Economics and 3.00 0314 GED-3151 Economics and
Sociology Sociology
50. Integrated Design 0613 Software
CSE-3200 Project / Capstone 0.75 CSE-3200 Development 1.50
Project (Phase-I) Project – I*
51. Microprocessors, 0611 Microprocessors,
Micro-controllers Micro-controllers
CSE-4101 3.00 CSE-3211 3.00
and Embedded and Assembly
System Language
52. 0611 Microprocessors,
Microprocessors,
Micro-controllers
Micro-controllers
CSE-4102 0.75 CSE-3212 and Assembly 0.75
and Embedded
Language
System Sessional
Laboratory
53. Artificial 0613 Artificial
CSE-4201 3.00 CSE-3213 3.00
Intelligence Intelligence
54. Artificial 0613 Artificial
CSE-4202 Intelligence 0.75 CSE-3214 Intelligence 0.75
Sessional Laboratory
55. 0611 Automata Theory
CSE-4103 Compiler Design 3.00 CSE-3215 and Compiler 3.00
Design
56. 0611 Automata Theory
Compiler Design and Compiler
CSE-4104 0.75 CSE-3216 0.75
Laboratory Design
Laboratory
57. Applied Statistics 0542 Applied Statistics 3.00
MATH-4107 and Queuing 3.00 MATH-3241 and Queuing
Theory Theory
58. ---- ---- --- 0031 Industrial 1.00
CSE-3224
Training**
116
59. Fault Tolerant 0413 Fault Tolerant
CSE-4125 3.00 CSE-3217 3.00
System System
60. ---- ---- ---- 0611 CSE-3219 E-commerce and
3.00
Web Security
61. Human Computer 0611 Human Computer
CSE-4241 3.00 CSE-3221 3.00
Interaction Interaction
62. Human Computer ---- ---- ---- ----
CSE-4242 Interaction 0.75
Sessional
63. Advanced 0613 Advanced
CSE-4121 3.00 CSE-3223 3.00
Algorithms Algorithms
64. Industrial 031 Industrial
CSE-3224 1.00 CSE-3224 1.00
Training* Training*
65. Digital Image 0613 Digital Image and
CSE-3215 3.00 CSE-3225 3.00
Processing Video Processing
66. Digital Image 0613 Digital Image
CSE-3216 Processing 0.75 CSE-3226 Processing 0.75
Sessional Laboratory
67. Simulation and 0613 Simulation and
CSE-4247 3.00 CSE-3227 3.00
Modeling Modeling
68. 0613 Simulation and
Simulation and
CSE-4248 0.75 CSE-3228 Modeling 0.75
Modeling Sessional
Laboratory
69. CSE-4139 VLSI Design 3.00 0613 CSE-3229 VLSI Design 3.00
70. --- --- ---- 0613 VLSI Design
CSE-3230 0.75
Laboratory
71. --- --- ---- 0613 Natural Language
CSE-3231 3.00
Processing
72. --- --- ---- 0613 Natural Language
CSE-3232 Processing 0.75
Laboratory
73. 061 Final Year Design
CSE-4000 Project / Thesis*** 3.00 CSE-4000 Project (FYDP)/ 1.50
Thesis***
74. Integrated Design 0613 Software
CSE-4100 Project / Capstone 0.75 CSE-4100 Development 1.50
Project (Phase-II) Project - II
75. Digital Signal 0612 Digital Signal
CSE-4207 3.00 CSE-4101 3.00
Processing Processing
76. Digital Signal 0612 Digital Signal
CSE-4208 Processing 0.75 CSE-4102 Processing 0.75
Sessional Laboratory
77. --- --- ---- 0612 Cellular and
CSE-4103 Wireless 3.00
Communication
117
78. --- --- ---- 0613 CSE-4105 Data Science and
3.00
Applications
79. Data and Network 0611 Computer and
CSE-4203 3.00 CSE-4107 3.00
Security Cyber Security
80. --- --- ---- 0413 Software Testing
CSE-4109 and Quality 3.00
Assurance
81. --- --- ---- 0611 Parallel and
CSE-4111 Distributed 3.00
Systems
82. CSE-4133 Bioinformatics 3.00 0613 CSE-4113 Bioinformatics 3.00
83. CSE-4137 Machine Learning 3.00 0613 CSE-4115 Machine Learning 3.00
84. --- --- ---- 0613 Machine Learning
CSE-4116 0.75
Laboratory
85. 0613 Data Mining and
Data Mining and
CSE-4249 3.00 CSE-4117 Data Ware- 3.00
Data Ware-housing
housing
86. 0613 Data Mining and
Data Mining and
Data Ware-
CSE-4250 Data Ware-housing 0.75 CSE-4118 0.75
housing
Sessional
Laboratory
87. --- --- ---- 0613 Digital System
CSE-4119 3.00
Design
88. --- --- ---- 0613 Digital System 0.75
CSE-4120 Design
Laboratory
89. 061 Final Year Design
CSE-4000 Project / Thesis*** 3.00 CSE-4000 Project (FYDP)/ 6.00
Thesis***
90. 0613 Computer
Graphics and
CSE-4205 Computer Graphics 3.00 CSE-4211 3.00
Multimedia
Systems
91. 0613 Computer
Graphics and
Computer Graphics
CSE-4206 1.50 CSE-4212 Multimedia 0.75
Sessional
Systems
Laboratory
92. Technology 0413 Engineering 2.00
HUM-4163 Entrepreneurship 3.00 GED-4251 Management and
and Leadership Leadership
93. --- --- ---- 0613 CSE-4113 Cloud Computing 3.00
94. --- --- ---- 0612 CSE-4215 Green Computing 3.00
118
95. --- --- ---- 0612 CSE-4217 Network Planning 3.00
96. --- --- ---- 0611 Blockchain and
CSE-4219 Cryptocurrency 3.00
Technology
120