University of Dhaka

Department of Computer Science and Engineering

C URRICULUM OF
B ACHELOR OF S CIENCE IN C OMPUTER S CIENCE AND E NGINEERING
(B.S C . E NGG . IN CSE)

A CADEMIC Y EAR : 2023 - 2024 AND O NWARD

i
Preface

Welcome to the curriculum description of the Bachelor of Science in Computer Science and Engineering
(shortly, B.Sc. Engg. in CSE) degree program of the Department of Computer Science and Engineering
(CSE) under the Faculty of Engineering and Technology (FoET) of the University of Dhaka (DU). In this
dynamic and rapidly evolving field, we are excited to offer a comprehensive curriculum that blends the
realms of Computer Science and Computer Engineering. This 4-year undergraduate engineering degree
program is designed following the principles and practices of Outcome Based Education (OBE) aiming to
equip students with the knowledge, skills, and attitudes necessary for 21st -century workplaces and to excel
them in the age of rapidly progressing industrial revolutions.

The convergence of computer science and computer engineering has revolutionized industries and
reshaped the way we perceive and interact with technology. From enabling understanding of core theories
of computer science to applying them in solving practical problems related to intelligent data collection, data
processing, knowledge development and thereby optimizing business operations and creating self-learning
machines. Nowadays, the applications of computers, software, networks, and data centers are limitless.
As the students embark on this educational journey, they will explore the core theories, techniques, and
applications that underpin solving complex engineering problems in these rapidly transformative domains.

The curriculum is meticulously crafted to strike a balance between theoretical foundations and practical
hands-on experience. The students will explore a wide spectrum of subjects, ranging from basic science,
mathematics, fundamentals of electronics and electrical engineering, programming, data structures, algo-
rithms, microprocessors and microcontrollers, operating systems, computer networks, software engineering,
artificial intelligence, computer graphics, cloud computing, information security, quantum computing, and
many more. It also incorporates a basic understanding of engineering project management, professional
ethics, history of the emergence of Bangladesh, and ICT business entrepreneurship. Our experienced
faculty members, who are accomplished experts in the field, will guide the students through both the
theoretical complexities and real-world implications of computing, communications, AI-driven automation,
and knowledge engineering.

Throughout the program, the students will have the opportunity to sharpen their skills, collaborate
on projects, and gain exposure to industry practices. The program’s capstone projects will challenge the
students to apply their accumulated knowledge and skills to solve real-world problems, preparing the
students to make meaningful contributions to various domains upon graduation.

At the University of Dhaka, we value research-driven comprehensive education. Beyond technical

expertise, we emphasize critical thinking, critical analysis, vertical and horizontal communications in
teamwork, ethical considerations, and effective negotiation as essential pillars of success in emerging fields

ii
of computing. Following the principles of Outcome Based Education (OBE) system, our goal is to nurture
well-rounded professionals who not only excel in their technical capacities but also possess the ability to
collaborate, innovate, and lead in a rapidly changing global landscape.

As per the current trend, computer science and engineering is not just a field of study, rather it avenues
to shape demanding professionals in the practical workplace including chief technology officer (CTO),
sloutions architect, software architect, system analyst, software engineer, AI engineer, information security
architect, data scientist, network engineer, etc. The skills the students acquire here will empower them to be
at the forefront of innovation, tackling challenges, and creating solutions that have a positive impact on
society, especially in improving the quality of human life.

We are excited to accompany our students on this transformative adventure as the students will explore
the frontiers of computing machines, programming languages, complex computation systems, Internet
technologies, artificial intelligence, machine learning, and data science. Through dedication, curiosity, and
hard work, our students will undoubtedly contribute to a future driven by ubiquitous computing systems.

iii
Contents

Preface ii

I Part A 1

1 Title of the Academic Program 1

2 Name of the University 1

3 Vision of the University 1

4 Mission of the University 1

5 Name of the Program Offering Entity (Department/Faculty/Institute) 2

6 Vision of the Program Offering Department 2

7 Mission of the Program Offering Department 2

8 Objectives of the Program Offering Department 2

9 Description of the Program 3

10 Program Educational Objectives (PEOs) 4

11 Program Learning Outcomes (PLOs) 5

12 Mapping Mission of the University with PEOs 6

13 Mapping PLOs with the PEOs 6

14 Mapping Courses with the PLOs 7

II Part B 11

15 Structure of the Curriculum 11

16 Semester Wise Course Distribution 16

16.1 1st Year, 1st Semester 16
16.2 1st Year, 2nd Semester 16
16.3 2nd Year, 1st Semester 17
16.4 2nd Year, 2nd Semester 17
16.5 3rd Year, 1st Semester 18
16.6 3rd Year, 2nd Semester 18
16.7 4th Year, 1st Semester 19
16.8 4th Year, 2nd Semester 19

v
III Part C 21

17 Description of all courses of the program 21

17.1 Core Courses 21
17.2 Internship and Final Year Project 139
17.3 Elective Courses 147
17.3.1 Elective I 147
17.3.2 Elective II 177
17.3.3 Elective III 206
17.4 Mathematics and Statistics Courses 238
17.5 General Education Courses 250

IV Part D 274

18 Evaluation and Grading 274

18.1 Examination Committee 274
18.2 Tabulators 274
18.3 Class Representative 275
18.4 Marks Distribution 275
18.5 Submission of Marks 276
18.5.1 Internal Evaluation Marks 276
18.5.2 Semester Final Examination Marks 276
18.6 Eligibility to sit for the Final Examination 277
18.7 Grading Scale 277
18.8 Letter Grades and Grade Points 277
18.9 Assigning ‘W’ and ‘I’ Grades 278
18.10Semester Grade Point Average (SGPA) and Cumulative Grade Point Average (CGPA) 278

19 Improvement Examination 279

20 Re-admission and Drop Out 279

20.1 Re-admission 279
20.2 Drop Out 279

Conclusions 282

vi
I ♦ Part A

1 Title of the Academic Program

Bachelor of Science in Computer Science and Engineering
(Abbreviated as, B.Sc. Engineering in CSE)

2 Name of the University

University of Dhaka

3 Vision of the University

Cultivation of knowledge, skills, and attitudes and thereby enabling individuals as dynamic human capital
poised to make a lasting national and global impact.

4 Mission of the University

The mission of the University of Dhaka is split into 6 parts as follows:

• UM1 (Transformative Education) To provide transformative education by enabling students to

embrace lifelong learning, and fostering a sustainable knowledge-based society through the continuous
pursuit of scholarship and technology.

• UM2 (Collaborative Research and Innovation) To build Collaborative research and innovation hubs,
leveraging partnerships to expand the boundaries of technological advancement.

• UM3 (Education Ecology) To develop an educational ecosystem that fosters excellence, transparency,
and accountability.

• UM4 (Community Engagement) To engage with relevant stakeholders and communities in building a
just, fair, and sustainable world.

• UM5 (Ethical Responsibility) To empower students to become ethically responsible global citizens
for positive societal impact.

• UM6 (National Heritage) To instill a deep sense of national heritage and pride, cultivating a connection
to our historical roots and global inheritance.

1
5 Name of the Program Offering Entity (Department/Faculty/Institute)
The name of the program offering department is the Department of Computer Science and Engineering under
the Faculty of Engineering and Technology of the University of Dhaka.

6 Vision of the Program Offering Entity

The department envisions empowering students with cutting-edge knowledge and skills in Computer
Science and Engineering and nurturing their potential to become problem solvers, architects, ethical leaders,
and trailblazers in the globally evolving landscape of computer science and engineering.

7 Mission of the Program Offering Entity

Department of Computer Science and Engineering will venture:

• PM1: Educating students on the state-of-the-art knowledge and skills required for the design, devel-
opment, and innovation of computers, software, networks, and intelligent application systems.

• PM2: Empowering students with research and innovation skills including investigation, critical
thinking, analysis, synthesizing, and evaluation to bring positive changes in different fields such as
transportation, healthcare, finance, education, climate science, and more, contributing to the betterment
of the society.

• PM3: Preparing graduates to excel as leading professionals with social and environmental responsibil-
ities, ethics, and human values.

• PM4: Enhancing the life-long learning capacity of students by engaging them in new technological
problem-solving, design, and development activities.

8 Objectives of the Program Offering Entity

The objective of the Department of Computer Science and Engineering of University of Dhaka is to provide
students with a comprehensive and cutting-edge education in these rapidly advancing fields. The program
aims to equip students with the knowledge, skills, and practical experiences necessary to become proficient
Computer Scientists and Computer Engineering professionals. By integrating theoretical foundations
with hands-on training, the course seeks to foster critical thinking, problem-solving abilities, design of
computer systems, software development, Internet technologies, and a strong understanding of data analysis
techniques, machine learning algorithms, and AI applications.

The objectives of the program are noted as follows:

• Foundational Knowledge: To provide students with a strong foundational knowledge of the key
concepts, theories, and principles underlying Computer Science and Engineering majors. This includes
understanding computation systems and software, algorithms, networking and the Internet, AI
methods, machine learning techniques, and data analysis.

• Technical Skills: To equip students with practical, hands-on technical skills required for addressing
complex engineering problems using emerging computation tools and technologies. This includes

2
 programming languages like Assembly, C/C++, Java, Python, HTML/CSS, PHP, and proficiency in
relevant software libraries and frameworks.

• Problem-Solving and Critical Thinking: To develop students’ problem-solving and critical thinking
abilities, enabling them to analyze complex computation problems, handle large and complex datasets,
identify patterns, make data-driven decisions, and address real-world challenges through designing
efficient databases, using diverse algorithms, AI and data science techniques.

• Ethics and Responsibility to the Society: To instill ethical considerations and responsible engineering
practices in students. This includes addressing issues related to bias in AI algorithms, data privacy,
transparency, and the societal impact of AI technologies. Graduates should be able to develop AI
solutions with ethical considerations in mind.

By fulfilling these objectives and goals, the Department of Computer Science and Engineering of
University of Dhaka strives to produce skilled and ethical professionals who can put lasting national and
global impact.

9 Description of the Program

The Bachelor of Science in Computer Science and Engineering is an undergraduate academic degree program
designed to provide students with a comprehensive understanding of the theories, principles, techniques,
and applications of computer systems. This program aims to equip students with the knowledge and skills
necessary to design computers, software and network systems, analyze, interpret, and leverage large sets of
data to make informed decisions and develop AI and ML-driven solutions across various domains.

The program’s curriculum containing 150 credits combines foundational courses in computer science,
computer engineering, mathematics, basics of electrical and electronic engineering, statistics, and humanities
with specialized courses in the areas of AI and Data Engineering, hardware and software systems, network
and distributed systems, and theoretical computer science. Here is a general overview of the program’s
components:

a. Foundation Courses:

• Programming: Students learn programming languages such as Assembly, C/C++, Java, PHP,
HTML/CSS, database, and network programming that are widely used in developing intelligent
software systems.

• Mathematics and Statistics: Courses cover topics like differential equations, linear algebra, calculus,
vector, geometry, probability, and statistics, which form the basis of solving computing problems,
data analysis, and machine learning algorithms.

• Electrical and Electronic Engineering Fundamentals: One physics with laboratory and two courses
- Introduction to basic electrical circuits and Electronic devices and circuits with corresponding
laboratories help to grow foundation knowledge and skills working with electrical and electronic
stuff.

b. Core Computer Science and Engineering Courses: The program is designed to provide knowledge
and skills on cutting-edge Computer Science, Computer Engineering, and Computer Technologies. The
following courses can be considered as highlights of the program.

3
 • Data Structure and Algorithms: Courses on Data Structure, Design and Analysis of Algorithms,
Algorithm Engineering, and Database Systems build a strong foundation of technologies required
for data storage and data processing.

• Microprocessor and Microcontrollers: A good set of courses on Discrete Mathematics, Digital Logic
Design, Computer Architecture, Microprocessor, Microcontrollers, and Embedded Systems equips
students with operational details of computing devices and embedded programs.

• Software Systems Engineering: The Object Oriented Design and Programming, Software Engineer-
ing, Web Engineering and Technology courses along with correspondinglaboratories significantly
support students in designing and developing application software systems.

• Artificial Intelligence and Machine Learning: The inclusion of Artificial Intelligence and Machine
Learning courses opens doors to address complex real-world challenging problems in real-time
environments.

• Network and Distributed Systems: The studies on Operating Systems, Data and Telecommunica-
tions, Computer Networking, Information Security, Internet of Things, and Parallel and Distributed
Systems courses would help students to build secured and efficient information network systems.

c. Elective or Specialization Courses: A large set of specialization courses has been designed to be offered
as elective courses to meet the diverse interests of the students. Each student will take 2 such courses
with laboratories and 1 without lab. These courses would help students in growing their knowledge and
skills in depth in their area of interest.

d. Capstone Projects and Industrial Experience:

• Students will be working on capstone projects where they apply computing, networking, AI and
ML techniques to address real-world problems.

• Internships with industry partners are expected to provide hands-on exposure to the field.

e. Soft Skills and Communication: The inclusion of presentations, demonstrations, and teamwork activities
in the laboratories gives strong emphasis on communication skills so that the students can effectively
present findings and insights to both technical and non-technical audiences.

f. Humanities: Four courses including History of Emergence of Bangladesh, IT Project Management,

Professional Ethics and Environment, and ICT Business Entrepreneurship help to grow students with
professionalism and responsibility to society.

Graduates of the Bachelor of Science in Computer Science and Engineering degree program will be well-
prepared for careers in technology innovation, transportation, healthcare, finance, e-commerce, and more,
where distributed software and network systems, Artificial Intelligence and data-driven decision-making
are becoming increasingly essential.

10 Program Educational Objectives (PEOs)

Graduates of the Bachelor of Science in Computer Science and Engineering degree program are expected to
attain the following Program Educational Objectives (PEO) within 3 to 5 years of graduation.

4
 • PEO1: Graduates will demonstrate leadership roles as Computer professionals and continue to acquire
knowledge, skills, and experiences to address new challenges in the field of computer science and
engineering.

• PEO2: Graduates will retain the pursuit of knowledge, skills, intelligence, and interdisciplinary learn-
ing in a multicultural environment for achieving top-notch academic scholarships and professional
careers.

• PEO3: Graduates will design and develop computing, software, and network technologies with a focus
on sustainability to offer a better place for humanity while they will practice ethical and responsible
usage of technologies.

11 Program Learning Outcomes (PLOs)/Program Outcomes (POs)

Graduates of the Bachelor of Science in Computer Science and Engineering degree program are expected to
attain the following Program Outcomes (POs) by the time of graduation.

• PO1 - Foundational Knowledge: Apply a profound understanding of basic science, mathematics,

and core principles of computer, computing, and communications to tackle complex engineering
problems within the field effectively. Utilize theoretical insights and practical skills to devise innovative
solutions.

• PO2 -Problem Analysis and Modeling: Identify, formulate, and rigorously analyze complex engineer-
ing problems in computer science and engineering domains. This involves extensive computing and
scientific issues, literature review, and the application of mathematical, statistical, and computational
algorithmic techniques to derive substantiated conclusions.

• PO3 - Algorithm Design and Implementation: Design solutions for complex computer science
and 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. (K5)

• PO4 - Investigation: Conduct investigations of complex problems using research-based knowledge

(K8) and research methods including design of experiments, analysis and interpretation of data, and
synthesis of information to provide valid conclusions.

• PO5 - Modern Tool Usage: Apply a cutting-edge array of computing, communication and artificial
intelligence techniques to develop innovative software application models, network systems and other
AI applications. Understand the use of prediction and modeling techniques for complex engineering
activities and their limitations.

• PO6 - Computer Engineers and Society: Apply reasoning informed by computer science and en-
gineering 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. (K7)

• PO7 - Environment and Sustainability: Understand and evaluate the sustainability and impact of
professional engineering work in solving complex computer science and engineering problems in
societal and environmental contexts. (K7).

5
 • PO8 - Ethics: Apply ethical principles and commit to professional ethics, responsibilities, and the
norms of professional practice.

• PO9 - Individual Work and Teamwork: Function effectively as an individual and as a member or
leader of diverse teams and in multidisciplinary settings.

• PO10 - Communication: Communicate effectively on complex engineering activities with the engineer-
ing 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.

• PO11 - Project Management and Finance: Demonstrate knowledge and understanding of the compu-
tation, software and network systems, and AI principles and apply these to one’s work as a member
or a leader of a team to manage projects in multidisciplinary environments.

• PO12 - Life-Long Learning: Recognize the need for and have the preparation and ability to engage in
independent, life-long learning for adaptability in the broadest context of technological change

12 Mapping Mission of the University with PEOs

The mapping between the mission of the university (please refer to Section 4) and PEOs (please refer to
√
Section 10) is shown as follows. The cells marked with ‘ ’ denote a mapping.

Program Educational Objectives

PEO1 PEO2 PEO3
√ √
UM1
√
UM2
Mission of the University √
UM3
√
UM4
√
UM5
√ √
UM6

13 Mapping PLOs with the PEOs

The aforementioned PLOs/POs and their mapping with the PEOs are presented in the following Table. The
√
cells marked with ‘ ’ denote a mapping.

6
 Program Educational Objectives (PEOs)
PEO1 PEO2 PEO3
√
PO1
√
PO2
√
PO3
√
Program Outcomes (POs) PO4
√
PO5
√
PO6
√
PO7
√
PO8
√
PO9
√
PO10
√
PO11
√
PO12

14 Mapping Courses with the PLOs

The mapping of courses with the PLOs/POs is presented in the following Table. Here, the courses are only
identified by course codes. For details of the course information, please refer to Section 15. The cells in the
√
following table marked with ‘ ’ denote a mapping.

Program Outcomes (POs)

Sl Course Code PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
√ √ √
1 CSE 1101
√ √ √
2 CSE 1103
√ √ √
3 CSE 1104
√ √ √
4 CSE 1201
√ √ √
5 CSE 1202
√ √ √
6 CSE 1203
√ √ √
7 CSE 1204
√ √ √
8 EEE 1209
√ √ √
9 EEE 1210
√ √ √
10 CSE 2101
√ √ √
11 CSE 2102
√ √ √
12 CSE 2103

7
 √ √ √
13 CSE 2104
√ √ √
14 CSE 2105
√ √ √
15 CSE 2106
√ √ √
16 CSE 2201
√ √ √
17 CSE 2202
√ √ √
18 CSE 2203
√ √ √
19 CSE 2204
√ √ √
20 CSE 2205
√ √ √
21 CSE 2206
√ √ √
22 CSE 3101
√ √ √
23 CSE 3102
√ √ √
24 CSE 3103
√ √ √
25 CSE 3104
√ √ √ √ √ √ √ √
26 CSE 3105
√ √ √
27 CSE 3109
√ √ √
28 CSE 3110
√ √ √
29 CSE 3201
√ √ √
30 CSE 3202
√ √ √
31 CSE 3203
√ √ √
32 CSE 3204
√ √ √
33 CSE 3205
√ √ √ √ √ √ √
34 CSE 3206
√ √ √ √ √ √ √ √ √ √ √ √
35 CSE 4100
√ √ √
36 CSE 4101
√ √ √
37 CSE 4102
√ √ √
38 CSE 4103
√ √ √
39 CSE 4104
√ √ √ √ √ √ √
40 CSE 4110
√ √
41 CSE 4201
√ √
42 CSE 4202
√ √
43 HUM 4203
√ √
44 HUM 4205
√ √ √ √ √ √ √ √ √ √ √ √
45 CSE 4210

8
 √ √ √ √ √ √ √ √ √ √ √ √
Summary

9
II ♦ Part B

15 Structure of the Curriculum

a. Duration of the program: 4 Years/8 Semesters.

b. Admission Requirements: General Undergraduate Admission guidelines of the Science Unit will be
applicable. Some important eligibility criteria are described as follows:

• Candidates having a minimum GPA of 3.50 (including 4th subject) separately in SSC and HSC
examinations held in recent designated years from the Science/Agricultural Science branch of any
education board of Bangladesh or Alim in Science branch from Madrasa Board or IGCSE/O-level
and IAL/GCE/A-level or equivalent foreign degree and a minimum total GPA of 8.0 in these two
will be eligible to apply. For IGCSE/O-level and IAL/GCE/A-level and any foreign degree holders,
the equivalent grades will be calculated and thus the eligibility will be determined.

• Candidates having a minimum GPA of 3.0 (including 4th subject) separately in SSC and HSC
examinations held in recent designated years from the Arts/General or Business Education branches
of any education board of Bangladesh and a minimum total GPA of 7.5 in these two will also be
eligible to apply. For IGCSE/O-level and IAL/GCE/A-level and any foreign degree holders, the
equivalent grades will be calculated and thus the eligibility will be determined.

• In the admission test, the candidate must secure at least 60% marks of the total marks allocated for
the Physics and Mathematics parts.

c. Total class weeks in a Year/semester: 15 weeks/semester including midterm exam; 2 semesters in a year

d. Teaching hours of theory courses: One theory course credit is defined as conducting one 60 minutes
class delivery in a week, spanning 14 weeks in a semester excluding midterm examination. For a 3-credit
course, two classes each of 90 minutes are held in a week, i.e., 42 hours of total contact hours per 3-credit
course. Similarly, a 2-credit course has 28 hours of teaching, two classes of 60 minutes each week.

e. Teaching hours of laboratory courses: One laboratory course credit is defined as conducting hands-on
work in the lab for 2 hours in a week, spanning 14 weeks in a semester. For a 1.5 credit laboratory
course, one class of 3 hours is held in a week, i.e., 42 hours of total contact hours in 14 weeks. Similarly, a
0.75-credit lab course has one class of 3 hours in alternate weeks, and a 1.0-credit lab course has 28 hours
of teaching, each class of 2 hours in 14 weeks.

f. Mid and Final Examinations: 1 week for midterm and 2 to 3 weeks for final examinations.

11
g. Preparatory leave: 9-10 days of preparatory leave will be allocated between the last class date of a
semester and the starting date of the final examinations.

h. Total minimum credit requirement to complete the degree program: 150 Credits.

i. Minimum CGPA requirements for graduation: 2.00, and without ‘F’ grade in any subject.

j. Maximum academic years of completion: 6 (Six) Years from the date of admission at 1st year 1st semester.

k. Course Code

i. Every course has a unique course code. The letter prefix in any course code indicates the field or the
discipline of the course, e.g., CSE stands for Computer Science and Engineering, EEE for Electrical
and Electronic Engineering, PHY for Physics, MATH for Mathematics, STAT for Statistic, HUM for
arts and humanities, BUS for business, and MIS for management of information system.

ii. The four digits in the course code have the following meaning:

• The first digit corresponds to the year in which the course is offered by the department.

• The second digit represents the semester in which the course is offered.

• The third and fourth digits are used to specify different theory and lab courses taught in a
semester. The last digit is assigned an odd number for theoretical courses and even for laboratory
courses.

l. Category of Courses:

i. General Education Courses: (Interdisciplinary courses, beyond the discipline/program, that provide
a well-rounded learning experience to the students) For example Arts and Humanities, Social
Sciences, Business, ICT, Basic Science/STEM, other engineering, etc. (as applicable for the disciplined
academic program).

Sl Course Code Course Title Credit

1 HUM 1109 History of Emergence of Bangladesh 2.0
2 HUM 4105 Professional Ethics and Environment 2.0
3 MIS 4203 IT Project Management 2.0
4 BUS 4205 ICT Business Entrepreneurship 2.0
5 PHY 1205 Physics 3.0
6 PHY 1206 Physics Lab 0.75
7 MATH 1107 Differential and Integral Calculus 3.0
8 MATH 1207 Linear Algebra 3.0
9 MATH 2107 Differential Equations, Laplace Transform and Fourier Analysis 3.0
10 STAT 2207 Probability and Statistics 3.0
11 STAT 3107 Random Processes 3.0
12 EEE 1105 Electrical Circuits 3.0
13 EEE 1106 Electrical Circuits Lab 0.75
14 EEE 1209 Electronic Devices and Circuits 3.0
15 EEE 1210 Electronic Devices and Circuits Lab 0.75
Total (12 Theory and 3 Lab courses) 34.25

12
ii. Core courses (Courses that characterize the discipline):

Sl Course Code Course Title Credit

16 CSE 1101 Discrete Mathematics 3.0
17 CSE 1103 Computational Problem Solving 3.0
18 CSE 1104 Computational Problem Solving Lab 1.5
19 CSE 1201 Structured Programming 3.0
20 CSE 1202 Structured Programming Lab 1.5
21 CSE 1203 Digital Logic Design 3.0
22 CSE 1204 Digital Logic Design Lab 0.75
23 CSE 2101 Data Structures and Algorithms 3.0
24 CSE 2102 Data Structures and Algorithms Lab 1.5
25 CSE 2103 Object Oriented Design and Programming 3.0
26 CSE 2104 Object Oriented Design and Programming Lab 1.5
27 CSE 2105 Computer Architecture and Microprocessor 3.0
28 CSE 2106 Microprocessor and Assembly Language Lab 1.5
29 CSE 2109 Data and Telecommunication 3.0
30 CSE 2201 Database Management System 3.0
31 CSE 2202 Database Management System Lab 1.5
32 CSE 2203 Design and Analysis of Algorithms 3.0
33 CSE 2204 Design and Analysis of Algorithms Lab 1.5
34 CSE 2205 Microcontroller and Embedded System 3.0
35 CSE 2206 Microcontroller and Embedded System Lab 1.5
36 CSE 2209 Numerical Methods 3.0
37 CSE 3101 Software Engineering 3.0
38 CSE 3102 Software Design and Development Project 1.5
39 CSE 3103 Web Engineering and Technology 3.0
40 CSE 3104 Web Engineering and Technology Lab 1.5
41 CSE 3105 Algorithm Engineering 3.0
42 CSE 3109 Operating System 3.0
43 CSE 3110 Operating System Lab 1.5
44 CSE 3201 Computer Network 3.0
45 CSE 3202 Computer Network Lab 1.5
46 CSE 3203 Artificial Intelligence 3.0
47 CSE 3204 Artificial Intelligence Lab 1.5
48 CSE 3205 Information Security 3.0
49 CSE 3206 Information Security Lab 1.5
50 CSE 3207 Theory of Computation 3.0
51 CSE 4101 Machine Learning 3.0
52 CSE 4102 Machine Learning Lab 1.5
53 CSE 4103 Internet of Things 3.0
54 CSE 4104 Internet of Things Lab 1.5
55 CSE 4201 Parallel and Distributed Systems 3.0
56 CSE 4202 Parallel and Distributed Systems Lab 1.5

13
 Total (23 Theory and 18 Lab courses) 95.25

iii. Elective Courses (Courses for specialization within the discipline):

ELECTIVE I courses with laboratories

Sl Course Code Course Title Credit
1 CSE 3209 Digital Image Processing 3.0
2 CSE 3210 Digital Image Processing Lab 1.5
3 CSE 3211 Introduction to Data Science 3.0
4 CSE 3212 Introduction to Data Science Lab 1.5
5 CSE 3213 Bioinformatics 3.0
6 CSE 3214 Bioinformatics Lab 1.5
7 CSE 3215 Mobile Application Development 3.0
8 CSE 3216 Mobile Application Development Lab 1.5
9 CSE 3217 Simulation and Modeling 3.0
10 CSE 3218 Simulation and Modeling Lab 1.5
11 CSE 3219 Computer Graphics 3.0
12 CSE 3220 Computer Graphics Lab 1.5
13 CSE 3221 Wireless Networks 3.0
14 CSE 3222 Wireless Networks Lab 1.5
Total (One theory course and its lab will be chosen by a student) 4.5

ELECTIVE II courses with laboratories

Sl Course Code Course Title Credit
1 CSE 4211 Deep Neural Network 3.0
2 CSE 4212 Deep Neural Network Lab 1.0
3 CSE 4213 Natural Language Processing 3.0
4 CSE 4214 Natural Language Processing Lab 1.0
5 CSE 4215 Data Mining 3.0
6 CSE 4216 Data Mining Lab 1.0
7 CSE 4217 Digital Forensics 3.0
8 CSE 4218 Digital Forensics Lab 1.0
9 CSE 4219 Software Security 3.0
10 CSE 4220 Software Security Lab 1.0
11 CSE 4221 Compiler Design 3.0
12 CSE 4222 Compiler Design Lab 1.0
13 CSE 4223 Cloud Computing 3.0
14 CSE 4224 Cloud Computing Lab 1.0
Total (One theory course and its lab will be chosen by a student) 4.0

14
 ELECTIVE III courses without laboratory
Sl Course Code Course Title Credit
1 CSE 4225 Big Data Analytics 3.0
2 CSE 4227 Information Retrieval 3.0
3 CSE 4229 Human Robot Interaction 3.0
4 CSE 4231 Computer Vision 3.0
5 CSE 4233 Software Testing and Quality Assurance 3.0
6 CSE 4235 VLSI Design and Formal Verification 3.0
7 CSE 4237 Parallel and Distributed Database Systems 3.0
8 CSE 4239 Applied Cryptography 3.0
9 CSE 4241 Wireless Network Security 3.0
10 CSE 4243 Graph Theory 3.0
11 CSE 4245 Operations Research 3.0
12 CSE 4247 Quantum Computing 3.0
13 CSE 4249 Game Theory 3.0
14 CSE 4251 Human Computer Interaction 3.0
Total (One theory course will be chosen by a student) 3.0

iv. Final Year Design Project and Internship (as applicable for the discipline/academic program)

Sl Course Code Course Title Credit

1 CSE 4100 Internship 3.0
2 CSE 4110 Final Year Project - Part A 2.0
3 CSE 4210 Final Year Project - Part B 4.0
Total 9.0

15
16 Year/Level/Semester/Term wise distribution of courses
The courses of the Bachelor of Science in Computer Science and Engineering are arranged and distributed
among eight semesters based on the importance and hierarchical need of the courses. In the following,
semester-wise courses are listed along with relevant information.

16.1 1st Year, 1st Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 1101 Discrete Mathematics 3.0

2 CSE 1103 Computational Problem Solving 3.0
3 CSE 1104 Computational Problem Solving Lab 1.5
4 EEE 1105 Electrical Circuits 3.0
5 EEE 1106 Electrical Circuits Lab 0.75
6 MATH 1107 Differential and Integral Calculus 3.0
7 HUM 1109 History of Emergence of Bangladesh 2.0

Total (5 Theory and 2 lab courses) 16.25

16.2 1st Year, 2nd Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 1201 Structured Programming 3.0 CSE 1103

2 CSE 1202 Structured Programming Lab 1.5
3 CSE 1203 Digital Logic Design 3.0
4 CSE 1204 Digital Logic Design Lab 0.75
5 PHY 1205 Physics 3.0
6 PHY 1206 Physics Lab 0.75
7 MATH 1207 Linear Algebra 3.0
8 EEE 1209 Electronic Devices and Circuits 3.0
9 EEE 1210 Electronic Devices and Circuits Lab 0.75

Total (5 Theory and 3 lab courses) 18.75

16
16.3 2nd Year, 1st Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 2101 Data Structures and Algorithms 3.0 CSE 1201

2 CSE 2102 Data Structures and Algorithms Lab 1.5
3 CSE 2103 Object Oriented Design and Programming 3.0 CSE 1201
4 CSE 2104 Object Oriented Design and Programming Lab 1.5
5 CSE 2105 Computer Architecture and Microprocessor 3.0
6 CSE 2106 Microprocessor and Assembly Language Lab 1.5
7 MATH 2107 Differential Equations, Laplace Transform and 3.0
Fourier Analysis
8 CSE 2109 Data and Telecommunication 3.0

Total (5 Theory and 3 lab courses) 19.5

16.4 2nd Year, 2nd Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 2201 Database Management System 3.0 CSE 2101

2 CSE 2202 Database Management System Lab 1.5
3 CSE 2203 Design and Analysis of Algorithms 3.0 CSE 2101
4 CSE 2204 Design and Analysis of Algorithms Lab 1.5
5 CSEA 2205 Microcontroller and Embedded System 3.0 CSE 2105
6 CSE 2206 Microcontroller and Embedded System Lab 1.5
7 STAT 2207 Probability and Statistics 3.0
8 CSE 2209 Numerical Methods 3.0

Total (5 Theory and 3 lab courses) 19.5

17
16.5 3rd Year, 1st Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 3101 Software Engineering 3.0 CSE 2201

2 CSE 3102 Software Design and Development Project 1.5
3 CSE 3103 Web Engineering and Technology 3.0
4 CSE 3104 Web Engineering and Technology Lab 1.5
5 CSE 3105 Algorithm Engineering 3.0 CSE 2203
6 STAT 3107 Random Processes 3.0
7 CSE 3109 Operating System 3.0
8 CSE 3110 Operating System Lab 1.5

Total (5 Theory and 3 lab courses) 19.5

16.6 3rd Year, 2nd Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 3201 Computer Network 3.0 CSE 2109

2 CSE 3202 Computer Network Lab 1.5
3 CSE 3203 Artificial Intelligence 3.0
4 CSE 3204 Artificial Intelligence Lab 1.5
5 CSE 3205 Information Security 3.0
6 CSE 3206 Information Security Lab 1.5
7 CSE 3207 Theory of Computation 3.0
8 Elective Ia 3.0
9 Elective I Lab 1.5

Total (5 Thoery and 4 lab courses) 21.0

a Two or more courses will be offered based on the availability of human and physical resources. A student chooses

one of them within the first two weeks of the semester. The minimum number of registered students to run an under-
graduate elective course is 12.

18
16.7 4th Year, 1st Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 4100 Internship a 3.0

2 CSE 4101 Machine Learning 3.0 CSE 3203
3 CSE 4102 Machine Learning Lab 1.5
4 CSE 4103 Internet of Things 3.0 CSE 3201
5 CSE 4104 Internet of Things Lab 1.5
6 HUM 4105 Professional Ethics and Environment 2.0
6 CSE 4110 Project - Part A b 2.0

Total (1 internship, 3 Theory and 2 lab courses, and 16.0

1 project)

a Internship is mandatory for all students and they will work in the relevant industry for 3 months as part-time or

full-time. Students will start their internship just after completing their third year second semester final examinations. A
detailed plan of implementation is available in the course outline.
b 2 students will make a group and submit a topic of interest to the committee either on a design/development

project or a research project specifying two names of intended supervisors in order of preference. The expected outcomes
of part A of the final year design project are a literature study, identifying limitations of the existing systems or applica-
tion services, objectives of the work, problem statement or list of novel features of the system, research questions and
methodology or list of steps and tools to be used for the design and development project, a Gantt chart for the project,
and a list of apparatus to be used along with their costs. The supervisors will take the initiative to engage industry
partners with the projects, wherever applicable.

16.8 4th Year, 2nd Semester

Sl Course Code Course Title Credit Prerequisite

1 CSE 4201 Parallel and Distributed Systems 3.0

2 CSE 4202 Parallel and Distributed Systems Lab 1.5
3 MIS 4203 IT Project Management 2.0
4 BUS 4205 ICT Business Entrepreneurship 2.0
5 Elective II 3.0
6 Elective II Lab 1.0
7 Elective III 3.0
8 CSE 4210 Project - Part Ba 4.0

Total (5 Theory and 2 lab courses, and 1 project) 19.5

a The expected outcomes of part B of the project are a usable software system or a comprehensive prototype of any

application service comprising of hardware, software and network tools, or a publishable research article/conference
paper with sufficient investigation, results and propositions. The students need to submit a complete project report, and
a software/ prototype/ collected data/simulation or test-bed implementation codes/proof of work in an acceptable
form. Finally, they will present and defend their system design, development, and results.

19
III ♦ Part C

17 Description of Courses
The Course outlines of each course of the Bachelor of Science in Computer Science and Engineering degree
program are provided in the following subsections.

17.1 Core Courses

21
 Discrete Mathematics/1st year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 1101 Discrete Mathematics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code CSE 1101
Course Title Discrete Mathematics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
Logic: Propositional Logic, Composite Statements, Logical Connectives, Application of Propositional Logic,
▲

Limitation of Propositional Logic, Propositional Equivalences, Predicate Logic, Quantifiers and Nested
Quantifiers, Rule of Inference, Introduction of proofs; Basic Discrete Structure: Basics of Set, Cardinality,
Infinite Set, Power Set, Cartesian Product, Set Operation, Computer Representation of Set; Function: Rep-
resenting a Function, Notation of Set, Injective Function, Surjective Function, Bijection Function, Inverse
Function, Composition of Function, Sequences and Summations, Zero-One Matrices, Boolean Product;
Relation: Binary Relation, Reflexive Relation, Symmetric Relation, Transitive Relation, Closure of a Re-
lation, Composite Relation, Equivalence Relation; Mathematical Induction: Proof Technique, Mathemat-
ical Induction, Discrete Probability, Uniform Probability Measure, Probability of Complementary Event,
Probability of a Union Event. Counting: Counting Rules, Inclusion, Pigeonhole principle, Permutation,
Combination, Binomial Coefficients and Identifies, Generalized Permutations and Combinations, Caesar
Cipher; Recursion: Applications of recurrence relations, Inclusion-Exclusion Principles; Basic Number
Theory: Importance of Number Theory, Divisors, Prime Numbers, Fundamental Theorem of Arithmetic,
GCD and Relatively Prime, Least Common Multiple, Mod Function. Graph: Terminology, Directed Graph,
Undirected Graph, Complete Graph, Bipartite Graph, Subgraph, Representation of Graph in Computer
System, Eurler and Hamilton Paths; Tree: Rooted Tree, M-ary, Binary Tree, Complete Binary Tree.

3 Text and Reference Materials

T Textbook:

– Keneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition, AMC, 2020.

R References:

– Goodaire, E.G., Paramenter, M.M , Discrete Mathematics with Graph Theory, ?? Edition, Pren-
tice hall PTR., 1997.

22
 Discrete Mathematics/1st year 1st semester 2024

4 Course Outcomes
After completion of this course, the students are expected to -

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the basic structures, characteristics
Cognitive
CO1 and operations of logic, sets, functions, re- PO1 40%
(C2)
lations, graphs, and trees.
Analyze problems by applying concepts re-
lated to quantifiers, rule of inference, ba-
Please refer
sic number theory, counting discrete objects, Cognitive
CO2 PO2 50% to Section 5.
and proving the mathematical properties of (C4)
a variety of discrete structures using princi-
ples of induction.
Translate a real-world computing problem
collaboratively into a mathematical model Cognitive
CO3 PO3 10%
using various concepts of discrete mathe- (C4)
matics.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines. • Logic: Propositional Logic, Composite
Statements, Logical Connectives, Application of Propositional
Logic.
3-4 Limitation of Propositional Logic, Propositional Equivalences, T T
• Predicate Logic, Quantifiers and Nested Quantifiers, • Rule
of Inference, Introduction of proofs.
5-7 Basic Discrete Structure: Basics of Set, Set Cardinality • In- T T
finite Set, Power Set, Cartesian Product, Set Operation, Com-
puter Representation of Set.

23
 Discrete Mathematics/1st year 1st semester 2024

8-9 Function: Representing a Function, Notation of Set, Injective T T

Function, Surjective Function, Bijection Function • Inverse
Function, Composition of Function, Sequences and Summa-
tions, Zero-One Matrices, Boolean Product.
10-11 Relation: Binary Relation, Reflexive Relation, Symmetric Re- T T
lation, Transitive Relation, • Closure of a Relation, Composite
Relation, Equivalence Relation;
12-14 Mathematical Induction: Proof Technique, Mathematical In- T T
duction, • Discrete Probability, Uniform Probability Measure,
Probability of Complementary Event, Probability of a Union
Event.
15-17 Recursion: Applications of recurrence relations, Inclusion- T R
Exclusion Principles; • Counting: Counting Rules, Inclusion,
Pigeonhole principle, • Permutation, Combination, Caesar Ci-
pher.
18-22 Basic Number Theory: Importance of Number Theory, Di- T T
visors, Prime Numbers, • Fundamental Theorem of Arith-
metic, GCD and Relatively Prime, Least Common Multiple,
Mod Function.
23-27 Graph: Terminology, Directed Graph, Undirected Graph, • T T
Complete Graph, Bipartite Graph, Subgraph, Representation
of Graph in Computer System. • Tree: Rooted Tree, M-ary,
Binary Tree, Complete Binary Tree;
28 Reviews, Practical applications of various techniques • T R
Problem-solving practices, • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1101 Chairman, Dept. of CSE, DU

April 23, 2024 April 23, 2024

24
 Discrete Mathematics/1st year 1st semester 2024

Appendix A : Program Outcomes (POs)

POs Category Program Outcomes

PO1 Foundational Knowl- Apply a profound understanding of basic science, mathematics, and core
edge principles of computer, computing, and communications to tackle intricate
challenges within the field effectively. Utilize theoretical insights and practi-
cal skills to devise innovative solutions.
PO2 Problem Analysis and Identify, formulate, and rigorously analyze complex engineering problems in
Modeling computer science and engineering domains. This involves extensive comput-
ing and scientific issues, literature review, and the application of mathemati-
cal, statistical, and computational algorithmic techniques to derive substanti-
ated conclusions.
PO3 Design and Develop- Design solutions for complex computer science and engineering problems and
ment design systems, components, or processes that meet specified needs with ap-
propriate consideration for public health and safety, cultural, societal, and
environmental considerations. (K5)
PO4 Investigations Conduct investigations of complex problems using research-based knowledge
(K8) and research methods including design of experiments, analysis and in-
terpretation of data, and synthesis of information to provide valid conclu-
sions.
PO5 Modern Tool Usage Apply a cutting-edge array of computing, communication and artificial in-
telligence techniques to develop innovative software application models, net-
work systems and other AI applications. Understand the use of prediction and
modeling techniques for complex engineering activities and their limitations.
PO6 Engineers and Society Apply reasoning informed by computer science and engineering 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. (K7)
PO7 Environment and Sus- Understand and evaluate the sustainability and impact of professional engi-
tainability neering work in solving complex computer science and engineering problems
in societal and environmental contexts. (K7)
PO8 Ethics Apply ethical principles and commit to professional ethics, responsibilities,
and the norms of engineering practice.
PO9 Individual and Team- Function effectively as an individual and as a member or leader of diverse
work teams and in multidisciplinary settings.
PO10 Communication Communicate effectively on complex engineering activities with the engineer-
ing community and with society at large, such as being able to comprehend
and write effective reports and design documentation, make effective presen-
tations, and give and receive clear instructions.
PO11 Project Management Demonstrate knowledge and understanding of the computation, software and
and Finance network systems, and AI principles and apply these to one’s own work as a
member or a leader of a team to manage projects in multidisciplinary envi-
ronments.
PO12 Life Long Learning Recognize the need for and have the preparation and ability to engage in in-
dependent, life-long learning for adaptibility in the broadest context of tech-
nological change.

Appendix B : Domain and Level of Bloom’s Taxonomy

Cognitive Domain Psychomotor Domain Affective Domain

C1 Remembering P1 Perception A1 Receive
C2 Understanding P2 Set A2 Respond
C3 Applying P3 Guided Response A3 Value
C4 Analyzing P4 Mechanism A4 Organize
C5 Evaluating P5 Complex Overt Response A5 Internalize
C6 Creating/Designing P6 Adaption
P7 Origination

25
 Computational Problem Solving/1st year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 1103 Computational Problem Solving

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code CSE 1103
Course Title Computational Problem Solving
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Course Rationale
▲

The course ”Computational Problem Solving” is designed to equip students with the foundational skills
and mindset necessary to thrive in the digital age. In a world driven by technology and innovation, com-
putational problem-solving has become an essential approach applicable across diverse fields. This course
aims to cultivate this cognitive skill by teaching students control structures and how to break down com-
plex problems into smaller, manageable components, identify patterns and algorithms, and develop sys-
tematic solutions. Through hands-on programming exercises, students will learn the basics of coding,
honing their ability to translate abstract concepts into executable instructions. By gaining familiarity with
programming languages and techniques, students will not only develop practical skills but also enhance
their logical reasoning and creativity. This course serves as a stepping stone for students aspiring to delve
into software development, data analysis, and other computational disciplines. Ultimately, by fostering
computational problems and programming prowess, this course empowers students to approach chal-
lenges methodically, creating a mindset that is indispensable in our technology-driven world.

3 Syllabus
Introduction to Computational Thinking: Scopes, Evolution, and Laws of Modern Computing System.
Data Representation: Data Types, Encoding, and Compression. Logic Building: Logical Thinking, Propo-
sitional Logic. Problem Solving: Defining a problem, logical reasoning, decomposition and abstraction.
Algorithmic Thinking: Name binding, Selection, Repetition, Modularization. Solution Modeling: Ab-
straction, Modeling, Data Organization, Dealing with Errors, and Evaluation of a Solution. Computational
Limitations: Process of capacity measurement in computer, Benchmarking, Practicality and Possibility of
Solution.

4 Text and Reference Materials

T Textbook:

26
 Computational Problem Solving/1st year 1st semester 2024

– David D. Riley and Kenny A. Hunt, Computational thinking for the modern problem solver , ,
CRC Press, .

R References:

– Karl Beeche, COMPUTATIONAL THINKING A beginner’s guide to problem solving and pro-
gramming, , BCS, .

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Explain the evolution and limitations of Cognitive
CO1 PO1 40%
modern computing systems. (C2)
Implement logic and other programming fa- Please refer
Cognitive
CO2 cilities to solve various types of logical prob- PO2 50% to Section 6.
(C3)
lems.
Demonstrate the scopes of a solution with Cognitive
CO3 PO3 10%
limitations. (C5)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

6 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

7 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Computational Thinking: Scopes, Evolution, T T
and Laws of Modern Computing System.
3-5 Data Representation: Data Types, Encoding, and Compres- T T
sion.
6-9 Logic Building: Logical Thinking, Propositional Logic. T T
10-12 Problem Solving: Defining a problem, logical reasoning, de- T T
composition and abstraction.
13-18 Algorithmic Thinking: Name binding, Selection, Repetition, T T
Modularization.

27
 Computational Problem Solving/1st year 1st semester 2024

19-23 Solution Modeling: Abstraction, Modeling, Data Organiza- T T

tion, Dealing with Errors, and Evaluation of a Solution.
24-26 Computational Limitations: Process of capacity measure- T T
ment in computer, Benchmarking, Practicality and Possibility
of Solution

For the definitions of T and R , Please refer to Section 4.

Course Teacher, CSE 1103 Chairman, Dept. of CSE, DU

April 23, 2024 April 23, 2024

28
 Computational Problem Solving Lab/1st year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 1104 Computational Problem Solving Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code CSE 1104
Course Title Computational Problem Solving Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

The Computational Problem Solving Lab is designed to provide students with hands-on experience in cod-
ing, problem-solving, debugging, and application development using the C programming language. This
laboratory-based course aims to complement the theoretical concepts covered in the corresponding theory
lectures, enabling students to apply their knowledge in practical, real-world scenarios. By engaging in
coding exercises, error handling, projects, and collaborative activities, students will develop fundamen-
tal programming skills and gain confidence in their ability to create functional and efficient programs.
This course will mainly focus on the outline: Familiarity of the Evolution of Computing System: Basic
Hardware and Software Components. Programming Language History and the hands-on implementation
of simple programs. Data Representation: Data Types, Encoding, and Compression. Conditional Opera-
tions. Arrays. Algorithmic Thinking: Name binding, Selection, Repetition (Loops), Modularization (Basic
Function Blocks), I/O Operations.

3 Text and Reference Materials

T Textbook:

– B. W. Kernighan, & D. M. Ritchie, The C programming language, Second Edition, Prentice Hall,
2006.

R References:

– Herbert Schildt, Teach Yourself C Plus Plus, Third Edition, Mcgraw-Hill Osborne Media Publi-
cations, 1994.

29
 Computational Problem Solving Lab/1st year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the fundamental knowledge on logic,
data types, variables, and various control Cognitive
CO1 PO1 25%
structures in writing program codes for (C2)
solving computing problems.
Write small-scale multi-functional applica-
Please refer
tion programs for solving real-life complex Cognitive
CO2 PO2 30% to Section 5.
engineering problems in the fields of com- (C3)
puter and information systems.
Defend modular design principles and de-
velopment solutions of real-life founda- Psychomotor
CO3 PO10 45%
tional complex engineering problems both (P5)
in written and oral forms.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

6 Lab Activity Outline

Week Experiment Title CO Activities

1 Familiarize students with the Integrated Development Envi- CO1 Coding and Report
ronment, Write and run basic programs in C programming Writing
language.
2 Solving problems with different data types, variables and con- CO1 Coding and Report
stants. Writing
3-4 Solving decision-making problems using conditional opera- CO1 Coding and Report
tors. Writing
5-6 Solving problems using repetitive statements. CO2 Coding and Report
Writing
7-8 Solving various problems using decision-making and looping CO1 Coding and Report
control structures. Writing
9-10 Write different types of modular programs and handling di- CO3 Coding, debugging,
verse data types. and Report Writing

30
 Computational Problem Solving Lab/1st year 1st semester 2024

11-12 Write programs using arrays to solve different problems. CO2 Coding and Report
Writing
13-14 Design, development, demonstration, and defending a small CO3 Coding, debugging,
menu-driven capstone project, developed by the students in and Report Writing
small groups.

Course Teacher, CSE 1104 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

31
 Structured Programming/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 1201 Structured Programming

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code CSE 1201
Course Title Structured Programming
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 1103 - Computational Problem Solving

2 Syllabus
Function: Functions with Return Type and Trivial Parameters, Local and Global Variables, Call by Value
▲

Function, Library Functions/Header Files Concept. Passing Arrays in a Function as Parameter, Call by Ref-
erence Function, Recursion, Scope Visibility and Lifetime of Variable. Strings: Basics, Difference between
String and Character Array, I/O, Basic Operations without using Library Functions, Array of Strings. String
Library - Basic String Operations, Length, Compare, Concatenate, Substring, Reverse. Structures: Basics,
Necessity, Declaration, Accessing, Initialization, Array of Structures. Pointers: Basics, Uses, Pointer Oper-
ation, Call by Reference using Pointers, Pointer for 1D/2D/3D Array, Structure, Pointer Expression, Array
of Pointers, Function Returning Pointers. Dynamic Memory Allocation: Basics, Uses, Malloc, Free, Cal-
loc, Realloc. File Operation: Basics, Uses, File Opening, Closing, File I/O, Use of Redirect Operator to
Write in File or Read from File. Preprocessors and Macros: Application and Implementation of prepro-
cessors and macros to increase the reusability and simplicity of a program. Linked List: Introduction
to Linked List, Contrasting with Arrays, Advantages and Disadvantages of Linked List, basic terminolo-
gies - nodes, pointers, head, tail, etc., Different types of linked list - Singly Linked List, Doubly Linked
List, Circular Linked List, Linked List Operations - Insertion at different positions, Deletion from differ-
ent positions, Traversing Linked List, Searching in Linked List, Update Operation in Linked List, Linked
List reversal, Linked List Algorithms - Cycle Detection, Merging two linked lists, Splitting Linked List,
etc. Application of Linked List in different Data Structures - Implementation of Stack, and Queue Data
structures. Sorting Algorithms: Insertion Sort, Selection Sort, Bubble Sort, Counting Sort, Merge Sort
and Quick Sort. Object Oriented Concepts in Computer Programming: Application of Object Oriented
Ideas.

3 Text and Reference Materials

T Textbook:

– Herbert Schildt, C++: The Complete Reference, Recent Edition, Wiley Publications.

R References:

– HARVEY M. DEITEL & PAUL DEITEL, C++ How to Program , Recent Edition, Prentice Hall.

32
 Structured Programming/1st year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the principles of Fundamental Con-
Cognitive
CO1 cepts related to structured programming to PO1 40%
(C3)
solve various problems.
Analyze the properties of various Data
Please refer
Structures and underlying concepts, limita- Cognitive
CO2 PO2 45% to Section 5.
tions, and bounds to design an algorithm to (C4)
model various real-life scenarios
Apply Computational Mathematics and Op-
Affective
CO3 timization Techniques to translate various PO6 15%
(A4)
problems to solve them

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 30% 5% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 45% 15% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-3 Function: Functions with Return Type and Trivial Parame- T T
ters, Local and Global Variables, Call by Value Function, Li-
brary Functions/Header Files Concept. Passing Arrays in a
Function as Parameter, Call by Reference Function, Recursion,
Scope Visibility and Lifetime of Variable.
4-6 Strings: Basics, Difference between String and Character Ar- T T
ray, I/O, Basic Operations without using Library Functions,
Array of Strings. String Library - Basic String Operations,
Length, Compare, Concatenate, Substring, Reverse.
7-8 Structures: Basics, Necessity, Declaration, Accessing, Initial- T T
ization, Array of Structures.

33
 Structured Programming/1st year 2nd semester 2024

9-12 Pointers: Basics, Uses, Pointer Operation, Call by Refer- T T

ence using Pointers, Pointer for 1D/2D/3D Array, Structure,
Pointer Expression, Array of Pointers, Function Returning
Pointers. Dynamic Memory Allocation: Basics, Uses, Mal-
loc, Free, Calloc, Realloc.
13-14 File Operation: Basics, Uses, File Opening, Closing, File I/O, T T
Use of Redirect Operator to Write in File or Read from File.
15 Preprocessors and Macros: Application and Implementation T T
of preprocessors and macros to increase the reusability and
simplicity of a program.
16-20 Linked List: Introduction to Linked List, Contrasting with T T
Arrays, Advantages and Disadvantages of Linked List, basic
terminologies - nodes, pointers, head, tail, etc., Different types
of linked list - Singly Linked List, Doubly Linked List, Cir-
cular Linked List, Linked List Operations - Insertion at dif-
ferent positions, Deletion from different positions, Traversing
Linked List, Searching in Linked List, Update Operation in
Linked List, Linked List reversal, Linked List Algorithms - Cy-
cle Detection, Merging two linked lists, Splitting Linked List,
etc. Application of Linked List in different Data Structures -
Implementation of Stack, and Queue Data structures.
21-23 Sorting Algorithms: Insertion Sort, Selection Sort, Bubble T T
Sort, Counting Sort, Merge Sort and Quick Sort.
24-28 Object Oriented Concepts in Computer Programming: Ap- T T
plication of Object Oriented Ideas.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1201 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

34
 Structured Programming Lab/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 1202 Structured Programming Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code CSE 1202
Course Title Structured Programming Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 1104 - Computational Problem Solving Lab

2 Syllabus
▲

The Structured Programming Lab will focus on increasing the skill and knowledge of students over a struc-
tured programming language, preferably C. It will offer students practical exposure to coding, problem-
solving, debugging, and application development using the C programming language. This hands-on lab
course is designed to reinforce the theoretical principles taught in related lectures (CSE-1201: Structured
Programming), empowering students to employ their understanding in practical contexts. Through cod-
ing tasks, error resolution, projects, and teamwork, students will cultivate core programming competencies
and enhance their confidence in crafting effective and optimized programs.

3 Text and Reference Materials

T Textbook:

– Herbert Schildt, C++: The Complete Reference, Recent Edition, Wiley Publications.

R References:

– HARVEY M. DEITEL & PAUL DEITEL, C++ How to Program , Recent Edition, Prentice Hall.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the principles of Fundamental Con-
Cognitive
CO1 cepts related to structured programming to PO1 30%
(C3)
solve various problems.

35
 Structured Programming Lab/1st year 2nd semester 2024

Analyze the properties of various Data

Please refer
Structures and underlying concepts, limita- Cognitive
CO2 PO2 50% to Section 5.
tions, and bounds to design an algorithm to (C4)
model various real-life scenarios
Apply Computational Mathematics and Op-
Affective
CO3 timization Techniques to translate various PO6 20%
(A4)
problems to solve them

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 30% 50% 20% 100%

6 Topic Outline

Week Experiment Title CO Activities

1 Solving coding problems: Related to the concept of Function, CO1 Coding
Loop, and Arrays and Report
Writing
2 Solving coding problems: Related to the concept of Function, CO1 Coding
Recursion, Nested Loops, and Arrays and Report
Writing
3 Solving coding problems: Related to the concept of String Ma- CO1 Coding
nipulation and Report
Writing
4-5 Solving coding problems: Related to the concept of Custom CO1 Coding
Data Type, Structure and Report
Writing
6 Solving coding problems: Related to the concept of Pointers CO1 Coding
and Dynamic Memory Allocation and Report
Writing
7 Solving coding problems: Related to the concept of File re- CO1 Coding
lated I/O in C and Report
Writing
8-9 Solving coding problems: Related to the concept of Linked CO1 Coding
List and associated algorithms and Report
Writing
10 Solving coding problems: Related to the Stack and Queue with CO1 Coding
customized implementation and Report
Writing

36
 Structured Programming Lab/1st year 2nd semester 2024

11 Solving coding problems: Related to the Sorting CO1 Coding

and Report
Writing
12 Solving coding problems: Related to the concept of Number CO1 Coding
Theory and Report
Writing
13-14 Design, development, demonstration, and defending a small CO2, CO3 Coding,
menu-driven capstone project, developed by the students in Debugging,
small groups Demon-
stration
and Report
Writing

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1202 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

37
 Digital Logic Design/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 1203 Digital Logic Design

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code CSE 1203
Course Title Digital Logic Design
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
Introduction: Analog System, Digital System, differences between Analog and digital systems.;Number
▲

Systems:: Decimal, Binary, Octal and Hexadecimal, BCD, ASCII, and ERCDIC Codes.; Combinational
Logic Circuits: Data Representation, Logic Gates and Boolean Algebra, Theorems, Combinational Cir-
cuits Design using NAND of NOR Gates only. Algebraic Simplification, Karnaugh Map.; Introduction
to Decision Diagram, Minimization of Switching Functions. Arithmetic Circuits: Half-Adder Full Adder,
Parallel Adders.; Sequential Logic Circuits: NAND and NOR Latches. Clocked SR. JK, D and T Flip-Flops.
FF Timing Consideration, Master-Slave FF. Complex Sequential logic Circuits: Asynchronous Ripple Up
and Down Counters, Counters with any MOD Numbers, Asynchronous IC Counters, Propagation Delay.
ParaIIeI Up/Down Counters, 74193 Counter. Decoding a Counter. Cascading Counters. Shift Registers.
MSI Logic Circuits: BCD - to - Decimal Decoders, BCD - to 7 Segment Decoder/Drivers. Encoders. Mul-
tiplexer and Demultiplexer. . Integrated Circuits Logic Families: TTL Logic Family Standard, TTL Series
Characteristics, Digital MOSFET Circuits. Memory Devices: Semiconductor Memory Technologies ROM
Architecture Timing and Type of ROM, EPROM, EEPROM, ROM Applications. RAM Architecture Static
and Dynamic RAM, DRAM Structure Operation and Refreshing. Introduction to Verilog.

3 Text and Reference Materials

T Textbook:

– Ronald J. Tocci Neal J. Widmer, Digital Systems Principals and Applications, Eleventh Edition,
Pearson, 2010.

R References:

– Charles H. Roth Larry L. Kinney, Fundamentals of Logic Design, Seventh Edition, Cengage
Learning, 2013.

38
 Digital Logic Design/1st year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Describe number system and methods of
conversion between different types of num-
ber systems. Identify the importance of es-
Cognitive
CO1 tablished forms in the minimization or other PO1 40%
(C3)
optimization of Boolean formulas in combi-
national logic circuits. Analyze the design
procedures of Arithmetic circuits.
Minimize functions using any type of min-
imizing algorithms (Boolean algebra, Kar-
naugh map or Tabulation method). Analyze
Please refer
the design procedures of Combinational and Cognitive
CO2 PO2 50% to Section 5.
Sequential circuits. Describe the basic con- (C4)
cepts of sequential logic circuits like flip-
flops. Introduces complex sequential logic
circuits like counters, registers etc.
Basic concepts of Integrated Circuits Logic
Families. Analyze the design procedures of Affective
CO3 PO6 10%
Memory Devices. Introduce decision dia- (A4)
grams and Verilog.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 40% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 55% 10% 100%

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • Define Analog System, Digital System and
their applications. Analog vs. digital.;
3-4 Introduction to different types of number systems: Binary, T T
Octal, and Hexadecimal, BCD, ASCH, and ERCDIC Codes.
Methods of conversion between different types of number sys-
tems.

39
 Digital Logic Design/1st year 2nd semester 2024

5-7 Introduction to Combinatorial Logic circuits. Data Represen- T T

tation Logic Gates and Boolean Algebra, Theorems, Combina-
tional Circuits Design using NAND of NOR Gates only. Alge-
braic Simplification, Karnaugh Map.
8-12 Arithmetic circuits: Half-Adder Full Adder, Parallel Adders. T T
13-14 Sequential Logic: NAND and NOR Latches. Clocked SR. JK, T T
D and T Flip-Flops. FF Timing Consideration. Master- Slave
FF.
15-17 Introduction to Complex sequential logic circuits. Asyn- T T
chronous Ripple Up and Down Counters, Counters with
Any MOD Numbers, Asynchronous IC Counters, Propaga-
tion Delay. ParaIIeI Up Down and Up/Down Counters, 74193
Counter. Decoding a Counter. Cascading Counters. Shift Reg-
isters.
18-21 MSI Logic Circuits: BCD - to - Decimal Decoders, BCD - to T R
7 Segment Decoder/Drivers. Encoders. Multiplexer and De-
multiplexer.
22-24 Integrated Circuits Logic Families: TTL Logic Family Stan- T T
dard TTL Series Characteristics, Digital MOSFET Circuits.
25-26 Memory Devices: Semiconductor Memory Technologies ROM T T
Architecture Timing and Type of ROM, EPROM, EEPROM,
ROM Applications. RAM Architecture Static and Dynamic
RAM, DRAM Structure Operation and Refreshing. Introduc-
tion to Sequential Circuits, formal Representation of Sequen-
tial Circuits. Decision Diagram.
27-28 Introduction to Decision Diagram, Minimization of Switch- T R
ing Functions. Introduction to Verilog.. Reviews, Future of
IoT and its Challenges • Problem-solving practices, • Assign-
ments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1203 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

40
 Digital Logic Design Lab/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 1204 Digital Logic Design Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code CSE 1204
Course Title Digital Logic Design Lab
Course Credit 0.75 units
Contact Hours Per Week 3 hours in alternate weeks
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Laboratory works based on CSE 1203 Digital Logic Design course - Verification of Basic Logic Gates, Imple-
menting all individual gates with universal gates NAND & NOR, Design a circuit for the given canonical
form, drawing the circuit diagram and verifying the De-Morgan laws, Design of a combinational logic
circuit for 4X1 MUX and verify the truth table, Design a combinational logic circuit for 1X4 DeMUX and
verify the truth table, Construct Half Adder and Full Adder using Half Adder and verify the truth ta-
ble, Implementation of Encoder, Decoder, Priority Encoder and verify the truth table, Verification of truth
tables of the basic Flip -Flops with synchronous and asynchronous modes, Implementation of Master-
Slave Flip-Flop with J-K Flip-Flop and verify the truth table for Race Around condition, Design a Decade
Counter and verify the truth table, Design the Mod 6 counter using D Flip-Flop.

3 Text and Reference Materials

T Textbook:

– Ronald J. Tocci Neal J. Widmer, Digital Systems Principals and Applications, Eleventh Edition,
Pearson, 2010.

R References:

– Charles H. Roth Larry L. Kinney, Fundamentals of Logic Design, Seventh Edition, Cengage
Learning, 2013.

41
 Digital Logic Design Lab/1st year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Design and implement various basic com-
binatorial and sequential logic circuits, for
Cognitive
CO1 example- implementing basic logic gates, PO3 50%
(C5)
multiplexers, demultiplexers, adders, en-
coders, decoders, counters and flip-flops.
Demonstrate appropriate digital logic de-
Please refer
sign techniques and tools to convert descrip- Psychomotor
CO2 PO5 30% to Section 5.
tions of logical problems to efficient digital (P4)
logic circuits.
Design simple digital logic projects as a Psychomotor
CO3 PO9 20%
team member to solve real-life problems. (P7)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 5% 5% 10%
Continuous Lab Performance 25% 10% 5% 40%
Lab Reports 5% 5% 10%
Capstone Project Presentation and Viva-voce 15% 15% 10% 40%
Total 50% 30% 20% 100%

6 Lab Activity Outline

Week Experiment Title CO Activities

1 Laboratory works based on CSE 1203 Digital Logic Design CO1 Experimentation and
course - Verification of Basic Logic Gates, Implementing all Report Writing
individual gates with universal gates NAND & NOR;
2 Design a circuit for the given canonical form and verifying the CO1 Experimentation and
De-Morgan laws, Design of a combinational logic circuit for Report Writing
4X1 MUX or 1X4 DeMUX.
3 Construct Half Adder and Full Adder, Encoder, Decoder, Pri- CO1 Experimentation and
ority Encoder and verify the truth table. Report Writing
4 Verification of truth tables of the basic Flip -Flops with CO1 Experimentation and
synchronous and asynchronous modes, Implementation of Report Writing
Master-Slave Flip-Flop with J-K Flip-Flop.
5 Design a Decade Counter and verify the truth table, Design CO2 Experimentation and
the Mod 6 counter using D Flip-Flop. Report Writing
6 Project design, experimentation, and testing. CO2 Experimentation and
Report Writing

42
 Digital Logic Design Lab/1st year 2nd semester 2024

7 Project demonstration and viva-voce. CO3 Demonstration and

viva-voce

Course Teacher, CSE 1204 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

43
 Data Structures and Algorithms/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2101 Data Structures and Algorithms

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2101
Course Title Data Structures and Algorithms
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Complexity Analysis: Complexity Analysis, beyond experimental analysis, comparing growth rates, Best,
Average, and Worst-case Analysis. Searching: Linear search, binary Search, application of Binary Search-
finding elements in a sorted array, finding the nth root of a real number, solving equations. Recursion:
Basic idea of recursion (3 laws-base case, call itself, move towards the base case by state change), Trac-
ing output of a recursive function, Applications- merge sort, permutation, combination, Memoization.
Sorting: Insertion sort, selection sort, bubble sort, merge sort, quick sort (randomized quick sort), Distri-
bution sort (counting sort, radix sort, bucket sort) lower bounds for sorting, external sort. Linked List:
Singly/doubly/circular linked lists, Basic operations on linked list (insertion, deletion, and traverse), Dy-
namic array and its application. Stack: stack operations (push/pop/peek), Stack-class implementation
using Array and linked list, in-fix to postfix expressions conversion and evaluation, Balancing parentheses
using stack. Queue: Basic queue operations (Enqueue, dequeue), circular queue/ dequeue, Queue-class
implementation using array and linked list, Application- Josephus problem, palindrome checker using
stack and queue. Binary Tree: Binary tree representation using array and Pointer, Traversal of Binary
Tree (in-order, pre-order and post-order). Binary Search Tree: BST representation, Basic operations on
BST (creation, insertion, deletion, querying and traversing), Application- searching, sets. Self-balancing
Binary Search Tree: AVL tree, Red Black Tree. Heap: Min-heap, max-heap, Binomial Heap, Fibonacci-
heap, Applications-priority queue, Heap sort. Disjoint Set: MakeSet, Union, find Set, Path compression
optimization techniques. Huffman Coding: method and application in lossless data compression.

3 Text and Reference Materials

T Textbook:

– Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C., Introduction to Algorithms, 4th Edition,
MIT Press, 2022.

44
 Data Structures and Algorithms/2nd year 1st semester 2024

4 Course Outcomes

CO CO Description PO Domain Weight Assessment Methods

CO1 Understand and apply the prin- PO1 Cognitive (C3) 25%
ciples of complexity analysis in-
Please refer to Section 5
cluding best, average, and worst-
case scenarios and different growth
rates in terms of time complex-
ity, space complexity, and big-
O notation to compare different
data structures and algorithms and
make informed decisions based on
their performance characteristics.
CO2 Implement and analyze fundamen- PO3 Cognitive (C3) 23%
tal data structures such as arrays,
linked lists, stacks, and queues, in-
cluding their applications, opera-
tions, advantages, and limitations.
CO3 Develop efficient algorithms using PO4 Cognitive (C4) 25%
sorting and searching techniques,
understand recursion, and apply
them to solve real-life problems .
CO4 Master advanced data structures PO12 Cognitive (C5) 27%
such as binary trees, binary search
trees, AVL trees, red-black trees,
heaps, and disjoint sets, choose
the right data structure, and apply
them to relevant problems.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 15% 15% 15% 15% 60%
Midterm Exam 5% 5% 5% 5% 20%
Class Test/Quiz 5% 3% 2% 0% 10%
Assignment/Presentation 0% 0% 0% 5% 5%
Class Participation 0% 0% 3% 2% 5%
Total 25% 23% 25% 27% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Complexity Analysis: Complexity Analysis, Beyond experi- T T
mental analysis, comparing growth rates, Best, Average, and
Worst case Analysis

45
 Data Structures and Algorithms/2nd year 1st semester 2024

3-4 Searching: Linear search, binary Search, application of Binary T T

Search- finding elements in a sorted array, finding nth root of
a real number, solving equations
5-6 Recursion: Basic idea of recursion (3 laws-base case, call itself, T T
move towards base case by state change), Tracing output of
a recursive function, Applications- merge sort, permutation,
combination, Memoization
7-9 Sorting: Insertion sort, selection sort, bubble sort, merge sort, T T
quick sort (randomized quick sort), Distribution sort (count-
ing sort, radix sort, bucket sort), lower bounds for sorting, ex-
ternal sort
10-12 Linked List: Singly/doubly/circular linked lists, Basic oper- T T
ations on linked list (insertion, deletion, and traverse), Dy-
namic array and its application
13-14 Stack: Stack operations (push/pop/peek), Stack-class imple- T T
mentation using Array and linked list, in-fix to postfix expres-
sions conversion and evaluation, Balancing parentheses using
stack
15-16 Queue: Basic queue operations (Enqueue, dequeue), circu- T T
lar queue/ dequeue, Queue-class implementation using array
and linked list, Application- Josephus problem, palindrome
checker using stack and queue
17 Binary Tree: Binary tree representation using array and T T
Pointer, Traversal of Binary Tree (in-order, pre-order and post-
order)
18-19 Binary Search Tree (BST): BST representation, Basic oper- T T
ations on BST (creation, insertion, deletion, querying and
traversing), Application- searching, sets
20-21 Self-balancing Binary Search Tree: AVL tree, Red Black Tree T T
22-24 Heap: Min-heap, max-heap, Binomial Heap, Fibonacci-heap, T T
Applications-priority queue, Heap sort
25-26 Disjoint Set: MakeSet, Union, find Set, Path compression op- T T
timization techniques
27 Huffman Coding: Method and application in lossless data T T
compression

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3207 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

46
 Data Structures and Algorithms Lab/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2102 Data Structures and Algorithms Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2102
Course Title Data Structures and Algorithms Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
▲

This laboratory course complements the theoretical knowledge gained in the Data Structures and Algo-
rithms course by providing hands-on experience in practical implementation and applications of data
structures and algorithms to real-life problems. Students will analyze real-world problems, and then pick
and utilize the correct data structures and algorithms to solve them. The lab projects are designed to be
innovative, and practical, preparing students for future technological challenges in the industry.

3 Text and Reference Materials

T Textbook:

– Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C., Introduction to Algorithms, 4th Edition,
MIT Press, 2022.

47
 Data Structures and Algorithms Lab/2nd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Implement and apply fundamental data
structures such as arrays, linked lists, stacks, Cognitive
CO1 PO1 25%
and queues to solve complex computational (C2)
problems.
Develop efficient algorithms using sorting
Please refer
and searching techniques, understand re- Cognitive
CO2 PO2 30% to Section 5.
cursion, and apply them to solve real-life (C3)
problems
Master advanced data structures such as bi-
nary trees, binary search trees, AVL trees,
red-black trees, heaps, and disjoint sets, Psychomotor
CO3 PO10 45%
choose the right data structure through crit- (P5)
ical analysis, and apply them to relevant
problems.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

6 Lab Activity Outline

Week Experiment Title CO Activities

1 Introduction to Complexity Analysis: Understanding com- CO1 Coding and Report
plexity analysis beyond experimental analysis, Comparing Writing
growth rates: Best, Average, and Worst-case analysis.
2 Implementing linear search and binary search algorithms, Ap- CO1 Coding and Report
plication of Binary Search: Finding elements in a sorted ar- Writing
ray, Finding the nth root of a real number using binary search,
Solving equations using binary search
3 Understanding the basic idea of recursion and its three laws, CO1 Coding and Report
Tracing output of a recursive function Implementing recur- Writing
sion in merge sort, permutation, combination, and memoriza-
tion.

48
 Data Structures and Algorithms Lab/2nd year 1st semester 2024

4 Implementing Insertion sort, selection sort, bubble sort, merge CO2 Coding and Report
sort, and quick sort, Introduction to distribution sort algo- Writing
rithms: Counting sort, radix sort, and bucket sort, Lower
bounds for sorting and understanding external sort tech-
niques.
5 Implementing singly/doubly/circular linked lists, Perform- CO2 Coding and Report
ing basic operations on linked lists: Insertion, deletion, and Writing
traversal, Understanding dynamic array and its application.
6 Implementing stack operations using arrays and linked lists, CO2 Coding and Report
In-fix to postfix expressions conversion and evaluation using Writing
stacks, and Balancing parentheses using the stack data struc-
ture.
7 Implementing basic queue operations: Enqueue, dequeue, Im- CO1 Coding and Report
plementing circular queue/dequeue, Application of queues: Writing
Solving Josephus problem, palindrome checker using stack
and queue.
8 Representing binary trees using arrays and pointers, Traversal CO3 Coding, and Report
of Binary Tree: in-order, pre-order, and post-order traversal. Writing
9 Implementing Binary Search Tree operations: Creation, inser- CO3 Coding, and Report
tion, deletion, querying, and traversing, Application of BST: Writing
Searching, sets.
10 Understanding AVL trees and Red-Black trees, Implementing CO2 Coding and Report
operations on self-balancing BSTs. Writing
11 Implementing Min-heap and max-heap data structures, Intro- CO2 Coding and Report
duction to Binomial Heap and Fibonacci Heap, Application of Writing
heaps: Priority queue and Heap sort.
12 Implementing Disjoint Set data structure operations: Make- CO3 Coding, and Report
Set, Union, FindSet, Optimizing Disjoint Set operations using Writing
path compression techniques.
13 Understanding Huffman Coding method, Application of Huff- CO3 Coding, and Report
man Coding in lossless data compression. Writing
14 Reviewing concepts covered throughout the course, Integrat- CO3 Coding, and Report
ing different data structures and algorithms to solve complex Writing
problems.

Mr. Md. Tanvir Alam Prof. Dr. Md. Abdur Razzaque

Course Teacher, CSE 2102 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

49
 Object Oriented Design and Programming/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2103 Object Oriented Design and Programming

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2103
Course Title Object Oriented Design and Programming
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 1201 - Structured Programming

2 Syllabus
▲

Introduction: Object Orient Programming (OOP). Object-oriented concepts: modeling problems using
object-oriented concepts, namespace, inheritance, encapsulation, polymorphism, Object-oriented design
methodologies, and OOP memory models. Object-oriented design patterns in OOP and class diagrams.
Use case, activity, and interaction diagram. Creational design patterns: UML class diagram and creation
of an object in OOP using a singleton, factory, abstract factory, builder, and prototype design pattern.
Structural Design Pattern: UML class diagram and object composition or extend in OOP using an adapter,
flyweight, composite, proxy, facade (or interface), bridge, and decorator. Behavioral Design Pattern: UML
class diagram and change the behavior or access scope in OOP-object using template, chain, mediator,
observer, strategy, command, interpreter, visitor, memento, and state design pattern. Exception handling:
exception types, chained exceptions using chain design pattern. OOP I/O: Stream and files using decorator
and factory design pattern. Java GUI event, Event Container, and Components.

3 Text and Reference Materials

T Textbook:
– Olaf Musch, Design Patterns with Java: An Introduction, Springer Vieweg Wiesbaden, First
Edition, 2023
– Eric Freeman (Author), Elisabeth Robson, Head First Design Patterns: Building Extensible and
Maintainable Object-Oriented Software, O’Reilly Media, 2nd Edition, Jan 2021
– Herbert Schildt, Java: The Complete Reference, 10th Ed..
R References:
– Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, Design Patterns: Elements of Reusable
Object-Oriented Software, Addison-Wesley Professiona, 1st Edition, October 1994
– Robert Sebesta, Concepts of Programming Language 11th Ed.
– Deitel & Deitel Java: How to Program 11th Ed.

50
 Object Oriented Design and Programming/2nd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the evolution of programming,
the rationale behind OOP, basic concepts of Cognitive
CO1 PO1 40%
OOP such as objects and classes, class dia- (C3)
gram, java class design using design pattern
Analysis of design methodologies, UML, in- Please refer
Cognitive
CO2 teraction class diagram using design pattern PO2 50% to Section 5.
(C4)
in Java developing enterprise application.
Understand and apply design patterns in
Affective
CO3 OOP to solve real-life complex problems, PO6 10%
(A4)
demonstrate OOP design skills.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Object Oriented Programming • Object- T T
oriented concepts, modeling problems using object-oriented
concepts
3-6 Object-oriented programming: • namespace, • inheritance, • T T
encapsulation, • polymorphism, • Object-oriented design •
methodologies, • OOP memory models
7-9 Object-oriented design patterns: • OOP and class diagrams. • T T
Use case, activity, and interaction diagram
10-13 Creational design patterns: • UML class diagram, class defini- T R
tion, and creation of an object in OOP using a singleton, fac-
tory, abstract factory, builder, and prototype design pattern.
14-17 Structural Design Pattern: • UML class diagram, class def- T R
inition, and object composition or extend in OOP using an
adapter, flyweight, composite, proxy, facade (or interface),
bridge, and decorator.

51
 Object Oriented Design and Programming/2nd year 1st semester 2024

17-19 Behavioral Design Pattern:• UML class diagram, class struc- T R

ture and change the behavior or access scope in OOP-object
using template, chain, mediator, observer, strategy, command,
interpreter, visitor, memento, and state design pattern
20-22 Exception handling:• exception types, chained exceptions us- T T
ing chain design pattern.
23-24 Exception handling: motivation, basic constructs, exception T T
class hierarchy, exception types, multiple catch clauses, creat-
ing own exceptions.
25-26 Java I/O: Stream and files using decorator and factory design T T
pattern.
27-28 GUI Containers and Components: • GUI packages/library, T T
GUI Event component classes, GUI Accumulator, and design
pattern.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE2103 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

52
 Object Oriented Design and Programming Lab/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2104

Object Oriented Design and Programming Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2104
Course Title Object Oriented Design and Programming Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Laboratory works based on CSE 2103 Objected Oriented Design and Programming course - Introduc-
tion: evolution of programming languages, from procedural programming to Object Orient Programming
(OOP). Object oriented concepts: modeling problems using object oriented concepts. OOP overview: en-
capsulation, inheritance and polymorphism. Objects and classes: attributes, functions or methods, con-
structors and destructors, overloading and overriding methods, access control, special considerations in
different languages. Inheritance: inheriting classes: subclass and superclass, inheritance hierarchy, over-
loading, overriding, dynamic binding, abstract class, inner classes, multiple inheritance, interface. Pack-
ages or namespaces. Exception handling: exception types, chained exception, creating own exception
subclasses. I/O: Stream and files. Multithreading. Generics and templates. Introduction to UML diagram.
Common object-oriented design principles and design patterns with case studies. Introduction to event
handling in GUI environment.

3 Text and Reference Materials

T Textbook:

– Herbert Schildt, Java: The Complete Reference, 10th Ed..

R References:

– Deitel & Deitel Java: How to Program 11th Ed.

– Cay Horstmann Object Oriented Design and Patterns 2nd Ed. Wiley 2005

53
 Object Oriented Design and Programming Lab/2nd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand evolution of programming, ra-
Cognitive
CO1 tionale behind OOP, basic concepts of OOP PO3 50%
(C5)
such as objects and classes.
Interpret and apply core OOP concepts, Please refer
Psychomotor
CO2 namely encapsulation, inheritance, and PO5 30% to Section 5.
(P4)
polymorphism.
Understand and apply advanced OOP fea-
tures like multithreading, exception han-
dling, generics, I/O, and namespace, use ob-
Psychomotor
CO3 ject oriented design principles and design PO9 20%
(P7)
patterns to solve real life complex problems,
demonstrate OOP skills and write report on
OOP concepts.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 5% 5% 10%
Continuous Lab Performance 25% 10% 5% 40%
Lab Reports 5% 5% 10%
Capstone Project Presentation and Viva-voce 15% 15% 10% 40%
Total 50% 30% 20% 100%

6 Lab Activity Outline

Week Experiment Title CO Activities

1 Getting familiar with an IDE and command line, and the very
basics of Java. Translating some problems from C to Java.
2 Class. Constructors. Static block and methods. Passing objects CO1 Experimentation and
to and returning objects from methods. Built-in methods of Report Writing
Object and String class.
3 finalize method, array of objects, static keyword (block, vari- CO1 Experimentation and
able, method), nested class. Report Writing
4 File I/O. Inheritance. CO2 Experimentation and
Report Writing
5 Interface. CO2 Experimentation and
Report Writing
6 Exception handling. CO2 Experimentation and
Report Writing

54
 Object Oriented Design and Programming Lab/2nd year 1st semester 2024

7 Multithreading. CO2 Experimentation and

Report Writing
8 Java’s Collection framework. CO2 Experimentation and
Report Writing
9 OOP design principles. CO2 Experimentation and
Report Writing
10 Project progress evaluation. CO3 Demonstration
11 Project progress evaluation. CO3 Demonstration
12 Project demonstration and viva-voce. CO3 Demonstration and
viva-voce

Course Teacher, CSE 2104 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

55
 Computer Architecture and Microprocessor/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2105

Computer Architecture and Microprocessor

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2105
Course Title Computer Architecture and Microprocessor
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Introduction: Classes of Computers, classes of Processor, trending in technology, the evolution of micro-
processors, scalar, superscalar, defining computer architecture, features of ARM Architecture- ARMv7;
Instruction Set Architecture (ISA): ARM Cortex M4 - features, operating states, operation modes, ar-
chitecture, bus matrix, register sets, instruction sets, addressing modes; Cortex M4 Memory System:
memory map, endianness, alignment, bit-band, connecting processor- AMBA; Arithmetic operations:
Multiplication- sequential version, Booth’s algorithm, array implementation for Booth Multiplier, Division-
restoring and non-restoring division; Cortex M4 Exceptions and Interrupts: interrupt management, pri-
ority, vector table, ISR, NVIC, SCB, PRIMASK, FAULTMASK, BASEPRI, exception handler, interrupt la-
tency and exception handling optimization- tail chaining, Fault handling- MemManage fault, Bus fault,
Usage fault, HardFault, fault status registers, faults related exception handling - stacking, unstacking,
vector fetches, invalid return; memory protection unit; Floating point: IEEE 754, single precision, half-
precision, double -precision floating point numbers, arithmetic operation- addition, subtraction, multipli-
cation, division, Cortex M4 FPU - registers, lazy stack; Arithmetic Logic Unit (ALU): Spatial and temporal
expansion, 1 bit-ALU, 32-bit ALU for Cortex M4; Pipelining: Cortex M4 pipelining, hazard - data, con-
trol, branch hazard, handling hazards in single cycle, Pipelined single-cycle processor’s datapath design,
control signal propagation in pipelined processor, pipelined dependency, pipelined datapath with hazard
handling circuits ; Cortex M4 Instruction Set and Assembler Directives: Instruction set of Cortex M4,
Machine language instruction formats, Assembler directives and operators; Programming with ARM As-
sembly Language: Instruction to machine code conversion, C to Assembly code conversion and vice-verse.
Systolic Array: matrix multiplication.

3 Text and Reference Materials

T Textbook:

– David A. Patterson, John L. Hennessy, Computer Organization and Design ARM Edition: The
Hardware Software Interface, First Edition, Morgan Kaufmann, 2016.

56
 Computer Architecture and Microprocessor/2nd year 1st semester 2024

– Joseph Yiu, The definitive guide to the ARM Cortex-M3 and Cortex-M4 Processors, Third
Edition, Newnes, 2013.

R References:

– Robert Plantz, Introduction to Computer Organization: ARM , First Edition, No Starch Press,
2024.
– David A. Patterson, John L. Hennessy, Computer Organization and Design RISC-V Edition: The
Hardware Software Interface, First Edition, Morgan Kaufmann, 2017.
– Daniel Kusswurm , Modern Arm Assembly Language Programming: Covers Armv8-A 32-bit,
64-bit, and SIMD, First Edition, 2020.
– Larry D Pyeatt, Modern Assembly Language Programming with the ARM, First Edition, Newnes,
2016.
– STM32F446xx advanced Arm ® -based 32-bit MCUs.
– Data Sheet : STM32F446xC/E.
– Cortex-M4 Devices Generic User Guide
– Cortex-M4 Technical Reference Manual
– ARM 7 Technical Reference Manual

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Demonstrate a comprehensive understand-
ing of microprocessor architecture, includ- Cognitive
CO1 PO1 40%
ing its components, instruction set, address- (C3)
ing modes, and operation principles.
Analyze the performance and behavior Please refer
of microprocessor-based systems, including Cognitive to Section
CO2 PO2 30%
understanding concepts such as pipelining, (C4) ??.
caching, and memory hierarchy.
Apply the knowledge to effectively program
microprocessors using assembly language, Affective
CO3 PO5 30%
including writing, debugging, and optimiz- (A4)
ing code for various applications.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • Classes of Computers, classes of Proces-
sor, trending in technology, the evolution of microprocessors,
scalar, superscalar, defining computer architecture, features
of ARM Architecture- ARMv7;;

57
 Computer Architecture and Microprocessor/2nd year 1st semester 2024

3-5 Instruction Set Architecture (ISA) • ARM Cortex M4 - fea- T T

tures, operating states, operation modes, architecture, bus ma-
trix, register sets, instruction sets, addressing modes;

6 Cortex M4 Memory System • memory map, endianness, align- T T

ment, bit-band, connecting processor- AMBA;
7-8 Arithmetic operations • Multiplication- sequential version, T T
Booth’s algorithm, array implementation for Booth Multiplier,
Division- restoring and non-restoring division;
9-12 Cortex M4 Exceptions and Interrupts • interrupt manage- T T
ment, priority, vector table, ISR, NVIC, SCB, PRIMASK,
FAULTMASK, BASEPRI, exception handler, interrupt latency
and exception handling optimization- tail chaining, Fault
handling- MemManage fault, Bus fault, Usage fault, Hard-
Fault, fault status registers, faults related exception handling
- stacking, unstacking, vector fetches, invalid return; memory
protection unit
13-14 Floating point • IEEE 754, single precision, half-precision, T T
double -precision floating point numbers, arithmetic
operation- addition, subtraction, multiplication, division,
Cortex M4 FPU - registers, lazy stack
15 Arithmetic Logic Unit (ALU) • Spatial and temporal expan- T T
sion, 1 bit-ALU, 32-bit ALU for Cortex M4;
16-19 Pipelining • Cortex M4 pipelining, hazard - data, con- T T
trol, branch hazard, handling hazards in a single cycle,
Pipelined single-cycle processor’s datapath design, control
signal propagation in pipelined processor, pipelined depen-
dency, pipelined datapath with hazard handling circuits ;
20-23 Cortex M4 Instruction Set and Assembler Directives • The in- T T
struction set of Cortex M4, Machine language instruction for-
mats, Assembler directives, and operators;
24-26 Programming with ARM Assembly Language • Instruction to T R
machine code conversion, C to Assembly code conversion, and
vice-versa;
27 Systolic Array: matrix multiplication; T T
28 Reviews; T R

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 2105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

58
 Microprocessor and Assembly Language Lab/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2106

Microprocessor and Assembly Language Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2106
Course Title Microprocessor and Assembly Language Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

The lab course aims to provide hands-on knowledge of Assembly language programming for ARM ar-
chitecture using an ARM instruction set. Learn good practices in structuring a microprocessor control
program. Apply the programming principles, including top-down programming, bottom-up program-
ming, and functional programming to define an accurate programming problem statement. Recognize
that good problem definition assists the program design process. Describe differences between the various
approaches to solving a programming problem using assembly/C language. Select one specific approach.
Using ARM Assembly programming to design and implement interrupts and exceptions. It will be used to
handle different interfacing techniques. The lab will cover design and Simulation of Data Path and Control
of CPUs.

3 Text and Reference Materials

T Textbook:

– David A. Patterson, John L. Hennessy, Computer Organization and Design ARM Edition: The
Hardware Software Interface, First Edition, Morgan Kaufmann, 2016.
– Joseph Yiu, The definitive guide to the ARM Cortex-M3 and Cortex-M4 Processors, Third
Edition, Newnes, 2013.

R References:

– Robert Plantz, Introduction to Computer Organization: ARM , First Edition, No Starch Press,
2024.
– David A. Patterson, John L. Hennessy, Computer Organization and Design RISC-V Edition: The
Hardware Software Interface, First Edition, Morgan Kaufmann, 2017.
– Daniel Kusswurm , Modern Arm Assembly Language Programming: Covers Armv8-A 32-bit,
64-bit, and SIMD, First Edition, 2020.

59
 Microprocessor and Assembly Language Lab/2nd year 1st semester 2024

– Larry D Pyeatt, Modern Assembly Language Programming with the ARM, First Edition, Newnes,
2016.
– STM32F446xx advanced Arm ® -based 32-bit MCUs.
– Data Sheet : STM32F446xC/E.
– Cortex-M4 Devices Generic User Guide
– Cortex-M4 Technical Reference Manual
– ARM 7 Technical Reference Manual

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
The lab reinforces theoretical concepts
learned in the Microprocessor theory course,
providing students with practical experi- Cognitive
CO1 PO1 25%
ence in microprocessor architecture and as- (C2)
sembly language programming for solving
computing problems.
Lab activities will involve conducting exper-
iments to observe the behavior of micropro- Please refer
Cognitive
CO2 cessor systems, analyzing experimental re- PO2 30% to Section 5.
(C3)
sults, and interpreting data to gain insights
into system performance and functionality.
Students will work collaboratively for a
project, which will require students to work
effectively in teams, demonstrating commu-
nication, leadership, and problem-solving Psychomotor
CO3 PO5 45%
skills. Students will learn to distribute tasks, (P5)
coordinate efforts, and integrate individual
contributions to achieve common objectives
through this task.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

60
 Microprocessor and Assembly Language Lab/2nd year 1st semester 2024

Course Teacher, CSE 2106 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

61
 Data and Telecommunication/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2109 Data and Telecommunication

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code CSE 2109
Course Title Data and Telecommunication
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Introduction: Communication model, data communication tasks, data communication network standards
and organizations. Protocol architecture, communications between layers, peer to peer communication
between remote layers, service access points, service primitives and communication between adjacent lay-
ers, encapsulation of PDUs, addition of headers on transmission; removal on reception, segmentation &
reassembly by protocol layers. Physical Layer: Analog and digital data transmission, spectrum and band-
width, transmission impairments, data rate and channel capacity. Wireless Transmission: Characteristics
and applications of wireless transmission-terrestrial and satellite microwave, radio waves, propagation
mechanism, free space propagation, land propagation, path loss, slow fading, fast fading, delay spread,
inter symbol interference. Digital transmission: Line coding techniques- NRZ, RZ, Manchester, and
differential Manchester encoding, AMI, Block coding, analog to digital conversion based on PCM, delta
modulation, etc. Analog transmission: ASK, FSK, PSK, QPSK, QAM encodings, AM, PM, FM, etc. Data
Transmission: Synchronous and asynchronous data transmission techniques. Multiplexing: FDM, inter-
national FDM carrier standards, synchronous TDM, international TDM carrier standards, statistical time
division multiplexing. Spread Spectrum: Frequency hopping spread spectrum, direct sequence spread
spectrum, code division multiple access. Error Detection and Correction: parity check, CRC, forward
error correction technique, linear block code, hamming code, etc. Data Link Control: Line configura-
tions, flow control and error control techniques- sliding window, stop and wait ARQ, selective reject ARQ
protocols.

3 Text and Reference Materials

T Textbook:

– B. Forouzan, Data Communications and Networking , Fifth Edition, McGraw-Hill , 2012.

R References:

– W. Stallings, Data and Computer Communications , 10th Edition, Prentice Hall, 2013.

62
 Data and Telecommunication/2nd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the fundamental concepts, el-
ements, network structures, criteria, and Cognitive
CO1 PO1 50%
bandwidth utilization techniques of data (C2)
communication systems.
Explain Analog and Digital signals, trans-
mission impairments, capacity, and per- Please refer
Cognitive
CO2 formance of a communication system. PO2 40% to Section 5.
(C3)
Analyze Digital-Digital, Analog-Digital,
Analog-Analog conversion approaches.
Familiarizing with the fundamentals of Er- Cognitive
CO3 PO1 10%
ror Detection and Correction techniques. (C3)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 25% 10% 60%
Midterm Exam 15% 5% 20%
Class Test/Quiz 5% 5%
Assignment/Presentation 5% 5% 10%
Class Participation 5% 5%
Total 45% 45% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to data communication systems and its compo- T T
nents. Network performance criteria. Organization of the In-
ternet.
3 Network Models: Layered architecture (OSI and TCP) T T
4-6 Data and Signal: Periodic analog signals, composite signals, T,R T,R
Fourier series. Bit rate, bit length.
7 Transmission Impairments: Attenuation, distortion, noise. T T
Signal to noise ratio.
8 Data Rate Limits: Nyquist bit rate, Shannon’s channel capac- T,R T,R
ity.
9 Performance Criteria: Bandwidth, throughput, latency, T T
bandwidth-delay product.

63
 Data and Telecommunication/2nd year 1st semester 2024

10-11 Digital-to-Digital Conversion: Data and signal elements. Cri- T,R T,R
teria for good signalling element (baseline wandering, DC
component, self-synchronization, error detection, complexity)
12-13 Line Encoding Schemes: Unipolar, Polar (NRZ, RZ), Bi- T T,R
phase (Manchester, differential Manchester), Bipolar (AMI,
Psedoternary), Multilevel
14 Block Coding and Scrambling techniques T T
15-16 Analog-to-Digital: Pulse Code Modulation (Sampling, Quan- T,R T,R
tization, Bit rate, BW), PCM decoder, Delta Modulation, Delta
PCM.
17-18 Digital-to-Analog: Amplitude Shift Keying, Frequency Shift T,R T,R
Keying, Phase Shift Keying, Constellation diagram. Quadra-
ture Amplitude Modulation
19-20 Analog-to-Analog: Amplitude, Frequency, and Phase Modula- T T,R
tion.
21-22 Bandwidth Utilization: Multiplexing (frequency-division, T,R T
wavelength-division, time-division), Data rate management
23-24 Spreading: Frequency Hopping Spread Spectrum (FHSS), Di- T,R T,R
rect Sequence Spread Spectrum (DSSS).
25-26 Error Detection and Correction: Types of errors, redundancy, T,R T,R
detection and correction, forward error correction, Hamming
distance.
27-28 Linear Block Codes: Cyclic codes, checksum. T,R T,R

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 2109 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

64
 Database Management System/2nd Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2201 Database Management System

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd Year 2nd Semester 2024
Course Code CSE 2201
Course Title Database Management System
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Introduction to Database System Concepts: Purpose and Applications of Database Systems, View of Data,
Database Language, Database Engine, Database and Application Architecture, Database Users and Admin-
istrators. Database Design using Relational and ER Models: Structure of Relational Databases, Database
Schema and Instance, Constraints and Keys: Super, Candidate, Primary, Foreign, Unique; Schema Dia-
gram, The Entity-Relationship Model: Entity and Relationship Sets, Attribute Types; Constraints: Mapping
Cardinalities, Participation; Strong and Weak Entity Sets, Entity-Relationship (ER) Diagram, Reducing E-R
Diagram to Relational Schemas, Extended E-R Features: Specialization, Generalization, Aggregation; E-R
Model Design Issues. Structured Query Language: Overview, Data Types, SQL Data Definition Language
(DDL), SQL Data Manipulation Language (DML): Basic Structure of SQL Queries, Set Operations, Null
Values, Grouping and Aggregate Functions, String and Other Functions, Nested Sub-queries, Database
Modification: Insert, Update, Delete; Join Types and Conditions: Inner Joins: Cartesian, Natural; Outer
Joins: Left, Right and Full, View and Materialized View, Integrity Constraints, Authorization, Role, Embed-
ded and Dynamic SQL, Trigger. Relational Algebra: Fundamental Operations: Select, Project, Rename,
Cartesian-Product, Set, Assignment Operations. Relational Database Design: Functional Dependency
Theory: Keys and FDs, Closure set of FDs, Attribute Closure, Canonical Cover, Normal Forms: 1NF, 2NF,
BCNF, 3NF; Decomposition Algorithms, Features of Good Relational Designs: Lossless Join, Dependency
Preservation, Concept of Multivalued Dependency: 4NF, 5NF. Data Storage Structure: RAID: Importance,
RAID Levels; File Organization: Fixed and Variable Length Records; Heap, Sequential, Multitable, B+-Tree
File Organizations, Data Dictionary Storage. Indexing: Basic Concepts, Ordered Indices: Dense, Sparse,
Secondary, Multilevel; B+-Tree Index: Insert, Update, Delete; Hash Indices: Static Hashing, Extendible
Hashing, Comparison of Ordered Indexing and Hashing. Query Processing: Measures of Query Cost:
Selection, Sort and Join Operations Algorithms, Other Operations: Duplicate Elimination, Projection, Set
Operations, Outer Joins, Aggregation, Evaluation of Expressions: Materialization and Pipelining. Query
Optimization: Transformation of Relational Expression: Equivalence Rules, Join Ordering; Cost Based
and Heuristics Optimization, Materialized View and Maintenance. Transactions: Transaction Concept
and ACID Properties, Transaction States, Schedule, Recoverability and Serializability. Concurrency Con-
trol: Lock-Based Protocols, Graph-Based Protocols, Deadlock Handling, Multiple Granularity, Timestamp-
Based Protocols, Validation-Based Protocols. Advanced Topics: XML, NoSQL.

65
 Database Management System/2nd Year 2nd Semester 2024

3 Text and Reference Materials

T Textbook:

– Abraham Silberschatz, Henry F. Korth, and S. Sudarshan, Database System Concepts, 7th Edition,
McGraw Hill Publications, 2020.

R References:

– P Raja Sekhar Reddy & A Mallikarjuna Reddy, Foundations of Database Management Systems,
Fifth Edition, Lambert Academic Publishing, 2020.

– Ramez Elmasri & Shakant B. Navathe, Fundamentals of Database System, 7th Edition, Pearson
Publications, 2016.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the basics of the database and
Cognitive
CO1 conceptualize a database system using E-R PO1 25%
(C3)
and relational model.
Analyze and construct queries using rela- Please refer
Cognitive
CO2 tional algebra and Structured Query Lan- PO2 20% to Section 5.
(C3)
guage (SQL).
Understand the functional dependencies
Cognitive
CO3 and apply systematic dataset design ap- PO3 15%
(C4)
proaches using normal forms.
Understand basic database storage struc-
tures and identify suitable index and hash-
ing mechanism for effective storage and re-
trieval of data; Learn effective techniques Cognitive
CO4 PO1 40%
for query processing and optimization; Un- (C2)
derstand the needs of transaction processing
and learn techniques for controlling the con-
current data access.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 10% 10% 10% 30% 60%
Midterm Exam 10% 5% 5% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 20% 20% 20% 40% 100%

66
 Database Management System/2nd Year 2nd Semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 • Purpose and Applications of Database Systems, View of T T
Data, Database Language, Database Engine, Database and Ap-
plication Architecture, Database Users and Administrators
3-5 • Structure of Relational Databases • Database Schema and T R
Instance, • Constraints and Keys: Super, Candidate, Primary,
Foreign, Unique • Schema Diagram • The Entity-Relationship
Model: Entity and Relationship Sets, Attribute Types • Con-
straints: Mapping Cardinalities, Participation; • Strong and
Weak Entity Sets, • Entity-Relationship (ER) Diagram • Re-
ducing E-R Diagram to Relational Schemas • Extended E-R
Features: Specialization, Generalization, Aggregation • E-R
Model Design Issues
6-10 • SQL: Overview, Data Types • SQL Data Definition Lan- T R
guage (DDL) • SQL Data Manipulation Language (DML): Ba-
sic Structure of SQL Queries, Set Operations, Null Values,
Grouping and Aggregate Functions, String and Other Func-
tions, Nested Sub-queries, • Database Modification: Insert,
Update, Delete • Join Types and Conditions: Inner Joins:
Cartesian, Natural; Outer Joins: Left, Right and Full, View
and Materialized View, • Integrity Constraints • Authoriza-
tion, Role • Embedded and Dynamic SQL • Trigger • The Re-
lational Algebra: Fundamental Operations: Select, Project, Re-
name, Cartesian-Product, Set, Assignment Operations
11-14 • Functional Dependency Theory: Keys and FDs, Closure set T R
of FDs, Attribute Closure, Canonical Cover • Normal Forms:
1NF, 2NF, BCNF, 3NF • Decomposition Algorithms, Features
of Good Relational Designs: Lossless Join, Dependency Preser-
vation, • Concept of Multivalued Dependency: 4NF, 5NF
15-17 • RAID: Importance, RAID Levels • File Organization: Fixed T T
and Variable Length Records; Heap, Sequential, Multitable,
B+-Tree File Organizations • Data Dictionary Storage
18-20 • Basic Concept of Indexing, Ordered Indices: Dense, Sparse, T T
Secondary, Multilevel; • B+-Tree Index: Insert, Update, Delete
• Hash Indices: Static Hashing, Extendible Hashing • Com-
parison of Ordered Indexing and Hashing
21-22 • Measures of Query Cost: Selection, Sort and Join Operations T T
Algorithms, • Other Operations: Duplicate Elimination, Pro-
jection, Set Operations, Outer Joins, Aggregation, • Evaluation
of Expressions: Materialization and Pipelining
23-24 • Transformation of Relational Expression: Equivalence Rules T T
• Join Ordering • Cost Based and Heuristics Optimization •
Materialized View and Maintenance
25-27 • Transaction Concept and ACID Properties • Transac- T T
tion States • Schedule: Recoverability and Serializability
• Lock-Based Protocols, Graph-Based Protocols, Deadlock
Handling, Multiple Granularity, Timestamp-Based Protocols,
Validation-Based Protocols
28 • XML, NoSQL T R

For the definitions of T and R , Please refer to Section 3.

67
 Database Management System/2nd Year 2nd Semester 2024

Course Teacher, CSE 2201 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

68
 Database Management System Lab/2nd Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2202 Database Management System Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd Year 2nd Semester 2024
Course Code CSE 2202
Course Title Database Management System Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Task: Implementation of ‘Bank’ and ‘University’ databases of the text book T or any other sample database
using Oracle Express Edition or any other DBMS software. Database Language: SQL(Structured Query
Language) –DDL: Creating Users and Assigning Roles and Authorities; Creating, Modifying and Deleting
Objects: Table, Index, View; Creating Integrity Constraints: Data Types and Lengths, Keys (Primary key,
Unique key, Foreign key/Referential Integrity Constraint), Check, Null and Not Null etc. –DML: Insert
(direct, text or excel file upload, using query); Basic structure of SQL queries: select, from, where, order
by, group by, having; rename, string and set operations; Aggregate functions: sum, min, max, avg, count;
Nested sub-queries; Complex queries; Views; Modification of the database: update, delete. Lab Exami-
nation 1: Based on DDL and DML of SQL Introduction to PL/SQL: PL/SQL features, PL/SQL Control
Structures and Procedures, Functions and Packages. Lab Examination 2: Based on PL/SQL. Project: A
database project is to be done mainly focusing on database design (form E-R model to Relational model
with normalization), implementation and querying information based on the scenario chosen by the stu-
dents with prescribed criteria.

3 Text and Reference Materials

T Textbook:

– Abraham Silberschatz, Henry F. Korth, and S. Sudarshan, Database System Concepts, 7th Edition,
McGraw Hill Publications, 2020.

R References:

– P Raja Sekhar Reddy & A Mallikarjuna Reddy, Foundations of Database Management Systems,
Fifth Edition, Lambert Academic Publishing, 2020.

– Ramez Elmasri & Shakant B. Navathe, Fundamentals of Database System, 7th Edition, Pearson
Publications, 2016.

69
 Database Management System Lab/2nd Year 2nd Semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Create, modify and delete database ob-
ject structures and implement different con-
Cognitive
CO1 straints on schema and instance and popu- PO2 25%
(C3)
late data into the sample database using any
modern database management system.
Please refer
Construct and apply DML commands to ac- Cognitive
CO2 PO2 25% to Section 5.
cess data form the sample database. (C3)
Model a new database of students’ choice,
identify the various entities, appropriate
data types, relationships, constraints, etc.;
design, normalize and achieve goodness of Cognitive
CO3 PO9 50%
the relational database schemas; write the (C6)
SQL commands to create and populate the
database and also write SQL, PL/SQL to ac-
cess the data from the database.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Continuous Lab Performance 20% 20% 40%
Project Presentation and Viva-Voce 40% 40%
Project Report 10% 10%
Class Participation 5% 5% 10%
Total 25% 25% 50% 100%

Course Teacher, CSE 2202 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

70
 Design and Analysis of Algorithms/2nd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 2203 Design and Analysis of Algorithms

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 2nd semester 2024
Course Code CSE 2203
Course Title Design and Analysis of Algorithms
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE2101: Data Structures and Algorithms

2 Syllabus
▲

Graph Traversal: Graph representation using Adjacency list and Adjacency matrix, Breadth-first search
(BFS), Depth first search (DFS), Topological Sort, Strongly Connected Components, Euler Path, Articula-
tion Point, Bridge, Bi-connected Components. Shortest Path Algorithms: Dijkstra’s Shortest Path Algo-
rithm, Bellman-Ford algorithm, and negative cycle detection, Shortest path in Directed Acyclic Graph,
Floyd-Warshall all pair shortest path algorithm, Johnson’s Algorithm. Greedy Algorithms: Elements and
properties of Greedy algorithms, Fractional knapsack, job scheduling with deadline, Minimum spanning
tree: Prim’s and Kruskal’s algorithms. Complexity Analysis and Recurrence Relation: Review of asymp-
totic notations, growth of a function, Amortized analysis, Aggregate analysis, The accounting method, The
potential methods, Methods to solve recurrence relation, Substitution method, Recursion tree method,
Master method. Dynamic Programming: Basic idea, properties and comparison with Divide & Conquer
and Greedy Algorithms, Rod Cutting algorithm, General form of Dynamic Programming and Memoriza-
tion, Coin related problems, Longest Increasing subsequence (LIS), Longest Common Subsequence (LCS),
0/1 Knapsack, Matrix Chain Multiplication, Rock Climbing, Applications of Dynamic programming. Di-
vide & Conquer: Counting Inversion using merge sort, Closest pair of points, Finding Ak mod M using
DC method, Finding median (in general k-th smallest element) in a set using DC in expected linear time.
Network Flow: Flow Networks, Max-Flow Min-cut theorem, Ford Fulkerson method and its limitation,
Edmonds Karp algorithm, Maximum bipartite matching, Minimum path cover, edge cover, The Hopcroft-
Karp algorithm, The stable marriage problem. Hashing: Linear Probing, Quadratic probing, Double Hash-
ing, Random Hashing, Cuckoo Hashing, Consistent Hashing.

3 Text and Reference Materials

T Textbook:

– Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C., Introduction to Algorithms, 4th Edition,
MIT Press, 2022.

71
 Design and Analysis of Algorithms/2nd year 2nd semester 2024

4 Course Outcomes

CO CO Description PO Domain Weight Assessment Methods

CO1 Understand and apply various PO1 Cognitive (C3) 25%
graph traversal techniques includ-
Please refer to Section 5
ing BFS, DFS, and algorithms for
finding shortest paths, articulation
points, and strongly connected
components.
CO2 Analyze and implement Greedy al- PO3 Cognitive (C4) 23%
gorithms and Dynamic Program-
ming techniques for solving op-
timization problems, and distin-
guish between these strategies and
other methods like Divide and
Conquer.
CO3 Design and analyze algorithms for PO4 Cognitive (C3) 25%
network flow problems, includ-
ing understanding the Max-Flow
Min-Cut theorem and implement-
ing flow algorithms like Ford-
Fulkerson and Edmonds-Karp.
CO4 Master complex data structures PO12 Cognitive (C3) 27%
for efficient algorithm implemen-
tation, including various hashing
techniques, and analyze their im-
pact on algorithm performance.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 15% 15% 15% 15% 60%
Midterm Exam 5% 5% 5% 5% 20%
Class Test/Quiz 5% 3% 2% 0% 10%
Assignment/Presentation 0% 0% 0% 5% 5%
Class Participation 0% 0% 3% 2% 5%
Total 25% 23% 25% 27% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

72
 Design and Analysis of Algorithms/2nd year 2nd semester 2024

1-4 Graph Traversal: Graph representation using Adjacency list T T

and Adjacency matrix, Breadth first search (BFS), Depth first
search (DFS), Topological Sort, Strongly Connected Compo-
nents, Euler Path, Articulation Point, Bridge, Bi-connected
Components
5-8 Shortest Path Algorithms: Dijkstra’s Shortest Path Algorithm, T T
Bellman-Ford algorithm and negative cycle detection, Short-
est path in Directed Acyclic Graph, Floyd-Warshall all pair
shortest path algorithm, Johnson’s Algorithm
9-10 Greedy Algorithms: Elements and properties of Greedy al- T T
gorithms, Fractional knapsack, job scheduling with deadline,
Minimum spanning tree: Prim’s algorithm and Kruskal’s algo-
rithm
11-13 Complexity Analysis and Recurrence Relation: Review of T T
asymptotic notations, growth of a function, Amortized anal-
ysis, Aggregate analysis, The accounting method, The poten-
tial methods, Methods to solve recurrence relation including
Substitution method, Recursion tree method, Master method
14-17 Dynamic Programming: Basic idea, properties and compar- T T
ison with Divide & Conquer and Greedy Algorithms, Rod
Cutting algorithm, General form of Dynamic Programming
and Memorization, Coin related problems, Longest Increas-
ing subsequence (LIS), Longest Common Subsequence (LCS),
0/1 Knapsack, Matrix Chain Multiplication, Rock Climbing,
Applications of Dynamic programming
18-20 Divide & Conquer (DC): Counting Inversion using merge T T
sort, Closest pair of points, Finding Ak mod M using DC
method, Finding median (in general k-th smallest element) in
a set using DC in expected linear time
21-24 Network Flow: Flow Networks, Max-Flow Min-cut theorem, T T
Ford Fulkerson method and its limitation, Edmonds Karp al-
gorithm, Maximum bipartite matching, Minimum path cover,
edge cover, The Hopcroft-Karp algorithm, The stable marriage
problem
25-26 Hashing: Linear Probing, Quadratic probing, Double Hash- T T
ing, Random Hashing, Cuckoo Hashing, Consistent Hashing

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 2203 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

73
 Design and Analysis of Algorithms Lab/2nd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2204

Design and Analysis of Algorithms Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 2nd semester 2024
Course Code CSE 2204
Course Title Design and Analysis of Algorithms Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
▲

This laboratory course is designed to provide practical experience in implementing, analyzing, and op-
timizing various algorithms as covered in the Design and Analysis of Algorithms course. Students will
develop and test algorithmic solutions using real-world data and simulations, focusing on essential topics
such as graph traversal, shortest path algorithms, greedy techniques, complexity analysis, dynamic pro-
gramming, divide and conquer strategies, network flows, and advanced hashing techniques. The course
aims to deepen students’ understanding of theoretical concepts through hands-on application, enabling
them to effectively tackle complex computational problems and enhance their ability to devise algorithms
that are both efficient and scalable.

Prospective Lab Tasks Description

1. Graph Traversal:

■ Implementing and visualizing graph traversal algorithms: BFS and DFS.

■ Applications and implementation of Topological Sort and algorithms for finding Strongly Con-
nected Components.
■ Implementing algorithms to find Euler paths, Articulation Points, Bridges, and Bi-connected
Components.

2. Shortest Path Algorithms:

■ Implementing Dijkstra’s algorithm and visualizing step-by-step path finding.

■ Implementing and comparing the Bellman-Ford algorithm and Floyd-Warshall algorithm.
■ Applying Johnson’s Algorithm to sparse graph scenarios.

3. Greedy Algorithms:

74
 Design and Analysis of Algorithms Lab/2nd year 2nd semester 2024

■ Implementing the Fractional Knapsack and job scheduling problems.

■ Constructing Minimum Spanning Trees using Prim’s and Kruskal’s algorithms.

4. Complexity Analysis and Recurrence Relation:

■ Analyzing the growth of functions using different asymptotic notations.

■ Practicing the substitution, recursion tree, and Master methods to solve recurrence relations.

5. Dynamic Programming:

■ Implementing and analyzing the efficiency of the Rod Cutting algorithm and the Coin Change
problem.
■ Solving the Longest Increasing Subsequence, Longest Common Subsequence, and 0/1 Knapsack
problems.
■ Implementing the Matrix Chain Multiplication and exploring applications of Dynamic Pro-
gramming in solving complex problems.

6. Divide & Conquer:

■ Implementing and analyzing the Counting Inversions using merge sort and finding the median
using the DC method.
■ Exploring Closest pair of points problem and its implementation.

7. Network Flow:

■ Implementing the Ford Fulkerson method and Edmonds Karp algorithm for solving flow net-
work problems.
■ Analyzing algorithms for maximum bipartite matching and studying the application of the
Hopcroft-Karp algorithm.

8. Hashing:

■ Implementing various hashing techniques such as Linear Probing, Quadratic Probing, and Dou-
ble Hashing.
■ Exploring advanced hashing strategies like Cuckoo Hashing and Consistent Hashing, analyzing
their performance and use-cases.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Implement and apply various graph traver-
sal techniques including BFS, DFS, and al-
Cognitive
CO1 gorithms for finding shortest paths, articu- PO1 25%
(C2)
lation points, and strongly connected com-
ponents.

75
 Design and Analysis of Algorithms Lab/2nd year 2nd semester 2024

Implement and apply Greedy algorithms

and Dynamic Programming techniques for Please refer
Cognitive
CO2 solving optimization problems, and distin- PO2 30% to Section 5.
(C3)
guish between these strategies and other
methods like Divide and Conquer.
Design, implement, analyze, and apply algo-
rithms for network flow problems, including
Psychomotor
CO3 understanding the Max-Flow Min-Cut theo- PO10 45%
(P5)
rem and implementing flow algorithms like
Ford-Fulkerson and Edmonds-Karp.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

Course Teacher, CSE 2204 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

76
 Microcontroller and Embedded System/2nd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2205

Microcontroller and Embedded System

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 2nd semester 2024
Course Code CSE 2205
Course Title Microcontroller and Embedded System
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE2101 Data Structures and Algorithms, CSE 2105 Computer Architec-
ture and Microprocessor
▲

2 Syllabus
Introduction to Microcontroller (MCU) and Embedded system: Functional components of the micro-
controller, Types of microcontroller, application of microcontroller: robotics, control system, IoT, drones,
autonomous vehicle and the building block of the intelligent industry, software and firmware; ARM Mi-
crocontroller architecture: Bus matrix (AHBx, APBx), peripherals, GPIO port/pin, Timers, FPU, MPU,
DSP, and Voltage regulator, clock generator, ADC, DAC, audio and video interface, communication ports,
System Configuration and Control; GPIO and GPIO port: GPIO concepts, grouping, communication
data rate, EXT interrupt and GPIO modes, Pull-up, pull-down, set and reset GPIO output, Speed, alter-
nate use of GPIO. GNU Debugger: C/C++ debugger for MCU, memory, and peripheral register content
verification and finding faults or logical errors. MCU System Reset and Clock Control – RCC: ARM
Cortex-M4/7 internal clock, MCU external and internal clock generator, RCC and real-time (RTC) clock
architecture and functional procedure, clock distribution and power management, Peripheral bus registers
for supplying clock to peripheral; Flash memory and SRAM: MCU flash memory and SRAM architecture
address data rate, interface to the microprocessor, external memory, and functions of MPU. Address map-
ping for memory and I/O, Internal and External Interrupt: Microcontroller interrupt vector and service
routine, customization; Timers: Timer and use of timer, timer pre-scaler, auto-reload register, counter, in-
put capture, CCR registers, PWM generation, delay generation, pattern generation, duty cycle, and power
delivery, Synchronous and asynchronous communication: Asynchronous communication such as UART,
GPIO; serial synchronous communication such as USART, SPI, I2C (I2S), CAN (fdCAN,bxCAN) protocol
architecture, packet and frame format, data communication, error checking, use of interrupt and DMA
for data transfer, configuration and status verification, troubleshooting; MCU communication network:
R232, RS485, ethernet, and CANBus; Transaction of information: Polling, Interrupt I/O, DMA, No-buffer,
single buffer, and double buffer data transaction. ADC and DAC: Analog and digital peripherals, resolu-
tion, quantization, sampling and use of DMA channel; DSP, floating point and Vector processing: Signal
pattern analysis, signal processing, review of FFT and DFT; Diplay Peripherals and GPU: LCD TFT, LVDS,
RGB protocol, color matrix, MIPI, IPS and HDMI display interfaces. Touch screen, multi-touch, and input
management.

77
 Microcontroller and Embedded System/2nd year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– STMicroelectronics, STM32F446xx of M7 advanced Arm®-based 32-bit MCUs - Reference man-

ual, RM0390 Rev 6 (M4), STMicroelectronics Online, March 2021.
– STMicroelctronics, Datasheet - STM32F446xC/E - Arm® Cortex®-M4/7 32-bit micocontroller,
DS10693 Rev 10, Jan, 2021
– ARM Limited, Cortex-M4 Revision r0p0 Technical Reference Manual Revision r0p0, 2009/10

R References:

– Joseph Yiu, The Definitive Guide to ARM® Cortex®-M3 and Cortex®-M4 Processors,3rd Edi-
tion, November 2013.
– ARM Limited, Cortex-M4 Revision r0p0 Technical Reference Manual Revision r0p0, 2009/10

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
Cognitive
CO1 mentary concepts of the architectures of the PO1 35%
(C3)
microcontroller and its components, includ-
ing design goal and various features.
Analyze operational details of the micro-
controller components and apply knowl- Please refer
Cognitive
CO2 edge to develop various complex control sys- PO2 45% to Section 5.
(C4)
tems, firmware for automation, and intelli-
gent machines.
Apply the knowledge obtained to compre-
hend the role of modern embedded systems
Affective
CO3 architecture, including design and its link PO6 20%
(A4)
with the innovation of new machines, to
comprehend the country’s SDG.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

78
 Microcontroller and Embedded System/2nd year 2nd semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to microcontroller and embedded system • Func- T T
tional components, Type of microcontrollers, • the role of
the microcontroller, and embedded system in automation and
control system. • Architecture, bus matrix, and components
features
3-4 Overview of C/C++ programming and development environ- T T
ment • Embedded C/C++ programming, microcontroller pro-
gramming, and debugging.
5-6 Microcontroller Core components and Clock Signal • Em- T T
bebbed microprocessor: an overview of the features of the em-
bedded microprocessor. • clock generation and distribution,
PLL clock generation, • External and internal clock, Prescaller,
and clock configuration.
5-6 General purpose input and output (GPIO): • GPIO, character- T T
istics, types of input-output systems, push-pull, pullup and
pulldown methods, analog, digital, serial input-output. GPIO
modes, speed, alternate functions, purpose, and role. GPIO
interrupt and Interrupt routines. Interrupt I/O.
7-8 Internal flash memory, SRAM, and External Memory • MCU T T
flash memory model, architecture, power management, access
control, memory, and I/O address mapping. MPU and exter-
nal memory.
9-10 Synchronous and Asynchronous communication • Concepts T T
of synchronous and asynchronous communication, MCU com-
ponents for synchronous and asynchronous communication,
Signaling, Clock sharing, synchronous and asynchronous
communication protocol overview, and low-level signaling
techniques.
11-13 Universal synchronous/Asynchronous Receiver and Transmit- T T
ter (USART) • USART clock, GPIO Alternate function, Baud
rate calculation and configuration, transmission and receiving
functional diagram, signaling, input and output buffer, inter-
rupt and overrun, and noise error handling. Frame format,
parity, payload. RS485 communication. Application of UART
and USART.
14-16 Timer and Pulse Width Modulation • MCU timer functions, T R
Basic Timer, General Purpose timer, Advance Timer, Role of
timer. Delay generation. • Concept of PWM, algorithms:
naive, Space Vector Modulation. PWM duty cycle, power de-
livery, dead time, Complement output, and input capture.
One plus generation. Full bridge and half-bridge concept. •
Pattern generation and PWM applications • Drone-based data
collection strategies;
17-18 DMA and I/O • Direct memory access, Application of DMA T T
memory to memory, memory to I/O, and I/O to I/O. Role
of DMA in Serial Communication and PWM. DMA channel,
stream, priority. DMA flow control, DMA error handling.
DMA circular and double buffer modes

79
 Microcontroller and Embedded System/2nd year 2nd semester 2024

19-21 SPI and I2S • SPI protocols, frame format, simplex and du- T T
plex communication, a clock signal, master-slave communica-
tion, multi-master and multi-slave communication, and slave
selection. SPI addressing and configuration of target devices.
Clock phase and polarity, CRC, interrupts, and DMA control.
Low power SPI communication.
22-23 I2C peripherals and protocols • Communication protocol, T T
frame format, data, and control frame, I2C reset, and error
handling. • Communication mode: master transmitter, mas-
ter receiver, slave transmitter, slave receiver, I2C DMA, and
Interrupt handling. SPI ACK and NACK.
24-25 bxCAN and fdCAN – Controller Area Network • CAN proto- T T
col, Types of CAN, Data and control frame format, Mailbox,
CAN filter, CAN bus architecture, Sleep mode, initialization
mode, and Normal mode. CAN DMA and error handling.
CAN application
24-25 ADC and DAC • Analog to digital (ADC/DAC) conversion, T R
sampling rate, quantization, ADC channel selection. Signal
conversion mode, continuous conversation mode. Timing dia-
gram. Data Alignment. ADC/DAC input output handling.
26-28 Display peripherals and GPU • floating point and Vector pro- T R
cessing: Signal pattern analysis, signal processing, review of
FFT and DFT; Display Peripherals and GPU: LCD TFT, LVDS,
RGB protocol, color matrix, MIPI, IPS, and HDMI display in-
terfaces. Touch screen, multi-touch, and input management.

For the definitions of T and R , Please refer to Section 3.

TBA Prof. Dr. Md. Abdur Razzaque

Course Teacher, CSE 2205 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

80
 Microcontroller and Embedded System Lab/2nd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2206

Microcontroller and Embedded System Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 2nd semester 2024
Course Code CSE 2206
Course Title Microcontroller and Embedded System Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 2205 Microcontroller and Embedded System (co-requisite)

2 Syllabus
▲

This lab course aims to provide hands-on knowledge of building modern control, IoT, and robotics sys-
tems based on theory and techniques learned in CSE2205: microcontrollers and embedded systems. The
students are given innovative, practical, commercially viable, industry-friendly projects to enhance their
knowledge and expertise and target future technology industry establishments in Bangladesh. The project
must be demonstrated and presented in four or five phases, with a final showcase of the developed sys-
tem. However, the project must have some compulsory components like clock and RTC configuration,
UART communication, Graphical display design, and one of the following communication for transferring
information between machines/devices such as HTTP(s), TCP, UDP, XMLRPC, MQTT, and Matter proto-
cols. The students do not need to design the protocols but use them; otherwise, they propose a new viable
protocol. Students must develop a backed server process and UI interface on the mobile/web platform
to be visible to authorized users from throughout the globe. However, students can propose any project
connected to the industry that may have commercial value or be commercially viable.

3 Text and Reference Materials

T Textbook:
– STMicroelectronics, STM32F446xx of M7 advanced Arm®-based 32-bit MCUs - Reference man-
ual, RM0390 Rev 6 (M4), STMicroelectronics Online, March 2021.
– STMicroelctronics, Datasheet - STM32F446xC/E - Arm® Cortex®-M4/7 32-bit micocontroller,
DS10693 Rev 10, Jan, 2021
– ARM Limited, Cortex-M4 Revision r0p0 Technical Reference Manual Revision r0p0, 2009/10
R References:
– Joseph Yiu, The Definitive Guide to ARM® Cortex®-M3 and Cortex®-M4 Processors,3rd Edi-
tion, November 2013.
– ARM Limited, Cortex-M4 Revision r0p0 Technical Reference Manual Revision r0p0, 2009/10

81
 Microcontroller and Embedded System Lab/2nd year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Analyze understand the values of the
commercial/industry standard project
Cognitive
CO1 and selection of suitable algorithms and PO1 25%
(C2)
techniques to develop the targeted con-
trol/IoT/Robotic system
Design and solve the target embedded sys-
tem project bare-metal hardware using (µ
vision keil or any other IDE environment) Please refer
Cognitive
CO2 register-based programming. Demonstrate PO2 60% to Section 5.
(C3)
and present the project and submission the
final report and web/mobile-based applica-
tion/product.
Continuous presences in the lab, evaluate Psychomotor
CO3 PO10 15%
the progress of the given project (P5)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 10% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 20% 30%
Total 25% 60% 15% 100%

Course Teacher, CSE 2206 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

82
 Numerical Methods/2nd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 2209 Numerical Methods

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 2nd semester 2024
Course Code CSE 2209
Course Title Numerical Methods
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
ERROR ANALYSIS: Approximations and Round-Off Errors: Accuracy and Precision, Error Definitions,
▲

Round-Off Errors. Truncation Errors and the Taylor Series: The Taylor Series, Error Propagation, Total
Numerical Error, Blunders, Formulation Errors and Data Uncertainty. ROOTS OF EQUATIONS: Brack-
eting Methods: Graphical Methods, Bisection Method, False-Position Method. Open Methods: Simple
Fixed-Point Iteration, Newton-Raphson Method, Secant Method. LINEAR ALGEBRAIC EQUATIONS:
Gauss Elimination: Naive Gauss Elimination, Pitfalls of Elimination Methods, Complex Systems. Nonlin-
ear Systems of Equations, Gauss-Jordan, LU Decomposition and Matrix Inversion, Special Matrices and
Gauss-Seidel. CURVE FITTING: Least-Squares Regression: Linear Regression, Polynomial Regression,
General Linear Least Squares. Interpolation: Newton’s Divided-Difference Interpolating Polynomials,
Lagrange Interpolating Polynomials, Inverse Interpolation Spline Interpolation: Quadratic and Cubic
Spline. NUMERICAL DIFFERENTIATION AND INTEGRATION: Newton-Cotes Integration Formulas:
Trapezoidal Rule, Simpson’s Rules. Integration of Equations: Newton-Cotes Algorithms for Equations,
Gauss Quadrature. Numerical Differentiation: High-Accuracy Differentiation Formulas, Derivatives of
Unequally Spaced Data, Partial Derivatives.

3 Text and Reference Materials

T Textbook:

– Steven C. Chapra and Raymond P. Canale, Numerical Methods for Engineers, 7th Edition, McGraw-
Hill Education, 2015.

R References:

– Online Available Resources,

83
 Numerical Methods/2nd year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 ERROR ANALYSIS: Approximations and Round-Off Errors: T T
Accuracy and Precision, Error Definitions, Round-Off Errors.
3-4 Truncation Errors and the Taylor Series: The Taylor Series, Er- T T
ror Propagation, Total Numerical Error, Blunders, Formula-
tion Errors and Data Uncertainty.
5-7 ROOTS OF EQUATIONS: Bracketing Methods: Graphical T T
Methods, Bisection Method, False-Position Method.
8-9 Open Methods: Simple Fixed-Point Iteration, Newton- T T
Raphson Method, Secant Method.
10-12 LINEAR ALGEBRAIC EQUATIONS: Gauss Elimination: T T
Naive Gauss Elimination, Pitfalls of Elimination Methods,
Complex Systems. Nonlinear Systems of Equations, Gauss-
Jordan,
13-15 LU Decomposition and Matrix Inversion, Special Matrices and T T
Gauss-Seidel.
16-18 CURVE FITTING: Least-Squares Regression: Linear Regres- T R
sion, Polynomial Regression, General Linear Least Squares.
Interpolation: Newton’s Divided-Difference Interpolating
Polynomials, Lagrange Interpolating Polynomials,
19-22 Inverse Interpolation, Spline Interpolation: Quadratic and T T
Cubic Spline.
23-25 NUMERICAL DIFFERENTIATION AND INTEGRATION: T T
Newton-Cotes Integration Formulas: Trapezoidal Rule, Simp-
son’s Rules. Integration of Equations: Newton-Cotes Algo-
rithms for Equations, Gauss Quadrature
27-28 Numerical Differentiation: High-Accuracy Differentiation T R
Formulas, Derivatives of Unequally Spaced Data, Partial
Derivatives.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 2209 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

84
 Software Engineering/CSE 3101: Third Year First Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3101 Software Engineering

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester CSE 3101: Third Year First Semester 2024
Course Code CSE 3101
Course Title Software Engineering
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 3103 Object Oriented Design and Programming (co-requisite)

2 Syllabus
Introduction: Software engineering techniques, software process structure, process model Software de-
▲

velopment practices: agile software development methods such as Extreme Programming (XP) and XP
framework, Agile Modeling (AM), Scrum and Scrum workflow, Adaptive Software development (ASD),
Dynamic Systems Development Method (DSDM), Crystal, feature-driven development (FDD), Incremen-
tal Funding Method (IFM), DevOps, and Site Reliability Engineering (SRE). No-agile approaches Rational
Unified Process (RUP), Open Process Framework (OPF). Process improvement initiatives: Capability Ma-
turity Model (CMM) and Personal Software Process (PSP) Software Requirement Analysis: Requirement
engineering, Eliciting Requirements, Developing Use Cases, requirement analysis, scenario-based use-case
modeling, UML modeling, class-based method, requirement modeling for web and mobile app Software
Design: design concept, architectural design, pattern-based architectural design, component-based de-
sign, user interface design, pattern-based design, Webapp and mobile app design. Quality management:
concepts, software quality, review techniques, software quality assurance, Software testing strategies:
Unit testing, integral testing, Test Strategies for Object-Oriented Software, testing Web and mobile App,
white box and black box testing Security Engineering: Security Engineering Analysis, Security Assurance,
Security Risk Analysis. Formal Modeling and verification: Functional specification, clean room design,
Cleanroom Testing. Software Project Management: concepts, process and project metric, estimation,
scheduling, and risk management.

3 Course Rationale
To provide a comprehensive introduction to software engineering leading to the ability to understand
contemporary terminology, progress, issues, and trends. A thorough introduction to software engineering
techniques, focusing on software process models, agile development. Principle that guides practice, under-
standing requirements, requirements modeling: scenarios, information and analysis classes, Requirements
modeling: Flow, behavior, patterns and web apps, Design concept, pattern-based design, quality manage-
ment, software quality assurance, software testing strategies.

85
 Software Engineering/CSE 3101: Third Year First Semester 2024

4 Text and Reference Materials

T Textbook:

– Roger S. Pressman and Bruce Maxim, Software Engineering: A Practitioner’s Approach, 8th
Edition, McGraw Hill, January, 2014,

R References:

– Ian Sommerville, Software Engineering, 10th Edition Pearson, March 2015)

– Gene Kin, Patrick Debois, John Willis, Jez Humble, and John Allspaw, The DevOps Handbook:
How to Create World-Class Agility, Reliability, and Security in Technology Organizations,
IT Revolution Press, October 2016
– Niall Murphy, Betsy Beyer, Chris Jones, and Jennifer Petoff, Site Reliability Engineering, 1st edi-
tion, O’Reilly Media, May 2016

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply knowledge to software development
life cycle, engineering techniques, and soft- Cognitive
CO1 PO1 20%
ware process modeling and development (C2)
tools.
Analysis and use of agile software require-
ments model, design techniques, testing Cognitive
CO2 PO2 35%
methodologies, use case, class, interaction (C3)
diagram in software development life cycle.
Review and design software testing and ver-
ification tools including software security, cognitive
CO3 PO4 30%
risk assessment, cost estimation, software (C4)
project scheduling, and management.
Compare and contrast different analyses and
design methodologies and develop design Affective
CO4 P10 15%
solutions for complex enterprise software (A4)
engineering projects.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

6 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 10% 20% 20% 10% 60%
Midterm Exam 10% 5% 5% 20%
Class Test/Quiz 5% 5%
Assignment/Presentation 5% 5% 10%
Class Participation 5% 5%
Total 20% 35% 30% 15% 100%

86
 Software Engineering/CSE 3101: Third Year First Semester 2024

7 Topic Outline

Lecture Selected Topic Reading Exercise

1-2 Introduction to Software Engineering • Process structure, pro- T T
cess model, • classical process model, agile model
3-6 Agile software development methods • Extreme framework T T
and programming, • Scrum workflow • Adaptive Software de-
velopment, • Dynamic system development process, • Crys-
tal, feature-driven development (FDD), • Incremental Fund-
ing Method (IFM), DevOps and Site Reliability • Rational uni-
fied process, open process framework
7-8 Human Aspects of Software Engineering • Characteristics of T T
software engineer • psychology of software engineering, •
software team, team structure • Agile team, XP team • Soft-
ware engineering using cloud, collaboration tools • Process
improvement initiative, personal software process
8-11 Software requirement analysis • Requirement engineering, T R
Specification, • Eliciting Requirements, • Developing Use
Cases, requirement analysis, scenario-based use-case model-
ing, • UML modeling and Activity diagram, class diagram, •
requirement modeling for web and mobile apps, requirement
validation
12-17 Software Design • design concept, pattern-based architec- T R
tural design, • data-centric architecture, data-flow architec-
ture, • layered architecture, Architectural context diagram, •
component-based design, user interface design, Swimlane di-
agram, pattern-based design, error handling • Webapp, and
mobile app design.
18-21 Quality management •concepts, software quality, McCall’s T T
software quality factors, review techniques, Defect amplifi-
cation model, Analyzing Metrics, software quality assurance,
Software quality goals, attributes, and metrics
22-24 Software testing strategies: • Unit testing, integral testing, T R
Test Strategies for Object-Oriented Software, • testing Web
and mobile App, white box and black box testing
25-26 Formal Modeling and verification: •Functional specification, T T
• clean room design,cleanroom Testing
27-28 Software Project Management: concepts, process, • project T T
metric, • estimation, scheduling, and risk management

Course Teacher, CSE 3101 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

87
 Software Design and Development Project/3rd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3102

Software Design and Development Project

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 1st semester 2024
Course Code CSE 3102
Course Title Software Design and Development Project
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

Concepts/paradigms/phases of Software Engineering/life cycle; Recurring and Fundamental Principles;

Requirement Analysis/Engineering/Specification; Concepts of Feasibility Analysis and techniques of cost
benefit analysis; Role, Tasks and Attributes of System Analysts ; Software Architectures; Design: Archi-
tectural Design, Module Design, Interfaces and fundamental Principles; User Interface (UI) Design: UI
Design Principles, User Interaction, Information Presentation, User Support, Interface Evaluation; Im-
plementation Issues; Introduction to Software Testing; Quality Assurance; Configuration Management:
Version Management and Tools; Maintenance and Evolution; Project Management: Software process and
project Metrics, Software Project Planning, Risk Analysis and management, Project Scheduling and Track-
ing; Use case model for requirement writing; Elaboration using System Sequence Diagram; UML diagrams;
Interaction and Collaboration Diagram for designing Software; GRASP patterns.
The laboratory will enable students to understand a “design, build and test” exercise to enhance their
skills in product re-engineering and improve their understanding of the project implementation phase. In
addition to the engagement in life-long learning in the broadest context of technological change, students
will be able to gather sustainable experience on individual and teamwork along with project management
and finance.

3 Text and Reference Materials

T Textbook:
– Roger Pressman, Software engineering a practitioner’s approach, 7th Edition, McGraw Hill
Higher Education, 2010.
– Ian Sommerville, Software engineering, 9th Edition, Pearson, 2011.
R References:
– Soren Lauesen, Software requirements styles and techniques, First Edition, Addison-Wesley,
2002.

88
 Software Design and Development Project/3rd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply Engineering Principle to software de-
Cognitive
CO1 velopment and use UML notation to repre- PO1 30%
(C2)
sent project model.
Analyze a problem for feasibility study, get
Please refer
the business requirement, design, imple- Cognitive
CO2 PO2 30% to Section 5.
ment and test for checking that the business (C3)
requirements are met.
Write reports for requirement, design and
testing of the proposed solution following Psychomotor
CO3 PO10 30%
the given formats and demonstrate the so- (P3)
lution
Exhibit the leadership skills to work in a
Psychomotor
CO4 group and as an individual member through PO9 10%
(P6)
the project

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Class Participation 10% 10%
Continuous Lab Performance 10% 10% 20%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 10% 40%
Total 30% 30% 30% 10% 100%

Course Teacher, CSE 3102 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

89
 Web Engineering and Technology/3rd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3103

Web Engineering and Technology

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 1st semester 2024
Course Code CSE 3103
Course Title Web Engineering and Technology
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 1201 Structured Programming

2 Syllabus
▲

Introduction to Web Engineering: Functional components of the Internet and World Wide Web archi-
tecture, backend, User Interface (UI), RESTfull web architecture: Uniform Interface, Stateless, Cacheable,
Client-Server Overview of internet protocol: HTTP, HTTPS, FTP, SMTP, POP, IMAP, SOAP, HTML/XML
Standard: W3C XML/HTML document format, logical architecture, physical architecture, Header, body
and footer, data handling, Validity; Architecture/Framework: Presentation layer, business layer, database
presentation layer, database/ persistent storage; Example Architecture: Hexagonal Architecture, life cy-
cle, UI, input and output port, REST adapter, use case and application business logic, domain/business
logic, entity database adapter, database/persistence storage. Overview of clear and onion architecture;
UI Design examples: React model, Typescript, javascript, AngularJs, CSS; Mobile Application Model:
overview of MVVM Model and Hexagonal architecture, Model, View, View Model, Data binding; Mobile
Application development plateform: Swift, Cotlin, and Flutter; Case study web platform: Apache, ng-
inx, NodeJs, Django; Web application Security: TLS, PCI data security, Firewall, MITM, DoS, DDoS attack,
poisoning attack.

3 Text and Reference Materials

T Textbook:

– Davi Vieira, Designing Hexagonal Architecture with Java: An architect’s guide to building
maintainable and change-tolerant applications with Java and Quarkus, 8st Edition, Packt
Publishing, January 7, 2022.
– Leslie Sikos, Web Standards: Mastering HTML5, CSS3, and XML, 2nd Edition, Apress;,December,
2014
– Mike Amundsen, RESTful Web API Patterns and Practices Cookbook: Connecting and Or-
chestrating Microservices and Distributed Data, O’Reilly Media, 1st Edition, November, 2022

90
 Web Engineering and Technology/3rd year 1st semester 2024

– Jeff McWherter & Scott Gowell, Professional Mobile Application Development, 1st Edition,
Wrox publisher, August, 2012

R References:

– Doguhan Uluca, Angular for Enterprise Applications - Third Edition: Build scalable Angu-
lar apps using the minimalist Router-first architecture , 3rd ed. Edition, Packt Publishing,
January, 2024.
– John A Estrella & Rossetta Sornabala,Agile Project Management for Mobile Application Devel-
opment, Agilitek Corporation, February 28, 2017
– Andrew Hoffman, Web Application Security: Exploitation and Countermeasures for Modern
Web Applications, 1st Edition, O’Reilly Media, April, 2020
– Carl Rippon,Learn React with TypeScript - A beginner’s guide to reactive web development
with React 18 and TypeScript, Packt Publishing, Second Edition, March 2023
– Christos Karayiannis & Andrew Swartzbaugh, Linux Web Server Development: A Step-by-
Step Guide for Ubuntu, Fedora, and other Linux Distributions, CreateSpace Independent
Publishing Platform, June, 2015
– Dušan Stojanović,Modern Web Development with Go: Build real-world, fast, efficient and
scalable web server apps using Go programming language, Orange Education Pvt Ltd, March,
2023
– Kevin Hoffman, Programming WebAssembly with Rust: Unified Development for Web, Mo-
bile, and Embedded Applications, 1st Edition, Pragmatic Bookshelf, March, 2019 by

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
mentary concepts of various architectures, Cognitive
CO1 PO1 35%
applications, protocols, and backend appli- (C3)
cation models for Web application design-
related problems.
Analyze operational details of various Web
Architecture, UI Design, Business logic, Do-
main Model, Persistence Storage, Use case,
Please refer
REST Adapter, and Interaction between Cognitive
CO2 PO2 45% to Section 5.
layers to apply the specialist engineering (C4)
knowledge to solve the complex web en-
gineering infrastructure development prob-
lem.
Establish a reliable protocol while planning
and designing web and mobile application
Affective
CO3 infrastructure to address web engineering- PO6 20%
(A4)
related problems and issues that ensure user
acceptance, testing, and quality assurance.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

91
 Web Engineering and Technology/3rd year 1st semester 2024

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Web Engineering • Functional Component, T T
Internet and World Wide Web architecture, protocols, back-
end, RESTful web architecture, Uniform Interface, Cacheable,
and Client-Server architecture

3-4 Overview of Web and Internet Protocols • TCP, UDP, HTTP, T T

HTTPS, FTP, SMTP, SOAP
5-6 Overview Web Framework Architecture: • Layered approach T T
• Presentation, business, data presentation, and database per-
sistence layer.
8-14 Hexagonal Architecture and Web development life cycle • UI T T
design and concepts, Input and output port, REST adapter,
use case, application business logic, domain business logic,
database application logic, database and persistence storage.
15-16 Overview Clear and Onion Architecture • Components, layer T R
model, domain services, application services, infrastructure,
and observability services.
17-20 UI design and UI models • React Model, Typescript, javascript, T R
Angularjs, CCS
21-23 MVVM and mobile application design • Understanding T R
MVVM and hexagonal model, View, View Model, Data Bind-
ing
23-24 Mobile Application Development Platform • Swift, Cotlin, T T
and Flutter
25-26 Web application Server Platform • Apache, nginx, NodeJs, T R
Django and so on, log management
27-28 Web Application Security • TLS, Certified Authority, PCI data T T
security, firewall, MITM, Fishing attack, Web poisoning, DoS,
DDoS attack.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3103 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

92
 Algorithm Engineering/3rd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3105 Algorithm Engineering

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 1st semester 2024
Course Code CSE 3105
Course Title Algorithm Engineering
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 2203 Design and Analysis of Algorithms

2 Syllabus
NP Completeness: Detailed exploration of P, NP, NP-hard, NP-complete, Co-NP, and PSPACE, with focus
on polynomial time verification, NP-completeness and Reducibility, proving NP-completeness, examples
▲

of NP-complete problems, the Satisfiability Problem and Cook’s Theorem. Exact Exponential Algorithms
and Approximation or Non-Exact Algorithms: Coverage includes Dynamic Programming for the Trav-
eling Salesman Problem (TSP), a branching algorithm for the Independent Set Problem, parameterized
algorithms for the Vertex Cover Problem, and discussions on undecidability and the Halting problem.
Also included are a 2-approximation algorithm for vertex cover, PTAS and FPTAS for the knapsack prob-
lem, and a look at various problems such as the vertex-cover problem, the traveling salesman problem, the
Hamiltonian Cycle problem, the set-covering problem, Maximum Cut, Steiner Tree Problem, and Job shop
scheduling. Heuristic and Metaheuristic: This segment offers an overview of Heuristics and Metaheuris-
tics, fundamentals of Simulated Annealing, temperature schedule and cooling strategies, acceptance prob-
abilities in Simulated Annealing, applications of Simulated Annealing, and discusses the performance and
limitations of Metaheuristics, including trade-offs and case studies. Computational Geometry: Focuses
on basics and applications, Convex Hull, Graham Scan Algorithm, Quick Hull Algorithm, parallelized
versions of Convex Hull algorithm, Voronoi Diagram, and Fortune’s Algorithm (Sweep Line Algorithm).
String Matching: This part of the course covers the naive string matching algorithm, the Rabin-Karp
algorithm, string matching with finite automata, Knuth-Morris-Pratt algorithm, and Suffix Arrays. Back-
tracking: Topics include basics and applications, Graph coloring, n-Queen, understanding the concept of
branch and bound in backtracking, and the impact of pruning techniques on improving the performance
of backtracking. Online Algorithms: Basics and applications, Ski-Rental Problem, K-Server Problem,
Linear-List Search Problem, Waiting for an Elevator, Online Caching, distinguishing online and anytime
algorithms, and ways of proving anytime property of an algorithm. Linear Programming: Basics and
applications, formulating problems as linear programs, and duality.

3 Text and Reference Materials

T Textbook:
– Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C., Introduction to Algorithms, 4th Edition,
MIT Press, 2022.

93
 Algorithm Engineering/3rd year 1st semester 2024

4 Course Outcomes

Assessment
CO CO Description PO Domain (LoBT) Weight
Methods
Compare the time and space
Cognitive (C4), Af-
CO1 complexities of computational PO1,P02 25%
fective(A1, A2)
problems.
Design feasible and useful al-
gorithms (such as fast, ex-
act algorithms, approximation Please refer
Cognitive (C6), Af-
CO2 algorithms, randomized algo- PO3 50% to Section 5
fective(A1, A2)
rithms, heuristics, and meta-
heuristics) for computationally
hard optimization problems.
Analyze performance parame- Affective (c4), Af-
CO3 PO4 25%
ters and their trade-off. fective(A1, A2)

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 15% 30% 15% 60%
Midterm Exam 5% 10% 5% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 25% 50% 25% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-3 NP Completeness: Detailed exploration of P, NP, NP-hard, T T
NP-complete, Co-NP, and PSPACE, Polynomial time ver-
ification, NP-completeness and Reducibility, Proving NP-
completeness, Examples of NP-complete problems, Satisfiabil-
ity Problem and Cook’s Theorem

94
 Algorithm Engineering/3rd year 1st semester 2024

4-8 Exact Exponential Algorithms and Approximation/Non- T T

Exact Algorithms: Dynamic Programming for Traveling
Salesman Problem (TSP), Branching algorithm for Inde-
pendent Set Problem, Parameterized Algorithms for Vertex
Cover Problem, Undecidability and the Halting problem, 2-
approximation algorithm for vertex cover, PTAS and FPTAS
for knapsack, Independent set problems in planar graphs, The
vertex-cover problem, The traveling salesman problem, The
Hamiltonian Cycle problem, The set-covering problem, Maxi-
mum Cut, Steiner Tree Problem, Job shop scheduling
9-12 Heuristic and Metaheuristic: Overview of Heuristics and T T
Metaheuristics, Fundamentals of Simulated Annealing, Tem-
perature Schedule and Cooling Strategies, Acceptance Prob-
abilities in Simulated Annealing, Applications of Simulated
Annealing, Performance and Limitations of Metaheuristics,
Trade-offs and Case Studies
13-15 Computational Geometry: Basics and Applications, Convex T T
Hull - Graham Scan Algorithm, Quick Hull Algorithm, Paral-
lelized versions of Convex Hull algorithm, Voronoi Diagram -
Fortune’s Algorithm (Sweep Line Algorithm), Divide and Con-
quer
16-18 String Matching: The naive string matching algorithm, The T T
Rabin-Karp algorithm, String matching with finite automata,
Knuth-Morris-Pratt algorithm, Suffix Arrays
19-20 Backtracking: Basics and applications, Graph coloring, n- T T
Queen, Understanding the concept of branch and bound in
backtracking, Impact of pruning techniques on improving the
performance of backtracking
21-24 Online Algorithms: Basics and applications, Ski-Rental Prob- T T
lem, K-Server Problem, Linear-List Search Problem, Waiting
for an Elevator, Online Caching, Distinguishing Online and
Anytime Algorithms, Ways of Proving Anytime Property of
an Algorithm
25-26 Linear Programming: Basics and applications, Formulating T T
problems as linear programs, Duality

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 3105 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

95
 Operating System/3rd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3109 Operating System

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 1st semester 2024
Course Code CSE 3109
Course Title Operating System
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 2205: Microcontroller and Embedded System

2 Syllabus
Introduction: Operating system overview, types of operating system, computer system structure, struc-
▲

ture and components of an operating system, and introduction to RTOS: DUOS. System calls: class of
system calls and description, ARM system call (SVC). Process and threads: process and thread model,
process and thread creation (TCB) and termination, user and kernel level thread, scheduling, schedul-
ing algorithms, dispatcher, context switch, real-time scheduling, ARM SysTick, PendSV, Process Stack.
Concurrency and synchronization: IPC and inter-thread communication, critical region, critical section
problems and solutions, ARM semaphore, and Exclusive Access. Resource management: introduction
to deadlock, ostrich algorithm, deadlock detection and recovery, deadlock avoidance, deadlock preven-
tion, starvation. Memory management: basic memory management, fixed and dynamic partition, virtual
memory, segmentation, paging and swapping, MMU, ARM MPU. Virtual memory management: paging,
page table structure, page replacement, TLB, exception vector, demand paging, segmentation, thrashing,
and performance. File management: File Naming and structure, file access and attributes, system calls,
file organization: OS and user perspective view of the file, memory mapped file, file directories organi-
zation. File System Implementation: implementing file, allocation strategy, allocation method, directory
implementation, UNIX inode, block management, quota, and example and case study file system. I/O
management: I/O Devices, I/O Bus architecture, controller, interrupts, DMA, programmed I/O, ARM In-
terrupt and DMA. Disk I/O management: structure, performance, low-level disk formatting, Disk-Arm
scheduling algorithm, error handling, SSD, and stable storage. Operating System Security: Concept of
Computer Virus, Malware, Trojan Horse, DoS, Access control: Authentication and Authorization. Case
study: Linux variant, windows, embedded and HPC OS

3 Text and Reference Materials

T Textbook:

– Andrew S. Tanenbaum, Modern Operating System, Pearson, Fourth Edition, March, 2014.
– Joseph Yiu, The Definitive Guide to ARM® Cortex®-M3 and Cortex®-M4 Processors,3rd Edi-
tion, November 2013.

96
 Operating System/3rd year 1st semester 2024

R References:

– Silberschatz and P.B. Galvin, Operating System Concepts, Addison Wesley.

– William Stallings, Operating Systems: Internals and Design Principles, Pearson, 8th edition
(February 2, 2014).
– A. Tannenbaum, A. Woodhull, Operating Systems – Design and Implementation, Pearson, 3rd
edition, Jan 2006.
– John O’Gorman, Operating Systems, MacMillan.
– Uresh Vahalla, UNIX Internals: The New Frontiers, Prentice Hall, 1996.
– McKusick et al., The Design and Implementation of the 4.4 BSD Operating System, Addison
Wesley, 1996.
– Lectures in various social media.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply knowledge to visualization, under-
stand design trade-offs and decisions and
their dependence on the target environment,
Cognitive
CO1 esteem the distinction between mechanisms PO1 35%
(C3)
and policies, be exposed to low-level system
code, and understand current operating sys-
tems research and development trends.
Analyzing design methodologies of oper-
ating kernel systems calls the links be-
tween hardware and kernel and interac-
tion between process, threads, and pro- Please refer
Cognitive
CO2 cess scheduling, including handling concur- PO2 45% to Section 5.
(C4)
rency control and deadlock. Investigating
techniques for physical and virtual mem-
ory management, online file systems, stor-
age management, and methodologies
Apply the knowledge obtained to compre-
hend the role of modern operating systems
architecture on embedded systems, desk- Affective
CO3 PO6 20%
tops, and server systems, including the de- (A4)
sign and role of the OS system ingredients
from the cybersecurity facet.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%

97
 Operating System/3rd year 1st semester 2024

Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Operating Systems and Computer Hardware • T T
types of the operating system, architecture, components, com-
puter basic resources, and memory. Operating system exam-
ples.
3-5 ARM Cortex-4/7 processor architecture review and System T T
call • ARM Cortex processor available facilities to design oper-
ation system kernel system call, algorithm for invoking system
call and returns.
6-7 Process and Thread • Process and thread architecture • pro- T T
cess and thread creation, termination and process control
block • variable and code memory mapping
8-9 Process and thread scheduling • Design of process schedul- T T
ing algorithm and examples and performance evaluation, •
Role of SysTick (system timer) and PendSV (pending excep-
tion) services for process scheduling, • process stackframe •
realtime scheduling.
10-11 Concurrency and Synchronization • System resources and T T
inter-process communication • concurrent and synchroniza-
tion algorithms their correctness, • review interrupt, test-and-
set, semaphore, mutex, lock of ARM processor.
12-13 Resource management – Deadlock handling, • Cause of dead- T T
lock, • deadlock prevention prevention, avoidance and detec-
tion algorithms • Recovery from deadlock, • process starva-
tion and best effort solution
14-16 Memory management, • fixed, dynamic partition memory al- T T
location • paging and swapping, • virtual memory manage-
ment: TLB, demand paging, demand segmentation, trashing
and performance. • page replacement algorithms • Aceess vi-
olation and considering ARM MPU, • Demand paging design
considerations
17-18 File system management • File naming, data structure, access T T
and attributes • OS file system call • directory and file organi-
zation, memory mapped file
19-20 File system implementation • File allocation methods, • Unix T T
inode concepts, block mana gement, • file access, quotas, •
journaling ext4, xfs file system case study.
21-22 I/O management • Types of I/O devices, I/O bus controller, T T
• interrupt, poling and DMA for I/O data communication. •
Review ARM interrupt and DMA Problem-solving practices,
23-24 Disk I/O management • Disk structure, format and disk arm T T
scheduling, • error handling • SSD and state disk manage-
ment • Stable storage: RAIDx

98
 Operating System/3rd year 1st semester 2024

25-26 Operating system Security: • Concept and taxonomy of com- T T

puter Virus, malware, trojan horse, DoS attack. • Access con-
trol: authentication and authorization
27-28 Case study • Linux variant, Microsoft Windows, MacOS, IOS, R R
Android OS, RTOS and embedded system OS

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3109 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

99
 Operating System Lab/3rd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3110 Operating System Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 1st semester 2024
Course Code CSE 3110
Course Title Operating System Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course Assembly language, C Programming, Data Structure, Microcontroller

2 Syllabus
The Operating System lab intends to provide students hands-on experience developing operating system
components on a bare metal hardware platform under DUOS (developed by CSE, DU). The students must
▲

demonstrate sufficient knowledge of GNU C/C++, GCC Makefile, Linkers, ARM assembly language, data
structure, and algorithms, as demonstrated in the operating system theory courses. The lab intended to
design and implement the various components and concepts acquired in the CSE3109 operating system
theory courses. The students will given five to six complex lab assignments on the OS system call (using
SVC exception) design and implementation on ARM Cortex-4/7 processors, process creation and exe-
cution, process scheduling (process single/multilevel queue), synchronization, and concurrency control
using ARM Test-And-Set, semaphore, and lock, assignment on deadlock algorithm implementation, pro-
cess stackframe handling. Next, students will develop dynamic memory allocation from the heap and free
heap memory, device driver, and double/Single buffer I/O management (character, block I/O, wifi, sen-
sors, GPS, GSM, etc.). Next, the students will implement a file system on microSD memory and graphical
I/O assignment using a multi-touch TFT LCD Touchscreen display with multi-touch, including neoGPU.

3 Text and Reference Materials

T Textbook:
– ARM Limited, Cortex-M4 Revision r0p0 Technical Reference Manual Revision r0p0, 2009/10
– Joseph Yiu, The Definitive Guide to ARM® Cortex®-M3 and Cortex®-M4 Processors,3rd Edi-
tion
– STMicroelectronics, PM0214 Programming manual, Rev. Doc ID 022708 Rev 3, Sept, 2013
R References:
– Andrew S. Tanenbaum, Modern Operating System, Pearson, Fourth Edition, March, 2014.
– STMicroelectronics, STM32F446xx of M7 advanced Arm®-based 32-bit MCUs - Reference man-
ual, RM0390 Rev 6 (M4), STMicroelectronics Online, March 2021.
– STMicroelctronics, Datasheet - STM32F446xC/E - Arm® Cortex®-M4/7 32-bit micocontroller,
DS10693 Rev 10, Jan, 2021

100
 Operating System Lab/3rd year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Analyze understand the assignment prob-
Cognitive
CO1 lem and selection of suitable algorithms and PO2 25%
(C2)
techniques to solve the given problem
Design and solve the given operation system
Please refer
assignment problem on bare-metal hard- Cognitive
CO2 PO3 60% to Section 5.
ware with minimal DUOS implementation. (C3)
Demonstrate and present the solution.
Continuous presences in the lab, evaluate Psychomotor
CO3 PO9 15%
the progress of the given assignment (P5)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 10% 5% 5% 20%
Viva, Lab Presentation and Demonstration 10% 50% 60%
Lab Reports 5% 5% 10%
Total 25% 60% 15% 100%

6 Lab Activity Outline

Assignment
Experiment Title CO Activities
No
1 *Design and implement DUOS, Makefile, Linker, boot process CO1 Coding and Demon-
and basic I/O driver stration
2 *Design and Implementation of System call (ARM SVCall) CO2 Coding and presen-
mechanism and separation kernel and userspace tation and demon-
stration
3 *Process and Thread creation (fork, exec services, etc.), CO2 Coding, presentation
cloning, stack memory assignment, and heap memory alloca- and demonstration
tion and management implementation.
4 *Design and deployment of Scheduling Queue (Single and CO2 Coding, presenta-
multi-level), scheduling algorithms: time sharing, FCFS, and tion, demonstration,
priority and their performance comparison. and Report Writing
5 Process synchronization and concurrency control CO2 Coding and demon-
stration
6 Deadlock creation and implementation of deadlock detec- CO2 Coding, presentation
tion/avoidance and recovery algorithms and demonstration

101
 Operating System Lab/3rd year 1st semester 2024

7 Implement demand paging and page replacement algorithm CO2 Coding, presentation
and demonstration
8 Designing inode and simple file system implementation CO2 Coding, presentation
and demonstration
9 *Designing and implementing various device drivers and I/O CO2 Coding, presentation
buffer and demonstration
10 Security IDS signature management and scanning for finding CO2 Coding, presentation
affected resources. and demonstration
11 Final Report, including selected lab assignments from the CO3 Online report sub-
above list (compulsory). mission

* Compulsory

Course Teacher, CSE 3110 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

102
 Computer Network/3rd year 2nd semester 2023

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3201 Computer Network

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2023
Course Code CSE 3201
Course Title Computer Network
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 2109 - Data and Telecommunication

2 Syllabus
Introduction to Computer Networks: Functional components of the Internet, Protocol layers, Protocol
▲

standards, Network Performance metrics (delay, loss, throughput, jitter, etc.), Packet switching principles.
Application Layer: Network application architecture, Client-server, and peer-to-peer models, Design
details of HTTP protocol versions 1.1 through 3.0, FTP, SMTP, IMAP, DNS; Proxy and Web caching, P2P
file distribution, HTTP stream and DASH protocols, Content Delivery Networks (CDNs). Transport Layer:
Protocol overview of UDP and TCP, Multiplexing and Demultiplexing, Internet Checksum; Reliable Data
Transfer, Flow Control, Congestion Control - AIMD, Slowstart, Congestion Avoidance, Fast Retransmis-
sion and Fast Recovery techniques; TCP Tahoe, TCP Reno, TCP New Reno, TCP CUBIC; Throughput and
Fairness performances of TCP protocol versions. Network Layer: Forwarding and Routing functions at the
Data plane and Control plane, Functional components of a router; Overview of IPv4 and IPv6, IP Address-
ing, subnetting and supernetting, NAT, DHCP, Generalized forwarding in Software Defined Networking
(SDN), and Middleboxes; Link State (LS) and Distance Vector (DV) Routing Algorithms, Autonomous Sys-
tems, and their categories, OSPF, IGRP, and EIGRP, and BGP; Software Defined Networking - OpenFlow
Protocol and SDN controller functionalities - ODL and ONOS controller designs. Wireless Networks In-
troduction to wireless networks, Types of wireless networks, Medium Access Control in Wireless Networks,
Routing in Wireless Networks, Mobility and Mobile IPv6.

3 Text and Reference Materials

T Textbook:

– J. F. Kurose and K. W. Ross, Computer Networking: A Top Down Approach, 8th Edition, Pearson
Publications, 2020.

R References:

– Andrew Tanenbaum & David Wetherall, Computer Networks, Fifth Edition, Pearson, 2010.

103
 Computer Network/3rd year 2nd semester 2023

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
mentary concepts of various architectures, Cognitive
CO1 PO1 40%
applications, protocols, and background (C3)
processes dealing with networking architec-
ture and protocol design related problems.
Analyze operational details of various pro-
tocols, related to application, transport, and
Please refer
routing layers to apply the specialist engi- Cognitive
CO2 PO2 50% to Section 5.
neering knowledge to solve the complex net- (C4)
working infrastructure development prob-
lem.
Establish a reliable protocol while planning
and designing network services infrastruc-
ture, to address networking-related prob- Affective
CO3 PO6 10%
lems and issues that ensure user Quality (A4)
of Service (QoS) and Quality of Experience
(QoE).

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • What’s the Internet? What’s a protocol? Net-
work edge, network core; Access net, physical media;
3-4 Internet/ISP structure; • Performance: traffic intensity, loss, T T
delay ; Protocol layers, service models • network modeling
and fundamentals of network security

104
 Computer Network/3rd year 2nd semester 2023

5-7 Principles of network applications: app architectures and app T T

requirements; • Client-Server and Peer-to-Peer Applications,
Socket • Web and HTTP Protocols - version 1.1, 2.1, 2.2, 3.0,
• Web Caching, Cookies • File Transfer Protocol (FTP) and
Electronic Mail: SMTP, POP3, IMAP
8-10 Domain Name System (DNS): Architecture, database, opera- T T
tional records and DNS caches • P2P file sharing protocols,
Socket programming with TCP and UDP, Content Distribu-
tion Networks (CDNs), and HTTP streaming and DASH Pro-
tocols
11-14 Transport layer services • Multiplexing and demultiplexing; • T T
Connectionless transport: UDP, and Principles of reliable data
transfer, Connection oriented transport TCP ): segment struc-
ture, Principles of UDP Communications, UDP Checksum and
Internet Checksum
15-17 Principles of flow control, connection management Principles T T
of congestion control • TCP congestion control Algorithms:
TCP Tahoe, TCP Reno, TCP New Reno, TCP CUBIC • Evolu-
tion of Transport layer functionality Problem solving on prac-
tical problems related to Application and Transport layer pro-
tocols
18-21 Introduction to Network Data plane functionalities: Forward- T R
ing, Connection setup; Virtual circuit and datagram networks;
What’s inside a router? Organization and functionalities of a
router. • IP: Internet Protocol Datagram format, IPv4 address-
ing CIDR, sub and super netting • DHCP, NAT, and ICMP pro-
tocols •IPv6 header format, changes compared to IPv4, Tran-
sition from IPv4 to IPv6, Tunneling, Security, etc
22-25 Network Control Plane Functionalities: Routing algorithms - T T
Link state Routing, Distance Vector Routing and Hierarchi-
cal routing Algorithms • Routing in the Internet Autonomous
Systems, OSPF, and BGP fundamentals: iBGP and eBGP •
Generalized Forwarding and Software Defined Networking,
SDN Control plane, Open Flow Protocol, Interaction between
data and control planes of SDN - ODL and ONOS controllers.
26-27 Introduction to Wireless and Mobile Networks • Elements of T T
a wireless network; Wireless Link standards and their char-
acteristics; CDMA; Noise, interference and hidden terminal
problems • IEEE 802.11a/b/g systems; IEEE 802.11 MAC Pro-
tocol CSMA/CA; CSMA/CA with RTS/CTS; Cellular network
architecture 4G, 5G, and beyond systems.
28 Reviews, Future Internet and its Challenges • Problem solving T R
practices, • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3201 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

105
 Computer Network Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3202 Computer Network Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3202
Course Title Computer Network Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
The Computer Network lab is designed to provide students with hands-on experience in the design and
▲

development of various network application architectures and operational insights of network protocols
at different layers. The students will analyze the performances of HTTP, DNS, SMTP. P2P, TCP Tahoe,
TCP Reno, TCP CUBIC, and DASH protocols in terms of network throughput, fairness, delay, jitter, loss,
and user quality of experience metrics for a given network scenario. Through implementation and deeper
analysis of data traffic, the students will be able to identify suitable network design components and com-
munication protocols applicable for meeting user service demands.

3 Text and Reference Materials

T Textbook:

– J. F. Kurose and K. W. Ross, Computer Networking: A Top Down Approach, 8th Edition, Pearson
Publications, 2020.

R References:

– Andrew Tanenbaum & David Wetherall, Computer Networks, Fifth Edition, Pearson, 2010.

106
 Computer Network Lab/3rd year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Analyze performances of the application
layer and transport layer protocols in terms Cognitive
CO1 PO2 25%
of throughput, delay, jitter, loss, and user (C2)
quality of experience of a given network.
Evaluate the effectiveness of a network de- Please refer
Cognitive
CO2 sign topology using a given routing protocol PO3 30% to Section 5.
(C3)
and data protection algorithm.
Communicate effectively the data-analysis-
driven choice of an application framework,
network protocol, and a security algorithm Psychomotor
CO3 PO10 45%
for addressing real-life complex network en- (P5)
gineering problems both in written and oral
forms.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 5% 5% 5% 15%
Lab Reports 5% 5% 10%
Lab Presentation and Demonstration 30% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

Course Teacher, CSE 3202 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

107
 Artificial Intelligence/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3203 Artificial Intelligence

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3203
Course Title Artificial Intelligence
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 2203: Design and Analysis of Algorithms

2 Syllabus
Basics of Artificial Intelligence: Foundation and Brief history of Artificial Intelligence (AI), Turing test,
▲

Total Turing test, Applications of AI. Intelligent Agents: Agents and its variants, concept of rationality,
Performance measure, task environment, Agent program types, Representation of agent programs and
their impact. Problem solving in AI through searching: Problem formulation, Uninformed search strate-
gies: BFS, DFS, UCS, DLS, IDS, Bidirectional search, applicability and performance measure, Informed
search strategies: Greedy Best First Search, A* search, Weighted A*, Heuristic information, Heuristic
function and admissibility. Population-based Nature inspired Optimization Algorithms: Genetic Al-
gorithms, Swarm intelligence: Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Sim-
ulated Annealing Adversarial Search: Search in a competitive environment, Basics of Game theory and
Mechanism design, Dominant strategy, Equilibrium, Nash Equilibrium, Optimal decision in games, Mini-
Max Algorithm, Alpha-Beta Pruning, Monte Carlo Tree Search (MCTS). Constraint Satisfaction Problem:
Constraint graph, constraint optimization problems, Inference in CSP, Enforcing consistency, Backtracking
search and its extensions for solving CSP, Local search for CSPs: Min-conflict heuristic. Knowledge-based
agents and Logic in AI: History of Logic within the context of AI, Propositional logic, First order predicate
logic, Normal Forms – Disjunction and Conjunction Normal Forms, Logical inference: Resolution, Higher
order logic. Expert Systems: Basics and variants of expert systems, Rule-based expert systems, inference
techniques, Fuzzy expert systems, Degree of Membership and Fuzzy inference. Utility based Agents and
Decision Theory: Decision theoretic agent, utility theory, Bayesian Reasoning, Bayesian Network, Influ-
ence/Decision diagram, Markov property, Markov Decision Process, Bellman Equation, MDPs impact on
model-free and Model-based settings, Value iteration algorithm, Policy iteration algorithm and Q-learning
algorithm, Hidden Markov Model: Evaluation problem, Decoding problem, learning problem and their
solution methods (forward algorithm, Viterbi algorithm, The Baum-Welch Algorithm, etc.) Artificial Neu-
ral Networks: Perceptron, Hebbian Learning, Linear and non-linear separability, Multi-layer perceptron,
Forward Propagation, Backpropagation and its variations. Ethics in AI: Bias and Fairness, Privacy and
Security, Explainability, Transparency, etc.

3 Text and Reference Materials

T Textbook:

108
 Artificial Intelligence/3rd year 2nd semester 2024

– S. Russell and P. Norvig , Artificial Intelligence: A Modern Approach, 4th Edition, Prentice
Hall, 2020.

4 Course Outcomes

CO CO Description PO Domain Weight Assessment Methods

CO1 Understand and describe founda- PO1 Cognitive (C2) 25%
tional concepts and history of Arti-
Please refer to Section 5
ficial Intelligence, including Turing
tests and various AI applications.
CO2 Apply problem-solving techniques PO3 Cognitive (C3) 23%
in AI using search strategies and
understand the design and analysis
of intelligent agents.
CO3 Learn, implement, and analyze var- PO4 Cognitive (C4) 25%
ious optimization techniques, ex-
pert systems, decision-making al-
gorithms such as Markov Decision
Processes, and learning algorithms
including Neural Networks.
CO4 Evaluate the ethical implications in PO12 Cognitive (C5) 27%
AI practices, focusing on bias, fair-
ness, and transparency, and explore
advanced topics like neural net-
works and decision-making pro-
cesses in AI.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 15% 15% 15% 15% 60%
Midterm Exam 5% 5% 5% 5% 20%
Class Test/Quiz 5% 3% 2% 0% 10%
Assignment/Presentation 0% 0% 0% 5% 5%
Class Participation 0% 0% 3% 2% 5%
Total 25% 23% 25% 27% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1 Basics of Artificial Intelligence: Foundation and Brief his- T T
tory of Artificial Intelligence (AI), Turing test, Total Turing
test, Applications of AI

109
 Artificial Intelligence/3rd year 2nd semester 2024

2-3 Intelligent Agents: Agents, concept of rationality, Perfor- T T

mance measure, Environment, Actuators and Sensors, Proper-
ties of task environment: observability, determinism, episodic
vs sequential, static vs dynamic, discrete vs continuous, coop-
erative vs competitive, single agent vs multi-agent, Agent pro-
gram types: Simple reflex agents, Model-based reflex agents,
Goal-based agents, Utility-based agents, Learning agents,
Representation of agent programs and their impact: Atomic,
Factored, Structured
4-6 Problem Solving in AI through Searching: Problem formula- T T
tion, level of abstraction, Uninformed search strategies: BFS,
DFS, UCS, DLS, IDS, Bidirectional search, applicability and
performance measure, Informed search strategies: Greedy
Best First Search, A* search, Weighted A*, Heuristic informa-
tion, Heuristic function and admissibility
7-9 Population-based Nature Inspired Optimization Algo- T T
rithms: Genetic Algorithms, Swarm intelligence: Ant Colony
Optimization (ACO), Particle Swarm Optimization (PSO),
Simulated Annealing
10-11 Adversarial Search: Search in a competitive environment, T T
Basics of Game theory and Mechanism design, Dominant
strategy, Equilibrium, Nash Equilibrium, Optimal decision in
games - problem formulation, MiniMax Algorithm, Alpha-
Beta Pruning, Monte Carlo Tree Search (MCTS)
11-13 Constraint Satisfaction Problem: Problem formulation, Con- T T
straint graph, Real world applications, Discrete and continu-
ous domain, Varieties of constraints: Unary, Binary, Higher or-
der, Global constraints, Impact of hard and soft constraints,
constraint optimization problems, Constraint Propagation:
inference in CSP, Enforcing consistency: Node, Arc, path and
k-consistency, AC-3 algorithm, Backtracking search and its ex-
tensions for solving CSP, Local search for CSPs: Min-conflict
heuristic
14-15 Knowledge-based Agents and Logic in AI: History of Logic T T
within the context of AI, Propositional logic, First order pred-
icate logic, Normal Forms – Disjunction and Conjunction Nor-
mal Forms, Conversion to Conjunctive Normal Forms, Logical
inference: Resolution, Higher order logic
16-17 Expert Systems: Basics and variants of expert systems, Rule- T T
based expert systems, forward chaining and backward chain-
ing inference techniques, Fuzzy expert systems, Degree of
Membership and Fuzzy inference
18-24 Utility based Agents and Decision Theory: Decision theo- T T
retic agent, utility theory - marginal utility, expected util-
ity, value of information, maximum expected utility, Bayesian
Reasoning, Bayesian Network, Influence/Decision diagram,
Markov property, Markov Decision Process, Bellman Equa-
tion, Basics of Reinforcement Learning, MDPs impact on
model-free and Model-based Reinforcement Learning, Value
iteration algorithm, Policy iteration algorithm, Q-learning al-
gorithm, Hidden Markov Model: Evaluation problem, Decod-
ing problem, learning problem, Viterbi algorithm, Online be-
lief update, forward algorithm
25-27 Artificial Neural Networks: Perceptron, Hebbian Learning, T T
Linear and non-linear separability, Multi-layer perceptron,
Forward Propagation, Backpropagation and its variations

110
 Artificial Intelligence/3rd year 2nd semester 2024

28 Ethics in AI: Bias and Fairness, Privacy and Security, Explain- T T

ability and Transparency

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3203 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

111
 Artificial Intelligence Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3204 Artificial Intelligence Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3204
Course Title Artificial Intelligence Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
This laboratory course is designed to provide practical experience in implementing and optimizing various
▲

artificial intelligence algorithms covered in the Artificial Intelligence course. Students will develop and
test AI models using real-world data, focusing on search algorithms, optimization techniques, adversarial
search, constraint satisfaction problems, decision theory, and artificial neural networks.

Prospective Lab Tasks Description

1. Search Algorithms:

■ Implementing and comparing uninformed and informed search strategies.

■ Developing heuristic functions and analyzing their effectiveness in search strategies.

2. Nature-Inspired Optimization Algorithms:

■ Implementing genetic algorithms and population-based optimization algorithms.

■ Analyzing the performance of these algorithms in solving optimization problems.

3. Adversarial Search and Game Theory:

■ Developing game-playing AI using the MiniMax algorithm and Alpha-Beta pruning.

■ Implementing Monte Carlo Tree Search to handle more complex game environments.

4. Constraint Satisfaction Problems:

■ Implementing and solving CSPs using backtracking, local search, and the AC-3 algorithm.
■ Applying these techniques to real-world scenarios like scheduling and planning.

5. Decision Theory:

■ Implementing decision-theoretic agents and exploring concepts like Markov Decision Processes
and Q-learning.

112
 Artificial Intelligence Lab/3rd year 2nd semester 2024

■ Creating models that simulate decision-making processes and optimize outcomes based on
learned experiences.

6. Artificial Neural Networks:

■ Building and training neural networks, including perceptrons and multi-layer networks.
■ Exploring backpropagation and its variations in network training processes.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

4 Course Outcomes

CO Description PO Domain Level Assessment

Methods
CO1 Implement and analyze PO1 Cognitive (C3)
various AI techniques in- Please refer to
cluding search algorithms, Section 5
optimization methods, and
machine learning models to
solve practical problems.
CO2 Apply advanced AI strategies PO3 Cognitive (C4)
such as adversarial search,
constraint satisfaction, and
learning algorithms to de-
velop intelligent systems that
perform optimally in dy-
namic environments.
CO3 Demonstrate proficiency in PO4 Cognitive (C5)
using modern AI tools and
platforms for simulation,
testing, and deploying AI
solutions with a focus on
ethical considerations and
real-world applications.
CO4 Effectively communicate and PO6 Psychomotor (P3)
defend project methodolo-
gies and outcomes through
structured presentations,
demonstrating the abil-
ity to engage an audience
and respond to real-time
feedback.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Class Participation 10% 10%

113
 Artificial Intelligence Lab/3rd year 2nd semester 2024

Continuous Lab Performance 7% 8% 5% 10% 30%

Lab Reports 5% 5% 10%
Lab Viva-Voce 10% 10% 20%
Capstone Project or Demo/Presentation 5% 10% 5% 10% 30%
Total 25% 30% 45% 100%

Course Teacher, CSE 3204 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

114
 Information Security/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3205 Information Security

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3205
Course Title Information Security
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
Security basics: Confidentiality, integrity and availability (CIA Triad), threats, vulnerabilities, attacks,
▲

and attack agents, and common security threats. Cryptographic primitives: Classical encryption schemes,
symmetric cipher, stream cipher, RC4, block cipher and data encryption standard, advanced encryption
standard, key distributions, random number generation, public key cryptography, certificates, digital sig-
nature, hash functions, message authentication code. Internet protocols: PGP, IPSec, SSL/TLS, HTTPS,
Tor protocols, DNSSec, DNS cache poisoning attacks, email security. Access control: discretionary access
control, mandatory access control, role-based access control (RBAC) and attribute-based access control
(ABAC). User Authentication: password-based mechanism–dictionary and rainbow table attacks, token-
based authentication, biometric-based authentication, remote authentication. Denial of service attacks:
TCP vulnerabilities, denial of service attacks, Flooding attacks, DDOS attacks, reflector and amplifier
attacks, defense against DOS, Botnets. Web security: PHP exploits, SQL injection, cross-site scripting,
browser side exploits. Malicious softwares: types of Malware, infected content, vulnerability exploits,
social engineering, system corruption, bots, zombie, key loggers, phasing, spyware, backdoors, counter
measures. Buffer overflow exploits and defenses, Intrusion detection and prevention, defense in depth,
firewalls-packet filtering and proxy-server based firewall.

3 Text and Reference Materials

T Textbook:

– William Stallings, Cryptography and Network Security, Principles and Practice, Eighth Edi-
tion, Pearson Publications.

R References:

– William Stallings & Lawrie Brown, Computer Security Principles and Practices, Fifth Edition,
Pearson Publications.

115
 Information Security/3rd year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Describe fundamental theories, models and Cognitive
CO1 PO1 30%
practices of information security. (C3)
Please refer
Analyze existing theory, models and meth- Cognitive
CO2 PO2 40% to Section 5.
ods in the field of information security. (C4)
Apply knowledge to both modeling the po-
tential problems and the solutions at organi-
Affective
CO3 zation level and be able to communicate this PO6 30%
(A4)
problems and solutions using basic theoret-
ical skills.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 25% 15% 60%
Midterm Exam 5% 10% 5% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 30% 40% 30% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1 Networking and Socialization, sharing course administration T T
and guidelines • Orientation and Basics of security: Security
basics: Confidentiality, integrity and availability (CIA Triad),
threats, vulnerabilities, attacks, and attack agents, and com-
mon security threats.

2-10 Cryptographic primitives: Classical encryption schemes, sym- T T

metric cipher, stream cipher, RC4, block cipher and data en-
cryption standard, advanced encryption standard, key distri-
butions, random number generation, public key cryptography,
certificates, digital signature, hash functions, message authen-
tication code.;
11-14 Internet protocols: PGP, IPSec, SSL/TLS, HTTPS, Tor proto- T T
cols, DNSSec, DNS cache poisoning attacks, email security.

116
 Information Security/3rd year 2nd semester 2024

15 Access control: discretionary access control, mandatory access R R

control, role-based access control (RBAC) and attribute-based
access control (ABAC).

16-17 User Authentication: password-based mechanism–dictionary R R

and rainbow table attacks, token-based authentication,
biometric-based authentication.
18 Denial of service attacks: TCP vulnerabilities, denial of service R R
attacks, Flooding attacks, DDOS attacks, reflector and ampli-
fier attacks, defense against DOS Botnets.

19-20 Web security: PHP exploits, SQL injection, cross-site script- R R

ing, browser side exploits
21-22 Malwares: types of Malware, infected content, vulnerability R R
exploits, social engineering, system corruption, bots, zombie,
key loggers, phasing, spyware, backdoors, counter measures.

23 Buffer overflow exploits and defenses. R R

24-25 Intrusion detection and prevention, denfense in depth. R R
26-28 firewall-packet filtering and proxy based firewall. R R

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3205 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

117
 Information Security Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3206 Information Security Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3206
Course Title Information Security Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

The Information Security Lab is designed to provide students with hands-on experience in detecting differ-
ent types of security attack scenarios and devising solutions to handle those attacks. This laboratory-based
course aims to complement the theoretical concepts covered in the corresponding theory lectures, enabling
students to apply their knowledge in practical, real-world scenarios. This lab is divided into three parts: 1)
solving different security problems related to cryptography using the Python programming language, and
learning different cryptographic tools ,2) Simulation of security attacks using open source security tools,
and 3) Experiments on system vulnerability testing tools.

3 Text and Reference Materials

T Textbook:

– William Stallings, Cryptography and Network Security, Principles and Practice, Eighth Edi-
tion, Pearson Publications.

R References:

– William Stallings & Lawrie Brown, Computer Security Principles and Practices, Fifth Edition,
Pearson Publications.

– Online available resources.

118
 Information Security Lab/3rd year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the core features of cryptog-
raphy and basic properties of different se- Psychomotor
CO1 PO1 20%
curity attacks. Apply the relevant crypto- (P4)
graphic features and knowledge of security.
Analyze different security problems and de- Please refer
Cognitive
CO2 vise solutions using Python programming PO5 30% to Section 5.
(C2)
language and open-source security tools.
Design a security model for a given scenario,
incorporate different security features using Cognitive
CO3 PO9 50%
programming language and available secu- (C6)
rity tools, and implement a reliable system.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Examination 10% 10% 20%
Capstone Project or Demo/Presentation 5% 10% 25% 40%
Total 20% 30% 50% 100%

Course Teacher, CSE 3206 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

119
 Thoery of Computation/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3207 Theory of Computation

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3207
Course Title Thoery of Computation
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 1101 Discrete Mathematics

2 Syllabus
Fundamentals: Strings and their properties, Basics of automata, Transition systems. Formal Languages
▲

and the Chomsky Hierarchy: Regular, Context-Free, Context-Sensitive, Recursively Enumerable. Fi-
nite Automata: Basics of DFA & NFA, Constructions of DFA, Extended transition function for DFA and
NFA, Subset construction, DFA minimization, Equivalence test, Finite Automata with outputs: Mealy and
Moore Machines - construction and conversions. Regular Languages, Regular Expressions, and their re-
lationship: Constructions of Regular Expressions. Properties of Regular Languages: Closure Properties,
Arden’s Theorem, Pumping Lemma for Regular Languages. Context-Free Languages and Grammars:
Context-free grammar (CFG) basics and construction, Derivation trees, Ambiguous grammar, Construc-
tion of reduced grammar, Elimination of null and unit productions, Normal forms for CFG (CNF & GNF),
Pumping Lemma for Context-Free Languages, CYK Algorithm. Pushdown Automata: Push down au-
tomata (PDA) basics and construction, PDA acceptance by final state and empty stack, PDA transforma-
tions, Relationship between Context-Free Languages and PDAs. Context-Sensitive Languages and Lin-
ear Bounded Automata: Context-sensitive languages (CSL) and construction, Context-sensitive grammars
(CSG), Linear bounded automata (LBA), Relationship between CSLs and LBAs. Turing Machines: Basics
of Turing machines and construction, Decidability and Undecidability, The Halting Problem.

3 Text and Reference Materials

T Textbook:

– John E. Hopcroft, Rajeev Motwani and Jefrey D. Ullman, Introduction to Automata Theory, Lan-
guages and Computation, 3rd Edition, Pearson, 2006.

R References:

– K.L.P. Mishra and N.Chandrasekaran, Theory of Computer Science: Automata, Languages and
Computation, 3rd Edition, Prentice Hall, 2006.
– John C. Martin, Introduction to Languages and the Theory of Computation, 4th Edition, McGraw-
Hill, 2010.

120
 Thoery of Computation/3rd year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Fundamentals: Strings and their properties, Basics of au- T T
tomata, Transition systems, Formal Languages and the Chom-
sky Hierarchy (Regular, Context-Free, Context-Sensitive, Re-
cursively Enumerable)
3-8 Finite Automata: Basics of DFA & NFA, Constructions of T T
DFA, Extended transition function for DFA and NFA, Subset
construction, DFA minimization, Equivalence test, Finite Au-
tomata with outputs: Mealy and Moore Machines - construc-
tion and conversions
9-11 Regular Languages, Regular Expressions, and their rela- T T
tionship: Constructions of Regular Expressions, Closure
Properties, Arden’s Theorem, Pumping Lemma for Regular
Languages
12-16 Context-Free Languages and Grammars: Context-free gram- T T
mar (CFG) basics and construction, Derivation trees, Ambigu-
ous grammar, Construction of reduced grammar, Elimination
of null and unit productions, Normal forms for CFG (CNF &
GNF), Pumping Lemma for Context-Free Languages, CYK Al-
gorithm
17-19 Pushdown Automata: Push down automata (PDA) basics T T
and construction, PDA acceptance by final state and empty
stack, PDA transformations, Relationship between Context-
Free Languages and PDAs
20-23 Context-Sensitive Languages and Linear Bounded Au- T T
tomata: Context-sensitive languages (CSL) and construction,
Context-sensitive grammars (CSG), Linear bounded automata
(LBA), Relationship between CSLs and LBAs
24-27 Turing Machines and Undecidability: Basics of Turing ma- T T
chines and construction, Decidability and Undecidability, The
Halting Problem

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3207 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

121
 Machine Learning/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4101 Machine Learning

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4101
Course Title Machine Learning
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 3203 Artificial Intelligence

2 Syllabus
Introduction to Machine Learning: History and evolution of machine learning; Key types of machine
▲

learning: Supervised, Semi-Supervised, Unsupervised, Reinforcement; Real world applications of ma-

chine learning; Basic concepts: Features, Labels, Training data, Test data, Concept of model validation.
Supervised Learning: Classification- Decision Trees: Attribute Selection Measures (Information Gain,
Gain Ratio, Gini Index), Tree Pruning, Scalability; Bayesian Classifier: Naı̈ve Bayesian and Bayesian Be-
lief Network; K-Nearest Neighbors (KNN); Logistic Regression; Rule-Based Classification; Support Vector
Machines (SVM). Artificial Neural Networks - Perceptron, Multi-Layer Perceptrons and Deep Learning;
Activation Functions (ReLU, Leaky ReLU, tanh, softmax, etc.), Cost functions, Loss functions, Optimizers-
Gradient Descent and beyond – SGD with Momentum, Adam, etc. Regression- Simple and Multiple Lin-
ear Regression; Polynomial Regression; Bias-Variance Trade-off; Overfitting and Underfitting; Regulariza-
tion. Model Evaluation & Fine Tuning: Metrics: Confusion matrix, Accuracy, Precision, Recall, F and Fβ
measures, ROC-AUC; Error Metrics: Mean Absolute Error (MAE); Mean Squared Error (MSE); Preparing
Training and Test Datasets: Holdout method, Random subsampling, Cross-validation techniques, Boot-
strap; Model Selection using Statistical Tests of Significance, Feature Engineering, Learning Theory. Ag-
gregating Multiple Models to Improve Classification Performance: Introducing Ensemble Methods, Bag-
ging, Boosting, Random Forests. Learning with Insufficient Training Data: Semi-Supervised Learning,
Transfer Learning, Active Learning. Unsupervised Learning: Clustering- Partitioning Methods: k-Means,
k-Medoids; Hierarchical Methods; Density-Based Methods; Probabilistic Model-Based Clustering; Cluster-
ing High-Dimensional Data; Evaluation of Clustering; Outlier Detection Methods. Reinforcement Learn-
ing: Brief review of MDPs, Q-learning and limitations of tabular Q-learning with large state/action spaces.
Function Approximation - The need to represent Q-values with neural networks. Deep Q-Networks
(DQNs), Policy Gradients.

3 Text and Reference Materials

T Textbooks:

– Tom M. Mitchel, Machine Learning, First Edition, McGraw-Hill Education.

122
 Machine Learning/4th year 1st semester 2024

– Peter Flach, Machine Learning: The Art and Science of Algorithms that Make Sense of Data,
First Edition, Cambridge University Press.

R References:

– Jiawei Han, Jian Pei, H. Tong, Data Mining: Concepts and Techniques, 4th Edition, Morgan
Kaufmann Publishers, Elsevier.

– Dirk P. Kroese, Zdravko I. Botev, Thomas Taimre, Radislav Vaisman, Data Science and Machine
Learning: Mathematical and Statistical Methods, 4th Edition, CRC Press, Taylor and Francis.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Learn the basics of ML algorithms and based Psychomotor
CO1 on that guidance solve real-life ML prob- PO3 (P3-Guided 40%
lems in response. Response)
Cognitive Please refer
Evaluate the performance of an ML solution
CO2 PO4 (C5- 40% to Section 5.
with analysis and investigation.
Evaluating)
Designing optimized ML models gradually
Cognitive
based on the feedback from the previous
CO3 PO5 (C6- Creat- 20%
learning and deploying new cutting-edge
ing/Designing)
techniques wherever needed.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 20% 15% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 2% 3% 5%
Class Participation 3% 2% 5%
Total 40% 40% 20% 100%

123
 Machine Learning/4th year 1st semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Machine Learning: History and evolution of machine T T
learning; Key types of machine learning: Supervised, Semi-Supervised, Un-
supervised, Reinforcement; Real world applications of machine learning;
Basic concepts: Features, Labels, Training data, Test data, Concept of model
validation to emphasize the importance of evaluating model performance
on unseen data.
3-9 Supervised Learning: Classification- Decision Trees: Attribute Selection T T
Measures (Information Gain, Gain Ratio, Gini Index), Tree Pruning, Scala-
bility; Bayesian Classifier: Naı̈ve Bayesian and Bayesian Belief Network; K-
Nearest Neighbors (KNN); Logistic Regression; Rule-Based Classification;
Support Vector Machines (SVM). Artificial Neural Networks - Perceptron,
Multi-Layer Perceptrons and Deep Learning Activation Functions: ReLU,
Leaky ReLU, tanh, softmax, etc., Loss functions Optimizers: Beyond Gradi-
ent Descent – SGD with Momentum, Adam, etc.

10-12 Supervised Learning: Regression- Introduction to Cost Functions and Gra- T T

dient Descent; Simple and Multiple Linear Regression; Polynomial Regres-
sion; Bias-Variance Trade-off; Overfitting and Underfitting; Regularization.
13-15 Model Evaluation & Fine Tuning: Metrics: Confusion matrix, Accuracy, T T
Precision, Recall, F and Fβ measures, ROC-AUC; Error Metrics: Mean Abso-
lute Error (MAE); Mean Squared Error (MSE); Preparing Training and Test
Datasets: Holdout method, Random subsampling, Cross-validation tech-
niques, Bootstrap; Model Selection using Statistical Tests of Significance,
Feature Engineering, Learning Theory.
16-17 Aggregating Multiple Models to Improve Classification Performance: In- T T
troducing Ensemble Methods, Bagging, Boosting, Random Forests.
18-19 Learning with Insufficient Training Data: Semi-Supervised Learning, T T
Transfer Learning, Active Learning.
20-24 Unsupervised Learning: Clustering- Partitioning Methods: k-Means, k- T T
Medoids; Hierarchical Methods: Agglomerative, Divisive, BIRCH; Density-
Based Methods: DBSCAN, OPTICS; Probabilistic Model-Based Clustering:
Expectation-Maximization Algorithm; Clustering High-Dimensional Data;
Evaluation of Clustering; Outlier Detection Methods.

25-28 Reinforcement Learning: Brief review of MDPs, Q-learning and limita- T T

tions of tabular Q-learning with large state/action spaces. Function Ap-
proximation: The need to represent Q-values with neural networks. Deep
Q-Networks (DQNs): (i) Architecture: How a neural network approximates
the Q-function. (ii) Experience Replay: Stabilizing learning with past ex-
periences. (iii) Target Networks: Improving convergence. Policy Gradients:
Introduce the concept of directly learning policies.

TBA
Course Teacher, CSE 4101 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

124
 Machine Learning Lab/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4102 Machine Learning Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4102
Course Title Machine Learning Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
This laboratory course is designed to provide practical experience in implementing and optimizing various
▲

machine learning algorithms covered in the Machine Learning course. Students will develop and test ML
models using real-world data, focusing on supervised, semi-supervised, unsupervised, and reinforcement
learning.

Prospective Lab Tasks Description

1. Supervised Learning:

■ Implementing classification algorithms such as Decision Trees, Naı̈ve Bayes, K-Nearest Neigh-
bors, Logistic Regression, and SVM.
■ Training and evaluating performance using real-world datasets.
■ Exploring regularization techniques to combat overfitting.

2. Regression Techniques:

■ Implementing regression models like Linear Regression and Polynomial Regression.

■ Studying the bias-variance trade-off through experiments.
■ Using regularization methods like Ridge and Lasso.

3. Neural Networks and Deep Learning:

■ Building and training Perceptrons and Multi-Layer Perceptrons.

■ Implementing convolutional neural networks and exploring different activation functions.
■ Applying optimizers such as SGD, Momentum, and Adam.

4. Ensemble Methods:

■ Creating and analyzing the performance of ensemble methods like Bagging, Boosting, and Ran-
dom Forests.

125
 Machine Learning Lab/4th year 1st semester 2024

■ Conducting experiments to compare single models versus ensemble models.

5. Unsupervised Learning:
■ Implementing clustering algorithms such as k-Means, Hierarchical, and DBSCAN.
■ Evaluating clustering quality and exploring techniques for determining the number of clusters.
6. Reinforcement Learning:
■ Implementing basic reinforcement learning algorithms like Q-learning and Policy Gradients.
■ Using environments from OpenAI Gym to test and improve RL models.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Develop proficiency in utilizing machine
learning libraries and frameworks to imple-
Cognitive
CO1 ment supervised and unsupervised learn- PO1 25%
(C2)
ing models, addressing complex engineer-
ing problems in real-world applications.
Design, build, and optimize machine learn-
ing models using techniques such as en-
Please refer
semble methods, neural networks, and re- Cognitive
CO2 PO2 30% to Section 5.
inforcement learning to solve intricate en- (C3)
gineering challenges in computational sys-
tems.
Effectively communicate the design princi-
ples, optimizations, and outcomes of ma-
Psychomotor
CO3 chine learning models through structured PO10 45%
(P5)
documentation, presentations, and team-
work.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

126
 Machine Learning Lab/4th year 1st semester 2024

Course Teacher, CSE 4102 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

127
 Internet of Things/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4103 Internet of Things

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4103
Course Title Internet of Things
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 3201 - Computer Network

2 Syllabus
Orientation and Introduction to IoT: Inter-networking of tiny devices, Key features of Internet of Things
and its diverse applications in practical fields including transportation, smart building, healthcare, agri-
▲

culture, underwater health monitoring, etc. IoT Devices: IoT Device Architecture, Functional components
of an IoT device - Sensing, computing, communication, and power units of an IoT mote, Types of IoT motes,
Automotive IoT - Actuators, dynamic resource management and autonomic control units; IoT Platforms:
Definition and architecture of IoT platform, ThingsBoard - an open source IoT platform, APIs for IoT
platform, most popular IoT platforms provider include Amazon Web Services (AWS), Microsoft Azure,
Oracle, Google Cloud, and Cisco IoT Cloud Connect; Wireless IoT Network Infrastructure: Architecture
and functional details of Consumer IoT (CIoT), Industrial IoT (IIoT), and Underwater IoT, IoT Access Pro-
tocols: Radio Frequency Modulation, Media Access Control, RFID, Sigfox, LoRaWAN, BLE/NFC, Zigbee,
WiFi, Cellular (3G/4G/5G), NBIoT and Mesh protocols; IoT Routing Protocols: Neighborhood Discovery,
Principles of AODV and DSR protocols, Routing based on geographic location information, Types of rout-
ing based on route creation time - proactive, reactive, and hybrid; Challenges of Routing in IoT, Multipath
routing, Mutliconstrained routing, drone-based data collection strategies; Congestion Control in IoT Net-
works: congestion detection, alleviation, and control strategies for IoT networks including CoAP, MQTT,
and RPL. AI and ML for IoT Security: AI and ML for mitigating emerging threats in cyber-physical sys-
tems including device anomaly and network intrusion, malware infection, DoS, DDoS, etc. while balancing
data protection and energy consumption.

3 Text and Reference Materials

T Textbook:
– F. John Dian, Fundamentals of Internet of Things: For Students and Professionals, First Edi-
tion, Wiley Publications, 2022.
R References:
– Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stamatis Karnouskos, Stefan Avesand, & David
Boyle, Internet of Things Technologies and Applications for a New Age of Intelligence, Sec-
ond Edition, Academic Press, 2019.

128
 Internet of Things/4th year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Describe foundational concepts, architec-
tural components, and principles that un- Cognitive
CO1 PO1 40%
derpin the Internet of Things (IoT) ecosys- (C3)
tem.
Explain operational details of data collec-
Please refer
tion protocols at various layers that are Cognitive
CO2 PO2 50% to Section 5.
energy-efficient while ensuring application (C4)
Quality of Service (QoS).
Design impactful IoT applications by in-
tegrating sensors, actuators, communica-
Affective
CO3 tion protocols, and cloud services, address- PO6 10%
(A4)
ing real-world challenges across diverse do-
mains.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • Orientation and Introduction to IoT: Inter-
networking of tiny devices, Key features of Internet of Things
and its diverse applications in practical fields including trans-
portation, smart building, healthcare, agriculture, civil infras-
tructure monitoring, underwater health monitoring, Logistic
tracking, etc.;
3-4 IoT Devices: IoT Device Architecture, Functional components T T
of an IoT device • Sensing, computing, communication, and
power units of an IoT mote, • Types of IoT motes, Automo-
tive IoT - Actuators, dynamic resource management and auto-
nomic control units;

129
 Internet of Things/4th year 1st semester 2024

5-7 IoT Platforms: Definition and architecture of IoT platform, T T

ThingsBoard - an open source IoT platform, • APIs for IoT
platform, most popular IoT platforms provider: Amazon Web
Services (AWS), Microsoft Azure, Oracle, Google Cloud, and
Cisco Cloud Connect;
8-12 Wireless IoT Network Infrastructure: Architecture and func- T T
tional details of Consumer IoT (CIoT), Industrial IoT (IIoT),
and Underwater IoT, • IoT Access Protocols: the IEEE 802.15.4
standard for low-power medium access control (MAC), Ra-
dio Frequency Modulation, Media Access Control - TMAC,
BMAC, SMAC, DCC-MAC, dynamic hybrid MAC (HyMAC);
13-14 RFID, Sigfox, LoRaWAN, BLE/NFC, Zigbee, WiFi, Cellular T T
(3G/4G/5G), NBIoT and Mesh protocols;
15-17 IoT Routing Protocols: Neighborhood Discovery, Principles of T T
AODV and DSR protocols, • Routing based on geographic lo-
cation information, • Types of routing based on route creation
time - proactive, reactive, and hybrid;
18-21 Emerging Challenges of Routing in IoT, • Multipath routing, T R
Secured routing, • Mutliconstrained routing, • Drone-based
data collection strategies;
22-24 Congestion Control in IoT Networks: congestion detection, al- T T
leviation, and control strategies for IoT networks including
CoAP, MQTT, and RPL.
25-26 AI and ML for IoT Security: AI and ML for mitigating T T
emerging threats in cyber-physical systems including device
anomaly and network intrusion, malware infection, DoS,
DDoS, etc. while balancing data protection and energy con-
sumption.
27-28 Reviews, Future of IoT and its Challenges • Problem-solving T R
practices, • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4103 Chairman, Dept. of CSE, DU

April 23, 2024 April 23, 2024

130
 Internet of Things Lab/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4104 Internet of Things Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4104
Course Title Internet of Things Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 3201 Computer Network

2 Syllabus
Working with Microcontroller Board Understand the concept of Internet of Things Devices, Working with
▲

sensors and connecting various sensors with Arduino devices, working with various protocols for transfer-
ring data among multiple IoT devices; Raspberi Pi Fundamentals: Understand fundamental functions of
Raspberri Pi, Collecting sensing data, Filtering data, and communicating to a cloud server; Working with
mbed environment: mbed is an IDE (and also an operating system) tailored for IoT applications based
on 32 bit ARM micro-controllers. There are several commercially available boards out there as a result it
allows simple and rapid prototyping. One of its main advantages compared to other IDEs that it can han-
dle multiple types of micro-controllers so that the code written can be reused in multiple environments.
Furthermore it has an intuitive UI and also supports on-line workflows with team integration and version
control.; Creating a virtual sensor mote: Adding features and services to a microcontroller to function
as an independent sensor mote; MQTT Communication and Configuring IoT Gateway Creating an IoT
network using studied protocols and configuring an IoT Gateway.

3 Text and Reference Materials

T Textbook:

– F. John Dian, Fundamentals of Internet of Things: For Students and Professionals, First Edi-
tion, Wiley Publications, 2022.

R References:

– Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stamatis Karnouskos, Stefan Avesand, & David
Boyle, Internet of Things Technologies and Applications for a New Age of Intelligence, Sec-
ond Edition, Academic Press, 2019.

131
 Internet of Things Lab/4th year 1st semester 2024

Course Teacher, CSE 4104 Chairman, Dept. of CSE, DU

April 23, 2024 April 23, 2024

132
 Parallel and Distributed Systems/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4201 Parallel and Distributed Systems

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4201
Course Title Parallel and Distributed Systems
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course CSE 3201: Computer Network

2 Syllabus
▲

Parallel Computing Overview: Overview of parallel processing landscape: why and how, types of par-
allelism, Flynn’s taxonomy, and a brief overview of parallel architectures, Parallel Random Access Ma-
chine (PRAM) model; Parallel Computer Architecture: Shared memory, distributed memory, hybrid
memory. Parallel Programming Models: Shared memory model, Message passing model, Data Parallel
model, Hybrid Model, SPMD and MNMP; Parallel Program Metrics: Speedup, Efficiency, Iso-efficiency,
Overhead, Strong and Weak scaling (Amdahl’s law, Gustafson’s law; Multi-core parallel programming:
Data and task parallelism, Shared memory parallelism, OpenMP, CUDA, OpenACC; Distributed Mem-
ory programming: Message Passing Interface (MPI); Clustering for Massive Parallelism: Cluster Design
Issues, Cluster System Interconnects, Hardware, Software, and Middleware Support, GPU Clusters for
Massive Parallelism, Cluster Job Scheduling Methods, Load Sharing Facility (LSF) for Cluster Comput-
ing, MOSIX, Top 500; Distributed System Overview: Fundamental principles, Key features, Major de-
sign issues, Process, Middleware; Distributed System Architectures: Layered architectures, Object-based
architectures, Data-centered architectures, Event-based architectures; Distributed System Communica-
tion Model: Sockets, RPC, RMI, publish-subscribe; Naming: Namespace, Distributed hash tables (DHT),
Name resolution, Chord; Migration: Process migration, Code migration; Time, Clock and Event: Logical
clocks, Lamport vector clocks, Ordering of events, Clock synchronization, NTP, Synchronization based on
Co-ordination (with Election Algorithms), Distributed Mutual Exclusion, Distributed Transactions, Lock-
ing, Global State, Distributed Snapshot; Consistency and Replication Model: linearizability, eventual,
causal, sequential, server-initiated replica, client-initiated replica, Epidemic protocol, Quorum-based pro-
tocol; Consensus protocols: 2PC, 3PC, Paxos; Fault, Failure and Recovery: Byzantine Failure, Triple
Modular Redundancy, Agreement, Multicasting, Snapshotting, Checkpointing, Message Logging; Virtu-
alization: Levels of Virtualization Implementation, VMM Design Requirements, Middleware Support for
Virtualization, Virtualization of Clusters and Data Centers, Server Consolidation in Data Centers; Peer to
peer Computing: P2P Computing Systems, Overlay networks, P2P fault tolerance, P2P trust and security
management, P2P file sharing; Overview: Distributed Machine Learning, Edge Computing, Blockchain,
Distributed Resource Allocation.

133
 Parallel and Distributed Systems/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Marteen van Steen, Andrew S. Tanenbaum, Distributed Systems: Principles and Paradigms,
Fourth Edition, Pearson Prentice Hall, 2023.
– Ananth Grama, Vipin Kumar, Introduction to Parallel Computing, Addison-Wesley, 2003.

R References:

– George Coulouris, Jean Dollimore, Tim Kindbera, Gordon Blair, Distributed Systems, Pearson,
2011.
– Kai Hwang, Jack Dongarra & Geoffrey C. Fox, Distributed and Cloud Computing: Clusters,
Grids, Clouds, and the Future Internet (DCC), Morgan Kaufmann, 2012.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
The course provides a comprehensive un-
derstanding of parallel and distributed sys-
tems, covering principles, theories, and Cognitive
CO1 PO1 40%
practical applications. Students will learn (C3)
about different architectures, algorithms,
and programming models.
The course will assist in demonstrating an-
alytical ability by applying knowledge from
Please refer
various domains to address real-world com- Cognitive
CO2 PO2 50% to Section 5.
plex problems in parallel and distributed (C4)
computing, identify requirements, and de-
velop effective solutions.
Design and implement real-world complex
parallel and distributed applications by in-
tegrating appropriate programming models,
Affective
CO3 communication protocols, and fault toler- PO6 10%
(A4)
ance mechanisms. They will demonstrate
proficiency in developing efficient and scal-
able solutions.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%

134
 Parallel and Distributed Systems/4th year 2nd semester 2024

Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1 Networking and Socialization, sharing course administration T2 T2
and guidelines • Parallel Computing Overview: Overview of
parallel processing landscape: types of parallelism, Flynn’s
taxonomy, Parallel Random Access Machine (PRAM) model;
Parallel Computer Memory Architecture: Shared memory,
distributed memory, hybrid memory
2-3 Parallel Programming Models: Shared memory model, Mes- T2 T2
sage passing model, Data Parallel model, Hybrid Model,
SPMD and MNMP • Parallel Program Metrics: Speedup, Ef-
ficiency, Iso-efficiency, Overhead, Strong and Weak scaling
(Amdahl’s law, Gustafson’s law.;
3-5 Many-core Computing: GPU, CUDA; • Multi-core Program- T2 T2
ming: Data and task parallelism, Shared memory, OpenMP;
• Shared Memory Programming: Thread; • Distributed Mem-
ory Programming: Message Passing Interface (MPI)
6-8 Clustering for Massive Parallelism: Cluster Design Issues, R2 R2
Cluster System Interconnects, Hardware, Software, and Mid-
dleware Support, GPU Clusters for Massive Parallelism, Clus-
ter Job Scheduling Methods, Load Sharing Facility (LSF) for
Cluster Computing, MOSIX, Top 500

9 Distributed System Overview: Fundamental principles, Key T1 T1

features, Major design issues, Process, Middleware; • Dis-
tributed System Architectures: Layered architectures, Object-
based architectures, Data-centered architectures, Event-based
architectures
10-11 Distributed System Communication Model: Sockets • RPC • T1 T1
RMI • Publish-subscribe
12-13 Naming: Namespace, Distributed hash tables (DHT), Name T1 T1
resolution, Chord • Migration: Process migration, Code mi-
gration;

14-16 Time, Clock and Event: Logical clocks, Lamport vector clocks, T1 R1
Ordering of events, Clock synchronization, NTP, Synchroniza-
tion based on Co-ordination (with Election Algorithms) • Dis-
tributed Mutual Exclusion, Distributed Transactions, Locking,
Global State, Distributed Snapshot
17-18 Consistency and Replication Model: linearizability, eventual, T1 R1
causal, sequential, server-initiated replica, client-initiated
replica • Epidemic protocol, Quorum-based protocol;
19 Consensus protocols: 2PC, 3PC, Paxos • T1 R1
20-21 Fault, Failure and Recovery: Byzantine Failure, Triple Mod- T1 T1
ular Redundancy, Agreement, Multicasting, Snapshotting,
Check- pointing, Message Logging;

135
 Parallel and Distributed Systems/4th year 2nd semester 2024

22-23 Virtualization: Levels of Virtualization Implementation, R1 R1

VMM Design Requirements, Middleware Support for Virtu-
alization, Virtualization of Clusters and Data Centers, Server
Consolidation in Data Centers
24-25 Peer to peer Computing: P2P Computing Systems, Overlay R1 R1
networks, P2P fault tolerance, P2P trust and security manage-
ment, P2P file sharing
26-27 Overview: Distributed Machine Learning, Edge Computing, R1 R1
Blockchain, Distributed Resource Allocation.
28 Reviews and Discussion, Future of Distributed Systems and T R
its Challenges • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4201 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

136
 Parallel and Distributed Systems Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4202

Parallel and Distributed Systems Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4202
Course Title Parallel and Distributed Systems Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
▲

The lab course aims to provide hands-on experience with designing, implementing, and analyzing Parallel
and distributed systems concepts covered in the lecture portion of the theory course. The lab is intended
to design and implement the various components and concepts acquired in the CSE4101 Parallel and Dis-
tributed Systems Theory courses. The students will be given multiple programming assignments on the
development of distributed applications using various communication paradigms: RPC and RMI; parallel
programming models (e.g., shared memory, message passing) using OpenMP and MPI; multicore program-
ming using CUDA and OpenACC; analyzing scalability, speedup, and efficiency of parallel programs by
implementing a parallel version of a sequential algorithm.

3 Text and Reference Materials

T Textbook:

– Marteen van Steen, Andrew S. Tanenbaum, Distributed Systems: Principles and Paradigms,
Fourth Edition, Pearson Prentice Hall, 2023.
– Ananth Grama, Vipin Kumar, Introduction to Parallel Computing, Addison-Wesley, 2003.

R References:

– Quinn Michael J. Quinn, Parallel Programming in C With Mpi and Openmp, McGraw-Hill
Education, 2008.
– Quinn Michael J. Quinn, Parallel Programming in C With Mpi and Openmp, McGraw-Hill
Education, 2008.
– Marc Snir, Jack Dongarra, Janusz S. Kowalik, Steven Huss-Lederman, Steve W. Otto, MPI: The
Complete Reference, MIT Press, 1998.

137
 Parallel and Distributed Systems Lab/4th year 2nd semester 2024

– arbara Chapman, Gabriele Jost, Ruud Van De Pas, Ruud Van Der Pas, William Gropp, Ewing Lusk,
Using OpenMP – Portable Shared Memory Parallel Programming (Scientific and Engineer-
ing Computation), MIT Press, 2007.
– Rohit Chandra, Ramesh Menon, Leo Dagum, David Kohr, Dror Maydan, Parallel Programming in
OpenMP, Morgan Kaufmann, 2000.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the fundamental knowledge on the
principles of parallel and distributed sys- Cognitive
CO1 PO1 20%
tems, including architecture, algorithm, and (C2)
programming.
With assignments and projects, students
will analyze complex problems related to Please refer
Cognitive
CO2 parallel and distributed computing, identify PO2 30% to Section 5.
(C3)
requirements, and develop appropriate so-
lutions.
Students will design and implement solu-
tions of real-life complex engineering prob-
lems of parallel and distributed systems, Psychomotor
CO3 PO5 50%
applying appropriate programming models, (P5)
communication protocols, and using the ap-
propriate technologies.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 30%
Total 25% 30% 45% 100%

Course Teacher, CSE 4202 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

138
17.2 Internship and Final Year Project

139
 Internship/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4100 Internship

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4100
Course Title Internship
Course Credit 3.0 units
Contact Hours Per Week Minimum 240 hours of industrial experience over 8-12 weeks.
Course Status Core Course
Prerequisite Course None

2 Course Rationale
The Internships in the computer, software, and network services Industry provide students with a unique
▲

opportunity to gain practical experience in the dynamic fields of computing and information technology by
working in real-world industry settings. This intensive internship program is designed to bridge the gap
between classroom learning and industry application. Through hands-on projects, guided mentorship,
and exposure to industry practices, interns will develop valuable workplace skills, expand their profes-
sional network, and contribute to solving real challenges faced by IT companies. During the internship,
students will work closely with industry professionals, applying their knowledge to address real business
problems. They will engage in diverse projects that involve software requirement analysis, development
of programs and databases, report generation, query processing, data mining, writing AI algorithms, mo-
bile application design and development, analyzing the traffic of data networks, network administration
and troubleshooting, network programming, software re-engineering, venerability assessment and pene-
tration testing, software quality assurance, embedded systems, and IoT network design and development,
distributed systems development, research and investigation, and ethical considerations. By the end of the
program, interns will have a comprehensive understanding of the Computer and ICT industry landscape
and be better prepared for career opportunities in these fields.

3 Course Description
The course offers students a comprehensive and immersive experience aimed at broadening their under-
standing of problem-solving activities. Throughout this program, students will gain exposure to a diverse
array of technical and practical applications, providing them with a well-rounded perspective on the in-
dustry. Beyond technical skills, the course explores various critical facets of a professional environment,
including company operations, workplace culture, safety protocols, project management methodologies,
effective communication strategies, and the art of delivering impactful presentations.
One of the core requirements of this course is for students to maintain a logbook throughout their
industrial training. This logbook content, monitored by an industry supervisor, serves as a valuable repos-
itory of their experiences, insights, and the tasks they have undertaken during their time in the industry.
Furthermore, students are expected to culminate their industrial training experience with a comprehensive
written report that showcases their newfound knowledge and proficiency.

140
 Internship/4th year 1st semester 2024

To ensure a holistic evaluation of their performance, an assessment will be conducted collaboratively by

academic and industrial supervisors. This assessment process typically involves a report, and a viva, dur-
ing which students will discuss and defend their experiences, decisions, and the skills they have acquired
during their industrial training. Additionally, students may be required to complete questionnaires that
help assess their overall comprehension of the course material and its practical application in the indus-
try. Through this multifaceted approach to assessment, students are not only evaluated on their technical
competence but also on their ability to adapt, communicate effectively, and thrive within a professional
engineering setting. This comprehensive evaluation process is designed to help students develop a deeper
appreciation for problem-solving activities and to equip them with the skills and knowledge necessary to
excel in their future careers.

4 Academic and Industry Supervisors

A student will work closely with two supervisors to fulfill the internship-related requirements: an aca-
demic supervisor and an industry supervisor.

4.1 Role of an Academic Supervisor

The role of the academic supervisor is paramount in overseeing and enhancing the success of the intern-
ship program. Typically, this role is fulfilled by a faculty member selected by the Academic Committee
of the department. The academic supervisor’s responsibilities extend to evaluating the student’s perfor-
mance and contributions throughout the internship period, culminating in a comprehensive assessment as
outlined in Section 6.
To enrich the student’s internship experience, the academic supervisors play a multifaceted role. First,
they provide valuable guidance to students in the selection of industries for their internships. This guid-
ance helps students align their goals and aspirations with the available opportunities in their chosen field.
Additionally, academic supervisors assist students in nominating or selecting their industrial supervisors,
drawing upon their network of industry contacts and expertise to ensure a productive mentorship.
Another crucial aspect of the academic supervisor’s role is the ongoing monitoring of the student’s
progress. This involves visiting or maintaining regular communication with the industrial supervisor.
While a minimum of one visit is mandatory, multiple interactions are encouraged to closely observe the
student’s development and ensure alignment with the internship’s objectives. Furthermore, the academic
supervisor takes the initiative to gather assessment feedback and marks from the industrial supervisor,
facilitating a comprehensive evaluation of the student’s performance.

4.2 Role of an Industry Supervisor

The industrial supervisors, much like the academic supervisors, play a crucial role in shaping the student’s
internship experience. Nominated from the industry, they bring a wealth of practical knowledge and
expertise to the student’s learning journey.
The industrial supervisor’s responsibilities include actively observing and assessing the student’s in-
ternship activities, regularly reviewing logbooks, and evaluating performance based on a predetermined
rubric. They also oversee the completion of daily tasks, assignments, projects, and experiments, ensur-
ing the student’s engagement in meaningful learning experiences. Moreover, the industrial supervisor
employs prescribed assessment techniques to gauge the student’s progress, contributing valuable insights
into their skill development and workplace contributions.
Collaboration between the industrial and academic supervisors is key to the student’s comprehensive
evaluation. The industrial supervisor responds to queries and provides insights to the academic supervisor,
fostering a holistic assessment of the student’s performance. Together, they create a symbiotic relationship
that shapes the student’s internship journey, prepares them for future success in the industry, and enhances
the overall quality of the internship experience. Beyond these core responsibilities, industrial supervisors
may also take on other pertinent tasks to further enrich the student’s professional development during the
internship.

141
 Internship/4th year 1st semester 2024

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Demonstrate technical knowledge and practical
skills through learning new tools and techniques Psychomotor
CO1 PO5 10%
as per the requirements of the involved industrial (P3)
organization or institution.
Demonstrate the ability to adapt health, safety, Please refer
Affective
CO2 legal, and cultural requirements in an indus- PO6 5% to Section 6.
(A4)
trial/institutional working environment.
Demonstrate the knowledge of professional engi-
Affective
CO3 neering techniques in societal and environmental PO7 5%
(A4)
contexts for sustainable development.
Demonstrate commitment to professional ethics
Affective
CO4 and institutional responsibilities while performing PO8 20%
(A4)
engineering tasks.
Demonstrate interpersonal, oral, and written com-
Psychomotor
CO5 munication skills in teamwork, technical presenta- PO10 30%
(P4)
tions, and report writing.
Demonstrate adaptive learning capacity to cope
Affective
CO6 with the dynamism of working environment and PO12 10%
(A5)
technological changes.
Apply problem-solving skills to identify, formu-
late, and analyze computing problems encoun-
Cognitive
CO7 tered in an industrial environment, utilizing rele- PO2 20%
(C3)
vant literature, mathematical principles, and com-
puter engineering fundamentals.

6 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 CO5 CO6 CO7 Total
Report (Academic) 5% 5% 5% 5% 5% 5% 30%
Logbook (Industry) 5% 15% 20%
Questionnaire (Industry) 5% 5% 10%
Presentation on Final Report 5% 5% 5% 15%
Q/A Session 5% 5% 5% 15%
Final Report Evaluation 5% 5% 10%
Total 10% 5% 5% 20% 30% 10% 20% 100%

Note: Students will present a summary of their final report before an evaluation team of three members comprising of industry
and academic supervisors, and a relevant faculty of the department (determined by the Academic Committee) - 40% weight.

Coordinator, CSE 4100 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

142
 Final Year Project/4th year 1st and 2nd semesters 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4110 and CSE 4210 Final Year Project Part A & B

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st and 2nd semesters 2024
Course Code CSE 4110 and CSE 4210
Course Title Final Year Project
Course Credit 2.0 + 4.0 = 6.0 units
Contact Hours Per Week Minimum 4 and 6 hours a week in the 1st and 2nd semesters, respectively.
Course Status Core Course
Prerequisite Course None

2 Course Rationale
▲

The Final Year Project is the culmination of a student’s academic journey, providing an opportunity to
apply acquired knowledge, skills, and methodologies to address real-world challenges. This project-driven
experience is essential for students to demonstrate their proficiency in developing innovative solutions,
working with state-of-the-art tools and techniques, conducting innovation, and effectively communicating
their findings. This project fosters innovation, creativity, critical thinking, collaboration, and problem-
solving abilities, preparing students to tackle complex engineering problems and contribute meaningfully
to the rapidly evolving domains of Computer Science and Engineering.
Through their chosen projects, students embark on a journey of exploration, experimentation, and dis-
covery, reflecting the field’s interdisciplinary nature. This final-year project showcases technical prowess
and hone soft skills such as project management, teamwork, and communication. This endeavor rein-
forces the program’s commitment to producing well-equipped graduates to address real-world challenges,
advance the frontiers of knowledge and skills, and make impactful contributions to emerging IT industries
in this rapidly evolving industrial revolution era.
As students immerse themselves in the integrated design project experience, they deepen their under-
standing of specific domains of computer science and engineering, engage with cutting-edge technologies,
and develop a robust portfolio that demonstrates their expertise to potential employers, collaborators, and
research institutions.
This course rationale highlights the project’s significance as a transformative learning experience that
not only culminates academic pursuits but also marks the beginning of a promising journey into inno-
vation and creativity. By completing their final year projects, students emerge as computer scientists or
engineering practitioners with the theoretical knowledge, practical skills, and intellectual curiosity neces-
sary to navigate the challenges and opportunities of the ever-evolving landscape in these dynamic fields.

3 Course Description
The Final Year Project is a culminating experience that allows students to demonstrate their expertise in
the emerging fields of computer science and engineering through an in-depth innovation and industry

143
 Final Year Project/4th year 1st and 2nd semesters 2024

project. This course allows students to tackle complex problems, contribute to advancing knowledge in
the field, and showcase their ability to apply theoretical concepts to practical challenges. Students will
work under the guidance of a faculty supervisor to design, execute, and present an original development
and implementation of a system or an application service or to conduct analysis, synthesize data, and make
propositions in different fields of computer science and engineering.
The project comprises two parts envisioned in two subsequent semesters. Throughout the course, stu-
dents engage in rigorous design, Development, experimental design, data analysis, model development,
and evaluation. They contribute new insights, methodologies, or solutions to the field, addressing real-
world problems with novel computing techniques.
The final year project is expected to demonstrate the student’s mastery of design, development, techni-
cal proficiency, and innovation under the type ‘Design and Development Project’, and research investiga-
tion, critical thinking, analysis, synthesis, and evaluation skills under the type ‘Research Project’ through
carrying out the following activities.

(i) Project Proposal and Planning: This task is included in CSE 4110 - Final Year Project (Part A). • For
Design and Development Project - Motivation, objectives, problem statements, key features, detail
methods containing platform or technology tools; • Formulating problem statements, listing key
objectives, conducting literature reviews to identify gaps and opportunities, and stating problem-
solving methodology.

(ii) System Design, Development and Analysis: This task is included in CSE 4110 - Final Year Project
(Part A). • For Design and Development Project - Design and Development of the system or applica-
tion service, implementation, analysis, and testing of operational correctness.

(iii) Experimental Design and Data Collection: This task includes CSE 4210 - Final Year Project (Part
B). • For Design and Development Project - System integration, Designing databases, input forms,
and processes for collecting data from different sources, including humans and machines.

(iv) Analysis, Evaluation, and Interpretation: This task is included in CSE 4210 - Final Year Project (Part
B). • For Design and Development Project - Conducting User Acceptance Test (UAT) cases, analyzing
outcomes, testing system robustness with diverse inputs, and interpreting the results of processed
data; • For Research Project - Evaluating model performance using appropriate metrics, Interpreting
and analyzing results, Development of propositions of their findings.

(v) Ethical Considerations and Bias Analysis: This task is included in CSE 4210 - Final Year Project
(Part B). • For Design and Development Project - Addressing ethical concerns related to originality
of the system or application service design, Development, and data analysis;

(vi) Writing a report on the Project: Writing a comprehensive report in a prescribed format recom-
mended by the evaluation committee, Structuring the document with multiple chapters including
Introduction, State-of-the-Art Systems or Studies, Design Methodology, Results, and Discussion. The
introduction, state-of-the-art, and initial design concepts are in CSE 4110 (Part A), and the rest is
in CSE 4210 (Part B). Reports with a plagiarism similarity percentage of more than 15% (without
references, author names, and affiliations) or generated by any AI software are unacceptable.

(vii) Project Presentation and Defense: Presenting the contents of the report; Students will defend the
Introduction, State-of-the-art, and Initial Design Concepts in CSE 4110 (Part A) and the methodology,
results, and interpretations in CSE 4210 (Part B).

4 Teaching Methods
No formal teaching will be conducted. However, students are supposed to meet the supervisor(s) periodi-
cally, receive instructions, exchange ideas, and present the progress of their works.

144
 Final Year Project/4th year 1st and 2nd semesters 2024

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Demonstrate the knowledge of computer science
Cognitive
CO1 and engineering to solve complex problems inno- PO1 5%
(C3)
vatively.
Analyze a problem for identifying the require-
Cognitive
CO2 ments, methods, tools, and techniques of computer PO2 5%
(C4)
science and engineering necessary for solving it.
Develop a system, application service, or research
Cognitive
CO3 design based on analyzing a complex scientific or PO3 20%
(C5)
engineering problem.
Evaluate the performance of the proposed system
design by comparing it with the existing similar
Cognitive
CO4 systems through experimental results and/or data PO4 20%
(C6)
analysis to infer a rational conclusion of the pro-
posed system.
Use modern ICT techniques and tools such as com-
Psychomotor
CO5 putation, software, network, optimization, AI, and PO5 5%
(P6)
machine learning to develop the proposed system.
Identify professional practices considering the im- Please refer
Affective
CO6 pacts on societal /health/ legal/ cultural issues, PO6 5% to Section 6.
(A4)
whichever applies to the proposed system.
Identify the impact of the proposed system on
the environment, alongside the sustainability mea- Affective
CO7 PO7 5%
sures taken into consideration, while designing the (A4)
system.
Demonstrate the ethical principles and responsi-
Affective
CO8 bilities throughout the development process of the PO8 5%
(A3)
proposed system model and writing reports.
Exhibit the leadership skills to work in groups and
Psychomotor
CO9 as an individual member through the entire project PO9 5%
(P6)
lifetime.
Write comprehensive and constructive reports of
the proposed solution with adequate details and Psychomotor
CO10 PO10 10%
follow the given formats alongside presenting (P3)
them with adequate confidence.
Manage any project effectively in multidisciplinary
environments considering the costing and financ-
Psychomotor
CO11 ing, handling conflicts, optimizing resources, and PO11 5%
(P4)
maintaining deadlines to design and implement
the system.
Explore the state-of-the-art computing knowledge,
Affective
CO12 concepts, and techniques for designing and imple- PO12 10%
(A5)
menting the problem’s solution (s).

6 Assessment Methods of COs

Part A Criteria - Both for ‘Design and Development Project’ and ‘Research Project’

145
 Final Year Project/4th year 1st and 2nd semesters 2024

Assessment Type CO1 CO2 CO3 CO4 CO5 CO6 CO7 CO8 CO9 CO10 CO11 CO12 Total
Supervisor (30%) 5 5 5 5 5 5 30
Progress Report (40%) 5 5 20 5 5 40
Exam Committee (30%) 15 5 10 30
Total 10 10 40 10 10 20 100

Part B Criteria - Both for ‘Design and Development Project’ and ‘Research Project’

Assessment Type CO1 CO2 CO3 CO4 CO5 CO6 CO7 CO8 CO9 CO10 CO11 CO12 Total
Supervisor (30%) 10 5 5 5 5 30
Final Report (40%) 15 10 5 5 5 40
Exam Committee (30%) 5 5 5 5 5 5 30
Total 5 5 20 20 5 5 5 5 5 10 5 10 100

Notes:
(i) At the end of the 4th-year 1st semester, only 6 out of 12 outcomes will be evaluated under Part A, weighing 50%
(ii) Two examiners will evaluate item Project reports per the University of Dhaka rules.
(iii) The exam committee will arrange demonstration/presentation/project showcasing or poster presentations as deemed nec-
essary for proper evaluation.
(iv) After completion of the project works, each group of students will submit a book-bonded report, a poster for showcasing in
the department premise, and a prototype for an integrated system design or a software system or collected data and model
training program codes or simulation environment settings and trace files or program codes, developed project manuals
any deliverables appropriate for demonstration, and possible of the project outcomes.
(v) When students are working in a group, their marks may vary from one to another depending on the individual’s contribu-
tion and demonstrated performance before the supervisor and exam committee members.

TBA
Coordinator, CSE 4110 and CSE 4210 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

146
17.3 Elective Courses

17.3.1 Elective I

147
 Digital Image Processing/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3209 Digital Image Processing

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 3209
Course Title Digital Image Processing
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3203 - Artificial Intelligence

2 Syllabus
▲

Introduction: Definition of image, Differences between image processing, image analysis and computer
vision. Image digitization. How human eye works, Digital Image: RGB to Grayscale Conversion, Average
method, Weighted Method. Spatial resolution, Image contouring. Contrast Enhancement: Histogram,
Histogram stretching. Histogram equalization. Image Gradient: Magnitude and Phase, Gradient Deriva-
tives: Sobel, Roberts and Prewitt Operators. Convolution and Correlation: Cross-Correlation Filtering,
Convolution examples: Image Averaging, Edge Detection. Linear Filters: Applying a Linear Filter, Practice
with Linear Filters, Smoothing and Sharpening, Shift-Invariant linear operation (Convolution), Gaussian
Filters. Laplacian Operator: Positive and Negative Laplacian Operator, Laplacian of Gaussian: Discrete
approximation of LoG function. Canny edge detection: Noise Reduction, Gradient Calculation, Non-
maximum Suppression, Double Thresholding and Edge Tracking. Color Image Processing: Color Models-
CMY, HIS, YIQ, YUV and YcbCr. Image Degradation and Restoration: Image Degradation/ Restoration
Model. Noise: Gaussian Noise, Impulse noise, Periodic Noise. Noise Removal: Median filter, Mean filer,
Adaptive Median Filter. Fourier Transform (in 2D): Trigonometric Fourier Series, Exponential Fourier
Series. Discrete Fourier Transform, DFT properties, Magnitude and Phase of DFT. Image Deblurring in
frequency domain: Inverse Filter, Wiener Filter. Image Compression: Redundancy, General Image Com-
pression and Transmission Model: Encoder and Decoder. JPEG Coding: 2D-DCT, Quantization, Zig-Zag
Scan etc. Hough Transform: Line and Circle Detection by Hough Transform. Morphological Image Pro-
cessing: Erosion and Dilation, Opening and Closing, Some Basic Morphological Algorithms: Boundary
Extraction, Hit-or-Miss Transformation, Morphological Thinning, Skeletons, Thickening. Morphological
Reconstruction: Reconstruction by (Geodesic) Erosion and Dilation.

3 Text and Reference Materials

T Textbook:

– R. C. Gonzalez and E. E. Woods, Digital Image Processing, Prentice Hall.

148
 Digital Image Processing/4th year 1st semester 2024

R References:

– SE Umbaugh, Digital Image Enhancement, Restoration and Compression, 4th Edition, 2023
– Sandipan Dey, Hands on Image Processing with Python

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction: Definition of image, Differences between image T T
processing, image analysis and computer vision. Image digiti-
zation.
3-4 How human eye works, Digital Image: RGB to Grayscale Con- T T
version, Average method, Weighted Method. Spatial resolu-
tion . Image contouring.
5-6 Contrast Enhancement: Histogram, Histogram stretching. T T
Histogram equalization.
7 Image Gradient: Magnitude and Phase, Gradient Derivatives: T T
Sobel, Roberts and Prewitt Operators.
8-9 Convolution and Correlation: Cross-Correlation Filtering, T T
Convolution examples: Image Averaging, Edge Detection,
10-11 Linear Filters: Applying a Linear Filter, Practice with Linear T T
Filters, Smoothing and Sharpening, Shift-Invariant linear op-
eration (Convolution), Gaussian Filters.
12 Laplacian Operator: Positive and Negative Laplacian Oper- T R
ator, Laplacian of Gaussian: Discrete approximation of LoG
function.
13 Canny edge detection: Noise Reduction, Gradient Calcula- T T
tion, Non-maximum Suppression, Double Thresholding and
Edge Tracking.
14-15 Color Image Processing: Color Models- CMY, HIS, YIQ, YUV T T
and YCbCr,
16-17 Image Degradation and Restoration: Image Degradation/ T R
Restoration Model. Noise: Gaussian Noise, Impulse noise, Pe-
riodic Noise. Noise Removal: Median filter, Mean filer, Adap-
tive Median Filter.
18-19 Fourier Transform (in 2D): Trigonometric Fourier Series, Ex- T R
ponential Fourier Series. Discrete Fourier Transform, DFT
properties, Magnitude and Phase of DFT.
20 Image Deblurring in frequency domain: Motion Blur, In- T R
verse Filter, Wiener Filter
21-23 Image Compression: Redundancy, General Image Compres- T R
sion and Transmission Model: Encoder and Decoder. JPEG
Coding: 2D-DCT, Quantization, Zig-Zag Scan etc.
24-25 Hough Transform: Line and Circle Detection by Hough T R
Transform.
26 Morphological Image Processing: Erosion and Dilation, T R
Opening and Closing,
27-28 Some Basic Morphological Algorithms: Boundary Extrac- T R
tion, Hit-or-Miss Transformation, Morphological Thinning,
Skeletons, Thickening. Morphological Reconstruction: Re-
construction by (Geodesic) Erosion and Dilation.

For the definitions of T and R , Please refer to Section 3.

149
 Digital Image Processing/4th year 1st semester 2024

Prof. Dr. Md. Haider Ali Prof. Dr. Md. Abdur Razzaque
Course Teacher, CSE 3209 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

150
 Digital Image Processing Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3210 Digital Image Processing

Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3210
Course Title Digital Image Processing Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
▲

The CSE 3210 Digital Image Processing Lab complements the CSE 3209 Digital Image Processing course,
providing practical hands-on experience with digital image processing techniques. Students will imple-
ment algorithms for image enhancement, restoration, segmentation, and compression. The lab exercises
include image transformations, filtering, edge detection, and morphological operations using standard
image processing tools. This applied approach helps students develop the skills necessary to address real-
world image processing challenges effectively.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

Course Teacher, CSE 4224 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

151
 Introduction to Data Science/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3211 Introduction to Data Science

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE-3211
Course Title Introduction to Data Science
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Introduction: Basic concepts of Data Science; Properties of data: structured vs unstructured, quantitative
vs categorical, big data vs little data; Data Objects and Attribute types: What is an attribute? Nominal,
Binary, Ordinal and Numeric attributes. Basic Statistical Description of Data: Measuring the Central
Tendency: Mean, Median, Mode; Measuring the Dispersion of Data: Range, Quartiles, Variance, Stan-
dard Deviation, Interquartile Range. Visualizing Data: Graphic displays of basic statistical descriptions
of data: Boxplots, Tabular data, Dot and Line plots, Quantile plot, Quantile-Quantile plot, Bar and Pie
charts, Histograms, Data maps, Scatter plots and data correlation. Measuring Data Similarity and Dis-
similarity: Data Matrix vs Dissimilarity Matrix; Dissimilarity of numeric data: Euclidean, Manhattan
and Minkowski distances; Proximity measures for nominal, binary and ordinal attributes; Dissimilarity
for attributes of mixed types; Cosine similarity. Mathematical and Statistical Analysis: Linear Algebra:
Matrix operations, Eigenvalues and Eigenvectors; Scores and Rankings; Probability, Probability distribu-
tions: Binomial, Normal, Poisson; Statistical tests for significance; Bayesian reasoning. Data Quality: Basic
concepts of data accuracy, completeness, consistency, timeliness, believability and interpretability; Major
tasks and challenges in data preprocessing. Data Cleaning: Collection process of data: Hunting, Scraping,
Logging; Handling missing values and noisy data; Data cleaning as a process; Crowdsourcing. Data Inte-
gration: Entity identification problem; Redundancy and Correlation analysis: Chi-square correlation test,
Correlation Coefficient and Covariance to discover data correlation; Tuple duplication, data value con-
flict detection and resolution. Data Reduction: Dimensionality reduction: Wavelet Transforms, Principal
Component Analysis, Attribute Subset Selection; Numerosity Reduction: Parametric and Non-parametric
data reduction techniques, Sampling, Data Cube Aggregation; Data Compression. Data Transformation:
Transformation by normalization: Min-Max, z-score and decimal scaling; Discretization by binning, his-
togram analysis, cluster, decision tree and correlation analysis; Concept hierarchy generation for nominal
data. Learning from Data: Supervised Learning: Basic concepts of supervised learning; Classification
methods: decision tree, Bayesian classification, k-NN, logistic regression; Model evaluation and selection:
accuracy, precision, recall, F-measure, ROC-curves; Cross-validation, bootstrap; Ensemble Methods: bag-
ging, boosting, random forests; Basic concepts of linear and non-linear regression; Unsupervised Learning:
Basic concepts of unsupervised learning; Clustering methods: partitioning methods: k-Means, k-Medoids;

152
 Introduction to Data Science/3rd year 2nd semester 2024

Hierarchical methods: agglomerative, divisive; Density-based methods: DBSCAN, OPTICS; Evaluation of

Clustering; Outlier detection methods.

3 Text and Reference Materials

T Textbook:

– Steven S. Skiena, The Data Science Design Manual, 1st Editions, Springer Publications, 2017.
– Jiawei Han, Jian Pei, H. Tong, Data Mining: Concepts and Techniques, 4th Edition, Morgan
Kaufmann Publishers, Elsevier., 2006.

R References:

– Dirk P. Kroese, Zdravko I. Botev, Thomas Taimre, Radislav Vaisman, Data Science and Machine
Learning: Mathematical and Statistical Methods, 2nd Edition, Morgan Kaufmann Publishers,
Elsevier., 2006.
– Charu C. AggarWal, Data Mining: The Textbook, 2nd Edition, Springer Publications, 2015.

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction: Basic concepts of Data Science; Properties of T T
data: structured vs unstructured, quantitative vs categorical,
big data vs little data; Data Objects and Attribute types: What
is an attribute? Nominal, Binary, Ordinal and Numeric at-
tributes.
3-4 Basic Statistical Description of Data: Measuring the Central T T
Tendency: Mean, Median, Mode; Measuring the Dispersion
of Data: Range, Quartiles, Variance, Standard Deviation, In-
terquartile Range.
5-6 Visualizing Data: Graphic displays of basic statistical de- T T
scriptions of data: Boxplots, Tabular data, Dot and Line plots,
Quantile plot, Quantile-Quantile plot, Bar and Pie charts, His-
tograms, Data maps, Scatter plots and data correlation.
7-8 Measuring Data Similarity and Dissimilarity: Data Matrix T T
vs Dissimilarity Matrix; Dissimilarity of numeric data: Eu-
clidean, Manhattan and Minkowski distances; Proximity mea-
sures for nominal, binary and ordinal attributes; Dissimilarity
for attributes of mixed types; Cosine similarity.
9-10 Mathematical and Statistical Analysis: Linear Algebra: Ma- T T
trix operations, Eigenvalues and Eigenvectors; Scores and
Rankings; Probability, Probability distributions: Binomial,
Normal, Poisson; Statistical tests for significance; Bayesian
reasoning.
11-12 Data Quality: Basic concepts of data accuracy, completeness, T R
consistency, timeliness, believability and interpretability; Ma-
jor tasks and challenges in data preprocessing.
13-14 Data Cleaning: Collection process of data: Hunting, Scrap- T T
ing, Logging; Handling missing values and noisy data; Data
cleaning as a process; Crowdsourcing.

153
 Introduction to Data Science/3rd year 2nd semester 2024

15-17 Data Integration: Entity identification problem; Redundancy T R

and Correlation analysis: Chi-square correlation test, Correla-
tion Coefficient and Covariance to discover data correlation;
Tuple duplication, data value conflict detection and resolu-
tion.
18-20 Data Reduction: Dimensionality reduction: Wavelet Trans- T R
forms, Principal Component Analysis, Attribute Subset Selec-
tion; Numerosity Reduction: Parametric and Non-parametric
data reduction techniques, Sampling, Data Cube Aggregation;
Data Compression.
21-23 Data Transformation: Transformation by normalization: T R
Min-Max, z-score and decimal scaling; Discretization by bin-
ning, histogram analysis, cluster, decision tree and correlation
analysis; Concept hierarchy generation for nominal data.
24-28 Learning from Data: Supervised Learning: Basic concepts T R
of supervised learning; Classification methods: decision tree,
Bayesian classification, k-NN, logistic regression; Model eval-
uation and selection: accuracy, precision, recall, F-measure,
ROC-curves; Cross-validation, bootstrap; Ensemble Methods:
bagging, boosting, random forests; Basic concepts of linear
and non-linear regression; Unsupervised Learning: Basic con-
cepts of unsupervised learning; Clustering methods: parti-
tioning methods: k-Means, k-Medoids; Hierarchical methods:
agglomerative, divisive; Density-based methods: DBSCAN,
OPTICS; Evaluation of Clustering; Outlier detection methods.

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE3211 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

154
 Introduction to Data Science Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3212 Introduction to Data Science Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3212
Course Title Introduction to Data Science Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Experiment Lists: 1. Measuring basic statistical description of data such as mean, median, mode, quantile
and standard deviation. 2. Visualizing data with different methods such as boxplots, dot and line plots,
quantile plot, quantile-quantile plot, bar and pie charts, histograms, data maps, scatter plots. 3. Measur-
ing Data Similarity and Dissimilarity with different methods such as Data Matrix vs Dissimilarity Matrix;
Dissimilarity of numeric data: Euclidean, Manhattan and Minkowski distances; Proximity measures for
nominal, binary and ordinal attributes; Dissimilarity for attributes of mixed types; Cosine similarity. 4.
Perform data collection and cleaning: Collection process of data: Hunting, Scraping, Logging; Handling
missing values and noisy data; Crowdsourcing. 5. Perform Data Integration: Redundancy and Correlation
analysis: Chi-square correlation test, Correlation Coefficient and Covariance to discover data correlation.
6. Perform Data Reduction: Dimensionality reduction: Wavelet Transforms, Principal Component Anal-
ysis, Attribute Subset Selection; Numerosity Reduction: Parametric and Non-parametric data reduction
techniques, Data Compression. 7. Perform Data Transformation: Transformation by normalization: Min-
Max, z-score and decimal scaling; Discretization by binning, histogram analysis. 8. Design and Implement
some methods for supervised learning from data: Classification methods- decision tree, Bayesian classifi-
cation, k-NN, logistic regression. Model evaluation and selection: accuracy, precision, recall, F-measure;
Cross-validation and bootstrap. 9. Design and Implement some methods for unsupervised learning from
data: Clustering methods- partitioning methods: k-Means, k-Medoids; Hierarchical methods, Density-
based methods; Outlier detection methods.
Programming Language: C/C++/Java/Python/R

3 Text and Reference Materials

T Textbook:

– Steven S. Skiena, The Data Science Design Manual, 1st Editions, Springer Publications, 2017.
– Jiawei Han, Jian Pei, H. Tong, Data Mining: Concepts and Techniques, 4th Edition, Morgan
Kaufmann Publishers, Elsevier., 2006.

155
 Introduction to Data Science Lab/3rd year 2nd semester 2024

R References:

– Dirk P. Kroese, Zdravko I. Botev, Thomas Taimre, Radislav Vaisman, Data Science and Machine
Learning: Mathematical and Statistical Methods, 2nd Edition, Morgan Kaufmann Publishers,
Elsevier., 2006.
– Charu C. AggarWal, Data Mining: The Textbook, 2nd Edition, Springer Publications, 2015.

Course Teacher, CSE3212 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

156
 Bioinformatics/3rd Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3213 Bioinformatics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd Year 2nd Semester 2024
Course Code CSE 3213
Course Title Bioinformatics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 2203

2 Syllabus
The course will cover fundamentals of algorithms, statistics, and mathematics as applied to biological
▲

problems. In particular, emphasis will be given to biological problem modeling and understanding the
algorithms and mathematical procedures. Practical implementation of the algorithms is taught with small
sized synthetic examples. Topics to be covered are: fragment analysis, genome rearrangement, sequence
similarity, restriction mapping, pattern search and statistical learning, molecular evolution and phyloge-
netics, functional genomics and systems level analysis.

3 Course Rationale
The aim of the course is to provide students with basic knowledge to develop and implement algorithm
related to biological problem so that student understand the true nature of the complexity of biological
problem

4 Text and Reference Materials

T Textbook:

– P A Pevzner et, Computational Molecular Biology, An Algorithmic Approach, 3rd Edition,

MIT Press, 2000.

R References:

– N C Jones and P A Pevzner, Introduction to Bioinformatics Algorithm, First Edition, McGraw

Hill, 2004.

157
 Bioinformatics/3rd Year 2nd Semester 2024

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the biological basics of genome
reconstruction, genome rearrangement, Cognitive
CO1 PO1 20%
fragment analysis, phylogenetic analysis, (C2)
sequence similarity and clustering.
Understand the algorithmic formulation of
Cognitive
CO2 problem related to biological topics men- PO2 30%
(C3)
tioned.
Analysis related algorithms to understand
cognitive
CO3 the suitability of different algorithm in dif- PO4 30%
(C4)
ferent context.
Compare and contrast different solutions Affective
CO4 PO10 20%
and find new solution if possible (A4)

6 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 CO4 Total

Final Exam 5% 20% 20% 15% 60%
Mid Term Exam 10% 5% 5% 20%
Class Test/Quizz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 20% 30% 30% 20% 100%

7 Topic Outline

Lecture Selected Topic Reading Exercise

1-2 Introduction to Molecular Biology T TR
3-5 Genome reconstruction and fragment analysis T TR
6-8 Restriction mapping T TR
9-11 Genome rearrangement T TR
12-17 Sequence similarity search T TR
18-19 Phylogenetic tree construction T TR
20-22 Combinatorial Pattern matching T TR
23-25 RNA secondary structure prediction T TR
26-28 DNA data Clustering T TR
29-30 Gene finding in genomic data T TR

158
 Bioinformatics/3rd Year 2nd Semester 2024

Course Teacher, CSE 3213 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

159
 Bioinformatics Lab/3rd Year 2nd semester

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3214 Bioinformatics Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd Year 2nd semester
Course Code CSE 3214
Course Title Bioinformatics Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 2203

2 Syllabus
The introduction to Bioinformatics Lab is designed to provide students with hands-on experience in ap-
▲

plying algorithmic solution to biological problems. Problems on different topics covered in the theoret-
ical part including fragment analysis, genome rearrangement, sequence similarity, restriction mapping,
pattern search and statistical learning, molecular evolution and phylogenetics, functional genomics and
systems level analysis will be furnished for the lab. By engaging in coding exercises with synthetic and
real life data students will develop fundamental understanding of biological problems and learn the ways
to solve them computationally.

3 Course Rationale
The aim of the course is to challenge students with to develop and implement algorithm related to biolog-
ical problem so that student understand the true nature of the complexity of biological problem and gain
understanding of the topics covered in the theoretical course.

4 Text and Reference Materials

T Textbook:

– P A Pevzner et, Computational Molecular Biology, An Algorithmic Approach, 3rd Edition,

MIT Press, 2000.

R References:

– N C Jones and P A Pevzner, Introduction to Bioinformatics Algorithm, First Edition, McGraw

Hill, 2004.

160
 Bioinformatics Lab/3rd Year 2nd semester

5 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Select biological problems related to
genome analysis, restriction mapping and Cognitive
CO1 PO1 30%
motif finding and design search, greedy and (C2)
graph algorithms to solve them
Select biological problems related to lo-
cal and global alignment, secondary struc-
Cognitive
CO2 ture prediction, gene prediction and design PO2 30%
(C3)
dynamic programming algorithms to solve
them
Select biological problems related to heuris-
tic similarity, sampling, clustering and de-
cognitive
CO3 sign combinatorial pattern matching, ran- PO4 40%
(C4)
domized and different clustering algorithms
to solve them

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

6 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Reports 5% 5% 10%
Lab Viva-Voce 15% 20%
Capstone Project or Demo/Presentation 15% 15% 5% 30%
Total 30% 30% 40% 100%

7 Lab Activity Outline

Week Experiment Title CO Activities

1 Familiarize students with general algorithm and complexity. CO1 Coding and Report
Writing
2 Solving problems with genome analysis specially with frag- CO1 Coding and Report
ment assembly. Writing
3 Solving restriction mapping specially the partial digest prob- CO1 Coding and Report
lem. Writing
4 Solving phylogenetics tree construction using UPGMA CO2 Coding and Report
Writing
5 Solving motif finding problem with combinatorial pattern CO2 Coding and Report
matching algorithm Writing

161
 Bioinformatics Lab/3rd Year 2nd semester

6 Solving secondary structure prediction problem using Nussi- CO2 Coding and Report
nov Algorithm. Writing
7 Solving clustering problem using agglomerative algorithm. CO1 Coding and Report
Writing
8 Solving genome rearrangement problem CO3 Coding and Report
Writing
9 Solving gene finding problem using hidden Markov tool. CO3 Codingand Report
Writing
10 Solving gene regulatory network problem CO2 Coding and Report
Writing
11 Solving global sequence similarity search problem CO2 Coding and Report
Writing
12 Solving local sequence similarity search problem CO3 Coding and Report
Writing
13-14 Design, development, demonstration, and defending a small CO3 Coding and Report
project based on self chosen topic in a group of two Writing

Course Teacher, CSE 3101 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

162
 Mobile Application Development/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3215 Mobile Application Development

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3215
Course Title Mobile Application Development
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3101 Software Engineering

2 Syllabus
▲

Overview of Mobile Computing: Dimensions of Mobile Computing, Discussion on Popular Mobile Ap-
plications, Centralized Frameworks: Fully Centralized Frameworks, Android Architecture, XML and UI
Development: Introduction to XML, Key XML Technologies for Mobile Computing, Android Layouts,
User Interface Development using XML, App Development Tips & Web Content, Android Activity Lifecy-
cle, Android Core Components, Development Environment: Android Development Environment Setup,
Android Process, Connectivity and Services: Introduction to Wireless Connectivity, Quality of Service in
Mobile Networks, Wireless Networking Technologies, Mobile IP, SMS, and Mobile Cloud Computing, Pre-
requisites and Challenges in Mobile Cloud Computing, Energy and Resource Management: Energy Anal-
ysis for Computing Offloading, Wireless Application Protocols: Wireless Application Protocol (WAP),
WAP Protocol Stack, I-mode, WAP Gateway, Push Message, Push Architecture, Push Message Types and
Formats, Pull Methodology, Sensor Framework and Applications: Android Sensor Framework, Hardware
and Software Sensors, Sensor Types and their Responsibilities, User Interface Design: Introduction to
User Interface, Validating Mobile Use Cases before Development, Key Points for UI Development, Soft-
ware Testing and Quality Assurance: The Effects of Software Testing.

3 Text and Reference Materials

T Textbook:

– Reza B’Far, Mobile Computing Principles, 4th Edition, Cambridge University Press, 2005.

R References:

– Bryan Sills, Brian Gardner, Kristin Marsicano, Chris Stewart, Android Programming: The Big
Nerd Ranch Guide, 5th Edition, Addison-Wesley Professional, 2022.
– Dawn Griffiths, David Griffiths, Head First Android Development, 3rd Edition, O’Reilly Media,
Inc., 2021.

163
 Mobile Application Development/3rd year 2nd semester 2024

Course Teacher, CSE 3215 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

164
 Mobile Application Development Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3216 Mobile Application Development Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3216
Course Title Mobile Application Development Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Introduction to Android Studio: Installation of Android Studio, setting up the environment, exploring
basic features; Working with XML and Layouts: Create and manipulate user interfaces using XML, Im-
plementing different Android layouts; Android Fundamentals: Understand fundamental Android com-
ponents and their lifecycle, Referencing and Event Listener, Android Intent, Activity Lifecycle, Fragments;
Application Development: Design and develop a basic calculator application, Planning, designing UI,
coding basic operations, implementing functionalities; Advanced Android Features: Implementation of
Broadcast intent and Broadcast receiver, Implementing SQLite Databases, Integrating REST API and map
into applications; Integrating Online Services: Using Firebase for authentication and database manage-
ment along with other cloud based API integrations.

3 Text and Reference Materials

T Textbook:
– Reza B’Far, Mobile Computing Principles, 4th Edition, Cambridge University Press, 2005.
R References:
– Bryan Sills, Brian Gardner, Kristin Marsicano, Chris Stewart, Android Programming: The Big
Nerd Ranch Guide, 5th Edition, Addison-Wesley Professional, 2022.
– Dawn Griffiths, David Griffiths, Head First Android Development, 3rd Edition, O’Reilly Media,
Inc., 2021.

Course Teacher, CSE 3216 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

165
 Simulation and Modeling/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3217 Simulation and Modeling

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3217
Course Title Simulation and Modeling
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

System Models: The concepts of a system, system environment, stochastic activities, continuous and dis-
crete systems, system modeling, types of models, static and dynamic physical models, static and dynamic
mathematical models, and principles used in modeling. System Studies: Subsystems; Major segments of a
corporate model: Environment, production, management; Types of system study; System analysis, design
and postulation. System Simulation: The technique of simulation, the Monte Carlo method, compari-
son of simulation and analytical methods, experimental nature of simulation, types of system simulation,
numerical computation technique for continuous and discrete models, distributed lag models, Cobweb
models, progress of a simulation study. Continuous System Simulation: Continuous system models, dif-
ferential equations, analog methods, digital-analog simulators, continuous system simulation languages,
hybrid simulation, feedback systems, simulation of an autopilot, interactive and real-time systems. System
Dynamics: Historical background, exponential growth and decay models, modified exponential growth
models, logistic curves, generation of growth models, system dynamics diagrams, multi-segment mod-
els, representation of time delays, feedback in socio-economic system, examples of real-life. Probability
concepts in simulation: Stochastic variables, discrete and continuous probability functions, measures of
probability functions, numerical evaluation of continuous probability functions, continuous uniformly
distributed random numbers, computer generation of random numbers, a uniform random number gen-
erator, generating discrete distributions, non-uniform continuously distributed random numbers, the re-
jection method. Arrival Patterns and Service Times: Congestion in Systems, arrival Patterns, Poisson
arrival patterns, Exponential distribution, coefficient of variation, Erlang distribution, Hyper-Exponential
distribution, service times, Normal distribution, queuing disciplines, measures of queues, mathematical
solutions of queuing problems, utilization as a design factor, grade of service. Discrete System Simu-
lation: Discrete events, representation of time, generation of arrival patterns, simulation of a telephone
system, delayed calls, simulation programming tasks, gathering statistics, counters and summary statis-
tics, measuring utilization and occupancy, recording distributions and transit times, discrete simulation
languages. Inventory Control and Cost-Effective Models: Finite/infinite delivery rate with backorder-
ing/without backordering, probabilistic inventory model, cost-effectiveness study, life-cycle cost study of
an aircraft system.

166
 Simulation and Modeling/3rd year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Geoffrey Gordon, System Simulation, 2nd Edition, Prentice Hall, 1977.

R References:

– V.P. Singh, System Modeling and Simulation, 1st Edition, New Age International Publisher,
2009.
– Deo Narsingh, System Simulation with Digital Computer, 1st Edition, PHI Publisher, 2011.

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 System Models: The concepts of a system, system environ- T T
ment, stochastic activities, continuous and discrete systems,
system modeling, types of models, static and dynamic phys-
ical models, static and dynamic mathematical models, and
principles used in modeling.
3-4 System Studies: Subsystems; Major segments of a corporate T T
model: Environment, production, management; Types of sys-
tem study; System analysis, design and postulation.
5-8 System Simulation: The technique of simulation, the Monte T T
Carlo method, comparison of simulation and analytical meth-
ods, experimental nature of simulation, types of system simu-
lation, numerical computation technique for continuous and
discrete models, distributed lag models, Cobweb models,
progress of a simulation study.
9-11 Continuous System Simulation: Continuous system models, T T
differential equations, analog methods, digital-analog simula-
tors, continuous system simulation languages, hybrid simula-
tion, feedback systems, simulation of an autopilot, interactive
and real-time systems.
12-14 System Dynamics: Historical background, exponential T T
growth and decay models, modified exponential growth mod-
els, logistic curves, generation of growth models, system dy-
namics diagrams, multi-segment models, representation of
time delays, feedback in socio-economic system, examples of
real-life.
15-19 Probability concepts in simulation: Stochastic variables, dis- T R
crete and continuous probability functions, measures of prob-
ability functions, numerical evaluation of continuous prob-
ability functions, continuous uniformly distributed random
numbers, computer generation of random numbers, a uniform
random number generator, generating discrete distributions,
non-uniform continuously distributed random numbers, the
rejection method.
20-22 Arrival Patterns and Service Times: Congestion in Systems, T R
arrival Patterns, Poisson arrival patterns, Exponential distri-
bution, coefficient of variation, Erlang distribution, Hyper-
Exponential distribution, service times, Normal distribution,
queuing disciplines, measures of queues, mathematical solu-
tions of queuing problems, utilization as a design factor, grade
of service.

167
 Simulation and Modeling/3rd year 2nd semester 2024

23-26 Discrete System Simulation: Discrete events, representation T R

of time, generation of arrival patterns, simulation of a tele-
phone system, delayed calls, simulation programming tasks,
gathering statistics, counters and summary statistics, mea-
suring utilization and occupancy, recording distributions and
transit times, discrete simulation languages.
27-28 Inventory Control and Cost-Effective Models: Finite/infinite T R
delivery rate with backordering/without backordering, prob-
abilistic inventory model, cost-effectiveness study, life-cycle
cost study of an aircraft system.

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE3217 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

168
 Simulation and Modeling Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 3218 Simulation and Modeling Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3218
Course Title Simulation and Modeling Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Experiment Lists: 1. Designing small system models: static and dynamic physical models, static and
dynamic mathematical models. 2. Implement system simulation techniques: Monte Carlo method, Dis-
tributed lag models, Cobweb models. 3. Designing a Continuous System Simulation: simulation of an
autopilot. 4. Design and Implement System Dynamics: Exponential growth and decay models, modified
exponential growth models, logistic curves, generation of growth models, representation of time delays. 5.
Simulation of Arrival Patterns and Service Times: Congestion in Systems, arrival Patterns, Poisson arrival
patterns and Exponential distribution; Service times, Normal distribution, queuing disciplines, measures
of queues, grade of service. 6. Designing a Discrete System Simulation: simulation of a telephone system.
7. Designing Inventory Control and Cost-Effective Models: Finite/infinite delivery rate with backorder-
ing/without backordering, life-cycle cost study of an aircraft system.
Programming Language: Python/R/MATLAB/SIMSCRIPT

3 Text and Reference Materials

Look into the textbook and references in CSE 3217 Simulation and Modeling course.

TBA
Course Teacher, CSE 3218 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

169
 Computer Graphics/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE-3219 Computer Graphics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE-3219
Course Title Computer Graphics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 2209 - Numerical Methods

2 Syllabus
▲

Introduction: Definition and applications of computer graphics. Display system: Raster graphic and vec-
tor graphic display system. Graphics hardware: Frame-buffer, Video-controller. Basics of line drawing:
Line drawing algorithm: DDA Algorithm. Derivation of initial decision variable and its derivative, algo-
rithm and simulation of (i) Bresenham’s/Mid-point Line drawing algorithm, (ii) Mid-point Circle drawing
algorithm and (iii) Mid-point Ellipse drawing algorithm. Line Clipping Algorithms: (i) Cohen Suther-
land line clipping algorithm, (ii) Cyrus Beak line clipping algorithm. Polygon Filling Algorithm: Types of
polygons, Scan-line algorithm, Edge Table (ET) and Active edge table (AET). Polygon Clipping algorithm:
Sutherland-Hodgman Polygon Clipping algorithm. Motion/Transformations: Classifications, Coordinate
system. Mathematics of transformation. 3D rotation matrix, translation, scaling and reflection. View-
ing in 3D (Projection): Classification, Mathematics of projection. Simple perspective projection matrices.
General-purpose projection matrices and its simplification. Visible Surface Determination: Z-buffering
algorithm, Visible surface Ray-tracing algorithm. Color Model of Light: Monochrome color, Comparison
between additive and subtractive color. RGB color model and CMY color model. HSV and HLS color
model. HSV color model. Illumination and Shading: Illumination model. Local light model: Ambi-
ent, diffuse light/reflection model. Specular reflection model. Phong’s illumination model. Flat/Constant
shading, interpolated/smooth shading. Phong-shading vs Gouraud-shading. Parametric Curves and Sur-
faces: Standard equation of Cubic Polynomial, Types of curves. Continuity of curve segments. Derivation
of basis matrix and blending functions of (i)Hermite curve, (ii)Bezier curve, Subdivision of curves, spline
and bi-cubic surfaces

3 Text and Reference Materials

T Textbook:
– Computer Graphics Principle and Practice, by Foley.
R References:
– Online resources from internet

170
 Computer Graphics/3rd year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction: Definition and applications of computer graph- T T
ics. Display system: Raster graphic and vector graphic
display system. Graphics hardware: Frame-buffer, Video-
controller.
3 Basics of line drawing: Line drawing algorithm: DDA Algo- T T
rithm.
4-6 Derivation of initial decision variable and its derivative, algo- T T
rithm and simulation of Mid-point/Bresenham’s Line draw-
ing algorithm, (Also slope independent line)
7-8 Derivation of initial decision variable and its derivative, algo- T T
rithm and simulation of Mid-point Circle drawing algorithm
9-10 Derivation of initial decision variable and its derivative, al- T T
gorithm and simulation of Mid-point Ellipse drawing algo-
rithm
11-13 Line Clipping Algorithms: Cohen-Sutherland line clipping T R
algorithm, Cyrus- Beak line clipping algorithm.
14-15 Polygon Filling Algorithm: Types of polygons, Scan-line al- T T
gorithm, Edge Table (ET) and Active edge table (AET).
16 Polygon Clipping algorithm: Sutherland-Hodgman Polygon T R
Clipping algorithm.
17-18 Motion/Transformations: Classifications, Coordinate system. T R
Mathematics of transformation. 3D rotation matrix, transla-
tion, scaling and reflection.
19-20 Viewing in 3D (Projection): Classification, Mathematics of T R
projection. Simple perspective projection matrices. General-
purpose projection matrices and its simplification.
21 Visible Surface Determination: Z-buffering algorithm, Visi- T R
ble surface Ray-tracing algorithm.
22-23 Color Model of Light: Monochrome color, Comparison be- T R
tween additive and subtractive color. RGB color model and
CMY color model. HSV and HLS color model. HSV color
model.
24-26 Illumination and Shading: Illumination model. Local light T R
model: Ambient, diffuse light/reflection model. Specular re-
flection model. Phong’s illumination model. Flat/Constant
shading, interpolated/smooth shading. Phong-shading vs
Gouraud-shading.
27-28 Parametric Curves and Surfaces: Standard equation of Cubic T R
Polynomial, Types of curves. Continuity of curve segments.
Derivation of basis matrix and blending functions of Hermite
curve, Bezier curve, Subdivision of curves, spline and bi-cubic
surfaces.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE4230 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

171
 Computer Graphics Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3220 Computer Graphics Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3220
Course Title Computer Graphics Lab
Course Credit 1.5 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
The CSE 3220 Computer Graphics Lab course offers hands-on experience in key computer graphics con-
▲

cepts, where students will learn to program graphical algorithms both directly and using OpenGL. The lab
exercises include implementing line drawing, polygon filling, and clipping algorithms, as well as transfor-
mations and rendering techniques. Students will also explore parametric curves and surfaces, program-
ming these elements manually and then utilizing OpenGL to understand the differences in implementation
and outcomes. This dual approach ensures a deep understanding of both the underlying principles and
their practical applications in modern graphics programming.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

Course Teacher, CSE 3220 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

172
 Wireless Networks/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3221 Wireless Networks

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3221
Course Title Wireless Networks
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 2109 -Data and Telcommunication

2 Syllabus
Introduction to Wireless Networks: Introduction to wireless network architectures: cellular and mobile
▲

networks, wireless local area networks, multi-hop adhoc networks; Principles of Wireless Communica-
tion: Radio propagation modeling, the performance of digital modulation schemes and coding techniques
in fading environments, Multipath Fading, Noise and Interference Mitigation, CDMA and OFDMA, chan-
nel diversity and MIMO, Cognitive Radio Networks; Medium Access Control: Unslotted and Slotted-
ALOHA protocols, System throughput analysis, IEEE 802.11a/b/g/e/i/ac CSMA/CA protocols, CSMA/CA
with RTS/CRS; Multiobjective Channel Allocation: Channel allocation for both protocol and SINR inter-
ference models. Power Optimization, throughput maximization, and fairness; Fundamentals of Wire-
less Network Routing: The AODV and OLSR protocols for mobile ad-hoc networks, Link estimation and
neighbor management; Geographic Routing: Geographic routing: greedy routing, routing holes, Routing
in intermittently connected mobile networks. Opportunistic routing and Cooperative Routing: Energy-
efficient and Delay-driven opportunistic routing (OR), Cooperative Routing for high throughput and relia-
bility; Congestion Control in Wireless Networks: TCP over wireless networks. Congestion sharing (IFRC,
WCAP). Centralized and distributed explicit and precise rate control (RCRT, WRCP), Optimization-based
rate control with Lagrange duality and queue backpressure; Emerging Wireless Network Technologies
and Standards: Wi-Fi 6, Wi-Fi 6E, Wi-Fi 7, Wireless Personal Area Network - WPAN IEEE 802.15.1/3/4
(Bluetooth, Zigbee), WMAN - IEEE 802.16a (Wi-Max), LTE, 3GPP, Mi-Fi, Ly-Fi; Security in Wireless Net-
works: Wireless Encryption Protocol, Wi-Fi Protected Access Control 3 (WPA3) and its predecessors, Man-
aging Wi-Fi with Digital Certificates, Opportunistic Wireless Encryption (OWE).

3 Text and Reference Materials

T Textbook:

– William Stallings, Wireless Communications and Networks, Second Edition, Pearson Publica-
tions, 2020.
– Matthew Gast, 802.11 Wireless Networks: The Definitive Guide, Second Edition, O’reilly,
2013.

173
 Wireless Networks/3rd year 2nd semester 2024

R References:

– Jennifer Minella, Wireless Security Architecture: Designing and Maintaining Secure Wireless
for Enterprise, First Edition, Wiley Publications, 2022.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Identify architecture, applications, and op-
Cognitive
CO1 eration principles of cellular, WLAN, and PO1 40%
(C2)
various adhoc networks.
Analyze various medium access and re-
source allocation techniques such as power
control for fixed-rate and rate-adaptive Please refer
Cognitive
CO2 systems, Aloha and CSMA based ran- PO2 50% to Section 5.
(C3)
domized medium access, scheduling for
TDMA/FDMA/CDMA-based wireless net-
works
Select appropriate network, transport, and
application layer protocols for a given wire- Cognitive
CO3 PO3 10%
less network with specific design considera- (C5)
tions.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 50%
Midterm Exam 15% 10% 25%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 10% 10%
Class Participation 5% 5%
Total 40% 45% 15% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • Introduction to Wireless Networks: Wire-
less network architectures- cellular and mobile networks,
wireless local area networks, multi-hop adhoc networks;

174
 Wireless Networks/3rd year 2nd semester 2024

3-4 Principles of Wireless Communication: Radio propagation T T

modeling, the performance of digital modulation schemes and
coding techniques in fading environments, • Multipath Fad-
ing, Noise and Interference Mitigation, CDMA and OFDMA,
channel diversity and MIMO;
5-7 Medium Access Control: Unslotted and Slotted- T T
ALOHA protocols, System throughput analysis, • VIEEE
802.11a/b/g/e/i/ac CSMA/CA protocols, CSMA/CA with
RTS/CRS;
8-10 Multiobjective Channel Allocation: Channel allocation for T T
both protocol and SINR interference models, • Power Opti-
mization, throughput maximization, and fairness;
11-12 Fundamentals of Wireless Network Routing: The AODV and T T
OLSR protocols for mobile ad-hoc networksm, Link estima-
tion and neighbor management; • Geographic Routing: Ge-
ographic routing: greedy routing, routing holes, Routing in
intermittently connected mobile networks.
13-14 Opportunistic routing and Cooperative Routing: Energy- T T
efficient and Delay-driven opportunistic routing (OR), Coop-
erative Routing for high throughput reliability; ;
15-17 Congestion Control in Wireless Networks: TCP over wire- T T
less networks. Congestion sharing (IFRC, WCAP), • Central-
ized and distributed explicit and precise rate control (RCRT,
WRCP), • Optimization-based rate control with Lagrange du-
ality and queue backpressure;
18-22 Emerging Wireless Network Technologies and Standards: T R
Wi-Fi 6, Wi-Fi 6E, Wi-Fi 7, • Wireless Personal Area Network
- WPAN IEEE 802.15.1/3/4 (Bluetooth, Zigbee), • WMAN -
IEEE 802.16a (Wi-Max), LTE, 3GPP, Mi-Fi, Ly-Fi;
23-26 Security in Wireless Networks: Wireless Encryption Proto- T T
col, Wi-Fi Protected Access Control 3 (WPA3) and its prede-
cessors, • Managing Wi-Fi with Digital Certificates, Oppor-
tunistic Wireless Encryption (OWE);
27-28 Reviews, Future of Wireless Networks and its Challenges, • T R
Problem-solving practices, • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Prof. Dr. Md. Mustafizur Rahman Prof. Dr. Md. Abdur Razzaque
Course Teacher, CSE 3221 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

175
 Wireless Networks/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 3222 Wireless Networks Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 3222
Course Title Wireless Networks
Course Credit 1.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 2109 -Data and Telcommunication

2 Syllabus
Performance Analysis of wireless MAC protocols: IEEE 802.11a/b/g/e/i/ac CSMA/CA protocols, CSMA/CA
▲

with RTS/CRS; Performance Analysis of Multiobjective Channel Allocation techniques: Power, through-
put, delay and fairness performances; Analysis of Wireless Network Routing protocols: The AODV and
OLSR protocols and their variants; Geographic, Opportunistic and Cooperative Routing. Performances of
Congestion Control algorithms in Wireless Networks: IFRC, WCAP, backpressure and rate control algo-
rithms. Implementation and Analysis of advanced protocols: Wi-Fi 6, Wi-Fi 6E, Wi-Fi 7, WPAN IEEE
802.15.1/3/4. Security testing in Wireless Networks: Configuration and administration of WPA3 and its
predecessors, Managing Wi-Fi with Digital Certificates, Opportunistic Wireless Encryption (OWE).

3 Text and Reference Materials

T Textbook:

– William Stallings, Wireless Communications and Networks, Second Edition, Pearson Publica-
tions, 2020.
– Matthew Gast, 802.11 Wireless Networks: The Definitive Guide, Second Edition, O’reilly,
2013.

R References:

– Jennifer Minella, Wireless Security Architecture: Designing and Maintaining Secure Wireless
for Enterprise, First Edition, Wiley Publications, 2022.

Course Teacher, CSE 3222 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

176
17.3.2 Elective II

177
 Deep Neural Networks/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4211 Deep Neural Networks

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4211
Course Title Deep Neural Networks
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 4101 Machine Learning

2 Syllabus
Introduction to Neural Networks: This segment explores the foundations of neural networks including
▲

the McCulloch-Pitts (MP) Neuron, Hebbian Learning, The Perceptron as building blocks, Multilayer Per-
ceptrons (MLPs), and Feedforward Neural Networks. Focuses on Activation Functions (Sigmoid, Tanh,
ReLU) and Loss functions (Mean Squared Error, Cross-Entropy). Deep Learning Fundamentals: Covers
Backpropagation as the core training algorithm, Gradient Descent and Optimization techniques such as
SGD, Momentum, and Adam, along with Vanishing/Exploding Gradients and Regularization Techniques
(Dropout, L1/L2 regularization). Hyperparameter Tuning and Best Practices: Discusses strategies for
hyperparameter optimization including grid search, random search, and Bayesian optimization, address-
ing overfitting and underfitting, data augmentation techniques, Compute Unified Device Architecture
(CUDA), deep learning frameworks utilizing CUDA, and visualization tools such as TensorBoard. Convo-
lutional Neural Networks and YOLO: Details on Convolutional Layers and Filters, Pooling Layers (Max
Pooling, Average Pooling), CNN Architectures for Image Classification (LeNet, AlexNet, VGG, ResNet),
Object Detection with YOLO, YOLO architecture (bounding boxes, grid cells, confidence scores), variations
(YOLOv2, YOLOv3, etc.), Loss function in YOLO, and Applications of YOLO. Recurrent Neural Networks:
Explores RNN Architectures and Sequence Data, Long Short-Term Memory Networks (LSTMs), Gated Re-
current Units (GRUs), and applications in Natural Language Processing, time series analysis. Transform-
ers: Investigates Attention Mechanisms as the core concept behind transformers, Self-Attention and its ap-
plications, Multi-Head Attention for richer feature extraction, Transformer Architecture: Encoder-decoder
structure and its variants, with applications in Text Generation, Machine Translation, Text Summariza-
tion, Question Answering, and more recent advancements like Vision Transformers. Diffusion Models:
Discusses the Principles of Diffusion for Image Generation, the iterative denoising process, understanding
noise schedules, Denoising Diffusion Probabilistic Models (DDPMs), architecture and training process,
applications of Diffusion Models in Text-to-Image Generation (DALL-E, Imagen, Stable Diffusion), Im-
age Super-resolution, other emerging applications, and comparisons with other generative models such as
Generative Adversarial Networks (GANs). Graph Neural Networks: Covers the basics of graph theory and
key concepts in GNNs including node embedding, edge embedding, graph and sub-graph embedding and
message passing, Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), and appli-
cations in social network analysis, chemical structure prediction, and recommendation systems.

178
 Deep Neural Networks/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– John D. Kelleher, Deep Learning, First Edition, MIT Press, 2019.

R References:

– Ian Goodfellow and Yoshua Bengio and Aaron Courville, Deep Learning, First Edition, MIT Press,
2016.
– Eli Stevens, Luca Antiga, and Thomas Viehmann, Deep Learning with PyTorch , First Edition,
Manning, 2020.

4 Topic Outline

Lecture Selected Topic Article Problems

1-3 Introduction to Neural Networks: The McCulloch-Pitts (MP) T T
Neuron, Hebbian Learning, The Perceptron - the building
blocks, Multilayer Perceptrons (MLPs) and Feedforward Neu-
ral Networks, Activation Functions (Sigmoid, Tanh, ReLU),
Loss functions (Mean Squared Error, Cross-Entropy)
4-7 Deep Learning Fundamentals: Backpropagation: The core T T
training algorithm, Gradient Descent and Optimization (SGD,
Momentum, Adam), Vanishing/Exploding Gradients, Regu-
larization Techniques (Dropout, L1/L2 regularization)
8-10 Hyperparameter Tuning and Best Practices: Strategies for T T
Hyperparameter optimization (grid search, random search,
Bayesian optimization), Dealing with overfitting and under-
fitting, Data augmentation techniques, Compute Unified De-
vice Architecture (CUDA), Deep Learning frameworks utiliz-
ing CUDA, Visualization tools for understanding neural net-
works (TensorBoard)
11-15 Convolutional Neural Networks and YOLO: Convolutional T T
Layers and Filters, Pooling Layers (Max Pooling, Average
Pooling), CNN Architectures for Image Classification (LeNet,
AlexNet, VGG, ResNet), Object Detection with YOLO, YOLO
architecture (bounding boxes, grid cells, confidence scores),
Variations (YOLOv2, YOLOv3, etc.), Loss function in YOLO,
Applications of YOLO
16-18 Recurrent Neural Networks: RNN Architectures and Se- T T
quence Data, Long Short-Term Memory Networks (LSTMs),
Gated Recurrent Units (GRUs), Applications: Natural Lan-
guage Processing, time series analysis
19-22 Transformers: Attention Mechanisms: The core concept be- T T
hind transformers, Self-Attention and its applications, Multi-
Head Attention for richer feature extraction, Transformer Ar-
chitecture: Encoder-decoder structure and its variants, Appli-
cations of Transformers: Text Generation, Machine Transla-
tion, Text Summarization, Question Answering, and more re-
cent advancements (e.g., Vision Transformers)

179
 Deep Neural Networks/4th year 2nd semester 2024

23-25 Diffusion Models: Principles of Diffusion for Image Gen- T T

eration, The iterative denoising process, Understanding
noise schedules, Denoising Diffusion Probabilistic Models
(DDPMs), Architecture and training process, Applications of
Diffusion Models: Text-to-Image Generation (DALL-E, Ima-
gen, Stable Diffusion), Image Super-resolution, Other emerg-
ing applications, Compare Diffusion Models to other genera-
tive models such as Generative Adversarial Networks (GANs)
26-27 Graph Neural Networks: Basics of graph theory and key con- T T
cepts in GNNs, including node embedding and message pass-
ing. Graph Convolutional Networks (GCNs) and Graph Atten-
tion Networks (GATs), Applications in social network analysis,
chemical structure prediction, and recommendation systems

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4211 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

180
 Deep Neural Network Lab/3rd year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4212 Deep Neural Network Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd year 2nd semester 2024
Course Code CSE 4212
Course Title Deep Neural Network Lab
Course Credit 1 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
This laboratory course complements the theoretical knowledge gained in the Deep Neural Networks course
▲

by providing hands-on experience in the practical implementation and optimization of deep learning mod-
els. Students will engage with real-world datasets and utilize state-of-the-art deep learning frameworks
to develop, analyze, and refine neural network models across various applications. The lab projects are
designed to be innovative, practical, and potentially commercially viable, preparing students for future
technological challenges in the industry.

Prospective Lab Tasks Description

1. Introduction to Neural Networks Implementation:

■ Setup and training of basic MLPs using frameworks like TensorFlow or PyTorch.
■ Experimentation with different activation and loss functions on simple datasets.

2. Optimizing Deep Learning Models:

■ Implementing backpropagation manually on a small network.

■ Use of optimization techniques such as SGD, Momentum, and Adam in training models.
■ Handling vanishing and exploding gradients through practical experiments.

3. Hyperparameter Tuning and Regularization Techniques:

■ Application of grid search, random search, and Bayesian optimization methods to tune network
hyperparameters.
■ Implementing dropout and L1/L2 regularization to combat overfitting.
■ Experiments with data augmentation techniques to enhance model robustness.

4. Advanced Model Architectures:

■ Building and training Convolutional Neural Networks for image classification tasks.

181
 Deep Neural Network Lab/3rd year 2nd semester 2024

■ Implementing YOLO for object detection tasks with real-time data.

■ Developing RNNs, LSTMs, and GRUs for time series analysis and natural language processing
tasks.

5. Transformers and Advanced Applications:

■ Implementing Transformer models for tasks like text summarization, translation, and question
answering.
■ Exploration of recent advancements such as Vision Transformers.

6. Diffusion Models for Generative Tasks:

■ Implementing and training diffusion models for tasks like image generation and super-resolution.
■ Comparing the performance and applicability of diffusion models with other generative models
like GANs.

7. Graph Neural Networks:

■ Introduction to graph theory and implementation of Graph Neural Networks for social network
analysis and recommendation systems.

3 Text and Reference Materials

T Textbook:

– John D. Kelleher, Deep Learning, First Edition, MIT Press, 2019.

R References:

– Ian Goodfellow and Yoshua Bengio and Aaron Courville, Deep Learning, First Edition, MIT Press,
2016.
– Eli Stevens, Luca Antiga, and Thomas Viehmann, Deep Learning with PyTorch , First Edition,
Manning, 2020.

Course Teacher, CSE 4212 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

182
 Natural Language Processing/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4213 Natural Language Processing

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4213
Course Title Natural Language Processing
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 4101 Machine Learning

2 Syllabus
▲

Introduction to NLP and Regular Expressions: Overview of NLP and its applications. Detailed practice
with regular expressions for text preprocessing tasks. Text Normalization Techniques: Explore advanced
techniques for text normalization including word and sentence segmentation. Introduction to stemming.
String Operations and Minimum Edit Distance: Introduction to string comparison using the minimum
edit distance algorithm for error correction. Introduction to N-gram Language Models: Building and
applying N-gram models for word sequence prediction. Evaluating Language Models: Methods for eval-
uating language models, including performance metrics. Naive Bayes and Logistic Regression for Text
Classification: Recap on Naive Bayes and logistic regression classifiers. Discussion on regularization in
logistic regression. Vector Semantics and Word Embeddings: Introduction to vector semantics. Practical
use of Word2Vec and GloVe. Neural Networks and Neural Language Models: Review of neural network
basics and their application in NLP. Advanced Neural Network Models (RNNs, LSTMs, GRUs): Explor-
ing complex architectures for sequence modeling. Transformers and Their Impact on NLP: Introduction
to transformer architecture and self-attention mechanism. Introduction and Pre-training of Transformer
Models: Overview of transformer technology. Importance and methods of pre-training transformers on
large text corpora. Fine-Tuning Transformer Models: Process and strategies for fine-tuning pre-trained
models on specific NLP tasks. Deep Dive into BERT and Its Variants: Detailed exploration of BERT, its
architecture, training process, and variants like RoBERTa and ALBERT. Applications of Transformers in
NLP: Use of transformers in sophisticated NLP applications such as named entity recognition and machine
translation. Transformers in Machine Translation: Detailed discussion on the use of transformers in ma-
chine translation, focusing on the encoder-decoder framework. Exploring Large Language Models and
Their Impact: Discussion on the impact of large-scale transformer models like GPT-3 on various linguis-
tic tasks and their broader implications. Context-Free Grammars and Constituency Parsing: Introduce
context-free grammars and the CKY algorithm for parsing them. Discussion on formal definitions, gram-
mar normal forms, and the use of treebanks. Dependency Parsing: Introduction to dependency grammar
formalisms. Exploration of how syntactic structures are described using directed binary grammatical re-
lations. Semantic Analysis in NLP: Introduction to semantic analysis, covering semantic parsing and

183
 Natural Language Processing/4th year 2nd semester 2024

relation extraction. Practical techniques and tools used for extracting meaning from text. Dialogue Sys-
tems and Chatbots: Introduction to the construction and functioning of chatbots and dialogue systems.
Hands-on session on designing a simple chatbot using NLP principles.

3 Text and Reference Materials

T Textbook:

– Daniel Jurafsky and James H. Martin, Speech and Language Processing An Introduction to Nat-
ural Language Processing, Computational Linguistics, and Speech Recognition, Recent Edi-
tion, PEARSON.

R References:

– Chris Manning and Hinrich Schütze, Foundations of Statistical Natural Language Processing ,
Recent Edition, MIT Press.

Course Teacher, CSE 4213 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

184
 Natural Language Processing Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4214

Natural Language Processing Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4214
Course Title Natural Language Processing Lab
Course Credit 1 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
▲

The CSE 4214 Natural Language Processing Lab is structured to enhance hands-on practical experience,
complementing the theoretical content taught in the corresponding CSE 4213 Natural Language Process-
ing course. In this lab, students undertake programming assignments and projects focusing on core NLP
tasks such as tokenization, syntactic parsing, semantic analysis, machine translation, and sentiment anal-
ysis. Additionally, the lab incorporates cutting-edge content involving recent transformer-based models.
Students will apply these advanced techniques to real-world datasets, developing, training, and evaluat-
ing NLP models using contemporary machine learning tools and libraries. This approach ensures students
are well-prepared for both current applications and future developments in the rapidly evolving field of
natural language processing.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

Course Teacher, CSE 4224 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

185
 Data Mining/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4215 Data Mining

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4215
Course Title Data Mining
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Introduction: Basic concepts of Data Mining, different kinds of data and patterns can be mined, used
▲

technologies, targeted applications and major issues and applications of Data Mining. Mining Frequent
Itemsets: Definitions and background, Market basket analysis, Methods for mining frequent itemsets
(i) Apriori algorithm (mining frequent itemsets using candidate generation, improving the efficiency of
Apriori), (ii) FP-growth algorithm (mining frequent itemsets without candidate generation), (iii) Mining
frequent itemsets using vertical data format. Mining Association Rules and Correlation: Mining as-
sociation rules, generating association rules from frequent itemsets; Mining correlations from association
rules, significance of correlation mining in presence of association rules; Pattern evaluation methods, var-
ious correlation measures: lift, chi-square, all-conf, max-conf, cosine and Kulc; Performance and applica-
bility analysis of correlation measures. Mining Sequential Patterns: Concepts and primitives, applica-
tions, domains; Mining methods in transactional sequence databases (i) Apriori based approaches (GSP,
SPADE), (ii) Pattern growth based (PrefixSpan); Mining sequential patterns in biological databases, web
access databases and time series databases. Mining Dynamic Data and Data Streams: Basic ideas of min-
ing incremental and dynamic data, handling high speed stream data, different windowing techniques for
data streams such as tilted, decaying and sliding window. Mining Representative Patterns: Mining closed
and maximal frequent itemsets and sequences; Mining top-k, top-k redundancy aware, k-summarized pat-
terns; Mining compressed or approximate patterns by pattern clustering. Mining Subgraph Patterns:
Methods for mining frequent subgraphs (i) Apriori based approaches (AGM, FSG), (ii) Pattern growth
based (gSpan); Mining variant and constrained substructure patterns. Mining in Multilevel and Multi-
dimensional Spaces: Mining multilevel, and multidimensional associations, mining data cube-based and
clustering-based quantitative association rules, using statistical theory to discover exceptional behavior.
Constraint-Based Pattern Mining: Pruning pattern space with pattern pruning constraints: monotonic,
antimonotonic, succinct, convertible, inconvertible; Pruning data space with data pruning constraints.
Mining Various Kinds of Data and Patterns: Mining rare and negative patterns, mining weighted and
utility-based patterns, mining patterns from uncertain data, mining spatial and temporal patterns, mining
high dimensional data. Data Mining Applications: Business intelligence; Web search engines and so-
cial media data analysis; Healthcare and biological data analysis; Education; Pattern-based classification,
clustering, outlier detection and semantic annotation; Collaborative filtering; Privacy-preserving.

186
 Data Mining/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Jiawei Han, Jian Pei, H. Tong, Data Mining: Concepts and Techniques, 4th Edition, Morgan
Kaufmann Publishers, Elsevier..

R References:

– Mohammed J. Zaki, Wagner Meira Jr, Data Mining and Analysis: Fundamental Concepts and
Algorithms, Cambridge University Press..
– Charu C. AggarWal, Data Mining: The Textbook, Springer..

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction: Basic concepts of Data Mining, different kinds of data T T
and patterns can be mined, used technologies, targeted applications and
major issues and applications of Data Mining.
3-6 Mining Frequent Itemsets: Definitions and background, Market bas- T T
ket analysis, Methods for mining frequent itemsets (i) Apriori algorithm
(mining frequent itemsets using candidate generation, improving the ef-
ficiency of Apriori), (ii) FP-growth algorithm (mining frequent itemsets
without candidate generation), (iii) Mining frequent itemsets using ver-
tical data format.
7-9 Mining Association Rules and Correlation: Mining association rules, T T
generating association rules from frequent itemsets; Mining correlations
from association rules, significance of correlation mining in presence of
association rules; Pattern evaluation methods, various correlation mea-
sures: lift, chi-square, all-conf, max-conf, cosine and Kulc; Performance
and applicability analysis of correlation measures.
10-12 Mining Sequential Patterns: Concepts and primitives, applications, do- T T
mains; Mining methods in transactional sequence databases (i) Apriori
based approaches (GSP, SPADE), (ii) Pattern growth based (PrefixSpan);
Mining sequential patterns in biological databases, web access databases
and time series databases.
13-14 Mining Dynamic Data and Data Streams: Basic ideas of mining in- T T
cremental and dynamic data, handling high speed stream data, differ-
ent windowing techniques for data streams such as tilted, decaying and
sliding window.
15-17 Mining Representative Patterns: Mining closed and maximal frequent T R
itemsets and sequences; Mining top-k, top-k redundancy aware, k-
summarized patterns; Mining compressed or approximate patterns by
pattern clustering.
18-20 Mining Subgraph Patterns: Methods for mining frequent subgraphs T R
(i) Apriori based approaches (AGM, FSG), (ii) Pattern growth based
(gSpan); Mining variant and constrained substructure patterns.
21-22 Mining in Multilevel and Multidimensional Spaces: Mining multi- T R
level, and multidimensional associations, mining data cube-based and
clustering-based quantitative association rules, using statistical theory
to discover exceptional behavior.
23-24 Constraint-Based Pattern Mining: Pruning pattern space with pattern T R
pruning constraints: monotonic, antimonotonic, succinct, convertible,
inconvertible; Pruning data space with data pruning constraints.

187
 Data Mining/4th year 2nd semester 2024

25-26 Mining Various Kinds of Data and Patterns: Mining rare and negative T R
patterns, mining weighted and utility-based patterns, mining patterns
from uncertain data, mining spatial and temporal patterns, mining high
dimensional data.
27-28 Data Mining Applications: Business intelligence; Web search engines T R
and social media data analysis; Healthcare and biological data analysis;
Education; Pattern-based classification, clustering, outlier detection and
semantic annotation; Collaborative filtering; Privacy-preserving.

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 4215 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

188
 Data Mining Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4216 Data Mining Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4216
Course Title Data Mining Lab
Course Credit 1.0 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Experiment Lists: 1. Implement and compare frequent itemset mining algorithms such as Apriori and
▲

FP-growth. 2. Generate association rules from frequent itemsets and discover correlation from them. 3.
Implement and compare sequential pattern mining algorithms such as GSP, SPADE and PrefixSpan. 4.
Design and implement algorithms for time series and web access sequences. 5. Design and implement
algorithms for Dynamic Data and Data Streams. 6. Design and implement algorithms for representative
pattern mining such as maximal, closed and top-k patterns. 7. Implement and compare frequent subgraph
pattern mining algorithms such as AGM, FSG and gSpan.
Language used: C/C++/Java/Python
A small capstone project: Discover interestingness from any kind of mined patterns, analyze the find-
ings, and apply them to make useful decisions in any real-life domain.

3 Text and Reference Materials

T Textbook:
– Jiawei Han, Jian Pei, H. Tong, Data Mining: Concepts and Techniques, 4th Edition, Morgan
Kaufmann Publishers, Elsevier..
R References:
– Mohammed J. Zaki, Wagner Meira Jr, Data Mining and Analysis: Fundamental Concepts and
Algorithms, Cambridge University Press..
– Charu C. AggarWal, Data Mining: The Textbook, Springer..

Course Teacher, CSE 4216 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

189
 Digital Forensics/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4217 Digital Forensics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4217
Course Title Digital Forensics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Optional course
Prerequisite Course CSE 2105 Computer Architecture and Microprocessor, CSE 3109 Operat-
ing Systems, CSE 3201 Computer Network

2 Syllabus
▲

Key digital forensics concepts: Computer forensics, network forensics, mobile device forensics, malware
forensics, memory forensics, scientific method of digital forensics, digital evidence, circumstantial vs. dig-
ital evidence, Evidence integrity and cryptographic hash functions, a chain of custody, using forensic
copies, reporting and testimony, a case study of real-world crime investigation involving digital foren-
sics. Legal system in Bangladesh: Legal system in Bangladesh, criminal vs civil justice system, courtroom
scenario, Lawyers vs prosecutors, defense attorneys, law enforcement, warrant requirement, e-discovery,
Judges and decision-makers, laws related to cyber crimes and digital forensics, accepted digital evidence
in Bangladesh legal system, fingerprint analysis, privacy law, and digital forensics. Hard Disk and File
Systems: Different types of disk drives and their characteristics, Logical structure of the disk, Booting pro-
cess of Windows, Linux, and Mac, Various file systems of Windows, Linux, and Mac, storage systems, and
Encoding standards. Defeating Anti-Forensics Techniques: Anti-forensics techniques, Data deletion and
recycle bin forensics, File carving techniques, password cracking techniques, Detect Steganography and
hidden data in the file systems, Anti-forensics countermeasures. Windows Forensics: Collect volatile and
non-volatile information, Perform Windows memory and registry analysis, Examine cache, cookies and
web browser history, Windows files and metadata, Text-based logs, and event-based logs. Linux and Mac
forensics: Volatile and non-volatile data in Linux, File system analysis in Linux, Mac Forensics. Network
Forensics: Sources of network-based evidence, Evidence Acquisition: Physical interception, traffic acquisi-
tion, and active acquisition, Network intrusion detection and analysis, Event log aggregation, correlation,
and analysis, Investigate switch, router, firewall and web proxies. Mobile Forensics: Architectural layers
and boot processes of Android and ios devices, Investigate cellular network data, SIM file systems and
its data acquisition method, Phone locks, rooting of Android and jailbreaking of ios devices, Logical and
physical acquisition of Android and ios devices; Investigating web attacks: Basics of internet information
services logs and Apache web server logs, Functionality of intrusion detection systems and web application
firewall, Investigate attacks on web applications and servers. Malware Forensics: Static and dynamic anal-
ysis of malware, Analyze malware behavior on the system and on the network. Cloud Forensics: Basics of
cloud computing and cloud forensics, Fundamentals of Amazon web services (AWS) and Microsoft Azure
Investigate security incident in AWS and Azure IoT Forensics: IoT and IoT security problems, Recognize
different types of IoT threats, IoT forensics and perform IoT forensics on IoT devices.

190
 Digital Forensics/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Bill Nelson, Amelia Phillips, Chris Steuart, Guide to Computer Forensics and Investigations, 6th
Edition, Cengage Learning, 2018.

R References:

– Muhiballah Muhammed, Windows Forensics Analyst Field Guide, 1st Edition, Pact Publishing,
2023.
– Michael Hale Ligh, Andrew Case, Jamie Levy, AAron Walters, The Art of Memory Forensics, 1st
Edition, John WIlley and Sons, 2014.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
mentary concepts of various architectures, Cognitive
CO1 PO1 40%
applications, protocols, and background (C3)
processes dealing with networking architec-
ture and protocol design related problems.
Analyze operational details of various pro-
tocols, related to application, transport, and
Please refer
routing layers to apply the specialist engi- Cognitive
CO2 PO2 50% to Section 5.
neering knowledge to solve the complex net- (C4)
working infrastructure development prob-
lem.
Establish a reliable protocol while planning
and designing network services infrastruc-
ture, to address networking-related prob- Affective
CO3 PO6 10%
lems and issues that ensure user Quality (A4)
of Service (QoS) and Quality of Experience
(QoE).

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

191
 Digital Forensics/4th year 2nd semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, Sharing course administration T T
and guidelines, Overview of Digital Forensics and Data Ac-
quisition, • Computer forensics, • network forensics, • mo-
bile device forensics, • malware forensics, • memory forensics
• Data Acquisition: Types-Live and Dead, Bit-by-bit, Logical
and Sparse, Methodology
3-4 Legal system in Bangladesh • criminal vs civil justice system, • T T
Lawyers vs prosecutors, • defense attorneys, law enforcement,
warrant requirement • Judges and decision maker, • laws re-
lated to cyber crimes and digital forensics • Accepted digital
evidences in Bangladesh legal system, finger print analysis,
privacy law and digital forensics
5-6 Hard Disk and File Systems • Different types of disk drives T T
and their characteristics, • Logical structure of disk, • Boot-
ing process of Windows, Linux and Mac • Various file systems
of Windows, Linux and Mac • storage systems and Encoding
standard
7-9 Defeating Anti-Forensics Techniques • Anti-forensics tech- T T
niques, • Data deletion and recycle bin forensics, • File
carving techniques, password cracking techniques • Detect
Steganography and hidden data in the file systems • Anti-
forensics counter measures;
10-13 Windows Forensics • Collect volatile and non-volatile infor- T T
mation • Perform Windows memory and registry analysis, •
Examine cache, cookies and web browser history, • Windows
files and meta data • Text-based logs and event-based logs;
14-15 Linux and Mac forensics • Volatile and non-volatile data in T T
Linux • File system analysis in Linux, • Mac Forensics
16-18 Network Forensics • Sources of network-based evidence, • Ev- T R
idence Acquisition: Physical interception, traffic acquisition
and active acquisition • Network intrusion detection and anal-
ysis, • Event log aggregation, correlation and analysis • Inves-
tigate switch, router, firewall and web proxies;
19-21 Mobile Forensics • Architectural layers and boot processes of T T
android and ios device, • Investigate cellular network data,
• SIM file systems and its data acquisition method, • Phone
locks, rooting of android and jailbreaking of ios devices • Log-
ical and physical acquisition of android and ios devices;
22-23 Investigating web attacks • Basics of internet information ser- T R
vices logs and Apache web server logs • Functionality of in-
trusion detection systems and web application firewall • In-
vestigate attacks on web applications and servers
24-25 Malware Forensics • Static and dynamic analysis of malware T R
• Analyze malware behaviour on system and on network
26 Cloud Forensics • Basics of cloud computing and cloud foren- T R
sics • Fundamentals of Amazon web services (AWS) and Mi-
crosoft Azure • Investigate security incident in AWS and
Azure
27 IoT Forensics • IoT and IoT security problems • Recognize dif- T R
ferent types of IoT threats • IoT forensics and perform IoT
forensics on IoT devices

192
 Digital Forensics/4th year 2nd semester 2024

28 Review, Future horizon of digital forensics, • Problem solving T R

practices • Presentation • Assignments, etc

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 3105 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

193
 Digital Forensics Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4218 Digital Forensics Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4218
Course Title Digital Forensics Lab
Course Credit 1 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
The CSE 4218 Digital Forensic Lab laboratory course is designed to complement the theoretical content
▲

of CSE 4217 Digital Forensics, offering students hands-on experience in digital forensic analysis through
practical exercises. The lab sessions utilize industry-standard tools to conduct studies of various systems,
including Windows, Linux, Mac, and mobile and network environments. Students engage in activities
such as disk and file system analysis, mobile data acquisition, network traffic capture, malware analysis,
and the detection of anti-forensic techniques. Additional labs focus on challenges in cloud and IoT foren-
sics, equipping students with the skills to handle real-world scenarios and understand the legal aspects
of digital forensics in the context of Bangladesh’s judicial system. This approach ensures that students
learn the tools and techniques of digital forensics and apply them to complex investigations across diverse
platforms.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

Course Teacher, CSE 4224 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

194
 Software Security /4th Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4219 Software Security

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th Year 2nd Semester 2024
Course Code CSE 4219
Course Title Software Security
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course

2 Syllabus
Introduction to Software Security Overview of software security concepts, Security principles and goals,
Threat modeling and risk assessment Secure Software Design Secure design principles and patterns, Se-
▲

curity requirements elicitation, Secure software architecture Common Vulnerabilities and AttacksBuffer
overflows and memory corruption, Injection attacks (SQL injection, XSS), Authentication, and session
management vulnerabilities Cryptography for Software Security Cryptographic primitives and algorithms,
Encryption, hashing, digital signatures, Key management, and secure protocols Access Control and Au-
thentication Role-based access control, Multi-factor authentication, Single sign-on and federated identity
Secure Coding Practices Input validation and output encoding, Error handling and exception manage-
ment, Secure coding standards and guidelines Security Testing and Analysis Static and dynamic code
analysis, Fuzz testing and penetration testing, Security testing tools and frameworks Secure Software
Development Lifecycle (SDLC) Integrating security into the SDLC, Secure coding practices in agile de-
velopment, Security requirements management

3 Text and Reference Materials

T Textbook:

– Robert Seacord, Secure Coding in C and C++, Second Edition, Pearson Publications.
– Gary McGraw, Software Security: Building Security In, First Edition, Addison-Wesley Profes-
sional.
– Chris Wysopal, Art of Software Security Testing, The: Identifying Software Security Flaws:
Identifying Software Security Flaws, First Edition, Addison-Wesley Professional.

R References:

– William Stallings & Lawrie Brown, Computer Security Principles and Practices, Fifth Edition,
Pearson Publications.

195
 Software Security /4th Year 2nd Semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand fundamental principles of soft-
Cognitive
CO1 ware security and Identify common soft- PO1 40%
(C3)
ware vulnerabilities and attacks.
Design and implement secure software sys- Please refer
Cognitive
CO2 tems, Conduct security assessments and PO2 50% to Section 5.
(C4)
vulnerability analysis.
Apply secure coding practices in real-world
Affective
CO3 scenarios and Adopt Secure Software Devel- PO6 10%
(A4)
opment Lifecycle practices .

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 25% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

Course Teacher, CSE 4219 Chairman, Dept. of CSE, DU

April 25, 2024 April 25, 2024

196
 Software Security Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4220 Software Security Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4220
Course Title Software Security Lab
Course Credit 1 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

The Software Security Lab is designed to provide students with hands-on experience in secure software
design, finding faults in programs and detecting different types of security attacks. This laboratory-based
course aims to complement the theoretical concepts covered in the corresponding theory lectures, enabling
students to apply their knowledge in practical, real-world scenarios.
The lab will focus on the following topics:

■ Setup and familiarization with security tools such as Burp Suite, Wireshark, and static code analysis
tools.

■ Analyzing code snippets to identify common security vulnerabilities like injection flaws, XSS, CSRF,
etc.

■ Conducting penetration tests on a simulated vulnerable web application to identify security weak-
nesses.

■ Implementing secure coding practices in sample applications to mitigate vulnerabilities.

■ Identifying and mitigating security threats in web and mobile applications through practical exer-
cises.

3 Text and Reference Materials

T Textbook:

– John Viega, Gary R. McGraw, Building Secure Software: How to Avoid Security Problems the
Right Way, First Edition, Addison-Wesley Professional.

R References:

197
 Software Security Lab/4th year 2nd semester 2024

– Wenliang Du, Computer Security: A Hands-on Approach, First Edition, CreateSpace Indepen-
dent Publishing Platform.

– Online available resources.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Analyze and identify common security vul-
nerabilities in software applications Perform Cognitive
CO1 PO1 45%
code review and analysis to detect security (C2)
flaws in software code.
Please refer
Conduct penetration testing and vulnerabil- Cognitive
CO2 PO2 30% to Section 5.
ity assessment of software systems. (C3)
Apply secure coding practices to develop ro- Cognitive
CO3 PO9 25%
bust and resilient software applications. (C6)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Class Participation 10% 10%
Continuous Lab Performance 15% 10% 5% 30%
Lab Examination 20% 20%
Capstone Project or Demo/Presentation 10% 15% 5% 40%
Total 25% 30% 45% 100%

Sarker Tanveer Ahmed Rumee, CSE 4220 Chairman, Dept. of CSE, DU

April 25, 2024 April 25, 2024

198
 Compiler Design/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4221 Compiler Design

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4221
Course Title Compiler Design
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3207 Theory of Computation

2 Syllabus
Introduction to Compilers: Introduces the role of compilers in software development, detailing the phases
▲

of compilation which include lexical analysis, syntax analysis, semantic analysis, optimization, and code
generation. It also covers compiler architecture and organization. Lexical Analysis: Explores regular
expressions and finite automata, focusing on lexical analyzer generators such as Lex, tokenization, and
lexical error handling. Syntax Analysis: Delves into context-free grammars and parsing techniques, in-
cluding top-down parsing (recursive descent, LL(1), predictive parsing) and bottom-up parsing (shift-
reduce parsing, LR(0), SLR(1), LR(1), LALR(1)). Syntax-Directed Translation: Examines syntax-directed
definitions and attribute grammars, translation schemes, and the use of intermediate representations in
syntax-directed translation. Semantic Analysis: Discusses the management of scope and symbol tables,
type checking, type inference, and semantic error handling. Code Optimization: Provides an overview
of optimization techniques, control flow analysis and optimization, data flow analysis and optimization,
and common optimization algorithms. Code Generation: Offers insights into code generation techniques,
instruction selection and scheduling, register allocation, and code generation for different target machines.

3 Text and Reference Materials

T Textbook:

– Alfred Aho, Jeffrey Ullman, Ravi Sethi, Monica Lam, Compilers: Principles, Techniques, and
Tools , Second Edition, Addison Wesley, 2006.

R References:

– Keith D. Cooper and Linda Torczon, Engineering a Compiler, Third Edition, Morgan Kaufmann,
2022.

199
 Compiler Design/4th year 2nd semester 2024

4 Topic Outline

Table 1: Compilers Course Outline

Lecture Selected Topic Article Problems

1-4 Introduction to Compilers: Overview of compilers and their T T
role in software development, phases of compilation: Lexi-
cal analysis, syntax analysis, semantic analysis, optimization,
code generation, compiler architecture and organization
5-8 Lexical Analysis: Regular expressions and finite automata, T T
Lexical analyzer generators (e.g., Lex), Tokenization, Lexical
error handling
9-12 Syntax Analysis: Context-free grammars and parsing tech- T T
niques, Top-down parsing: Recursive descent, LL(1), predic-
tive parsing, Bottom-up parsing: Shift-reduce parsing, LR(0),
SLR(1), LR(1), LALR(1)
13-16 Syntax-Directed Translation: Syntax-directed definitions T T
and attribute grammars, Translation schemes, Intermediate
representations
17-20 Semantic Analysis: Scope and symbol tables, Type checking T T
and type inference, Semantic error handling
21-24 Code Optimization: Overview of optimization techniques, T T
Control flow analysis and optimization, Data flow analysis
and optimization, Common optimization algorithms
25-28 Code Generation: Overview of code generation techniques, T T
Instruction selection and scheduling, Register allocation,
Code generation for different target machines

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4221 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

200
 Compiler Design Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4222 Compiler Design Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4222
Course Title Compiler Design Lab
Course Credit 1.0 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course Check the prerequisite for the related theory course

2 Syllabus
The CSE 4222 Compiler Design Lab serves as a practical complement to the theoretical concepts covered
▲

in the corresponding CSE 4221 Compiler Design Course. In this lab, students gain hands-on experience
in designing and implementing various components of a compiler. They will work on tasks such as lexical
analysis, syntax analysis, semantic analysis, and code generation. Through programming assignments,
students will build compiler modules, including lexical analyzers, parsers, symbol tables, and intermediate
code generators. Additionally, they will learn about optimization techniques and debugging strategies to
enhance compiler performance and reliability. By applying theoretical knowledge to real-world compiler
development scenarios, students develop a comprehensive understanding of compiler design principles
and practices.

3 Text and Reference Materials

Check the textbook and reference list for the corresponding theory course.

Course Teacher, CSE 4222 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

201
 Cloud Computing/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4223 Cloud Computing

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4223
Course Title Cloud Computing
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3201 -Computer Network

2 Syllabus
Introduction to Cloud Computing: Cloud computing concepts and definitions, Types of cloud services:
IaaS, PaaS, SaaS, Benefits and challenges of cloud computing Cloud Service Models: Infrastructure as
▲

a Service (IaaS), Platform as a Service (PaaS), Software as a Service (SaaS) Cloud Deployment Models:
Public, private, hybrid, and multi-cloud models, Considerations for choosing deployment models Vir-
tualization and Containers: Virtualization technologies (e.g., VMware, Hyper-V), Containerization (e.g.,
Docker, Kubernetes), Virtualization technologies for data centers, Server virtualization, storage virtualiza-
tion, network virtualization Cloud Architecture and Design: Design principles for scalable, reliable, and
available cloud applications, Microservices architecture, Serverless computing Cloud Security and Com-
pliance: Security considerations in the cloud, Data protection and encryption, Compliance standards (e.g.,
GDPR, HIPAA) Cloud Networking and Storage: Virtual networks, load balancing, and content delivery,
Cloud storage services (e.g., AWS S3, Azure Blob Storage) Cloud Monitoring and Management: Tools
for monitoring and managing cloud resources, Auto-scaling and resource optimization Cloud Data Cen-
ter Fundamentals: Data center components and infrastructure, Cooling, power distribution, and energy
efficiency Cloud Data Center Design and Architecture: Data center layout and design considerations,
Redundancy, fault tolerance, and disaster recovery, Network design for data centers, Network protocols,
Cloud Data Center Security: Physical security for data centers, Network security, access controls, and
monitoring Cloud Migration Strategies: Planning and executing cloud migration projects, Lift and shift,
re-platforming, refactoring, Emerging Trends and Technologies: Edge computing, Green data centers and
sustainability, Case Studies and Real-world Applications.

3 Text and Reference Materials

T Textbook:
– Thomas Erl, Ricardo Puttini, & Zaigham Mahmood, Cloud Computing: Concepts, Technology &
Architecture, First Edition, Pearson Publications, 2013.
R References:
– Gustavo Alessandro Andrade Santana, Yusuf Bhaiji, Maurilio Gorito, & Krishna Arji, Data Center
Virtualization Fundamentals, First Edition, Cisco Systems, 2013.

202
 Cloud Computing/4th year 2nd semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Explain the foundational concepts, princi-
Cognitive
CO1 ples, and architecture of cloud computing PO1 40%
(C3)
and data center technologies
Analyze different cloud and data center
Please refer
principles to meet the user’s Service Level Cognitive
CO2 PO2 50% to Section 5.
Agreement (SLA) and ensure Quality-of- (C4)
Service (QoS)
Create designs of emerging system ser-
vices leveraging cloud resources and mod- Psychomotor
CO3 PO5 10%
ern tools to benefit from cloud infrastruc- (P6)
ture.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines • Introduction to Cloud Computing: Cloud
computing concepts and definitions, Types of cloud services:
IaaS, PaaS, SaaS, Benefits and challenges of cloud computing;
3-4 Cloud Service Models: Infrastructure as a Service (IaaS), Plat- T T
form as a Service (PaaS), Software as a Service (SaaS) • Cloud
Deployment Models: Public, private, hybrid, and multi-
cloud models, Considerations for choosing deployment mod-
els
5-7 Virtualization and Containers: Virtualization technologies T T
(e.g., VMware, Hyper-V), Containerization (e.g., Docker, Ku-
bernetes), • Virtualization technologies for data centers,
Server virtualization, storage virtualization, network virtual-
ization;

203
 Cloud Computing/4th year 2nd semester 2024

8-12 Cloud Architecture and Design: Design principles for scal- T T

able, reliable, and available cloud applications, Microser-
vices architecture, Serverless computing • Cloud Security and
Compliance: Security considerations in the cloud, Data pro-
tection and encryption, Compliance standards (e.g., GDPR,
HIPAA)
13-14 Cloud Networking and Storage: Virtual networks, load bal- T T
ancing, and content delivery, Cloud storage services (e.g., AWS
S3, Azure Blob Storage); ;
15-17 Cloud Monitoring and Management: Tools for monitoring T T
and managing cloud resources, • Auto-scaling and resource
optimization, • Cost and Quality of Service considerations
while allocating cloud resources. • Availability and Fault-
tolerant issues of cloud services;
18-21 Cloud Data Center Fundamentals: Data center components T R
and infrastructure, Cooling, power distribution, and energy
efficiency • Cloud Data Center Design and Architecture:
Data center layout and design considerations, Redundancy,
fault tolerance, and disaster recovery, Network design for data
centers, Network protocols, • Cloud Data Center Security:
Physical security for data centers, Network security, access
controls, and monitoring;
22-24 Cloud Migration Strategies: Planning and executing cloud T T
migration projects, Lift and shift, re-platforming, refactoring;
25-26 Emerging Trends and Technologies: AI and ML in Edge com- T T
puting, Green data centers and sustainability, Case Studies,
and Real-world Applications.
27-28 Reviews, Future of Cloud Computing and its Challenges • T R
Problem-solving practices, • Assignments/Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4223 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

204
 Cloud Computing Lab/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4224 Cloud Computing Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4224
Course Title Cloud Computing Lab
Course Credit 1 units
Contact Hours Per Week 2
Course Status Elective Course
Prerequisite Course CSE 3201 -Computer Network

2 Syllabus
The lab exercises of this course is based on the theory topics taught in the CSE 4223 Cloud Computing
▲

course. Major topics: Introduction to a Cloud Service Automation Manager, Creating a VMWare, De-
ployment and Monitoring of services, Creating and Using a virtual machine, Resizing a virtual machine,
Creating backup image of a virtual machine, Creating a new project on a virtual server and generating its
monitoring reports, Exploring general hypervisors and virtual machine files, managing data stores, Using
a virtual machine console and creating user roles on the hypervisor, etc.

3 Text and Reference Materials

T Textbook:

– Thomas Erl, Ricardo Puttini, & Zaigham Mahmood, Cloud Computing: Concepts, Technology &
Architecture, First Edition, Pearson Publications, 2013.

R References:

– Gustavo Alessandro Andrade Santana, Yusuf Bhaiji, Maurilio Gorito, & Krishna Arji, Data Center
Virtualization Fundamentals, First Edition, Cisco Systems, 2013.

Course Teacher, CSE 4224 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

205
17.3.3 Elective III

206
 Big Data Analytics/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4225 Big Data Analytics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4225
Course Title Big Data Analytics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Introduction to Big Data Analytics: Definition of big data and its characteristics (volume, velocity, va-
▲

riety, veracity, and value). Importance of big data analytics in various industries. Some example-based
Overview of real-world applications. Foundations of Data Science: Basics of data science and its relation-
ship to big data analytics. Data lifecycle: acquisition, storage, processing, analysis, and visualization. Data
types, structures, and formats. Data Acquisition and Preprocessing: Techniques for collecting, cleaning,
and preprocessing large-scale datasets. Data integration and transformation. Data quality assessment and
improvement. Big Data Storage and Management: Overview of distributed file systems (e.g., Hadoop
Distributed File System - HDFS). NoSQL databases (e.g., MongoDB, Cassandra) and their role in big data
storage. Data warehousing concepts and architectures. Big Data Processing Frameworks: Apache Hadoop
ecosystem: Hadoop MapReduce, YARN, and Hadoop ecosystem projects (e.g., Hive, Pig, Spark). Introduc-
tion to Apache Spark: RDDs, DataFrames, Spark SQL, and Spark Streaming. Machine Learning for Big
Data Analytics: Overview of machine learning algorithms commonly used in big data analytics (e.g., clas-
sification, regression, clustering). Distributed machine learning frameworks (e.g., Spark MLlib). Feature
engineering and model evaluation techniques for big data. Big Data Visualization and Interpretation:
Data visualization principles and techniques for big data. Tools for interactive data exploration and vi-
sualization (e.g., Tableau, D3.js). Interpretation of visualizations and communication of insights. Mining
Data Streams: The data stream model, Sampling in a data stream, Filtering streams, Counting distinct el-
ements in a stream, Estimating moments, Handling windows in a data stream, Decaying windows, Mining
frequent patterns in a data stream. Scalability, Performance, and Optimization: Scalability challenges in
big data analytics. Techniques for improving performance and optimizing big data processing pipelines.
Parallel and distributed computing concepts. Ethical and Legal Considerations: Privacy, security, and
ethical issues in big data analytics. Compliance with regulations (e.g., GDPR, HIPAA) and industry stan-
dards. Responsible use of data and potential biases. Emerging Trends and Technologies: Recent advance-
ments in big data analytics (e.g., deep learning, edge computing). Trends in big data tools, platforms, and
industry applications. Opportunities and challenges in the future of big data analytics.

207
 Big Data Analytics/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Nathan Marz, James Warren, Big Data: Principles and Best Practices of Scalable Realtime
Data Systems, Manning Publications.
– Arshdeep Bahga, Vijay Madisetti, Big Data Science & Analytics: A Hands-On Approach, VPT.

R References:

– Saumyadipta Pyne, B.L.S. Prakasa Rao, S.B. Rao, Big Data Analytics: Methods and Applica-
tions, Springer.
– Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman, Mining of Massive Datasets, 2nd Edi-
tion, Cambridge University Press.

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Big Data Analytics: Definition of big data T T
and its characteristics (volume, velocity, variety, veracity, and
value). Importance of big data analytics in various industries.
Some example-based Overview of real-world applications.
3-4 Foundations of Data Science: Basics of data science and its T T
relationship to big data analytics. Data lifecycle: acquisition,
storage, processing, analysis, and visualization. Data types,
structures, and formats.
5-6 Data Acquisition and Preprocessing: Techniques for collect- T T
ing, cleaning, and preprocessing large-scale datasets. Data
integration and transformation. Data quality assessment and
improvement.
7-10 Big Data Storage and Management: Overview of distributed T T
file systems (e.g., Hadoop Distributed File System - HDFS).
NoSQL databases (e.g., MongoDB, Cassandra) and their role
in big data storage. Data warehousing concepts and architec-
tures.
11-14 Big Data Processing Frameworks: Apache Hadoop ecosys- T T
tem: Hadoop MapReduce, YARN, and Hadoop ecosystem
projects (e.g., Hive, Pig, Spark). Introduction to Apache Spark:
RDDs, DataFrames, Spark SQL, and Spark Streaming.
15-17 Machine Learning for Big Data Analytics: Overview of ma- T T
chine learning algorithms commonly used in big data analyt-
ics (e.g., classification, regression, clustering). Distributed ma-
chine learning frameworks (e.g., Spark MLlib). Feature engi-
neering and model evaluation techniques for big data.
18-20 Big Data Visualization and Interpretation: Data visualiza- T R
tion principles and techniques for big data. Tools for in-
teractive data exploration and visualization (e.g., Tableau,
D3.js). Interpretation of visualizations and communication of
insights.
21-22 Mining Data Streams: The data stream model, Sampling in a T R
data stream, Filtering streams, Counting distinct elements in
a stream, Estimating moments, Handling windows in a data
stream, Decaying windows, Mining frequent patterns in a data
stream.

208
 Big Data Analytics/4th year 2nd semester 2024

23-24 Scalability, Performance, and Optimization: Scalability T R

challenges in big data analytics. Techniques for improving
performance and optimizing big data processing pipelines.
Parallel and distributed computing concepts.
25-26 Ethical and Legal Considerations: Privacy, security, and eth- T R
ical issues in big data analytics. Compliance with regulations
(e.g., GDPR, HIPAA) and industry standards. Responsible use
of data and potential biases.
27-28 Emerging Trends and Technologies: Recent advancements T R
in big data analytics (e.g., deep learning, edge computing).
Trends in big data tools, platforms, and industry applications.
Opportunities and challenges in the future of big data analyt-
ics.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4225 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

209
 Information Retrieval/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4227 Information Retrieval

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4227
Course Title Information Retrieval
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3203 Artificial Intelligence

2 Syllabus
Boolean Retrieval: An example of information retrieval problem, Inverted Index, Processing Boolean
▲

queries, extended Boolean retrieval. Term Vocabulary and Postings Lists: Document delineation and
character sequence decoding, Tokenization, Dropping common terms: stop words, Normalization (equiv-
alence classing of terms), Stemming and lemmatization, skip pointers, Biword indexes, Positional indexes.
Dictionaries and Tolerant Retrieval: Search structures for dictionaries, General wildcard queries, k-
gram indexes for wildcard queries, Spelling correction. Index Construction: Blocked sort-based indexing,
Single-pass in-memory indexing, Distributed indexing, Dynamic indexing, Other types of indexes. Index
Compression: Statistical properties of terms in information retrieval, Dictionary compression, Posting file
compression. Scoring and Ranking: Parametric and zone indexes, Term frequency and weighting, The
vector space model for scoring, variant tf-idf functions. Computing Scores in a Complete Search System:
Efficient scoring and ranking: inexact top-k document retrieval, index elimination, champion lists, static
quality scores and ordering, impact ordering, cluster pruning; Components of an information retrieval
system: tiered indexes, query-term proximity, designing parsing and scoring functions. Evaluation in
Information Retrieval: Evaluation of unranked retrieval sets, Evaluation of ranked retrieval results, As-
sessing relevance, Results snippets. Relevance feedback and query expansion: The Rocchio algorithm for
relevance feedback, Probabilistic relevance feedback, Relevance feedback on the web, Evaluation of rele-
vance feedback strategies, Global methods for query reformulation. Probabilistic Information Retrieval:
The probability ranking principle; the binary independence model: Deriving a ranking function for query
terms, probability estimates in theory and practice. Language Models for Information Retrieval: Fi-
nite automata and language models, multinomial distributions over words; The query likelihood model.
Text Classification and Clustering: Naı̈ve Bayes and k- nearest neighbors text classification; The Bernoulli
model; Feature selection; K-means and Hierarchical clustering; Evaluation of text classification and cluster-
ing. Web Search Basics, Crawling, Indexes, Link Analysis: Web Characteristic, Index size and estimation,
Crawling, Web As a graph, Page Rank, Hubs and Authorities, Information Retrieval Applications.

3 Text and Reference Materials

T Textbook:

210
 Information Retrieval/4th year 2nd semester 2024

– Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information

Retrieval, Recent Edition, Cambridge University Press.

R References:

– Ricardo Baeza-Yates, Berthier Ribeiro-Neto, Modern Information Retrieval, Recent Edition, Ad-
dison Wesley.

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Boolean Retrieval: An example of information Retrieval T T
Problem, Inverted Index, Processing Boolean queries, ex-
tended Boolean retrieval.
3-5 Term Vocabulary and Postings lists: Document delineation T T, R
and character sequence decoding, Tokenization, Dropping
common terms: stop words, Normalization (equivalence class-
ing of terms), Stemming and lemmatization, skip pointers, Bi-
word indexes, Positional indexes.
6-7 Dictionaries and Tolerant Retrieval: Search structures for T T
dictionaries, General wildcard queries, k-gram indexes for
wildcard queries, Spelling correction.
8-9 Index Construction: Blocked sort-based indexing, Single- T T, R
pass in-memory indexing, Distributed indexing, Dynamic in-
dexing, Other types of indexes.
10-11 Index Compression: Statistical properties of terms in infor- T T, R
mation retrieval, Dictionary compression, Posting file com-
pression.
12-13 Scoring and Ranking: Parametric and zone indexes, Term fre- T T, R
quency and weighting, The vector space model for scoring,
variant tf-idf functions.
14-16 Computing Scores in a Complete Search System: Efficient T T, R
scoring and ranking: inexact top-k document retrieval, index
elimination, champion lists, static quality scores and ordering,
impact ordering, cluster pruning; Components of an informa-
tion retrieval system: tiered indexes, query-term proximity,
designing parsing and scoring functions.
17-18 Evaluation in Information Retrieval: Evaluation of unranked T T, R
retrieval sets, Evaluation of ranked retrieval results, Assessing
relevance, Results snippets.
19-21 Relevance feedback and query expansion: The Rocchio al- T T, R
gorithm for relevance feedback, Probabilistic relevance feed-
back, Relevance feedback on the web, Evaluation of relevance
feedback strategies, Global methods for query reformulation.
21-22 Probabilistic Information Retrieval: The probability ranking T T, R
principle; the binary independence model: Deriving a ranking
function for query terms, probability estimates in theory and
practice.
23-24 Language Models for Information Retrieval: Finite automata T T, R
and language models, multinomial distributions over words;
The query likelihood model.
Continued on next page

211
 Information Retrieval/4th year 2nd semester 2024

Table 1 – continued from previous page

Lecture Selected Topic Article Problems
25-26 Text Classification and Clustering: Naı̈ve Bayes and k- T T, R
nearest neighbors text classification; The Bernoulli model;
Feature selection; K-means and Hierarchical clustering; Eval-
uation of text classification and clustering.
27-28 Web search basics, crawling, indexes, Link analysis: Web T T, R
Characteristic, Index size and estimation, Crawling, Web As
a graph, Page Rank, Hubs and Authorities, Information Re-
trieval Applications.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4227 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

212
 Human Robot Interaction/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4229 Human Robot Interaction

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4229
Course Title Human Robot Interaction
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Introduction: Different types of Robots and interactions, Working principles of Robots, Hardware and
▲

Software of Robots. Design in HRI: design principles, anthropomorphization. Spatial Interaction: Use of
space in HHI and HRI, proxemics, navigations. Nonverbal Interaction: gaze and eye movement, gesture,
imitation, touch, posture, rhythm, timing. Verbal Interaction: speech production, speech recognition,
dialogue management. Emotion: mood, affect, emotional interaction strategies, perception and models of
emotion; Applications of Robots in industry and society. Perception of Robots in media and the real world.
Ethics in HRI: Three and Five ethical rules, emotional and abusive HRI. Future of HRI: Emerging issues
of HRI, Research Methodologies, Discussion about different steps of research in HRI.

3 Text and Reference Materials

T Textbook:

– C. Bartneck, T. Belpaeme, F. Eyssel, T. Kanda, M. Keijsers, S. Sabanovi, Human–Robot Interaction:

An Introduction, 1st edition, Cambridge University Press, 2020.

R References:

– Ramana Vinjamuri, Human-Robot Interaction: Perspectives and Applications, 1st Edition, In-
tech Open, 2023.

213
 Human Robot Interaction/4th year 2nd semester 2024

4 Course Outcomes
After completion of this course, the students are expected to -

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Identify a broad range of research topics in
Affective
CO1 HRI for designing and developing a robot PO8 30%
(A3)
that can successfully interact with humans.
Compare various types of Human-Robot
interactions including non-verbal/verbal Please refer
Affective
CO2 robot behavior, learning and collaborating PO6 20% to Section 5.
(A2)
with humans, group interactions, and
ethical considerations and challenges.
Conduct scientifically rigorous human-
subject research to test for HRI-related
Psychomotor
CO3 research questions and hypotheses, and PO12 50%
(P5)
how HRI research is currently applied in
real-world applications.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 10% 25% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 10%
Class Participation 5% 5%
Total 30% 20% 50% 100%

Course Teacher, CSE 4229 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

214
 Computer Vision/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4231 Computer Vision

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4231
Course Title Computer Vision
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3203 - Artificial Intelligence

2 Syllabus
Introduction: Definition, Brief history. Image formation: Geometric primitives and transformations, Pho-
▲

tometric image formation, The digital camera. Image processing: Feature detection and matching: Points
and patches, Edges, Lines. Segmentation: Active contours, Split and merge, Mean shift and mode find-
ing. Feature-based alignment: 2D and 3D feature-based alignment, Pose estimation, Geometric intrin-
sic calibration. Structure from motion: Triangulation, Two-frame structure from motion, Factorization,
Bundle adjustment, Constrained structure and motion. Dense motion estimation: Translational align-
ment, Parametric motion, Spline-based motion, Optical flow. Image stitching: Motion models, Global
alignment, Compositing. Computational photography: Photometric calibration, High dynamic range
imaging, Super-resolution and blur removal, Image matting and compositing, Texture analysis and syn-
thesis. Stereo correspondence: Epipolar geometry, Sparse correspondence, Dense correspondence, Local
methods, Global optimization, Multi-view stereo. 3D reconstruction: Shape from X, Active rangefind-
ing, Surface representations, Point-based representations, Volumetric representations, Model-based recon-
struction, Recovering texture maps and albedos. Image-based rendering: View interpolation, Layered
depth images, Light fields and Lumigraphs, Environment mattes, Video-based rendering. Recognition:
Object detection, Face recognition, Instance recognition, Category recognition, Context and scene under-
standing.

3 Text and Reference Materials

T Textbook:

– Richard Szeliski, Computer Vision: Algorithms and Applications, 2022

R References:

– David Forsyth & Jean Ponce, Computer Vision: A Modern Approach, 2nd Ed.
– Kulkarni, Computer Vision and Fuzzy Neural Systems, 2001

215
 Computer Vision/4th year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1 Introduction: Definition, Brief history. T T
2-3 Image formation: Geometric primitives and transformations, T T
Photometric image formation, The digital camera.
4-5 Image processing: Feature detection and matching: Points T T
and patches, Edges, Lines.
6-7 Segmentation: Active contours, Split and merge, Mean shift T T
and mode finding.
8-9 Feature-based alignment: 2D and 3D feature-based align- T T
ment, Pose estimation, Geometric intrinsic calibration.
10-11 Structure from motion: Triangulation, Two-frame structure T T
from motion, Factorization, Bundle adjustment, Constrained
structure and motion.
12-13 Dense motion estimation: Translational alignment, Paramet- T R
ric motion, Spline-based motion, Optical flow.
14-15 Image stitching: Motion models, Global alignment, Com- T T
positing.
16-17 Computational photography: Photometric calibration, High T T
dynamic range imaging, Super-resolution and blur removal,
Image matting and compositing, Texture analysis and synthe-
sis.
18-20 Stereo correspondence: Epipolar geometry, Sparse corre- T R
spondence, Dense correspondence, Local methods, Global op-
timization, Multi-view stereo.
21-23 3D reconstruction: Shape from X, Active rangefinding, Sur- T R
face representations, Point-based representations, Volumetric
representations, Model-based reconstruction, Recovering tex-
ture maps and albedos.
24-25 Image-based rendering: View interpolation, Layered depth T R
images, Light fields and Lumigraphs, Environment mattes,
Video-based rendering.
26-28 Recognition: Object detection, Face recognition, Instance T R
recognition, Category recognition, Context and scene under-
standing.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 4231 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

216
 Software Testing and Quality Assurance/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4233

Software Testing and Quality Assurance

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4233
Course Title Software Testing and Quality Assurance
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Definition and concept of software quality assurance (SQA); quality models; specification of quality re-
quirements; product development & delivery issues; software development processes & maturity; software
quality management process: total quality management, improvement cycle, SQA planning & manage-
ment, organizing the SQA effort; software verification & validation; typical software development errors;
Fagan inspections; software audit; software testing: testing objectives & testing fundamentals, testing the-
ory, coverage criteria, equivalence class testing, value-based testing, decision table, syntax & state transi-
tion testing, statement & path testing, branch & condition testing, data flow testing, thread-based testing,
integration & integration testing, system testing; testing in object-oriented systems; test tools & test au-
tomation; test management; problem reporting & corrective action.

3 Text and Reference Materials

T Textbook:

– Kshirasagar Naik & Priyadarshi Tripathy, Software Testing and Quality Assurance: Theory
and Practice, 1st Edition, John Wiley & Sons, 2011.

R References:

– Online Resources from the Internet.

Course Teacher, CSE 4233 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

217
 VLSI Design and Formal Verification/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4235

VLSI Design and Formal Verification

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE
Course Title VLSI Design and Formal Verification
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Introduction to VLSI; design metrics; MOS Devices, CMOS Inverter; Combinational logic, layout, design
rules. Manufacturing process; Simulation; Mentor Graphics CAD tools, Low Power design strategies; Logic
Styles; Boolean matching, Equivalence checking, VLSI circuits Dynamic CMOS logic Timing and clock
synchronization, Pipelining. Static, Dynamic sequential circuits Deep sub-micron designs; design for per-
formance. Wires; Coping with Interconnects. Adders, Multipliers, data paths; timing issues. Memory
structures; Variability and. CMOS system design, Floor plan, Placement and routing, VHDL and Verilog
to simulate. Project design.

3 Text and Reference Materials

T Textbook:

– Weste Harris, CMOS VLSI Design: A Circuits and Systems Perspective, Third Edition, Addi-
son Wesley, 2005.

R References:

– • N H E Weste & K Eshraghian, Principles of CMOS VLSI Design, Second Edition, Pearson,
1993.

218
 VLSI Design and Formal Verification/4th year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines
Introduction to VLSI and design metrics.
3-4 Introduce to create models of moderately sized CMOS circuits T T
that realize specified digital functions. Introduction to CMOS
Inverter.
5-7 Introduction to Combinational logic, layout, design rules and T T
Manufacturing process
8-12 Introduce to design integrated circuits and Mentor Graphics T T
using Computer Aided Design (CAD) tools. (CAD) Tools.
13-14 Introduction to Boolean matching, Equivalence checking and T T
VLSI circuits Dynamics.
15-17 Introduction to Low Power design strategies; CMOS logic Tim- T T
ing and clock synchronization and Pipe-lining
18-21 Introduction to Static and Dynamic sequential circuits Deep T R
sub-micron designs; design for performance. Wires, Coping
with Interconnects.
22-24 Introduction to Adders, Multipliers, data paths; timing issues T T
25-26 Introduction to Memory structures; Variability and CMOS T T
system design
27-28 Introduction to VHDL and Verilog to simulate. Project design. T R

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1203 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

219
 Parallel and Distributed Database Systems/4th Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4237

Parallel and Distributed Database Systems

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th Year 2nd Semester 2024
Course Code CSE 4237
Course Title Parallel and Distributed Database Systems
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
▲

Introduction: Distributed Database System, Principles, Architecture and Design Issues Distributed Database
Design: Alternative Design Strategies, Fragmentation, Allocation, Combined and Adaptive Approaches
Distributed Query Processing and Optimization: Layers of Query Processing, Query Decomposition,
Localization of Distributed Data, Join Ordering in Distributed Queries, Distributed Cost Model, Dis-
tributed Query Optimization Approaches Distributed Transaction Processing: Properties and Types of
Transactions, Distributed Concurrency Control: Serializability, Concurrency Control Mechanisms, Lock-
Based and Timestamp-Based Concurrency Control Algorithms, Deadlock Management, Multiversion Con-
currency Control and Optimistic Algorithms Replicated Data Management: Consistency of Replicated
Databases, Update Management Strategies and Replication Protocols, Replication and Failure Distributed
DBMS Reliability: Reliability Concepts and Measures, Fault-Tolerance and Failures in Distributed DBMS,
Local and Distributed Reliability Protocols, Site Failures and Network Partitioning Parallel Database Sys-
tems: Database System Architectures, Parallel Data Placement, Parallel Query Processing, Load Balancing,
Fault-tolerance, Database Clusters P2P Data Management: P2P, Blockchain Big Data Processing: Map-
Reduce, Cloud Computing Systems, Distributed NoSQL Database Systems Web Data Management: Web
Search, Web Querying, Web Data Integration

3 Text and Reference Materials

T Textbook:

– Tamer Oszu and Patrick Valduriez, Principles of Distributed Database Systems, 4th Edition,
Springer, 2020.

R References:

– Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts, 7th Edition,
McGraw-Hill, 2020.

220
 Parallel and Distributed Database Systems/4th Year 2nd Semester 2024

TBA
Course Teacher, CSE 4237 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

221
 Applied Cryptography/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4239 Applied Cryptography

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4239
Course Title Applied Cryptography
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Introduction and classical ciphers, block ciphers, stream ciphers, security notions for encryption and au-
▲

thentication, game reduction techniques, hash functions, message authentication codes (MACs), public
key cryptography, RSA encryption, other public key systems and signature schemes, authentication, secret
sharing, key establishment, interactive proofs, zero knowledge proof, cryptanalysis of cryptographic prim-
itives and protocols, side-channel attacks, differential cryptanalysis, or replay attacks, cryptanalytic tech-
niques on deployed systems, memory remanence, timing attacks, and differential power analysis, phys-
ically unclonable function, trusted platform module, threshold-based cryptography, oblivious transfer,
perfectly secure encryption, universal hash functions, computing on encrypted data in cloud (homomor-
phic encryption, secure multiparty computation), access control of cloud data (attribute-based encryption
- cipher policy attribute-based encryption, key policy attribute-based encryption), blockchain and cryp-
tocurrency, post quantum cryptography.

3 Text and Reference Materials

T Textbook:

– Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptogra-
phy, https://cacr.uwaterloo.ca/hac/.

– David Evans, Vladimir Kolesnikov, Mike Rosulek, A PragmaticIntroduction to Secure Multi-Party

Computation , https://securecomputation.org/.

R References:

– Online available resources.

– Relevant research papers from conferences and journals.

222
 Applied Cryptography/4th year 2nd semester 2024

Course Teacher, CSE 3205 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

223
 Wireless Network Security/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4241 Wireless Network Security

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4241
Course Title Wireless Network Security
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE-3221: Wireless Networks

2 Syllabus
Wireless Communication: Wireless Network Overview, Wireless Channel, Signal Propagation, Signal-
▲

to-Noise Ratio, Unintentional and Intentional Interference. Risks and Threats of Wireless Communi-
cation: Wireless Security Objectives, Passive and Active Threat Model, Performance vs. Security Trade-
offs. Review of Cryptographic Primitives and algorithms: symmetric ciphers, asymmetric ciphers, hash
functions, message authentication codes, digital signature and pseudorandom generators. Wireless Phys-
ical Layer Technologies: Anti-jamming/Jamming-resistance, CSMA/CA, Coverage and Exposure, Self-
ishness at MAC layer, MAC misbehavior, Data-driven misbehavior detection, Frequency Hopping Spread
Spectrum (FHSS), Direct Sequence Spread Spectrum (DSSS), Orthogonal Frequency Division Multiplexing
(OFDM). Wireless Network security: key exchange and key management protocols in wireless networks,
Authentication and Authorisation in WLAN, 801.X EAP. Secure routing: Selfishness in packet forwarding,
Wireless transport security, attacks on naming and addressing, sybil and replication attacks, security asso-
ciations, secure neighbor discovery. Security of WiFi and Bluetooth Networks: IEEE 802.11 Architecture
and Protocols, Control and Management Frames, Rogue Access Points, WEP, IEEE 802.11i, IEEE 802.11w,
WEP, 802.11i & Wi-Fi Protected Access (WPA) protocols, Bluetooth security features, Kerberos and RA-
DIUS authentication. Security of Cellular Networks: GSM and UMTS Network Structure and Archi-
tectures, GSM and UMTS Authentication and Confidentiality, Overview of Attacks and Countermeasures,
secure handover, security in mobile IP, Beyond 3G. Security of Wireless Sensor Networks (WSNs): WSN
Architectures and Protocols, Security Threats, Cryptographic Primitives, Key Establishment and Distribu-
tion, Security of different Wireless technologies used in WSN. Security of Near Field Communications
(NFCs) and RFIDs: Introduction to NFC and RFID Technologies, Tags and Readers, Security and Pri-
vacy Issues, Real-World Attacks, Standardisation Activities, Authentication and Access Control Protocols.
Advanced Topics: Emerging Wireless Technologies, Device Pairing, Secure Localization and Positioning,
Broadcast Authentication, trust establishment, anonymity; anonymous sensory data collection, etc.

3 Text and Reference Materials

T Textbook:

224
 Wireless Network Security/4th year 2nd semester 2024

– Yi Qian, Feng Ye, & Hsiao-Hwa Chen, Security in Wireless Communication Networks, John
Wiley & Sons, Ltd, 2022.

R References:

– Wolfgang Osterhage, Wireless Network Security, Second Edition, CRC Press.

Course Teacher, CSE 3205 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

225
 Graph Theory/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4243 Graph Theory

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4243
Course Title Graph Theory
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Optional
Prerequisite Course CSE 1101 Discrete Mathematics

2 Syllabus
Introduction: Graphs and multigraphs, Adjacency, Incidence and degree, regular graphs, Subgraphs; im-
▲

portant class of graphs- Null graphs, complete graphs, independent set and bipartite graphs, Path graphs,
cycle graphs and wheel graphs. Operations on graphs: Union and intersection, complement, subdivision
of edges, contraction of edges, graph isomorphism; Eulerian and Hamiltonian graph: Walks, Trails, Paths
and Cycles; Eulerian graphs and Hamiltonian graph;. Data structures and graph representation: Adja-
cency matrix, adjacency list, incidence matrix.Graph connectivity: Connectivity-edge connectivity, vertex
connectivity, connected separable graphs, block cut vertex tree, 2-connected graphs.Trees: properties of
trees, rooted trees, spanning trees of a graph,Counting of trees, distances in trees and graphs, graceful la-
beling.Matching: perfect matching, maximum matching; Independent set, covers, dominating set, factors
of a graph,. Planar Graphs: Characterization of planar graphs, plane graphs, Euler’s formula, dual graph,
thickness of a graph, straight line drawing of planar graphs. Graph coloring: Vertex coloring, edge color-
ing, map coloring, acyclic coloring, chromatic polynomials Digraphs: Terminologies, Eulerian digraphs,
Hamiltonian digraphs, Digraphs and tournaments, flow network Special classes of graphs: Outer planar
graphs, triangulated plane graphs, chordal graphs, series and parallel graphs, perfect graphs. Applica-
tions of graphs Bioinformatics, wireless sensor networks, etc

3 Text and Reference Materials

R Textbook:

– Douglas west, Introduction to graph theory, subsequent Edition, Pearson, 2000.

T Reference:

– Md. Saidur Rahman, Basic graph theory, 1st Edition, Springer, 2017.

4 Course Outcomes

226
 Graph Theory/4th year 2nd semester 2024

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
mentary concepts of various architectures, Cognitive
CO1 PO1 35%
applications, protocols, and background (C3)
processes dealing with networking architec-
ture and protocol design related problems.
Analyze operational details of various pro-
tocols, related to application, transport, and
Please refer
routing layers to apply the specialist engi- Cognitive
CO2 PO2 45% to Section 5.
neering knowledge to solve the complex net- (C4)
working infrastructure development prob-
lem.
Establish a reliable protocol while planning
and designing network services infrastruc-
ture, to address networking-related prob- Affective
CO3 PO6 20%
lems and issues that ensure user Quality (A4)
of Service (QoS) and Quality of Experience
(QoE).

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 25%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Overview of graph theory, sharing course administration and T T
guidelines • Graphs and multigraphs, Adjacency, Incidence
and degree, regular graphs, Subgraphs, • important class of
graphs- Null graphs, complete graphs, independent set and
bipartite graphs, Path graphs, cycle graphs and wheel graphs.
3-4 Operations on graphs: • Union and intersection, comple- T T
ment, subdivision of edges, contraction of edges, graph iso-
morphism;

227
 Graph Theory/4th year 2nd semester 2024

5-8 Eulerian and Hamiltonian graph: • Walks, Trails, Paths and T T

Cycles; Eulerian graphs and Hamiltonian graph;
9 Data structures and graph representation: • Adjacency ma- T T
trix, adjacency list, incidence matrix;
10-12 Graph connectivity: • Connectivity-edge connectivity, ver- T T
tex connectivity, connected separable graphs, block cut vertex
tree, 2-connected graphs;
13-14 Trees: • properties of trees, rooted trees, spanning trees of a T T
graph,Counting of trees, distances in trees and graphs, grace-
ful labeling;
15-16 Matching: • perfect matching, maximum matching; Indepen- T R
dent set, covers, dominating set, factors of a graph;
17-19 Planar Graphs: • Characterization of planar graphs, plane T T
graphs, Euler’s formula, dual graph, thickness of a graph,
straight line drawing of planar graphs;
20-24 Graph coloring: • Vertex coloring, edge coloring, map color- T T
ing, acyclic coloring, chromatic polynomials;
24-25 Digraphs: • Terminologies, Eulerian digraphs, Hamiltonian T R
digraphs, Digraphs and tournaments, flow network;
26 Special classes of graphs: • Outer planar graphs, triangulated T R
plane graphs, chordal graphs, series and parallel graphs, per-
fect graphs;
27 Applications of graphs • Bioinformatics, wireless sensor net- T R
works, etc;
28 Review, research direction in graph theory, • Problem solving T R
practices, • Assignments, Presentations, etc.

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 3105 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

228
 Operations Research/4th year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4245 Operations Research

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd Semester 2024
Course Code CSE 4245
Course Title Operations Research
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Courses
Prerequisite Course MATH 1207 Linear Algebra

2 Syllabus
▲

Linear Programming (LP) as a tool of Operational Research (OP). The history of LP and the contribution
of G. Dantzig. Modeling a problem as an LP problem by defining the objective function and the set of linear
constraints determines its feasible solutions. Forms of an LP problem include a unique optimal solution
and infinitely many optimal solutions. Incompatible constraints, unbounded feasible solution set, and un-
bounded variables; Mathematical Modeling: Linear, nonlinear, and integer programming models; Convex
Analysis: Convex sets, polyhedral sets and polyhedral cones, Extreme points and extreme directions, Rep-
resentation of polyhedral sets, Basic feasible solution and its relation with extreme points. Degenerated
basic feasible solutions. The Extreme Point Theorem. Finding the optimal solution by the use of Linear Al-
gebra; Linear Programming: Motivation of the simplex method and the revised simplex method, Farkas’
lemma and the Karush-Kuhn-Tucker optimality conditions, Duality and sensitivity analysis, Interior point
methods; The big M method and its application on various problems. The two-phase method and its ap-
plication on various problems. LP Problems with Unbounded Variables. The Dual LP problem. Economic
Interpretation of the Dual LP Problem. Duality theorem. Dual Simplex method and its application on
various problems. Computational Complexity Theory: Complexity issues, polynomial-time algorithms,
Decision problems, and classes NP and P; Network Optimization: Network simplex method, Matching
and assignment problems, Min-cost, max-flow problems.

3 Text and Reference Materials

T Textbook:

– Hanif D. Sherali, John J. Jarvis, and M. S. Bazaraa, Linear Programming and Network Flows,
Edition 3, illustrated, John Wiley & Sons, 2011
– Frederick S Hillier and Gerald J. Lieberman,Introduction to Operations Research, 11th Edition
McGraw Hill, 2021

R References:

229
 Operations Research/4th year 2nd Semester 2024

– HAMDY A TAHA, Operations Research: An Introduction, 10Th Edition, PEARSON, January 1,

2019

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Course Introduction, Operation Research and Mathematical T T
Modeling • Branch of Operation Research, Applications in
Operations Research, Optimization, OR Institutes and Asso-
ciations, Mathematical Modeling in Optimization
3-5 Review of Linear Algebra and Convex Analysis • Linear Al- T T
gebra, Review of Linear Algebra, Linear Independence, Span-
ning Set, Simultaneous Linear Equations, • Convex Analysis:
Convex Sets, Convex Sets, Extreme Point, • Hyperplanes, Di-
rections and Rays, Convex Cones, Polyhedral Sets
5-6 Feasible State and Geometric Solution • Minimization and T T
Maximization Problem, Linear Programming in Matrix Form,
Solving linear equation by Gauss-Jordan reduction, Singular
and non-singular matrix, Feasible Region, Solution, Required
Condition for feasibility
8-10 Linear Programming & Simplex Method • The Representa- T T
tion (or Caratheodory) Theorem, Extreme Point and Optimal-
ity, Basic Feasible Solutions, Characteristics of a Basic Feasible
Solution, Facts about Linear Programming, Key to the Simplex
Method, Simplex Algorithm
11-13 Simplex method Algebra of the simplex method, Simplex al- T T
gorithms, optimality and unboundedness, Unique and Alter-
nate solutions, degeneracy,
14-15 Modified Simplex Method, • Simplex Starting and Conver- T T
gence, Use of artificial variables, Two-phase method, Example:
Two-Phase method, Big-M method
16-17 Revised Simplex method • Revised simplex method and dual- T T
ity theory

18-21 Duality: Farkas Lemma and KKT Condition: An Example: T T

Where Farkas Lemma in action Proof of Farkas Lemma, KKT
condition, KKT Condition and Optimality, KKT condition ex-
amples, Lagrange multiplier, and solution of equality con-
straint
22-24 Decomposition: Column generation: Linear Programming: T T
Decomposition Principle, Decomposition principles, Master
Problem, Sub-problem
25-28 Network Flow Problem • Introduction to Network Optimiza- T R
tion, Minimum Cost Flow Problem, Shortest Path Problem,
Maximum Flow Problem, The Assignment Problem, The Mul-
ticommodity Flow Problem, The Multicommodity Capaci-
tated Network Design Problem, Simplex method for network
optimization, Tree Properties, Network Presentation Matrix,
Network flow problem using simplex method

For the definitions of T and R , Please refer to Section 3.

230
 Operations Research/4th year 2nd Semester 2024

TBA
Course Teacher, CSE 3103 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

231
 Quantum Computing/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4247 Quantum Computing

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code CSE 4247
Course Title Quantum Computing
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Linear algebra and operators. Introduction to quantum mechanics. Quantum gates and quantum circuits.
▲

Superposition and entanglement: Superposition Polarization of light, Single qubit notation Measurement
of Qubit BB84, Bloch Sphere Notation. Entangled States, Testing for Entangled States, Bell Pair and Bell
States EPR, Paradox and Bell Theorem. Simple Quantum Algorithms: Deutsch Deutsch-Jozsa, Grover.
Project design and presentation.

3 Text and Reference Materials

T Textbook:

– M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Tenth Edi-
tion, Cambridge University Press , 2011.

R References:

– N. D. Mermin, Quantum Computer Science: An Introduction, First Edition, Pearson, 2007.

R References:

– Hafiz Md. Hasan Babu, Quantum Computing: A Pathway to Quantum Logic Design, Second
Edition, Iop Publishing Ltd, 2023.

232
 Quantum Computing/4th year 2nd semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration T T
and guidelines
Introduction to Linear algebra and operators.
3-4 Introduction to quantum mechanics. T T
5-7 Basics of quantum gates and quantum circuits. T T
8-12 Methods of the Superposition Polarization of light. T T
13-14 Introduction to Single qubit notation Measurement of Qubit T T
BB84.
15-17 Basics of Bloch Sphere Notation. T T
18-21 Introduction to Entangled States and testing for Entangled T R
States.
22-24 Introduction to Bell Pair and Bell States EPR, Paradox and Bell T T
Theorem.
25-26 Introduction to Simple Quantum Algorithms such as Deutsch T T
Deutsch-Jozsa and Grover.
27-28 Project design and presentation. T R

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 1203 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

233
 Game Theory/4th year 2 Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - CSE 4249 Game Theory

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2 Semester 2024
Course Code CSE 4249
Course Title Game Theory
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Courses III
Prerequisite Course None

2 Syllabus
Introduction: Introduction to game theory, History, different families of games, strategies, payoffs, ra-
▲

tionality, equilibrium Normal-form games: simultaneous-move games with pure and mixed strategies,
zero-sum game, constant-sum game, rollback, dominance, best-response algorithms, Min-Max methods,
Nash equilibrium, price of anarchy; Extensive-form games: sequential-move games, game trees, strat-
egy, centipede game, combining sequential and simultaneous moves, two-stage and multi-stage game,
sub-game, sub-game perfection, rollback equilibrium; Uncertainty and Information: games with perfect
and imperfect information (Bayesian game), complete and incomplete information game, cheap talk, con-
flicting interests, signaling game, BayesNash equilibrium; Repeated games: finite and infinite repetition,
Grims strategy, tit-for-tat, asymmetric information, pooling and separation Mechanism Design reverse
game theory, incentive compatibility constraint, participation constraint, social choice and voting theory,
social welfare, Groves-Clarke Mechanisms; Auction: types, auction rules and design, Dutch and English
auctions, bidding strategy, Vickery Auctions.

3 Text and Reference Materials

T Textbook:

– D. Fudenberg and J. Tirole, Game Theory, 1st Edition, The MIT Press, August 29, 1991
– Roger B. Myerson,Game Theory: Analysis of Conflict, Harvard University Press, August, 1997

R References:

– Yoav Shoham, Kevin Leyton-Brown, Multiagent Systems: Algorithmic, Game-Theoretic, and

Logical Foundations, Cambridge University Press, 2008
– Prajit K. Dutta, Strategies and Games: Theory and Practice, The MIT Press

234
 Game Theory/4th year 2 Semester 2024

Course Teacher, CSE 4249 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

235
 Human Computer Interaction/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
CSE 4251 Human Computer Interaction

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code CSE 4251
Course Title Human Computer Interaction
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Elective Course
Prerequisite Course CSE 3101 - Software Engineering

2 Syllabus
▲

Overview: Definition, scope, core HCI design principles, history of HCI, good and bad design exam-
ples. Cognitive aspects: Cognitive processes: attention, perception, problem-solving, planning, reasoning
and decision-making. Design implications of the above processes. Cognitive frameworks: mental mod-
els, gulf of execution and evaluation, metaphors, user’s conceptual models. Design philosophies: User-
centered, participatory, agile. Interaction and Interfaces Types: Direct manipulation, navigation by se-
lection, menu, forms, dialog box, content organization, grouping of menu items, presentation of sequence
of items, command languages, speech technology. Interaction types and devices: Command, Graphical,
Multimedia, augmented and virtual reality, Web, Mobile, Appliance, Voice, pen, touch, gesture, haptic,
multimodal, shareable, tangible, augmented reality, wearable, robot, smart. Design consideration of all
above. Guidelines, principles, and theories: platform-based guidelines and domain-specific guidelines,
guideline document: navigation, display, user’s attention, data entry facilitation. Well-accepted guide-
lines: Norman’s, Nielsen’s, Shneiderman’s, Dix’s, ISO9241. Theories: web-design theory, design-by-level
theory: GOMS model, states of action theory: e.g. Norman’s 7 stages and 4 design principles etc.. Phases
of interaction design: design process cycle: Shneiderman’s, Preece’s, Norman’s, Google sprint. Discov-
ering Requirements or Needfinding: functional, non-functional, UX requirements. Use case, survey, in-
terview, focus group, ethnographic observation, diaries and cultural probe, personas, contextual inquiry,
Requirement statement template. Design process / phases: conceptual design, concrete design, design
alternatives, sketching, scenario development and storyboarding, prototypes. Design methods: ideation,
alternatives and creativity. Prototyping Using scenarios, sketching, storyboarding, Index card. Generating
prototypes: customer journey map. Evaluation and user experience: Expert reviews and heuristics. Con-
ducting a heuristic evaluation, benefits and bottlenecks, expert review report. Usability test and labs. Web
usability by Budd, Travis and others. Think-aloud, cognitive walkthrough and related techniques. Ethi-
cal issues of usability test. A/B testing, user acceptance test, controlled experiments, survey techniques,
ethnographic observation, field study, statistical experiments. Web analytics as evaluation. Evaluation
case studies. Collaborative Interaction and Social Interaction: Remote conversation, video conferencing,
telepresence, co-presence, social engagement: design issues of all above. Predictive Laws of HCI: Fitt, Hip,
Miller, Pareto, Zipf laws. Social and legal issues related to design.

236
 Human Computer Interaction/4th year 1st semester 2024

3 Text and Reference Materials

T Textbook:

– Designing the User Interface; by Shneiderman et al., 6th Ed. (2016)

– Interaction Design: Beyond Human Computer Interaction; by Sharp, Rogers and Preece, 5th Ed.
(2019)

R References:

– Human Computer Interaction; by Dix, Finlay, Abowd and Beale, 3rd Ed. (2003)

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand evolution of human computer
Cognitive
CO1 interaction, basic concepts of HCI, interpret PO1 40%
(C3)
and apply core HCI principles.
Please refer
Understand and apply phases of interaction Cognitive
CO2 PO2 50% to Section 5.
design. (C4)
Use HCI principles, practices and guidelines
to solve real life complex problems, demon- Affective
CO3 PO6 10%
strate HCI skills and write report on HCI (A4)
concepts.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 60%
Midterm Exam 15% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 10% 5%
Class Participation 5% 5%
Total 40% 45% 15% 100%

Course Teacher, CSE4230 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

237
17.4 Mathematics and Statistics Courses

238
 Differential and Integral Calculus/1st year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
MATH 1107 Differential and Integral Calculus

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code MATH 1107
Course Title Differential and Integral Calculus
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course None

2 Syllabus
▲

Functions: Graphing Functions, Mathematical Models and Commonly used Functions (Linear, Polyno-
mial, Power), Mathematical Models and Commonly Used Functions (Algebraic, Trigonometric, Exponen-
tial, and Logarithmic Functions), Transformations (Scaling, Reflection, Composition), Inverse of Functions,
Growth of Functions. Limits: Concepts, One Sided Limits, Infinite limits, Limit Laws, Sandwich Theorem,
Formal Definition of Limits and Continuity of Functions, Intermediate Value Theorem and Its Application,
Limits at Infinity and the Horizontal Asymptotes. Derivatives: Derivatives and Rate of Change, Deriva-
tives as Functions, Differentiability of Functions, Rules and Techniques of Differentiation, Chain Rule,
Indeterminate Forms and L’Hospital’s Rule. Applications of Differentiation: Rates of Change in Natu-
ral and Social Sciences, Finding Minimum and Maximum Value of Functions and the First and Second
Derivative Tests. Integrals: Riemann Sum and Definite Integrals, Properties of Integrals, Fundamental
Theorem of Calculus, Antiderivative and Indefinite Integral, Net Change Theorem. Techniques of Inte-
gration: Substitution Rule, Integration by Parts, Trigonometric Substitution, Partial Fractions, Approx-
imate Integration, Improper integrals. Application of Integration: Average Value of a Function, Mean
Value Theorem for Integrals, Finding Area between Curves, Volumes by Slicing, Disks and Washers.

3 Text and Reference Materials

T Textbook:

– Calculus: Early Transcendentals by James Stewart

R References:

– Calculus: Early Transcendentals by Howard Anton, Irl Bivens, and Stephen Davis

239
 Differential and Integral Calculus/1st year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understand the basics of functions, limit Cognitive
CO1 PO1 40%
and continuity. (C3)
Interpret the core mechanisms of differen- Please refer
Cognitive
CO2 tiation and apply these techniques to solve PO2 50% to Section 5.
(C4)
real-life problems.
Understand the relation between differenti-
Affective
CO3 ation and integrattion and apply integration PO6 10%
(A4)
techniques to solve real-life problems.

Legend:
CO: Course Outcome PO: Program Outcome (Appendix: ??)
LoBT: Level of Bloom’s Taxonomy (Appendix: ??)

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

Course Teacher, MATH 1107 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

240
 Linear Algebra/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
MATH 1207 Linear Algebra

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code MATH 1207
Course Title Linear Algebra
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course MATH 1107: Differential and Integral Calculus
▲

2 Syllabus
Basics: Matrices, Linear Equations and Gaussian Elimination, Inverse Matrices, LU Factorization. Vector
Spaces: Solving system of linear equations and row space, column space, null space, and Rank. Lin-
ear independence: basis and dimension. Orthogonal vectors: Subspaces, inner products, projection
onto subspaces, projection matrices and least squares, orthogonal basis and GramSchmidt orthogonaliza-
tion. Determinants and their properties, Co-factors, Cramer’s rule and other applications of determinants.
Eigenvalues and Eigenvectors: Basics, application in diagonalization, computing powers of matrices, and
solving difference equations. Various Matrices: Symmetric matrices, Hermitian matrices, Spectral theo-
rem, positive definite matrices and minima. Introduction to Linear Transformations: change of basis,
and Singular Value Decomposition, norm of a matrix and condition number, Left and Right inverse and
pseudoinverse, QR decomposition.

3 Text and Reference Materials

T Textbook:

– Howard Anton and Chirs Rorres, Elementary Linear Algebra, Eleventh Edition, Wiley Publica-
tions.

R References:

– Dan Margalit and Joseph Rabinoff, Interactive Linear Algebra , Georgia Intitute of Technology,
https://textbooks.math.gatech.edu/ila/.

R References:

241
 Linear Algebra/1st year 2nd semester 2024

∗ Gilbert Strang, Linear Algebra and Its Applications, Cengage Learning, Fourth Edition.
R References:
∗ Kenneth Kuttler, Linear Algebra, Theory And Applications, Saylor Foundation, https://resources.saylor.org
content/uploads/2012/02/Linear-Algebra-Kuttler-1-30-11-OTC.pdf.
R References:
∗ David Lay, Steven Lay, and Judi McDonald, Linear Algebra and Its Applications, Pearson,
Fifth Edition, https://home.cs.colorado.edu/ alko5368/lecturesCSCI2820/mathbook.pdf.

Course Teacher, MATH 2107 Chairman, Dept. of CSE, DU

April 23, 2024 April 23, 2024

242
 Differential Equation, Laplace Transformation and Fourier Analysis/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - MATH 2107

Differential Equation, Laplace Transformation and
Fourier Analysis

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code MATH 2107
Course Title Differential Equation, Laplace Transformation and Fourier Analysis
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course MATH 1207: Linear Algebra
▲

2 Syllabus
Differential Equations: Modeling with Differential Equations, Solving First Order Differential Equations,
Direction Fields and Euler’s Method, Methods for Separable Equations and Linear Equations. Partial Dif-
ferential Equation (PDE): Introduction and formation of PDE; Solution of linear and non-linear PDE
of order one. Laplace Transformation : Forward transform, inverse transform. Examples of transform
pairs. The Laplace transform of a differential equation. The use of Laplace transforms for the solution of
initial value problems, existence and uniqueness of Laplace transforms. Fourier Analysis: Properties of
Fourier series, Fourier sine and cosine series, Fourier transform of continuous and discrete signals, Fourier
Coefficients and orthogonality, General periodic functions, odd and even functions, Fourier transform of
continuous and discrete signals and the discrete Fourier transform and the FFT algorithm.

3 Text and Reference Materials

T Textbook:

1. Phil Dyke, An Introduction to Laplace Transforms and Fourier Series, Second Edition, Springer.
2. Shepley L. Ross, Differential Equations, Third Edition.

R References:

1. Dennis G. Zill, Differential Equations with Boundary-Value Problems, Ninth Edition.

2. V. Sundarapandian, Ordinary and Partial Differential Equations with Laplace Transforms,
Fourier Series and Applications.

243
 Differential Equation, Laplace Transformation and Fourier Analysis/2nd year 1st semester 2024

4 Topic Outline

Lecture Selected Topic Article Problems

1-3 Classification of Differential Equation, their origin and ap- T2 T2, R1
plication • Solutions of Differential Equation and their Exis-
tences • Initial-value problems, Boundary-value problems
3-7 Exact Differential Equation and Integrating Factors • Separa- T2 T2, R1
ble, Linear and Bernoulli Equation • Special Integrating Fac-
tors and Transformation
8-11 Partial Differential Equations (PDE): Basic Concepts and Ex- T2 T2, R1
amples • The method of separation of variables • Solution of
linear and non-linear PDE
12-14 Laplace Transformation : Forward transform, inverse trans- T1 T1
form. Examples of transform pairs. • The Laplace transform
of a differential equation
15-18 The use of Laplace transforms for the solution of initial value T1 T1, R2
problems • Existence and uniqueness of Laplace transforms.
19-21 Properties of Fourier series • Fourier sine and cosine series • T1 T1, R2
Fourier transform of continuous and discrete signals
22-25 Fourier Coefficients and orthogonality • General periodic T1 T1, R2
functions, odd and even functions
26-28 Fourier transform of continuous and discrete signals • The T1 T1, R2
discrete Fourier transform • FFT algorithm

Course Teacher, MATH 1207 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

244
 Probability and Statistics/2nd Year 2nd Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - STAT 2207 Probability and Statistics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd Year 2nd Semester 2024
Course Code STAT 2207
Course Title Probability and Statistics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course None

2 Syllabus
Introduction: Descriptive and Inferential Statistics, Populations and Samples Data with Graphs: Pie, Bar,
Line Charts, Dot Plots, Stem and Leaf plots, Frequency tables and Graphs, Grouped Data and Histograms
▲

Data with Numerical Measures: Measures of Centre (Mean, Median, Mode) and Variability (Range, Vari-
ance, Standard Deviation), Tchebysheff’s Theorem and Empirical Rules, Z-score, Percentile and Quartiles,
The Five-Number Summary and the Box Plot, Scatterplots Probability: Events, Simple Events and Sam-
ple Space, Counting Rules, Probability Axioms of Probability, Conditional Probability and Independence,
Bayes’ Rule Discrete Random Variables and Probability Distributions: Discrete Random Variables with
Mean and Standard Deviation and Probability Distribution; Bernoulli’s, Binomial, Poisson, Hypergeomet-
ric Random Variables and their Probability Distribution, Continuous Random Variables and Probability
Distributions: Continuous Random Variable, Uniform and Exponential Probability Distribution, Normal
Random Variable and Probability Distribution, Probabilities associated with Standard, Normal Random
variable, Normal approximation to the Binomial Probability Distribution Sampling Distribution: Sam-
pling Plan and Statistics, Central Limit Theorem and Sample Mean, Laws of Large Numbers, Sampling
Distribution of Sample Mean and Sample Proportion Linear Regression and Correlation: Simple Linear
Regression Model, Method of Least Squares, Analysis of Variance (ANOVA), Testing Linear Regression
Model, Correlation Analysis, Introduction to Multiple Regression Analysis Analysis of Categorical Data:
Multinomial Experiment and Chi-square statistic, Contingency Table, Chi-Square Test for Independence,
Chi-Square Test for Goodness-of-Fit

3 Text and Reference Materials

T Textbook:
– William Mendenhall, Robert J Beaver and Barbara M. Beaver, Introduction to Probability and
Statistics, 15th Edition, Cengage Learning, Inc., 2020.
R References:
– Sheldon M. Ross, Introductory Statistics, 4th Edition, Elsevier, 2017.

– Prem S Mann, Introductory Statistics, 10th Edition, John Willy and Sons, Inc., 2020.

245
 Probability and Statistics/2nd Year 2nd Semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Compute and interpret descriptive statistics Cognitive
CO1 PO1 20%
using numerical and graphical techniques. (C2)
Apply key concepts of probability, basic
rules, counting rules and theorems in prob-
Please refer
ability including Bayes’s and the Central Cognitive
CO2 PO2 35% to Section 5.
Limit Theorem (CLT), probability distribu- (C3)
tions, conditioning, independence, expecta-
tions, and variances.
Define and demonstrate discrete and con-
tinuous random variables and their statisti-
cal distributions, sampling theory, method Cognitive
CO3 PO3 45%
of least squares to estimate the parameters (C2)
in a regression model and analysis of cate-
gorical data.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 10% 20% 30% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 20% 35% 45% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-4 • Descriptive and Inferential Statistics, Populations and Sam- T T
ples • Pie, Bar, Line Charts, Dot Plots, Stem and Leaf plots •
Frequency tables and Graphs, Grouped Data and Histograms
• Measures of Centre (Mean, Median, Mode) and Variability
(Range, Variance, Standard Deviation) • Tchebysheff’s Theo-
rem and Empirical Rules, Z-score • Percentile and Quartiles,
The Five-Number Summary and the Box Plot, Scatterplots
5-8 • Events, Simple Events and Sample Space • Counting Rules • T R
Axioms of Probability, Conditional Probability and Indepen-
dence, Bayes’ Rule

246
 Probability and Statistics/2nd Year 2nd Semester 2024

9-13 • Discrete Random Variables with Mean and Standard Devia- T T

tion and Probability Distribution • Bernoulli’s, Binomial, Pois-
son, Hypergeometric Random Variables and their Probability
Distribution
14-18 • Continuous Random Variable, Uniform and Exponential T T
Probability Distribution, Normal Random Variable and Prob-
ability Distribution • Probabilities associated with Standard,
Normal Random variable • Normal approximation to the Bi-
nomial Probability Distribution
19-21 • Sampling Plan and Statistics, Central Limit Theorem and T T
Sample Mean • Laws of Large Numbers • Sampling Distribu-
tion of Sample Mean and Sample Proportion
22-25 • Simple Linear Regression Model, Method of Least Squares, T R
Analysis of Variance (ANOVA), Testing Linear Regression
Model • Correlation Analysis • Introduction to Multiple Re-
gression Analysis
26-28 • Multinomial Experiment and Chi-square statistic, Contin- T R
gency Table • Chi-Square Test for Independence • Chi-Square
Test for Goodness-of-Fit

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, STAT 2207 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

247
 Random Processes/3rd Year 1st Semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - STAT 3107 Random Processes

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 3rd Year 1st Semester 2024
Course Code STAT 3107
Course Title Random Processes
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course None

2 Syllabus
The fundamentals of Probability: Probability Spaces, conditional probability, independence, Discrete
▲

and Continuous Random Variables, Multiple RVs, Random Vectors, Function of Random Variables, Expec-
tation, Variance, Conditional Expectation and Convergence Bounds: Jensen, Markov, Chebyshev, Chernoff
Limit Theorems: Strong and Weak Laws of Large numbers, Central Limit Theorem Estimation: Types of
Estimators, Point Estimator of Population Mean and Proportion, Estimating a Population Variance, Inter-
val Estimators of Population Mean and Proportion, Difference between Two Population Means and Two
Binomial Proportions Statistical Hypotheses Testing: Hypothesis Tests and Significance Levels, Hypoth-
esis Tests concerning Population Proportions for Large Sample, Hypothesis Tests concerning the Mean
of a Normal Population Markov Chain: Random Processes, Discrete Time Markov Chains - PageRank,
Chapman-Kolmogorov Equations, Gambler’s Ruin Problem, Law of Large Numbers for Markov Chains,
Continuous Time Markov Chains, Birth and Death Processes, Irreducible and Reducible Markov Chains,
Ergodicity, Markov Decision Process (MDP), Expectation-Maximization Algorithm, Hidden Markov Mod-
els; Queuing System: Principles of Queuing System, M/M/1, M/M/1/K, Queue Tandem, Littl’s Law,
Foster-Lyapunov stability criterion and moment bounds.

3 Text and Reference Materials

T Textbook:

– Alberto Leon-Garcia, Probability, Statistics and Random Processes for Electrical Engineering,
3rd Edition, Pearson, 2008.

R References:

– William Mendenhall, Robert J Beaver and Barbara M. Beaver, Introduction to Probability and
Statistics, 15th Edition, Cengage Learning, Inc., 2020.

– Dimitris P. Bertsekas and John N. Tsitsiklis, Introduction to Probability, 2nd Edition, Athena
Scientific, 2008.

248
 Random Processes/3rd Year 1st Semester 2024

– Jean Walrand, Probability in Electrical Engineering and Computer Science: An Application-

Driven Course, e-book, 2014.

TBA
Course Teacher, STAT 3107 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

249
17.5 General Education Courses

250
 History of Emergence of Bangladesh/1st year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
HUM 1109 History of Emergence of Bangladesh

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code HUM 1109
Course Title History of Emergence of Bangladesh
Course Credit 2.0 units
Contact Hours Per Week 2
Course Status GED Course
Prerequisite Course None

2 Syllabus
▲

Ancient Period: Prehistoric Bengal, Maurya dynasty; Early Middle Ages: Gauda Kingdom, Pala dynasty,
Chandra dynasty, Sena dynasty, Deva Kingdom; Late Middle Ages: Turko Afghan rule, Sonargaon Sul-
tanate. Bengal Sultanate: Ilyas Shahi dynasty, Ganesha dynasty, Hussain Shahi dynasty; Mughal period:
Nawabs of Bengal, Europeans in Bengal, Battle of Plassey. British rule: British Rules in Indian Subconti-
nent, The Early Resistance Movements, Bengal Renaissance, Muslim League and its significance, Partition
of Bengal, Lahore Resolution, Communal riots, Creation of Pakistan. Pakistan period: Bengali Language
Movement, Politics: 1958–1971: United front, elections, six points movement, 11 Point Program of Stu-
dents, Agartala Conspiracy case, Mass Uprising (1969), The Election of 1970, Non-Cooperation Movement.
The Liberation War of Bangladesh: Formal Declaration of Independence, Operation Search Light, Mujib-
nagor Government, Interactive Timeline of the Bangladesh Liberation War, Major operations of Bangladesh
freedom fighters, East Pakistani paramilitary forces, Role of India and other Major Powers in the Liberation
War, Heroes of 1971, killing of Bangladeshi intellectuals, Surrender of Pakistan. Role of the Dhaka Uni-
versity in the emergence of Bangladesh. Political history of Bangladesh (1972 – present): Formation
of the constitution, Situation of Bangladesh just after independence, Famine of 1974, Assassination of the
father of the nation, Killing in jail, Military coups, Different governments in this period. Resources and
Achievements of Bangladesh.

3 Text and Reference Materials

T Textbook:

– Badruddin Umar, The Emergence of Bangladesh, Part 1 2, 1st Edition, Oxford Press, 2004.

R References:

– Barrister Md. Omar Faruque, Emergence of Bangladesh, ?? Edition, ?? Publisher, ?? Year.

251
 History of Emergence of Bangladesh/1st year 1st semester 2024

4 Course Outcomes
At the completion of this course, the students are expected to -

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Identify the main events of the history of
Bangladesh from the pre-historic time to Cognitive
CO1 PO1 40%
the Emergence of Bangladesh as a sovereign (C3)
state in 1971.
Explain post-liberation facts, events, and Please refer
Cognitive
CO2 initiatives taken behind the emerging eco- PO2 50% to Section 5.
(C4)
nomic growth of Bangladesh.
Compare the impacts of different periods in
Affective
CO3 the cultural, social, educational, and eco- PO6 10%
(A4)
nomic development of the country.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 35% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 40% 50% 10% 100%

Course Teacher, HUM 1109 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

252
 Electrical Circuits/1st year 1st semester 2024

Course Outline
EEE 1105 Electrical Circuits

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code EEE 1105
Course Title Electrical Circuits
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course None

2 Syllabus
Resistor: Properties, Types of Resistors, Ohm’s Law, Power, Energy, Efficiency, etc.; Series DC Circuits
Kirchhoff’s Voltage Law, Voltage Divider Rule, Power Distribution, Voltage Regulation, Voltage Sources in
Series, etc.; Parallel DC Circuits: Conductance and Resistance, Kirchhoff’s Current Law, Current Divider
Rule, Open Circuit, Short Circuit, Voltage Sources in Parallel, etc.; Parallel Network: Reduce and Return
Approach, Block Diagram Approach, Ladder Networks.; Methods of Analysis for DC Networks: Cur-
rent Source, Source Conversion, Current Sources in Series and Parallel, Branch- Current Analysis, Mesh
Analysis, Nodal Analysis, Bridge Network and Y- and -Y Conversions.; Network Theorems (DC): Super-
position Theorem, Thevenin’s Theorem, Norton’s Theorem, Maximum Power Transfer Theorem, Millman’s
Theorem, Substitution Theorem, Reciprocity Theorem etc. ; Capacitor: Electric Field, Capacitance, Dielec-
tric Strength, Leakage Current, Types of Capacitors, Charging and Discharging Phase, Energy Stored by
a Capacitor, Capacitors in Series and Parallel.; Inductor: Magnetic Field, Inductance, Types of Inductors,
Faraday’s Law and Lenz’s Law, Inductors in Series and Parallel. R-L, R-C and R-L-C Circuits with DC In-
put.; Introduction to Sinusoidal Alternating Waveform: Definitions, General Format for the Sinusoidal
Voltage or Current, Phase Relations, Ordinary and Frequency Response of Basic R, L and C Elements,
Average Power and Power Factor, Rectangular and Polar Form, Phasor.;

3 Text and Reference Materials

Textbook:

– Robert L. Boylestad, Introductory Circuit Analysis, Thirteenth Edition, Pearson Publications,

2015.

References:

– Charles Alexander & Matthew Sadiku, Fundamentals of Electric Circuits, Sixth Edition, McGraw
Hill, 2016.

253
 Electrical Circuits/1st year 1st semester 2024

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Analyze the operational principles and char-
Cognitive
CO1 acteristics of resistors, dc serial and parallel PO1 40%
(C3)
circuits.
Please refer
Explain methods of analysis and network Cognitive
CO2 PO2 50% to Section 5.
theorems for dc networks. (C4)
Provides basic introductions to capacitors,
Affective
CO3 inductors, and Sinusoidal Alternating Wave- PO6 10%
(A4)
form

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 40% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 55% 10% 100%

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration
and guidelines • Resistor Properties • Types of Resistors •
Temperature affect on the resistance of a material • Become
familiar with the broad range of commercially available resis-
tors.
3-4 Ohm’s law, power and energy • Understand the importance of
Ohm’s law and its application • Become aware of the differ-
ences between power and energy levels.
5-7 Series dc network •Become familiar with the characteristics of
a series circuit • Develop a clear understanding of Kirchhoff’s
voltage law • Application of the voltage divider rule.
8-12 Series-Parallel dc network •• Become familiar with the charac-
teristics of a parallel network • Develop a clear understanding
of Kirchhoff’s current law • Application of the current divider
rule • Clearly understand the impact of open and short cir-
cuits on the behavior of a network.

254
 Electrical Circuits/1st year 1st semester 2024

13-14 Methods of Analysis • Become familiar with the terminal char-

acteristics of a current source • Application of branch-current
analysis and mesh analysis to find the branch currents • Ap-
plication of nodal analysis to find all the terminal voltages of
any series-parallel network • Become familiar with bridge net-
work configurations and how to perform Delta to Y or Y to
Delta conversions.
15-17 Network Theorems: • Superposition Theorem • Thévenin’s
Theorem • Norton’s Theorem • Maximum Power Transfer
Theorem • Millman’s Theorem • Substitution Theorem • Reci-
procity Theorem
18-21 Capacitor: • Introduction to basic construction of a capaci-
tor and the factors that affect its ability to store charge on
its plates. • Methods of o determining the transient (time-
varying) response of a capacitive network and plot the result-
ing voltages and currents. • Understand the impact of com-
bining capacitors in series or parallel ;
22-24 Inductor • Become familiar with the basic construction of an
inductor, the factors that affect the strength of the magnetic
field established by the element • Methods of o determining
the transient (time-varying) response of an inductive network
and plot the resulting voltages and currents • Understand the
impact of combining inductors in series or parallel.
25-26 Introduction to Sinusoidal Alternating Waveform • Become
familiar with the characteristics of a sinusoidal waveform
• Determine the phase relationship between two sinusoidal
waveform of the same frequency •
27-28 Reviews • Problem-solving practices, • Assign-
ments/Presentations, etc.

Course Teacher, EEE 1105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

255
 Electrical Circuits Lab/1st year 1st semester 2024

Course Outline
EEE 1106 Electrical Circuits Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 1st semester 2024
Course Code EEE 1106
Course Title Electrical Circuits Lab
Course Credit 0.75 units
Contact Hours Per Week 3 hours in alternate weeks
Course Status GED Course
Prerequisite Course None

2 Syllabus
Lab experiments of this course will be based on the theory topics covered in EEE 1105 Electrical Circuits.
The major experiments include verification of Ohm’s Law, Series and Parallel DC circuit design, methods of
analysis such as Branch Current Analysis, Mesh Analysis, Nodal Analysis. Other lab experiments include
verification of DC Network theorems, Current flow and Voltage drop analysis of RL, RC, and RLC circuits.

3 Text and Reference Materials

Textbook:

– Robert L. Boylestad, Introductory Circuit Analysis, Thirteenth Edition, Pearson Publications,

2015.

References:

– Charles Alexander & Matthew Sadiku, Fundamentals of Electric Circuits, Sixth Edition, McGraw
Hill, 2016.

Course Teacher, EEE 1105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

256
 Physics/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - PHY 1205 Physics

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code PHY 1205
Course Title Physics
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status Core Course
Prerequisite Course None

2 Syllabus
Waves and Oscillations: Differential equation of a simple harmonic oscillator, total energy and average
▲

energy, Lissajous figures, spring-mass-system, calculation of period of a torsional pendulum, damped os-
cillation, determination of damping co-efficient, forced oscillation, resonance, two-body oscillations, Re-
duced mass, differential equation of a progressive wave, power and intensity of wave motion, stationary
wave, group velocity and phase velocity, reverberation; Physical Optics: Interference of light, Young’s
double slit experiment, Displacements of fringes and its uses, Newton’s rings, Diffraction of light, Fresnel
and Fraunh offer diffraction, diffraction by a single slit, resolving power of optical instruments, diffrac-
tion grating, production and analysis of polarized light, Brewster’s law, Malus law, Polarization by double
refraction, retardation plates, Nicol prism, optical activity, polarimeters, polaroid. Structure of Matter:
Crystalline and Non-Crystalline Solids, Single Crystal and Polycrystal Solids, Unit Cell, Crystal Systems,
Co-ordinations Number, Crystal Planes and Directions, Packing Factor, Miller Indices, Bragg’s Law, Inter-
atomic Distances, Introduction to Band Theory, Distinction between Metal, Semiconductor and Insulator.
Electricity: Coulomb‘s Law, The Electric field, Electric field due to: a charged particle, a dipole, a line
of charge, a charged disk; A point charge and a dipole in an Electric field; Electric Flux, Gauss‘ law, Ap-
plying Gauss’ law: Cylindrical Symmetry, Planar Symmetry, Spherical Symmetry; Electric Potential, Po-
tential and Field Strength, Potential due to: a charged particle, an Electric dipole; Magnetism: Magnetic
→
−
fields and the definition of B , Crossed fields: Discovery of the Electron, The Hall effect; Magnetic force
on a current-carrying wire, Torque on a current loop, Magnetic dipole moment; Magnetic Fields due to
currents: Biot-Savart law, Force between two parallel currents; Ampere’s law, Solenoids and Toroids, A
current-carrying coil as a Magnetic Dipole, Faraday‘s law and Lenz‘s law, Induction and Energy transfers,
Induced Electric Fields, Inductor and Inductance, Self Induction, RL circuit, Energy stored in a Magnetic
field, Energy density of a magnetic field.

257
 Physics/1st year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– David Halliday, Robert Resnick and Jearl Walker., Fundamentals of Physics - Volume 2, 10th
Edition, Wiley Publications.
– Hugh D. Young and Roger A. Freedman, University Physics with Modern Physics, 15th Edition,
Pearson Publications.

R References:

– Christopher Hammond, The Basics of Crystallography and Diffraction, 3rd Edition, Oxford
Science Publications.

4 Topic Outline

Lecture Selected Topic Article Problems

1-4 Waves and Oscillations: Differential equation of a simple harmonic os- T T
cillator, total energy and average energy, Lissajous figures, spring-mass-
system, calculation of period of a torsional pendulum, damped oscilla-
tion, determination of damping co-efficient, forced oscillation, resonance,
two-body oscillations, Reduced mass, differential equation of a progres-
sive wave, power and intensity of wave motion, stationary wave, group
velocity and phase velocity, reverberation;
5-9 Physical Optics: Interference of light, Young’s double slit experiment, T T
Displacements of fringes and its uses, Newton’s rings, Diffraction of light,
Fresnel and Fraunh offer diffraction, diffraction by a single slit, resolving
power of optical instruments, diffraction grating, production and analy-
sis of polarized light, Brewster’s law, Malus law, Polarization by double
refraction, retardation plates, Nicol prism, optical activity, polarimeters,
polaroid.
10-14 Structure of Matter: Crystalline and Non-Crystalline Solids, Single Crys- T T
tal and Polycrystal Solids, Unit Cell, Crystal Systems, Co-ordinations
Number, Crystal Planes and Directions, Packing Factor, Miller Indices,
Bragg’s Law, Interatomic Distances, Introduction to Band Theory, Distinc-
tion between Metal, Semiconductor and Insulator.
15-20 Structure of Matter: Crystalline and Non-Crystalline Solids, Single Crys- T T
tal and Polycrystal Solids, Unit Cell, Crystal Systems, Co-ordinations
Number, Crystal Planes and Directions, Packing Factor, Miller Indices,
Bragg’s Law, Interatomic Distances, Introduction to Band Theory, Distinc-
tion between Metal, Semiconductor and Insulator.
21-28 Magnetism: Magnetic fields and the definition of ↑ B, Crossed fields: T T
Discovery of the Electron, The Hall effect; Magnetic force on a current-
carrying wire, Torque on a current loop, Magnetic dipole moment; Mag-
netic Fields due to currents: Biot-Savart law, Force between two parallel
currents; Ampere’s law, Solenoids and Toroids, A current-carrying coil as
a Magnetic Dipole, Faraday‘s law and Lenz‘s law, Induction and Energy
transfers, Induced Electric Fields, Inductor and Inductance, Self Induc-
tion, RL circuit, Energy stored in a Magnetic field, Energy density of a
magnetic field.

258
 Physics/1st year 2nd semester 2024

Course Teacher, PHY 1205 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

259
 Physics Lab/1st year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - PHY 1206 Physics Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 1st year 2nd semester 2024
Course Code PHY 1206
Course Title Physics Lab
Course Credit 0.75 units
Contact Hours Per Week 3 hours in alternate weeks
Course Status Elective Course
Prerequisite Course None

2 Syllabus
Lab experiments will be conducted in the Physics Lab on some selected topics from the theory course PHY
▲

1205. Experiments such as Diffraction grating, Newton’s ring, Surface tension, Newton’s law of cooling,
RC circuit and RL circuit, etc. can be demonstrated in the lab.

3 Text and Reference Materials

T Textbook:

– David Halliday, Robert Resnick and Jearl Walker., Fundamentals of Physics - Volume 2, 10th
Edition, Wiley Publications.
– Hugh D. Young and Roger A. Freedman, University Physics with Modern Physics, 15th Edition,
Pearson Publications.

R References:

– Christopher Hammond, The Basics of Crystallography and Diffraction, 3rd Edition, Oxford
Science Publications.

Course Teacher, PHY 1206 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

260
 Electronic Devices and Circuits/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
EEE 1209 Electronic Devices and Circuits

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code EEE 1209
Course Title Electronic Devices and Circuits
Course Credit 3.0 units
Contact Hours Per Week 3
Course Status GED Course
Prerequisite Course EEE 1105 Electrical Circuits

2 Syllabus
▲

Introduction to Semiconductors: Properties, bonds and types of semiconductors. Semiconductor Diodes

and Special Purpose Diodes: The PN junction diode: formation, properties and V-I characteristics, Basic
constructions, characteristics, operations and uses of special diodes: Light-emitting diode (LED), Zener
diode etc. Diode Application: Half-wave and full-wave rectifiers – operation and efficiency, Ripple fac-
tor, Filter circuits, Clipping and Clamping circuits, Voltage regulation and regulator circuits - Zener diode
and transistor voltage regulator. Bipolar Junction Transistors: NPN and PNP transistors, amplifying and
switching actions of transistor, transistor characteristics in CB, CE & CC configurations, transistor load
line and Operating point. BJT Biasing: Linear amplification, inherent variation of transistor parameters
and thermal runway, stabilization and stability factor, methods of BJT biasing, analysis and design of bi-
asing circuits. Single Stage Transistor Amplifier: Single stage amplifier circuit, phase reversal, dc and ac
equivalent circuits, load line analysis, voltage gain and power gain, classification of amplifiers, amplifier
equivalent circuits. Field Effect Transistors: Classification of FET, construction, operation and character-
istics of JFET and MOSFET, transfer characteristics and Shockley’s equation, DC biasing of JFET. Power
Electronics: operations, characteristics and applications of industrial electronics devices: SCR (Silicon
Controlled Rectifier), TRIAC, DIAC etc. Feedback Techniques and Op-amps: Concepts- negative and
positive feedback, characteristics and gain with negative voltage and current feedback, emitter follower,
basic Op-amps- characteristics, inverting, non-inverting, integrators, differentiators, summing amplifiers.
Oscillators: Theory of oscillation and characteristics of different oscillators.

3 Text and Reference Materials

T Textbook:

– Thomas L. Floyd, ELECTRONIC DEVICES, Conventional Current Version, 10th Edition, Pear-
son, 2018.

R References:

261
 Electronic Devices and Circuits/2nd year 1st semester 2024

– Robert Bolyestad, Louis Nashelsky, ELECTRONIC DEVICES and CIRCUIT THEORY , 11th Edi-
tion, Pearson, 2012.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Understanding of Semiconductor Physics:
•Explain the fundamentals of semiconduc-
tor materials and their behavior.
Cognitive
CO1 •Describe the principles of electron and hole PO1 10%
(C2)
movement in semiconductors.
•Analyze doping techniques and their ef-
fects on semiconductor properties.
Understanding of Diodes and Transistors:
•Analyze diode circuits and their applica-
tions in rectification, clipping, clamping.
•Differentiate between different types of
Please refer
transistors (BJT, MOSFET, etc.) and their op- Cognitive
CO2 PO2 60% to Section 5.
erating principles. (C2)
•Analyze transistor biasing circuits and
their stability.
•Design and analyze transistor amplifier cir-
cuits.
Operational Amplifiers:
•Explain the principles of ideal operational
amplifiers (Op-Amps) and their characteris-
tics.
•Analyze the behavior of Op-Amp circuits, Cognitive
CO3 PO2 30%
including inverting and non-inverting am- (C3)
plifiers, summing amplifiers, integrators,
and differentiators.
•Design and analyze Op-Amp circuits for
specific applications.

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 5% 35% 20% 60%
Midterm Exam 5% 10% 5% 20%
Class Test/Quiz 5% 5%
Assignment/Presentation 5% 5% 10%
Class Participation 5% 5%
Total 10% 60% 30% 100%

262
 Electronic Devices and Circuits/2nd year 1st semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Introduction to Semiconductors: Semiconductor Materials: T,R T,R
Ge, Si, and GaAs, Covalent Bonds, Energy Levels, N-type and
P-type materials, PN Junction, I-V Characteristics.
3-5 Diode Applications: Diode Approximations, Half and Full- T,R T,R
Wave Rectifiers. Average and RMS values of Half and Full-
Wave Rectifiers. Power Supply Filters and Regulators, Zener
Diode.
6-7 Diode Limiters and Clampers Circuits, Voltage Multipliers. T,R T,R
8 Bipolar Junction Transistor: BJT Structure, Operation, Char- T,R T,R
acteristics.
9-10 Common-Base, Common-Emitter, Common-Collector Config- T T,R
urations and their I-V Characteristics.
11-12 DC Biasing: Fixed Bias, Collector Feedback Bias, Voltage Di- T,R T,R
vider Bias.
13-14 Bias Stabilization: Stability Factors for various types of BJT T T
Bias Configurations.
15-16 Single Stage Transistor Amplifier: Transistor AC Models. CE, T,R T,R
CC, and CB Amplifiers.
17-18 Field Effect Transistors: JFET and its Characteristics. DC Bias- T T,R
ing of JFET.
19-20 MOSFET and its Characteristics. Depletion-Type and T T
Enhancement-Type MOSFETs.
21-22 Operational Amplifiers: Introduction to Operational Ampli- T,R T,R
fiers (OP Amp). Differential Amplifiers. Input and Output
Characteristics. Op-Amp parameters, CMRR, Slew Rate.
23-25 Op-Amp Applications: Negative Feedback. Inverting and T,R T,R
Non-Inverting Amplifiers, Summing Amplifier, Integrator,
Differentiator, Voltage Buffer Circuits. Analog-to-Digital and
Digital-to-Analog Converters using Op-Amps.
26-28 Power Electronics: Thyristors Operation and I-V Characteris- T T,R
tics. Diac and Triac: Characteristics and Operations. Device
Applications.

For the definitions of T and R , Please refer to Section 3.

TBA
Course Teacher, CSE 2109 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

263
 Electronic Devices and Circuits Lab/2nd year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
EEE 1210 Electronic Devices and Circuits Lab

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 2nd year 1st semester 2024
Course Code EEE 1210
Course Title Electronic Devices and Circuits Lab
Course Credit 0.75 units
Contact Hours Per Week 3 hours in alternate weeks
Course Status GED Course
Prerequisite Course None

2 Syllabus
▲

Diode Characteristics and Applications: Forward and Reverse Bias Characteristics: Plot the current-
voltage (IV) characteristics of a PN junction diode under forward and reverse bias condition. Rectifier
Circuit Design: Design and construct a half-wave and full-wave rectifier circuit using diodes. Measure
output voltage and ripple factor. Clipping and Clamping Circuits: Implement diode-based clipping and
clamping circuits and observe their effects on input signal. Zener Diode Voltage Regulation: Construct a
Zener diode voltage regulator circuit and verify its ability to maintain a constant output voltage.
Transistor Characteristics and Applications: Input and Output Characteristics: Plot the input and
output characteristics of Bipolar Junction Transistors (BJT) and Field Effect Transistors (FET). DC Biasing:
Set up a BJT/FET amplifier circuit with proper biasing. Measure the DC operating point and calculate
the transistor parameters (Beta, VBE). Common Emitter Amplifier: Design and construct a common emitter
amplifier circuit. Measure the voltage gain, input, output impedance, and frequency response.
Operational Amplifiers (Op-Amp): Op-Amp Characteristics: Measure the input offset voltage, slew
rate of an operational amplifier. Inverting and Non-Inverting Amplifiers: Construct and measure the voltage
gain, input and output impedance, and bandwidth of Inverting and Non-Inverting amplifiers. Analog-to-
Digital and Digital-to-Analog: Implement Op-Amp based analog-to-digital and digital-to-analog converter
circuits.

3 Text and Reference Materials

T Textbook:

– Thomas L. Floyd, ELECTRONIC DEVICES, Conventional Current Version, 10th Edition, Pear-
son, 2018.

R References:

264
 Electronic Devices and Circuits Lab/2nd year 1st semester 2024

– Robert Bolyestad, Louis Nashelsky, ELECTRONIC DEVICES and CIRCUIT THEORY , 11th Edi-
tion, Pearson, 2012.

TBA
Course Teacher, CSE 2110 Chairman, Dept. of CSE, DU
April 24, 2024 April 24, 2024

265
 Professional Ethics and Environment/4th year 1st semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
HUM 4105 Professional Ethics and Environment

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 1st semester 2024
Course Code HUM 4105
Course Title Professional Ethics and Environment
Course Credit 2.0 units
Contact Hours Per Week 2
Course Status GED Course
Prerequisite Course None

2 Syllabus
▲

Human Values: Morals, Values and Ethics, Different values of human. Introduction to Professional
Ethics: Basic Concepts, Governing Ethics, Personal & Professional Ethics, Ethical Dilemmas, Life Skills,
Emotional Intelligence, Thoughts of Ethics, Value Education, Dimensions of Ethics, Profession and profes-
sionalism, Professional Associations, Professional Risks, Professional Accountabilities, Professional Suc-
cess, Ethics and Profession. Basic Theories: Basic Ethical Principles, Moral Developments, Deontology,
Utilitarianism, Virtue Theory, Rights Theory, Casuist Theory, Moral Absolution, Moral Rationalism, Moral
Pluralism, Ethical Egoism, Feminist Consequentialism, Moral Issues, Moral Dilemmas, Moral Autonomy.
Professional Practices in Engineering: Norms of Professional Conduct vs. Profession; Work Place Rights
& Responsibilities of Engineers, Obligations and Moral Values in Professional Ethics, Professional codes of
ethics, the limits of predictability of the engineering profession; Engineers and Managers; Organizational
Complaint Procedure, difference of Professional Judgment; Case study (for example: lessons from 1979
American Airlines DC-10 Crash and Kansas City Hyatt Regency Walk away Collapse). Ethics in Research
Domain: research misconduct, mistakes and errors; the emerging emphasis on understanding and foster-
ing responsible conduct, responsible authorship, reviewing editing. Global and Environmental issues
in Professional Ethics: Introduction – Current Scenario, Technology Globalization of Multinational Cor-
porations, Environment-friendly technology development, Sustainable Industrial Revolutions 4.0 and 5.0,
International Trade, World Summits, Business Ethics and Corporate Governance, Sustainable Develop-
ment Ecosystem, Energy Concerns, Ozone Deflection, Pollution, Ethics in Manufacturing and Marketing,
Media Ethics, War Ethics, Bioethics, Intellectual Property Rights, Climate Justice and Equity, Circular
Economy and Zero-Waste Practices, Impact of Artificial Intelligence on Sustainability, Indigenous Rights
and Environmental Ethics, Ethics of Geoengineering, Transnational Environmental Policies and Corporate
Accountability.

266
 Professional Ethics and Environment/4th year 1st semester 2024

3 Text and Reference Materials

T Textbook:

– R. Subramanian, Professional Ethics, 1st Edition, Oxford University Press, 2017.

– R. S. Naagarazan, A Textbook on Professional Ethics And Human values, 1st Edition, New Age
International (P) Ltd, Publishers, 2016.

R References:

– Caroline Whitbeck, Ethics in Engineering Practice & Research, 2nd Edition, Cambridge Univer-
sity Press, 2011.

4 Course Outcomes
After completion of this course, the students are expected to -

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Develop their awareness on Engineering Affective
CO1 PO8 30%
Ethics and Human Values. (A3)
Understand responsibilities as an engineer
Please refer
to develop sustainable and environment- Affective
CO2 PO6 20% to Section 5.
friendly technologies and work for the bet- (A2)
terment of society.
Appreciate ethical dilemma while discharg- Psychomotor
CO3 PO12 50%
ing duties in professional life. (P5)

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 25% 15% 20% 60%
Midterm Exam 5% 15% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 20% 50% 100%

Course Teacher, HUM 4105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

267
 IT project Management/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline - MIS 4203 IT Project Management

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code MIS 4203
Course Title IT project Management
Course Credit 2.0 units
Contact Hours Per Week 2
Course Status GED
Prerequisite Course CSE 3101 Software Engineering

2 Syllabus
Introduction: What is project? What is project management? Program and project portfolio management,
▲

role of project manager, project management profession. Project management and information technol-
ogy context: A system view of project management, understanding organization, stakeholder manage-
ment, project phases and the project Life cycle, The context of information technology projects, recent
trends affecting IT project management. Project management process groups: process groups, mapping
the process groups to the knowledge areas, developing an IT project management methodology, case study.
Project Integration Management: Strategic planning and project selection, developing a project man-
agement plan, directing and managing project work, monitoring and controlling project work, perform-
ing integrated change control, closing projects or phases. Project Scope Management: Planning scope
management, collecting requirements, defining scope, controlling scope. Project Schedule Management:
Planning schedule management, defining activities, sequencing activities, estimating activity resources,
estimating activity duration, developing the schedule, controlling the schedule. Project Cost Manage-
ment: Basic principles of cost management, planning cost management, estimating costs, determining the
budget, controlling costs. Project Quality Management: Planning quality management, performing qual-
ity assurance, controlling quality, tools and techniques of quality control, modern quality management,
improving IT project quality. Project Human Resource Management: Keys to managing people, devel-
oping the human resource plan, acquiring the project team, developing the project team, managing the
project team. Project Communication Management: Keys to good communications, planning commu-
nications management, managing communications, controlling communications. Project Risk Manage-
ment: Planning risk management, common sources of risk on IT projects, identifying risks, performing
qualitative risk analysis, planning risk responses, controlling risks. Project Procurement Management:
Planning procurement management, conducting procurements, controlling procurements. Project Stake-
holder Management: Identifying stakeholders, planning stakeholder management, managing stakeholder
engagement, controlling stakeholder engagement

268
 IT project Management/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Kathy Schwalbe, Information Technology Project Management, 9th Edition, Cengage, 2018.

R References:

– PMBOK Guide, Sixth Edition, Project Management Institute, 2017.

4 Course Outcomes

Domain Assessment
CO CO Description PO Weight
(LoBT) Methods
Apply the knowledge of sciences and engi-
neering fundamentals to interpret the ele-
mentary concepts of various architectures, Cognitive
CO1 PO1 35%
applications, protocols, and background (C3)
processes dealing with networking architec-
ture and protocol design related problems.
Analyze operational details of various pro-
tocols, related to application, transport, and
Please refer
routing layers to apply the specialist engi- Cognitive
CO2 PO2 45% to Section 5.
neering knowledge to solve the complex net- (C4)
working infrastructure development prob-
lem.
Establish a reliable protocol while planning
and designing network services infrastruc-
ture, to address networking-related prob- Affective
CO3 PO6 20%
lems and issues that ensure user Quality (A4)
of Service (QoS) and Quality of Experience
(QoE).

Legend:
CO: Course Outcome PO: Program Outcome
LoBT: Level of Bloom’s Taxonomy

5 Assessment Methods of COs

Assessment Method CO1 CO2 CO3 Total

Final Exam 20% 30% 10% 60%
Midterm Exam 10% 10% 20%
Class Test/Quiz 5% 5% 10%
Assignment/Presentation 5% 5%
Class Participation 5% 5%
Total 35% 45% 20% 100%

269
 IT project Management/4th year 2nd semester 2024

6 Topic Outline

Lecture Selected Topic Article Problems

1-2 Networking and Socialization, sharing course administration and guide- T T
lines • What is project? What is project management? Program and
project portfolio management, role of project manager, project manage-
ment profession. • Project management and information technology con-
text: A system view of project management, understanding organiza-
tion, stakeholder management, project phases and the project Lifecycle,
The context of information technology projects, recent trends affecting
IT project management;
3-4 Project management process groups • Process groups, mapping the pro- T T
cess groups to the knowledge areas, developing an IT project manage-
ment methodology, case study;
5-7 Project Integration Management • Strategic planning and project selec- T T
tion, developing a project management plan, directing and managing
project work, monitoring and controlling project work, performing in-
tegrated change control, closing projects or phases;
8-12 Project Scope Management • Planning scope management, collecting re- T T
quirements, defining scope, controlling scope;
13-14 Project Schedule Management • Planning schedule management, defin- T T
ing activities, sequencing activities, estimating activity resources, esti-
mating activity duration, developing the schedule, controlling the sched-
ule;
15-17 Project Cost Management • Basic principles of cost management, plan- T T
ning cost management, estimating costs, determining the budget, con-
trolling costs;
18-21 Project Quality Management • Planning quality management, perform- T R
ing quality assurance, controlling quality, tools and techniques of quality
control, modern quality management, improving IT project quality;
22 Project Resource Management • Keys to managing people, developing T T
the human resource plan, acquiring the project team, developing the
project team, managing the project team;
23 Project Communication Management • Keys to good communications, T T
planning communications management, managing communications,
controlling communications;
24-25 Project Risk Management • planning risk management, common sources T R
of risk on IT projects, identifying risks, performing qualitative risk anal-
ysis, planning risk responses, controlling risks;
26 Project Procurement Management • Planning procurement manage- T R
ment, conducting procurement, controlling procurement
27 Project Stakeholder Management • Identifying stakeholders, planning T R
stakeholder management, managing stakeholder engagement, control-
ling stakeholder engagement
28 Review, Challenges of Project management • Problem solving practices T R
• Presentation, Assignment, etc.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

270
 ICT Business Entrepreneurship/4th year 2nd semester 2024

University of Dhaka
Department of Computer Science and Engineering
Faculty of Engineering and Technology (FoET)
Second Science Complex, Mokarram Bhaban Area
University of Dhaka, Dhaka 1000, Bangladesh

Course Outline
BUS 4205 ICT Business Entrepreneurship

1 Basic Information
Faculty Faculty of Engineering and Technology (FoET)
Department Department of Computer Science and Engineering
Programme Bachelor of Science in Computer Science and Engineering
Semester 4th year 2nd semester 2024
Course Code BUS 4205
Course Title ICT Business Entrepreneurship
Course Credit 2.0 units
Contact Hours Per Week 2
Course Status GED
Prerequisite Course None

2 Syllabus
▲

Introduction to Entrepreneurship: The nature and importance of entrepreneurship, roles of entrepreneur-

ship in the global economy and society, navigating the current business trend in diverse fields of Informa-
tion and Communication Technology, the entrepreneurial mindset, myths about entrepreneurship, pros
and cons of entrepreneurship - some recent examples at home and abroad; Entrepreneurship as Innova-
tion and Problem Solving: Entrepreneurs are innovators and problem solvers to meet the needs and wants
of people, major competencies of an entrepreneur, Social Entrepreneurship -concept and importance, Cre-
ativity and the business idea: Preliminary assessment and detailed analysis of multiple candidate ideas,
Selection of the most promising idea, Creating and starting the venture - how it enhances standard of liv-
ing, promotes innovation and development, creates new jobs and puts impact on community development,
Risk taking - concepts and types of various risks including economic risk, reputation risk, operational risk,
and competition risk; Understanding the market and the marketing plan: Identifying the salient fea-
tures of the planned product or service, Determining sellers, consumers and competitors, Market survey
and SWOT analysis, Pricing and factors affecting prices, Strategies for popularizing the product in the
community, Power of social media for product marketing; The organizational plan: Organizational size
and location, human and capital resource based classification of entrepreneurship, Registration of the
organization, association and state laws and policies, GANTT chart for growth plan; Financial plan of
the business: Challenges of financial planning, sources of capital, informal risk capital, venture capital
and going public, income-expenditure statements, vat and taxes, cash flow projections, break-even anal-
ysis, strategies for growth and managing the implications of growth; Resource Mobilization: Types of
Resources - Human, Capital and other Resources, mobilization of various resource types, utilization of
human resource, human resource accounting, selection and utilization of human resources and profes-
sionals like accountants, lawyers, auditors, board members, role and importance of a mentor. Ethics and
Social Responsibility in Business: Practices of professional ethics as an entrepreneur, specially in man-
aging physical, financial and human resource management processes, Dimensions and attributes of social
responsibilities of an entrepreneur.

271
 ICT Business Entrepreneurship/4th year 2nd semester 2024

3 Text and Reference Materials

T Textbook:

– Eric Ries, The Lean Startup, 2nd Edition, Crown Currency, 2011.

R References:

– Peter Thiel & Blake Masters, Zero to One, First Edition, Crown Currency, 2014.

4 Topic Outline

Lecture Selected Topic Article Problems

1-4 Overview of Entrepreneurship in Information and Communication T T
Technology context, sharing course administration and guidelines •
Introduction to Entrepreneurship: The nature and importance of en-
trepreneurship, roles of entrepreneurship in the global economy and
society, navigating the current business trend in diverse fields of In-
formation and Communication Technology, the entrepreneurial mind-
set, myths about entrepreneurship, pros and cons of entrepreneurship
- some recent examples at home and abroad;
5-6 Entrepreneurship as Innovation and Problem Solving: En- T T
trepreneurs are innovators and problem solvers to meet the needs and
wants of people, major competencies of an entrepreneur, Social En-
trepreneurship - concept and importance;
7-10 Creativity and the business idea: Preliminary assessment and de- T T
tailed analysis of multiple candidate ideas, Selection of the most
promising idea, Creating and starting the venture - how it enhances
standard of living, promotes innovation and development, creates new
jobs and puts impact on community development, Risk taking - con-
cepts and types of various risks including economic risk, reputation
risk, operational risk, and competition risk;
11-14 Understanding the market and the marketing plan: Identifying the T T
salient features of the planned product or service, Determining sellers,
consumers and competitors, Market survey and SWOT analysis, Pric-
ing and factors affecting prices, Strategies for popularizing the product
in the community, Power of social media for product marketing;
15-17 The organizational plan: Organizational size and location, human and T T
capital resource based classification of entrepreneurship, Registration
of the organization, association and state laws and policies, GANTT
chart for growth plan;
18-21 Financial plan of the business: Challenges of financial planning, T R
sources of capital, informal risk capital, venture capital and going pub-
lic, income-expenditure statements, vat and taxes, cash flow projec-
tions, break-even analysis, strategies for growth and managing the im-
plications of growth;
22-25 Resource Mobilization: Types of Resources - Human, Capital and T T
other Resources, mobilization of various resource types, utilization of
human resource, human resource accounting, selection and utilization
of human resources and professionals like accountants, lawyers, audi-
tors, board members, role and importance of a mentor;

272
 ICT Business Entrepreneurship/4th year 2nd semester 2024

26-28 Ethics and Social Responsibility in ICT Business Entrepreneurship: T R

Practices of professional ethics as an entrepreneur, specially in man-
aging physical, financial and human resource management processes,
Dimensions and attributes of social responsibilities of an entrepreneur.

For the definitions of T and R , Please refer to Section 3.

Course Teacher, CSE 3105 Chairman, Dept. of CSE, DU

April 24, 2024 April 24, 2024

273
IV ♦ Part D

18 Evaluation and Grading

18.1 Examination Committee

An examination committee consisting of 4 teachers will be proposed by the Academic Committee of the
department. There will be separate examination committees for every academic semester.

The committee will consist of a chairman, 2 internal members, and an external member. The committee
may have an external member from other departments of the University of Dhaka or outside of the University
of Dhaka. The chairman of the committee will serve as the course coordinator for that academic semester.
The role of a course coordinator is to monitor the academic activities and report to the chairman to avoid
any unexpected situation.

The chairman of the examination committee, with the help of the committee members, will be responsible
for all activities related to the examination as per the University rules including getting questions from
the respective course teachers, moderating the questions and printing them, holding examinations, and
publishing results on time.

18.2 Tabulators

The examination committee will appoint two tabulators. Course teachers/examiners will submit their mark
sheets in detail.

The tabulators will enter the marks given by each course teacher/examiner in the tabulation sheets
independently, process the examination results, and compare them to check correctness. Thereafter, they
submit the signed tabulation sheets to the office of the controller of examinations through the chairman of
the committee.

The answer scripts of final examinations will be evaluated by two examiners and the average mark will
be considered as the obtained mark the difference between the two does not exceed 20%. Otherwise, the
script will be evaluated by a third examiner and the nearest two marks will be averaged to determine the
obtained mark. If the third examiner’s mark has the same difference from both the others, the average of
three marks will be the obtained mark.

The controller’s office will publish the examination results at the end of every semester and issue the
transcripts.

274
18.3 Class Representative

Each batch/section of students will have two class representatives (one male and one female) to maintain
liaison with the Course Coordinator, course teachers, and the office of the chairman of the Department
regarding their class progress and problems.

18.4 Marks Distribution

Letter grading is made to assess students’ performance. The grade is assigned on the overall evaluation of a
student’s performance based on the semester final examination, midterm exam, class test, assignments, and
class attendance in aggregate and the following weight distribution is applicable for the B.Sc. Engg. in CSE
program. Following the needs of a specific laboratory course, the course teachers may change the weights of
different mark heads or may merge multiple heads of marking together, e.g., viva-voce and continuous lab
performance may be evaluated together.

Theory Courses Laboratory Courses

Class Participation 5 Class Participation 10
Class Test (Best 1 of 2) 10 Continuous Lab Performance 30
Group Assignment or Presentation 10 Lab Reports 10
Midterm Examination 25 Lab Viva-Voce 20
Semester Final Examination 50 Capstone Project or Demo/Presentation 30
Total 100 Total 100

Class Participation is a qualitative evaluation of the performances of a student by the respective course
teacher based on regularity in attending classes, responding answers to the questions, giving valuable
feedback, taking part in discussions, making inquisitive questions, eagerness to learn, supporting keep the
classroom environment noise-free, etc. It mainly evaluates the attitude of a person and less cognitive or
psychomotor skills. For lab courses, affective domain skills of the students at different levels (A1 to A5) can
better be quantified depending on the courses.

Class Tests are highly effective both for the students and the course teacher to assess whether the
learning process is going correctly or not. Test results will be communicated to the students within a week
or two so that they can identify their mistakes, and errors in ways followed to learn a certain topic and
get good guidance from the faculty. Similarly, the course teacher can identify more accurately the rate of
learning of the students and getting feedback from this formative assessment tool, s/he can make changes
in the teaching and learning process to be followed in the subsequent classes.

Group Assignment or Presentation helps a student to work in a group to solve a complex engineering
problem, mathematically or logically translating a problem of the natural world into a digital one, design
and nurture alternate or effective solutions, compare multiple algorithms, protocols or systems and evaluate
their effectiveness, and defend his/her own understanding through presenting before a large group of
audience. It helps the course teacher to assess student’s psychomotor skills including teamwork capacity
and communication at different levels (P1 to P7) as well as higher-order cognitive domain skills (C4, C5).

Midterm and Final Examinations mainly contribute to assessing the amount of knowledge (from lower
to mid levels in cognitive domains: C1 to C3) gained by a student on the course matters. Evaluated midterm

275
exam scripts are shown to the students, which helps them a lot to correct and prepare themselves in the
right way for the semester’s final examinations.

Continuous Lab Performance in laboratory courses is very effective for students to increase their
technical skills. In each lab class, one problem or assignment is given which has to be solved by the students
individually or in a group. The total number of problems or assignments given per lab course will be
determined by the respective lab teachers. Each assignment has to be submitted during the lab time on
the same day as the assigning date or some time later on a different day which will be determined by the
respective lab teachers. For late submission, there will be some sort of penalty which will also be determined
by the respective lab teachers. There can be bonus marks for fast solvers if needed and felt necessary by the
respective lab teacher.

Lab Reports and Viva-Voce are essential for engaging students to enhance their technical report writing
skills and defending the solutions they have prepared, respectively. The viva-voce also helps course teachers
to better evaluate the level of understanding of the individual students and to identify whether the students
have solved the problem by themselves (or copied from others) and/or whose contribution is comparatively
higher while they are working in a group.

Capstone Projects or Demo Presentations Some of the courses will contain small capstone projects to be
developed by the students individually or in a group. Hands-on experiences of the students in accumulating
multiple technical skills while solving a complex engineering problem and their demonstrations help them
to grow technically proficient. For other lab courses, especially for the labs having 0.75 credits only, viva-voce
and demonstration on a given experiment can be merged for evaluation.

18.5 Submission of Marks

18.5.1 Internal Evaluation Marks

For a theory course, the course teacher will evaluate the continuous performances of the students by taking
Class Tests/Quizes, Midterm examinations, assignments/presentations, and class participation, and submit
their obtained marks out of 50% of the total to the chairman of the examination committee and controller of
examinations before commencement of the semester final examinations.

The evaluated answer scripts of the midterm and class tests must be shown to the students before the
last class of a semester and the total internal evaluation marks must be shared with the students before
commencement of the final examinations.

For laboratory courses, the marks obtained by each student will be submitted by the course teachers in a
prescribed format (determined by the Academic Committee of the Department) before the beginning of the
semester final examinations.

18.5.2 Semester Final Examination Marks

Generally, there will be two examiners, following the University rule, for evaluating answer scripts of the
semester final examinations. Both of them separately submit the marks on-time in a prescribed format to the
chairman of the examination committee and controller of examinations.

276
18.6 Eligibility to sit for the Final Examination

i. Students with 75% attendance and above on average will be eligible to sit for the semester final
examinations.

ii. Students having attendance greater than 60% and less than 75% will be considered to sit for the
examination after paying the required fines.

iii. Students having attendance below 60% will not be eligible to appear at the examination and they may
seek re-admission.

iv. Duration of the semester final examinations will be 3 hours and 2.5 hours for 3-credit and 2-credit
courses, respectively.

v. Duration of the midterm examinations will be 1.0 to 1.5 hours, determined by the respective course
teacher.

18.7 Grading Scale

The University of Dhaka follows a grading scale of 4.0.

18.8 Letter Grades and Grade Points

A teacher responsible for conducting the course determines the internal assessment marks (50% of the total).
The question of the final examination is prepared by two examiners and moderated by the examination
committee. Similarly, the answer scripts are evaluated by two examiners, and by a third examiner if more
than 20% deviation is found among the marks of the first two examiners for a given answer script. The
closer two marks are averaged to calculate the final examination mark of a student.

The Grade Point (GP) earned by a student in a certain course will be determined by his/her total score
including the internal assessment marks and final examination marks. The final result will be prepared by
cumulating the grade point average (CGPA) over the courses. The uniform grading system, recommended
by the University Grants Commission, is adopted for assigning a letter grade and grade point. This is given
in the following table:

277
 Numerical grade Letter Grade Grade Point (GP)

80 or Above A+ 4.00
75 to < 80 A 3.75
70 to < 75 A- 3.50
65 to < 70 B+ 3.25
60 to < 65 B 3.00
55 to < 60 B- 2.75
50 to < 55 C+ 2.50
45 to < 50 C 2.25
40 to < 45 D 2.00
Less than 40 F 0.00
I Incomplete
W Withdrawn

18.9 Assigning ‘W’ and ‘I’ Grades

A ‘W’ grade is assigned to a course for a student if he/ she withdraws from the course taking the necessary
official permission. ‘W’ grade will not be considered for GPA/ CGPA calculation. Such courses need to be
re-registered in the next year or semester, whichever is applicable.

A student will be assigned an ‘I’ grade,

i. If he/she has been absent in the Semester final examination.

ii. An ‘I’ grade will automatically be converted to an ‘F’ grade if he/she fails to sit for an improvement
examination within the stipulated time.

18.10 Semester Grade Point Average (SGPA) and Cumulative Grade Point Average (CGPA)

A student obtaining a ‘D’ or higher grade will be counted as credits earned by him/her. A student obtaining
an ‘F’ grade will not be counted towards his earned credits. The Semester Grade Point Average (SGPA) is
calculated for the courses taken in a semester and the Cumulative Grade Point Average (CGPA) is calculated
for all the courses taken up to the semester to which it refers by the student. The calculation of SGPA and
CGPA are as follows:

∑in=1 Ci Gi
SGPA = (1)
∑in=1 Ci

∑iN=1 Ci Gi
CGPA = (2)
∑iN=1 Ci
where, Ci , stands for credits of the ith course. Gi , stands for grade points earned in the ith course. n, stands
for the number of courses taken in the semester. N, stands for the number of courses taken up to the semester
to which refers. Both SGPA and CGPA will be rounded off to the second place of decimal for reporting.

278
19 Improvement Examination
i. To clear an ‘F’ grade in any course, a student can get a chance in two consecutive academic years
(complying with the maximum allowable 6 years) to reappear at the final examination. In this case, the
best grade that a student can be awarded is B+ (B Plus).

ii. A student may improve the grade of any course by reappearing at the Final examination within
consecutive two years if he/she obtains a grade less than or equal to C+ (C Plus) and the best grade
that a student can achieve in case of grade improvement is B+ (B Plus). However, if the grade is not
improved, the previous one will remain valid.

iii. A student will not be allowed for grade improvement once s/he is eligible for the degree.

iv. A student taking advantage of the improvement policy will not be eligible for receiving a gold medal or
any other award.

v. In addition to the usual fees, a fine, as per university rules, will be imposed for each course chosen for
improvement.

vi. A student will have to be mentally prepared to sit for the examination of a particular course chosen for
improvement even if it is held on the same day as his/her other regular examination.

20 Re-admission and Drop Out

20.1 Re-admission

A minimum CGPA (Cumulative Grade Point Average) of 2.00 will be required for getting promotion to the
next academic year. Securing a CGPA below the above minimum respective threshold will hinder a student
from getting promoted to the next academic year.

A student failing to get a promotion to the next academic year may seek re-admission to study with the
following batch. Re-admission may be sought by a student due to his/her prolonged sickness or any other
acceptable reasons. In the case of re-admission, all previously earned grades for the two semesters of that
year will be canceled.

20.2 Drop Out

A student may take re-admission only 2 times. If required, a student may take re-admission in the same
class or year, but the degree must be completed within 6 years from the date of admission at 1st year 1st
semester.

A student failing to get the minimum required CGPA even after taking re-admissions twice will be
dropped out of the program.

SPECIAL NOTES:

• The cases that can’t be resolved by the above rules will be discussed in the Academic Committee of
the Department and the usual practices of the university/faculty will be applied to address it.

279
• Disciplinary and punishable actions will be applied according to the existing rules of the University of
Dhaka.

280
Conclusions

In conclusion, the updated curriculum for the Bachelor of Science in Computer Science and Engineering
is a forward-thinking and comprehensive program designed to empower students with the knowledge
and skills needed to excel in the emerging fields of computing. By striking a balance between theoretical
foundations and practical applications, the curriculum equips students with a strong academic base, and
industrial exposure while nurturing their ability to address real-world challenges.

The program’s interdisciplinary approach encourages collaboration with other fields, enabling students
to understand the diverse applications of computer science and engineering knowledge in various industries
and domains. Furthermore, the emphasis on ethical considerations ensures that graduates are not only
skilled professionals but also responsible computer engineering practitioners.

With a focus on project-based learning and industry exposure, students gain invaluable hands-on
experience and develop the confidence to apply their knowledge in practical settings. The curriculum’s
emphasis on research and innovation fosters a culture of continuous learning, preparing students to stay
at the forefront of the rapidly evolving computing, software, network, Artificial Intelligence, and machine
learning technologies throughout their careers.

As a result of the proposed curriculum, the Department of Computer Science and Engineering of Uni-
versity of Dhaka aims to produce highly competent and ethically-driven computer science and engineering
professionals, ready to make a positive impact on society and contribute to the growth and advancement of
these fields both locally and globally. By providing a transformative educational experience, the university
strives to nurture the next generation of engineering leaders who will lead the way in shaping the smart
Bangladesh in the near future.

282
Department of Computer Science and Engineering
University of Dhaka
Second Science Complex Building,
Mokarram Bhaban Area, University of Dhaka
Dhaka 1000, Bangladesh
Phone: +88 09666 911 463 (Ext. 7421)
Email: [email protected], [email protected]
Website: www.du.ac.bd/body/CSE