B.Sc.

incompu[erscience&Engineering

Syllabus

gEng
"
National Institute of Textile Engineering & Research (NITER)
Faculty of Engineering & Technology
University of Dhaka
Dhaka-1000
 B.Sc. in Computer Science and Hngineering
University of Dhaka
Course Structure & Syllabus
2019-2020 onward

Rules and Regulations for Undergraduate Program in Computer Science

and Engineering
B.Sc. program in Computer Science and Engineering (B.Sc. in CSE) is a four
year course designed to prepare students to undertake careers involving
innovation and problem solving using computational techniques and
technologies. In order to give due importance to applied as well as theoretical
aspects of computing, the curriculum for the B.Sc. (CSE) program covers
most of the foundational aspects of computing sciences, and also develops in
students the engineering skills for problem solving using computing sciences.
With this approach, the B.Sc. (CSE) program can be divided broadly in two
halves. The first half focuses on building the foundations, and is highly
structured. The second part is for developing the skills and knowledge of the
students in various topics -computing and application domains. This part also
provides specializations and different students may follow different paths and
take different set of courses in it.
Academic Regulations for the Undergraduate Students
B.Sc. in Computer Science and Engineering course in the University of Dhaka
will be under semester system from the session 2019-2020 and onward.

Graduation Criteria
1.1 Name of Degree: B.Sc. in computer science and Engineering

1.2 Entrance qualification: H.S.C. (Science) with physics, Chemistry and

Mathematics.

1.3 Definition ofa credit: The credit is defined as follows:

i) Fortheoretical courses,15 contact hours = 1 Credit

ii) For practical courses, 30 contact hours lab work =1 Credit

1.4 Total Credits: A student has to complete total 160.50 credits for graduation.

Degree to be offered: B.Sc. in Computer Science and Engineering (CSE)

The Curriculum & Courses

3.1 The undergraduate curriculum of university ofDhaka is based on semester

system. The salient features of the semester system are:
 (a) Provision for continuous evaluation of students performance through Minimum credit hours for the requirement for the awards of B.Sc. in Computer
Attendance, Class Test, Practical/Sessional class etc. Science and Engineering will be decided by the University of Dhaka.
However, at least 160.5 credits hours for Computer. Science and Engineering
(b) Evaluation of the performance of course/courses by using Letter Grades
and Grade Points. must be earned to be eligible for graduation.

(c) In the curriculum, there is an emphasis on acquiring knowledge in basic 3.5 Assignment of credits & Contact Hour
sciences, humanities and social science & related courses of other discipline.
Emphasis shall be given to introduce courses dealing with professional 3.5.1 Theoretical courses
protective, project plaming and management, socio-economic and One Lecture per week per semester will be equivalent to 1 (one) credit. There
environmental aspects of development projects, communication skills, etc.
shall be at least 15 contact hours for each theoretical credit point in each
Semester.
3.2 Number of semesters in an Academic Year (Level)
3.5.2 Practical/Sessional
The duration of Bachelor Degree program shall be 04 (four) academic years
and 8 (eight) Semesters. The four academic years of study for the degree of There shall be normally 2 (two) contact hours in a week and 30 contact hours
B.Sc. in Computer Science and Engineering shall be designated as Year-1, in a Term for each credit of Practical/Sessional course.
Year-2, Year-3 and Year-4 in succeeding higher years of study. Each ;cademic
year comprises two semesters, i.e. Semester-I and Semesters-II. 3.5.3 Internship

Credit for Internship will be 3.00.

3.3 Duration of semester

The duration of each of Semester-I and Semester-II will be as follows : 3.5.3 Projectand Thesis

The students will be allowed nine working hours per week exclusively
3.4 Minimum credit point dedicated for the Project Work. Credit for Project and Thesis will be 3.00.

Semester - I
3.5.4 Comprehensive viva
Classes 15 Weeks
Credit for Comprehensive Viva will be 3.00.
Recess before semester Final Examination 02 weeks

Semester Final Examination 03 weeks 3.6 Time Limits For completion ofBachelor's Degree

Total 20 Weeks For the degree of B.Sc. in Computer Science and Engineering (CSE)
maximum allowable number of Semesters is 12 for the degree. But an
Inter Semester Break 01 Week additional Semester may be granted after judging the merit of individual case
Semester -11 according to the recommendation of Academic Committee of the institute.

(`Iils.qcs 15 W|.|.k*
3.7 Syllabus & Curriculum Development
Ri`cc*s 13cl`(`rL` Semester Final Examination ()2 W|.|.kH
3.7.1 The Curricula of the B.Sc. in Computer Science and Engineering (CSE)
Si`ii`i`*Ii`i' I.`if`iil [':xiimin€ition () 1 W|.(.kH Degree shall be as proposed by the Academic Committee lead by Dean,
Faculty of Engineering and Technology.
T()I il I ., ( ) W t.|` k ,I

I It)litl:I,Y*` V(Il'llli{}IIH (Ill(I I{€Hllll I'uhlii`lllitlll

I I wt`t`kH 3.7.2 The Academic Committee & Committee of Courses and Studies of the
concerned Department shall review the curricula at least once in every
(;rilntl '1'('1('1 i.' W¢@kl
academic year and put forward the recommendations to the Academic Council
by the responsible committee lead by Dean, Faculty of Engineering and
Technology.
 Distribution of Marks
4. Grading System :

4.1 For evaluation purpose all credit courses will be equivalent to 100 Marks.
Theory

4.2 Grades and Grade points: (a) Continuous Assessment

Grades and Grade Point will be awarded on the basis of marks obtained in the (i) Class Attendance
Written, Oral or Practical Examinationsthaboratory perforinances according to
(ii) Continuous Assessment
the following scheme:
(b) Semester Final Exam
Marks obtained Grade Grade Total :100%
80 to 100 A+ 4.00
75 to79 A 3.]S
70 to 74 A- 3.50
Practical/Sessional
65 to 69 8+ 3.25
60 to 64 a 3.00 (a) Continuous Assessment
55 to 59 a- 2.75
50 to 54 C+ 2.50 (i) Class Attendance :20%
45 to49 C 2.25 (ii) Experiment & Perforlnance : 40°/o
40 to 44 D 2.00
Less than 40 F 0.00 (iii) Report & Viva-Voce :20%
I Incomplete Total :80%

(b) Practical (Final) :20%

4.3 Calculation ofGPA/CGPA
Total :100%
A student obtaining `D' or higher grade will be counted as credits
earned by him/her. A student obtaining `F' grade will not be counted towards
his earned credits. The GPA (grade point average) will be calculated according Internship
to the following ``t)rmula:
(a) Continuous Assessment

(b) Final Exam

Z=(Grade points in a course x Credits for the course )
GPA-
Total Credits Total :100%

C'G'PA = Cumulative GPA for different Year

Protect and Thesis

The overall t)r Cumulative GPA gives the cumulative performance of (a) Continuous Assessment :30%
the student from Term-I up to any other Term to which it refers and is
a) Final Exam :70%
computed by dividing the total grade points accumulated up to the date by the
total credit hours. Total : 100%

Both GPA anil CGPA will be rounded off to the sccttnd place of`
decimal for reporting. grmprehensivevjxp
All subjects : 1 0 0 O/o

Evaluation System

6.1 Basis for awarding marks for class participation and attendance will be as
 6.4 ProjectandThesis
follows:
30% marks for Continuous Assessment to be evaluated by respective
Attendance Marks
Supervisor.
90% and Above 10
85% to 89% 9 70% marks for final examination to be evalriated by Project Evaluation
80% to 84% 8
Committee consisting of all the Head of the Departments & Project
75% to 79% 7
Supervisor.
70% to 74% 6
65% to 69% 5
60% to 64% 4 6.5 Internship
Less than 60% 0
30% marks for Continuous Assessment to be evaluated by respective
Supervisor and relevant Officer of the concerned industry.
A student is required to attend at least 60% of all classes held in every course.
70% marks for Final Examination to be evaluated by Evaluation Committee
consisting of all the Head of the Departments & Supervisor
6.2 Class Test

(a) The number of class tests of a course shall be 2 (Two) for all types of the 6.6 Comprehensive viva
courses. Evaluation of the performance in the class test will be on-the basis of
the `best one' of class tests. For All subjects (100°/o marks): Comprehensive Viva board will be formed
with teachers including Head of the Departments.
(b) Class test should hold regularly in every 3 to 4 weeks after starting ofclass.

(c) Duration of each class test shall be 30-55 minutes. 7. Duration of Semester Final Examination

(d) For convenience of conducting the class tests 50 minutes slot should be kept at There shall be 2 (two) hours examination for 2 (two) credit and 3 (three) hours
the beginning of at least 4 working days in a week. examination for 3 (three) credit theory course.

(e) The dates for the class tests shall be fixed by the course coordinator/chief
course coordinator and shall be armounced accordingly. Promotion Rules

8.1 The minimum passing grade in a theory course shall be `D' or 2.00 and the
(I) All class tests shall be of equal value. The result of each individual class test
minimum passing grade in a Practical or Sessional/ Industrial / Project and
shall be posted to display board for information of the students before the next
Thesis/Comprehensive Viva course will be `C' or 2.25
class test is held.
8.2 If a student fails to earn minimum grade `C' or 2.25 in a Practical or
(g) The final computed marks sheet of the class Tests and class Attendance shall
Sessional/Industrial Attachment/ Project and Thesis/Comprehensive Viva
be submitted in 2 (two) separate sealed envelope by the course teacher to
course will not be promoted to next Semester. He/she shall have to register the
Chairman of concerned Examination Committee before preparatory leave for
same as a regular student.
Semester final starts. The third copy of mark sheet along with answer scripts
of all the Class Tests should be sent to the Controller of Examinations.
8.3 Promotion from Year to Year:
6.3 Practical Final 8.3.1 A Student will be promoted to next Semester of any Year when

Course Teacher, Respective Head of the Department will c{)ntl`icl l'riicticill (i) He/ She gets at least a G.P.A of2.00 in two semesters ofa year.
Final Examination. It will be completed in the last ()2 (tw{}) wci`k* I)cl`{)rc the (ii) Passes the entire practical/Sessional courses.
preparatory leave starts. 8.3.2 To be promoted from Year-1 to Year-2 and Year-2 to Year-3 sthe must has to
get a C.G.P.A of 2.25 but in case of Year-3 to Year-4 sthe has to get a C.G.P.A
 of 2.50 in all the cases following conditions must be full filled:

i) If anyone gets G.P.A less than 2.00 (Grade D) in any theoretical subject the
11.3 If a student fails to full-fill the conditions for promotion from any semester to
grade point will not be included in total grade point. S/he has to appear in the the next may seek Re-admission with the same Semester of the subsequent
exam of that/those specific subject/subjects in the subsequent batch.
available batch.
ii) In every practical/sessional exam at least grade C (G.P.A 2.25) must be
achieved otherwise s/he will not be promoted to the next Semester as well as 11.4 0n Re-admission, grades earned earlier by a student in any

Year Semester shall be cancelled automatically and the student shall have to retake
all the course-works (such as Class Test/Class Attendance/Project and
8.4 A student, who obtains `F' grade in any theory course in any Semester, will Thesis/Field work/Viva voce and Final Examinations) of that Semester.
have to repeat the courses in the next available respective Semester. Percentage of class attendance of such students shall be counted from the date
8.5 The minimum CGPA requirement for the award of B.Sc. in CSE Degree is of herthis Re-admission. Class Test, if completed before herthis Re-Admission,
2.50 without `F' grade/withheld remaining for any of the courses. the concerned course teacher shall arrange make up Class Test.

Dean's Award 11.5 A Student shall not get chance for Re-admission more than three times during
Each Year one student from constituent institutions having highest CGPA in the entire program.
B.Sc. in CSE will be awarded Dean's Award from the Faculty of E_ngineering
& Technology provided that Sthe must have a CGPA at least 3.80 11.6 For Re-admission, a student shall have to apply within 07 (seven) working
days after publishing result of the concerned Semester.
10. Improvement of Grade
12. Admission for the second and subsequence Year
10.1 If a student obtains a grade lower than `8' in a course, he/she will be allowed
At the beginning of each Semester, The students who are promoted will have
to repeat the course only once for the purpose of grade improvement by
to take admission for the second/subsequent respective Semester by paying
forgoing his/her earlier grade, but he/she will not be eligible to get a grade
requisite fees as determined by the Institute authority.
better than `8' in such a course. A student will be permitted to repeat for grade
improvement purposes a maximum of four courses in B.Sc. in CSE. 13. Requirement of Entry-form fill up
• A student shall be allowed to appear at the Semester Final Examination
10.2 No improvement shall be allowed in Continuous Assessment,
Practical/Sessional courses.
if histher class attendance is at least 75% in theory/practical course.
• Students having percentage of attendance between 60% less than 75%
in any courses, may be allowed to appear at the Semester Final
11. Re-admission Examination by paying additional fess as determined by the University
11.1 A Student of Year-I , failing to appear in the Semester final examination, authority
unless rules of drop-out is applicable, may be allowed to get re-admission with • Students having percentage less than 60% in any course will not be
the Year-I of the immediate next batch. A Re-admitted student however, shall allowed to appear in Semester Final Examination.
always be assigned by the original registration number. • If any student fails in Practical/Sessional courses. S/he will not be
11.2 If a student fails to appear at any Semester final examination due to shortage of promoted to next semester.
required percentage of attendance, or failure to pay the dues or expulsion for • Student having well-disciplined and good manner to be certifled by
the institute/university or any other reason as the case may be, s/he shall have Head of the Department.
to get herself/himself re-admitted to the same Semester of the subsequently
• Clears all dues of library and residential hall.
available batch.
• Pays requisite fees as determined by the university authority.
 Semester I
Course Code Course Title Prerequisites Credit Hours
Theory Courses
CSE-110l Fundamentals of Computers and Computing 2.0
CSE-1102 Discrete Mathematics
3.0
FEE-1103 Electrical Circuits 3.0
CHE-1 104 Chemistry 3.0
MATH- I 1 05 Differential and Integral Calculus 3.0
SS-1106 Government and Public Administration 2.0
Lab Courses
CSE-1111 Fundamentals of Computers and Computing Lab 1.5

EEE-1 1 13 Electrical Circuits Lab I.5

CHE-1114 Chemistry Lab 1.5

Semester IV
Total Credits in lst Semester 20.50 Course Code Course Title Prerequisites Credit Hours
Theory Courses
CSE-2201 Database Management Systems-I CSE-210l 3.0
CSE-2202 Design and Analysis of Algorithms-I CSE-210l 3.0

Semester 11 CSE-2203 Data and Telecommunication CSE-2101 3.0

Course Code Course Title Prerequisites Credit Hours CSE-2204 Computer Architecture and Organization CSE-1202 3.0

Theory Course CSE-2205 Introduction to Mechatronic s BEE-1103. CSE-1202 2.0

CSE-1201 Fundamentals of Programming CSE-1 I 01, CSE-I 102 Lab Courses

3.0
CSE-2211 Database Management Systems-I Lab CSE-2111 1.5
CSE-1202 Digital Logic Design 3.0
CSE-2212 Design and Analysis of AIgorithms-I Lab CSE-21 I I 1.5
PHY-1203 Physics 3.0
CSE-2213 Data and Telecommunication Lab CSE-2111 0.75
MATH-1204 Methods of Integration, Differential Equations and MATH-I 105 3.0
CSE-2216 Application Development Lal] CSE-2101, CSE-2102,CSE-2111,CSE-2l12 1.5
Series
ENG-1205 Developing English Language Skills 2.0
Total Credits in 4t'' Semester 19.25
Lab Course
CSE-1211 Fundamentals of Programming Lab CSE-1111 3.0
CSE-1212 Digital Logic Design Lab 1.5
Semester V
PHY-1213 Physics Lab 1.5 Corse Code Course Title Prerequisites Credit Hours
ENG-1215 Developing English Language Skills Lab I.5 Theory Courses
Total Credits in 2nd Semester 21.50 CSE-310l Computer Networking CSE-2203 3.0
CSE-3102 Software Engineering CSE-2101, CSE2102 3.0
CSE-3103 Microprocessor and Microcontroller CSE-2204 3.0

CSE-3104 Database Management Systems-II CSE-220l 3.0

MATH-3 1\05 Multivariable Calculus and Geometry MAT-2105H 3.0

Lab Courses
CSE-31 1 1 Computer Networking Lab CSE-2213 I.5

CSE-3112 Software Engineering Lab CSE-2l 11, CSE-2l 12 0.75

CSE-3113 Microprocessor and Assembly Language Lab 1.5

CSE-31 16 Microcontroller Lab 0.75

Total Credits in 5`'` Semester 19.50

 Semester VI Summary of Eight Semesters
Course Code Course Title Prerequisites Credit Hours 1 st Semester (1 St Year 1 st Semester) 20.50
Tlieory Courses 2nd Semester (|st Year 2n a semester) 21.50
CSE-320l Operating Systems CSE-2202, CSE-2204 3.0 3rd Semester (2na Year lst Semester) 22.25
CSE-3202 Numerical Methods 4th Semester (2nd Year 2na semester) 19.25
CSE-2202 3.0
CSE-3203 Design and Analysis of Algorithms-II 5th Semester (3rd Year |S t Semester) 19.50
CSE-2202 3.0
6th Semester (3rd Year 2n a semester) 19.50
CSE-3204 Formal Language, Automata and Computability
7th Semester (4th Year |S t Semester)
CSE-1102 3.0
20.50
STAT-3205 Introduction to Probability and Statistics 3.0 8th Semester (4th Year 2n a semester) 17.50
Lab Courses Total Credits in Eight Semesters: 160.50
CSE-3211 Operating Systems Lab CSE-2212 1.5

CSE-3212 Numerical Methods Lab CSE-2212 0.75

CSE-3216 Software Design Patterns Lab CSE-3112
Option - I
1.5

ENG-3217 Technical Writing and Presentation Lab Course Code Course Title Credit Hours
ENG-1215 0.75

Total Credits in 6th Semester Theory Courses

19.50
CSE-4121 Robotics Science and Systems 3.0
CSE-4123 Computational Methods in Bio-molecular Sequence & Structure Analysis 3.0
CSE-4125 Introduction to Machine Leaming 3.0

CSE-4127 Information Retrieval 3.0

Semester VII
CSE-4131 Introduction to VLSI Design 3.0
Course Code Course Title Prerequisites Credit Hours
CSE-4133 Algorithm Engineering 3.0
Theory Course
CSE-4135 Software Requirements Specification and Analysis 3.0
CSE-410l Artificial Intelligence CSE-2202 . 3.0
CSE-4137 Cryptography and Security 3.0
MATH-2105MATH-3105STAT-3205
CSE-4102 Mathematical and Statistical Analysis for Engineers 3.0 CSE-4139 Computer Graphic s 3.0

Lab Courses
SS-4103 Entrepreneurship for IT Business 2.0
CSE-4151 Robotics Science and Systems Lab I.5
CSE-4XXX Option-I 3.0
CSE-4153 Computational Methods in Bio-molecular Sequence & Structure Analysis Lab 1.5
CSE-4XXX Option-II 3.0
CSE-4155 Introduction to Machine Leaming Lal) 1.5
Lab Courses
CSE-4157 Information Retrieval Lab I.5
CSE-41 1 1 Artificial Intelligence Lab CSE-2212 I.5

CSE-4XXX CSE-4161 Introduction to VLSI Design Lab 1.5

Option-I Lab I.5
CSE-4163 Algorithm Engineering Lab 1.5
CSE-41 13 Internet Programming Lab CSE-2216 1.5
CSE-4165 Software Requirements Specification and Analysis Lab 1.5
CSE-4114 Project 2.0
CSE-4167 Cryptography and Security Lab 1.5
Total Credits in 7t'` Semester 20.50
CSE-4169 Computer Graphics Lab 1.5

Semester VIII Option - 11

Course Code Course Title I.rerequisites Credit Hours Course Code Course Title Credit Hours
Theory Courses Theory Courses
ECOu4201 Economics 2.0 CSE-4122 Mathematics for Robotics 3.0

CSE-4202 Society and Technology 2.0 CSE-4124 Introduction to Bioinforrmtics 3.0

SS-4203 Engineering Ethics 2.0 CSE-4126 Introduction to Data Science 3.0

CSE-4XXX Option-Ill 3.0 CSE-4128 Wireless Networks 3.0
CSE-4XXX Option-IV 3.0 CSE-4130 Introduction to Quantum Logic 3.0
Lab Courses CSE-4132 Graph Theory 3.0
CSE-4XXX Option-III Lab I.5 CSE-4134 Software Project Management 3.0
CSE-4214 Project CSE-4114 4.0 CSE-4136 Computer Security 3.0
Total Credits in 8`hsemester 17.50 CSE-4140 Compiler Design 3.0

12 13
 Option - Ill
Course Code Course Title Credit Hours
Theory Courses CSE-1101: Fundamentals of computers and Computing
CSE-4221 Robot Leaning 3.0
[2.0 credits, 30 houlrs lecture]
CSE-4223 Fundamentals of Genomics and Proteomics 3.0
(Pre-requisite Courses: None)
CSE-4225 Introduction to Data Mining and Warehousing 3.0

CSE-4227 Cloud Computing 3.0

Introduction to Computers: From a Key Press to Display, Hardware,
CSE-4229 Introduction to Reversible Computing 3.0
Software, Operating SystemrMicroprocessor, Memory Overview, File
CSE-4231 Computational Geometry 3.0
and File System. Input-Output Devices. Application Software : Basic
CSE-4233 Software Testing and Verification 3.0
Text Editor (gedit, Notepad), Document Processing, Spreadsheet,
CSE-4235 Digital Forensic 3.0 Presentation, Database, Mathematical Analysis, Simulation, Image and
CSE-4237 Digital Image Processing 3.0 Video Editing, Games etc. Network and Internet: Networking Concept
CSE-4239 Parallel and Distributed Systems 3.0 and Topologies, Network Addresses (MAC, IP and Port), Name vs. IP
Lab Courses (role of DNS). Browser Software: Examples, URL, Security, Email,
CSE-4251 Robot Leaming Lab 1.5 Email Address, Email - Client Software, Email Software in the Internet,
CSE-4253 Fundamentals of Genomics and Proteomics Lab 1.5 Network Configuration and Basic Tools (ping, traceroute etc.). Number
CSE-4255 Introduction to Data Mining and Warehousing Lab I.5 System: Concept of Bit, Electronic Representation of Bits. Bit -Array:
CSE-4257 Cloud Computing Lab 1.5
Byte, Word, Double Word. Binary - to- Decimal Conversion, Binary
CSE-4259 Introduction to Reversible Computing Lab I.5
Arithmetic, Bit- Shifting, Logic Representation (1-Bit, Bit-Array).
CSE-4261 Computational Geometry Lab 1.5
Hexadecimal Arithmetic up to 32-Bit Array Representation. Conversion
CSE-4263 Software Testing and Verification Lab 1.5
between Binary, Hexadecimal and Octal Numbers. Representation of
CSE-4265 Digital Forensic Lab 1.5
Characters by Bit- Array: ASCII and UTF-8. Character Arithmetic:
CSE-4267 Digital Image Processing Lab 1.5
Case and Language Mapping and Changing. Memory: Introduction to
CSE-4269 Parallel and Distributed Systems Lab I.5
Computer Memory. System Modeling and Flow Chart. Introduction to
Programming: Program Structure, Variables, Constants, I/0, Conditional
Statements (If-Else), More about Conditional Statements (Nested If).

Option - IV CSE-1102: Discrete Mathematics

Coursecode Course Title Credit Hours [3.0 credits, 45 hours lecture]
Theory Courses (Pre-requisite Courses: None)
CSE-4222 Human Robot Interaction 3.0
Logics and Proofs: Propositional Logic, Applications of Propositional
CSE-4224 Mobile Robotics 3.0
Logic, Propositional Equivalences, Predicates and Quantifiers, Nested
CSE-4226 Aerial Robotics 3.0

CSE-4228 Application of Computational Biology 3.0

Quantifiers, Rules of Inference, Introduction to Proofs. Set, Function,
CSE4230 Human Computer Interaction 3.0
Sequence, Summation and Matrix: Sets, Set Operations, Functions,
CSE-4232 Internet of Things 3.0
Sequences and Summations, Zero - One Matrices, Boolean Product.
CSE-4234 Introduction to Multiple-Valued Logic 3.0
Number Theory: Divisibility and Modular Arithmetic, Integer
CSE-4236 VLSI Layout Algorithms 3.0 Representations and Algorithms, Primes and Greatest Common Divisors,
CSE-4238 Concepts of Concurrent Computation 3.0 Modular Exponentiation. Induction: Mathematical Induction. Counting:
CSE-4240 Applied Crypto graphy 3.0 The Basics of Counting, the Pigeonhole Principle, Permutations and
CSE-4242 Computer Vision 3.0 Combinations, Binomial Coefficients and Identities, Generalized
CSE-4244 Computer and Network Security 3.0 Permutations and Combinations. Recursion: Applications of Recurrence
CSE-4246 Natural Language Processing 3.0 Relations. Inclusion Exclusion: Inclusion -Exclusion. Relations: Relations
and Their Properties, Representing Relations. Graphs: Graphs and Graph
Models, Graph Terminology and Special Types of Graph, Euler and
Hamilton Paths. Trees: Introduction to Trees.

14 15
 LEE-1103: I]lectrical Circuits Equation and Its Limitation, Vander Waal's Equation, Kinetic Theory of
[3.0 credits, 45 hours lecture] Gases. Phase Rule: Definitions, Phase Rule of Water and Carbon Dioxide.
(Pre-requisite Courses: None) Thermodynalnics: First Law, Work Done for Expansion of Gases,
Resistor: Properties, Types of Resistors, Ohm's Law, Power, Energy, Thermochemistry, Second Law, Camot Cycle, Third Law. Chemical
Efficiency, etc. Series DC Circuits: Kirchhoff's Voltage Law, Voltage Kinetics: Rate Law, Rate Equation, Molecularity and Order of a Reaction,
Divider Rule, Power Distribution, Voltage Regulation, Voltage Sources in Derivation of Rate - Expression and Half- Life for First Order and Second
Series, etc. Parallel DC Circuits: Conductance and Resistance,
Kirchhoff's Current Law, Current Divider Rule, Open Circuit, Short Order Reactions, Pseudo First Order Reaction. Chemical Equilibrium:
Circuit, Voltage Sources in Parallel, etc. DC Series - Parallel Network: Dynamic Behavior of Chemical Equilibrium, Law of Mass Action,
Reduce and Return Approach, Block Diagram Approach, Ladder Equilibrium Constant, Le Chatelier Principle and Its Application. Solution:
Networks. Methods of Analysis for DC Networks: Current Source, Different Solutions, Colligative Properties. Electrochemistry: Electrolysis,
Source Conversion, CuITent Sources in Series and Parallel, Branch- Electrolytes, Electrolytic Cell, Faraday's Law, Electrochemical Cells,
Current Analysis, Mesh Analysis, Nodal Analysis, Bridge Network and
Electrode Potential, Standard Electrode and Standard Electrode Potential,
Y-A and A-Y Conversions. Network Theorems (DC): Supeaposition,
Thevenin's, Norton's, Maximum Power Transfer, Millman's, Substitution, Nemst Equation and Its Application. Biomo]ecules: Carbohydrates, Proteins,
Reciprocity, etc. Capacitor: Electric Field, Capacitance, Dielectric Nucleic Acid, Polymers and Polymerization Processes.
Strength, Leakage Current, Types of Capacitors, Charging and
MATH-1105: Differential and Integral Calculus
Discharging Phase, Energy Stored by a Capacitor, Capacitors in Series
and Parallel. Inductor: Magnetic Field, Inductance, Types of Inductors, [3.0 credits, 45 hours lecture]
Faraday's Law and Lenz's Law, Inductors in Series and Parallel. R-L, R-C (Pre-requisite Courses: None)
and R-L-C Circuits with DC Input. Introduction to Sinusoidal Functions: Graphing Functions, Mathematical Models and Commonly used
Alternating Wave forms: Definitions, General Format for the Sinusoidal Functions (Linear, Polynomial, Power), Mathematical Models and
Voltage or Current, Phase Relations, Average and RMS Values etc. Commonly Used Functions (Algebraic, Trigonometric, Exponential, and
Ordinary and Frequency Response of Basic R, L and C Elements, Average Logarithmic Functions), Transformations (Scaling, Reflection,
Power and Power Factor, Rectangular and Polar Form, Phasors. 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
CHE-1104: Chemistry
Theorem and Its Application, Limits at Infinity and the Horizontal
[3.0 credits, 45 hours lecture] Asymptotes. Derivatives: Derivatives and Rate of Change, Derivatives as
(Pre-requisite Courses: None) Functions, Differentiability of Functions, Rules and Techniques of
Atomic Structure: Bohr Atomic Model, Limitations of Bohr's Model, Differentiation. Applications of Differentiation: Rates of change in Natural
Atomic Spectra, Wave Nature of Electron, Heisenberg Uncertainty Principle, and Social Sciences, Exponential Growth and Decay, Linear Approximation
Schrodinger Equation, Quantum Numbers, Pauli's Exclusion Principle, and Differentials, Finding Minimum and Maximum Value of Functions and
Aufbau Principle, Hund's Rule, Electronic Configuration. Periodic Table: s, the first and Second Derivative Tests, Indeterminate Forms and L'Hospital's
Rule, Curve Sketching. Integrals: Riemann Sum and Definite Integrals,
p, d and f- Block Elements, Periodic Law, Atomic Radii, Ionization Potential, Properties of Integrals, Fundamental Theorem of Calculus, Anti-Derivative
Electronegativity, Electron Affinity, Diagonal Relationship, Metals, and Indefinite Integral, Net Change Theorem, Substitution Rule. Application
Metalloids, Nonmetals and Their Properties, Properties and Uses of Noble of Integration: Finding Area between Curves, Volumes, Volumes by
Gases. Chemical Bonding: Reason of Chemical Bonding, Ionic Bond, Cylindrical Shells, Average Value of a Function, Mean Value Theorem for
Covalent Bond, Coordinate Covalent Bond, Hydrogen Bond, Metallic Bond, Integrals.
Vander Waal's Force. Oxidation Reduction: Charge Concept, Electronic SS11106: Government and Public Administration
Concept, Oxidizing Agent, Reducing Agent, Oxidation Number, Balancing [2.0 credits, 30 hours lecture]
Pre-requisite Courses: None)
the Oxidation Reduction Equation. Acid Base: Bronsted Concept, Lewis
Concept, Ionization of Water, pH, Neutralization Curve, Indicators and Their Constitution of Bangladesh, fundamental rights as enunciated in Bangladesh
constitution, forms of government of Bangladesh, organs of government: a)
Selection, Buffer, Henderson Equation. State of Matter: Gas Laws: Boyle's
legislative assembly: composition, powers and functions,
Law, Charles' Law, Avogadro's Law, Ideal Gas, Real Gas, Ideal Gas b) judiciary- composition, powers and functions, c) executive public
16 17
administration, role of government, good governance, accountability and
transparency of the public servant, local government, human resource
management and planning.
CSH-1201 : Fundamentals of Programming
[3.0 credits, 45 hours lecture|
CSE-1111 : Fundamentals of Computers and Computing Lab (Pre-requisite Courses: CSE|1101, CSE11102)
Review of Basics: Basic I/0, Data Type, Conditional Logic, Switch Case,
[1.5 Credits, 45 Hours Lab]
Character, ASCII Value, Reading and Writing Character, Integer to
(Pre-requisite Courses: None) Character Conversion. Operators: Arithmetic, Relational, Logical and
Contents related to the coursework CSE-1101 (Fundamentals of Computers Bitwise Operators, Operator Precedence and Associativity, Arithmetic
and Computing). Expression Evaluation, Short Cut Operator. Functions-I: Basic
Functions, Void Functions with No Parameters. Loops: Looping Basic,
EEE-1113: Electrical Circuits Lab Necessity of Loops, While Loop, Loop Condition, Body, Initialization,
Increment, For Loops, Part of For Loops, Do While Loop, Entry
[1.5 Credits, 45 Hours Lab]
Controlled Loops, Exit Controlled Loops, Example, Formulating
(Pre-requisite Courses: None) Problems Using Loops. Formatted I/0: Specifying Width using Format
Contents related to the coursework EEE-I 103 (Fundamentals of Electricals Specifier in printf() and scant() in Details. Nested Loop: Nesting of Two
and Electronics). Loops, Example, Nesting of Independent Loops inside One, Example,
Nesting of More Than Two Loops. Functions -11: Functions with Return
Type and Trivial Parameters, Local and Global Variables, Call by Value,
CHE-1114: Chemistry Lab Library Functions/Header Files Concept. Arrays: Basics of Array,
[1.5 Credits, 45 Hours Lab] Necessity, Declaration, Accessing through Indices, Accessing using
Loops, Initialization, Example, Two Dimensional Arrays, Declaration,
(Pre-requisite Courses: None)
Initialization, Accessing through Loops, Example, Multidimensional
Contents related to the coursework CHE-1104 (Chemistry). Arrays, Example. Functions - Ill: Passing AITays in a Function as
Parameter, Call by Reference, Recursion, Scope Visibility and Lifetime of
Variable. Strings: Basics, Difference between String and Character
Array, I/0, 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 Operation, Call by Reference using Pointers,
Pointer for lD/2D/3D Array, Structure, Pointer Expression, Array of
Pointers, Function Returning Pointers. Dynamic Memory Allocation:
Basics, Uses, Malloc, Free, Calloc, Realloc. File Operation: Basics,
Uses, File Opening, Closing, File I/0, Use of Redirect Operator to Write
in File or Read from File. Preprocessors and Macros.

CSE-1202: Digital Logic Design

[3.0 credits, 45 hours lecture]
(Pre-requisite Courses: None)
Introduction: Introductory Concepts, Binary, Octal and Hexadecimal
Number System BCD, ASCH and EBCDIC Codes, Combinatorial
Logic: Data Representation Logic Gates and Boolean Algebra,
Combinational Circuits Design using N;!A}I|of NOR Gates Only.

18
19
Introduction to Decision Diagram, Minimization of Switching Functions Physical Optics: Theories of Light, Interference of Light, Young's
Algebraic Simplification, Kamaugh Map, VEKM, QuinceMccluskey Double Slit Experiment, Displacements of Fringes and Its Uses, Fresnel
Method. Sequential Logic: NAND and NOR Latches. Clocked SR. JK D Bi-Prism, Newton's Rings, Interferometers, Diffraction of Light, Fresnel
and T Flip - Flops. FF Timing Consideration. Master- Slave FF. Complex
and Fraunhoffer Diffraction, Resolving Power of Optical Instruments,
Sequential logic: Frequency Division and Counting Troubleshooting Diffraction at Double Slit & N - Slits, Diffraction Grating, Polarization,
Case Studies. Asynchronous Ripple Up and Down Counters, Counters Production and Analysis of polarized Light.
with Any MOD Numbers Asynchronous IC Counters, Propagation Delay.
Parallel Up Down and Upmown Counters. Presentable Counters. The MATH-1204: Methods of Integration, Differential Equations and Series
74193 Counter. Decoding a Counter. Cascading Counters. Shift [3.0 credits, 45 hours lecture]
Registers, IC Shift Digital Clock. MSI Logic Circuits: BCD - to - (Pre-requisite Courses: MATH-1105)
Decimal Decoders, BCD-to-7 Segment Decoder/Drivers. Encoders.
Techniques of Integration: Integration by Parts, Trigonometric
Multiplexer and Demultiplexer. Integrated Circuits Logic Families:
Substitution, Partial Fractions, Computer Algebra Systems (e.g.,
TTL Logic Family Standard TTL Series Characteristics, Other TTL Series
Mathematica, Sage), Approximate Integration - Simpson's Rule, Improper
TTL Loading Rules, Digital MOSFET Circuits. Memory Devices:
Integrals. Application of Integration: Arc Length, Area of a Surface of
Semiconductor Memory Technologies ROM Architecture Timing and
Revolution. Differential Equations: Modeling with Differential
Type of ROM, EPROM, EEPROM, ROM Applications. _ RAM
Equations, Solving First Order Differential Equations, Direction Fields
Architecture Static and Dynamic RAM, DRAM Structure Operation and
and Euler's Method, Methods for Separable Equations and Linear
Refreshing. Introduction to Sequential Circuits, Formal Representation of
Equations. Parametric Equations and Polar Coordinates: Curves
Sequential Circuits. Arithmetic circuits: The Half- Adder Full Adder.
Defined by Parametric Equations, Calculus with Parametric Curves, Polar
Parallel Adders.
Coordinates, Area and Length in Polar Coordinates, Conic Sections in
PHY-1203 : Physics Polar Coordinates. Sequence and Infinite Series: Sequence and
Convergence of Sequences, Infinite Series and Its Convergence,
[3.0 credits, 45 hours lecture]
Convergence Tests, Alternating Series, Power Series and Its
(Pre-requisite Courses: None)
Convergence, Representing Functions as Power Series, Taylor and
Heat and Thermodynamics: Introductory Concepts and Zeroth Law,
Mcclaurin Series, Applications of Taylor Polynomials, Approximating
Energy Considerations, Work and Heat, Units, Thermodynamic Process,
Functions by Polynomials.
Properties and Equilibrium, First Law of Thermodynamics and It's
Applications, Reversible and Irreversible Processes, Second Law of
Thermodynamics, Carnot Cycle, Efficiency of Heat Engines and Heat ENG-1205: Developing English Language Skills
Pump, Camot's Theorem, Absolute Scale of Temperature, Entropy. [2.0 Credits, 30 Hours Lab]
Structure of Matter: Crystalline & Non- Crystalline Solids, Single (Pre-requisite Courses: None)
Crystal and Polycrystal Solids, Unit Cell, Crystal Systems, Co-
English phonetics: the places and marmers of articulation of the English
ordinations Number, Crystal Planes and Directions, Packing Factor, Miller
sounds; Vocabulary: techniques of enriching stock of words; English
Indices, Bragg's Law, Defects in Solids, Point Defects, Line Defects,
grammar: construction of sentences, coirmion grammatical problems;
Bonds in Solids, Interatomic Distances, Introduction to Band Theory,
Reading: techniques and strategies for improving comprehension skills;
Distinction between Metal, Semiconductor and Insulator. Waves and
prose pieces by renowned authors; Writing: developing paragraphs as the
Oscillations: Differential Equation of a Simple Harmonic Oscillator,
building blocks of larger discourses; Business Correspondence:
Total Energy and Average Energy, Combination of Simple Harmonic
importance, classifications and structures; Report: types and layout of
Oscillations, Issajous' Figures, Spring- Mass System, Damped
reports; Technical Writing: research paper; dissertation and thesis;
Oscillation, Forced Oscillation, Resonance, Two- Body Oscillations,
technical proposals; instruction manual.
Reduced Mass, Differential Equation of a Progressive Wave, Power and
Intensity of Wave Motion, Stationary Wave, Group Velocity and Phase
Velocity, Architectural Acoustics, Reverberation and Sabine's Formula.

20
21
 CSH-1211: Fundamentals of Programming Lab
[3.0 Credits, 90 Hours Lab]
(Pre-requisite Courses: CSEl-1111) CSH-2101 : Data Structures and Algorithms
Contents related to the coursework CSE-1201 (Fundamentals of [3.0 credits, 45 hours lecture]
Programming). (Pre-requisite Courses: CSE-1201)

CSH-1212: Digital Logic Design Lab Introduction: Introduction to Data Structures, idea of abstract data type,
[1.5 Credits, 45 Hours Lab] preliminary idea of algorithm runtime complexity (Big Oh notation),
(Pre-requisite Courses: None) preliminary idea of data structure space complexity. Linked List:
Contents related to the coursework CSE-1202 (Digital Logic Design). Singly/doubly/circular linked lists, basic operations on linked list
(insertion, deletion and traverse), dynamic aITay and its application.
Stack and Queue: Basic stack operations (push/pop/peek), stack-class
CHE-1213: Physics Lab implementation using array and linked list, in-fix to post-fix expressions
[1.5 Credits, 45 Hours Lab] conversion and evaluation, balancing parentheses using stack, basic
(Pre-requisite Courses: None) queue operations (enqueue, dequeue), circular queue/ dequeue, queue-
Contents related to the coursework PHY-1203 (Physics). class implementation using array and linked list, application- Josephous
problem, palindrome checker using stack and queue. Recursion: Basic
ENG-1215: Developing English Language Skills lab idea of recursion (31aws-base case, call itself, move towards base case by
[1.5 Credits, 45 Hours Lab] state change), tracing output of a recursive function, applications- merge
(Pre-requisite Courses: None) sort, permutation, combination. Sorting: Insertion sort, selection sort,
bubble sort, merge sort, quick sort (randomized quick sort), distribution
Grammar: Tense, article, preposition, subject-verb agreement, clause,
sort (counting sort, radix sort, and bucket sort), and lower bounds for
conditional and sentence structure; Vocabulary building: Correct and
sorting, extemal sort. Binary Tree: Binary tree representation using array
precise diction, affixes, level of appropriateness. Colloquial and standard,
and pointers, traversal of Binary Tree (in-order, pre-order and post-order).
informal and fomal; Developing reading skill: Strategies of reading -
Binary Search Tree: BST representation, basic operations on BST
skimming, scanning, predicting, inference, analysis and interpreting variety
of texts, practicing comprehension from literary and nonliterary texts. (creation, insertion, deletion, querying and traversing), application-
searching, sets. Searching: Linear search, Binary Search, application of
Developing writing skill: Sentences, sentence variety, generating
Binary Search -finding element in a sorted array, finding nth root of a real
sentences, clarity and correctness of sentences, linking sentences to form
number, solving equations. Heap: Min-heap, max-heap, Fibonacci-heap,
paragraphs, writing paragraphs, essays, reports, formal and informal letters;
Listening skill and note taking: Listening to recorded texts and class applications-priority queue, heap sort. General Tree: Implementation,
lectures and leaming to take useful notes based on listening; Developing application of general tree- files system. Disjoint Set: Union find, path
compression. Huffman Coding: Implementation, application-
speaking skill: Oral skills including communicative expressions for
compression. Graph: Graph representation (adj acency matrix/adjacency
personal identification, life at home, giving advice and opinion, instruction
list), basic operations on graph (node/edge insertion and deletion),
and directions, requests, complaints, apologies, describing people and
traversing a graph: breadth-first search (BFS), depth-first search (DFS),
places, narrating events.
graph - bicoloring. Self-balancing Binary Search Tree: AVL tree
(rotation, insertion). Set Operations: Set representation using bitmask,
set/clear bit, querying the status of a bit, toggling bit values, LSB,
application of set operations. String ADT: The concatenation of two
strings, the extraction of substrings, searching a string for a matching
substring, parsing.

22 23
 CSE-2102: Object Oriented Programming EHE-2104: Electronic Devices and Circuits
[3.0 credits, 45 hours lecture] [3.0 credits, 45 hours lecture]
(Pre-requisite Courses: CSE-1201) (Pre-requisite Courses: CSE-1202)
Introduction: Object oriented programming overview. Object Oriented Introduction to Semiconductors: Properties, bonds and types of
Concepts: Modeling problems using object oriented concepts. semiconductors. Semiconductor Diodes and Special Purpose Diodes:
Introduction to UML. Encapsulation, Inheritance and Polymoaphism. The pn junction diode: formation, properties and V-I characteristics,
Object Oriented vs. Procedural programming, Basics of Object Oriented Basic constructions, characteristics, operations and uses of special diodes :
Programming language. Objects and Classes: Attributes and functions, Light-Emitting Diode (LED), Zener diode etc. Diode Application: Half-
constructors and destructors, functions or methods, overloading methods, wave and full-wave rectifiers - operation and efficiency, Ripple factor,
access control, special considerations in different languages. I/0: Stream Filter circuits - capacitor input filter, LC filter and H-filter, Clipping and
and files. Inheritance: Inheriting classes, subclass, super class, access Clamping circuits, Voltage regulation and regulator circuits - Zener diode
control, inheritance hierarchy, overriding, dynamic binding, abstract and transistor voltage regulator. Bipolar Junction Transistors: npn and
class, inner classes, special considerations in different languages, pnp transistors, amplifying and switching actions of transistor, transistor
multiple inheritance, interface. Exception and Exception Handling: characteristics in CB, CE & CC configurations, transistor load line and
Exception handling fundamentals, exception types, chained exception, operating point. BJT Biasing: Faithful amplification, inherent variation
creating own exception subclasses. Generics or Templates:- Special of transistor parameters and thermal runway, stabilization and stability
considerations in different languages. Package/Namespace: factor, methods of BJT biasing, analysis and design of biasing circuits.
Understanding and implementing package/namespace. Object-Oriented Single Stage Transistor Amplifier: Single stage amplifier circuit, phase
Design Principles and examples: Introduction to object-oriented design reversal, dc and ac equivalent circuits, load line analysis, voltage gain and
principles and examples, introduction to object-oriented design. Case power gain, classification of amplifiers, amplifier equivalent circuits.
Study using Object Oriented Programming. Field Effect Transistors: Classification of FET, construction, operation
and characteristics of JFET and MOSFET, transfer characteristics and
Shockley's equation, DC biasing of JFET. Power Hlectronics:
CSE-2103 : Digital Electronics and Pulse Techniques
operations, characteristics and applications of industrial electronics
[3.0 credits, 45 hours lecture] devices: SCR (Silicon Controlled Rectifier), TRIAC, DIAC etc.
(Pre-requisite Courses: CSE-1202) Feedback Techniques and Op-amps: Concepts- negative and positive
Logic Gates: Diode logic gates, transistor switches, transistor gates, feedback, characteristics and gain with negative voltage and current
MOS gates; Logic Families: TTL, ECL, IIL and CMOS logic with feedback, emitter follower, basic Op-amps- characteristics, inverting,
operation details Propagation delay, product and noise immunity; Open non-inverting, integrators, differentiators, summing amplifiers.
collector and high impedance gates; Electronic circuits for flip-flops, Oscillators: Theory of oscillation and characteristics of different
counters and register, memory systems, PLAs; A/D and D/A converters oscillators. Introduction to IC fabrication.
with applications; SAI circuits, LED, LCD and optically coupled
oscillators; Non-linear applications of OP AMPs; Analog switches; MATH-2105: Linear Algebra
Linear Wave Shaping: diode wave shaping techniques, clipping and
[3.0 credits, 45 hours lecture]
clamping circuits. comparator circuits, switching circuits; Pulse
(Pre-requisite Courses: MATH-1204)
transformers, pulse transmission, pulse generation; monostable, bistable Basics: Matrices, Linear Equations and Gaussian Elimination, Inverse
and astable multivibrators, Schmitt trigger, blocking oscillators and time- Matrices, LU Factorization. Vector Spaces: Solving system of linear
base circuit; Timing circuits; Simple voltage sweeps, linear current equations and row space, column space, null space, and Rank. Linear
Sweeps.
Independence: basis and dimension. Orthogonal Vectors: Subspaces,
inner products, projection onto subspaces, projection matrices and least
squares, orthogonal basis and Gram-Schmidt orthogonalization.
Determinants and their Properties: Co-factors, Cramer's rule and other
applications of determinants. Higenvalues and Eigenvectors: Basics,
application in diagonalization, computing powers of matrices, and

24 25
solving difference equations. Various Matrices: Symmetric matrices, EHE-2114: Electronics Devices and Circuits Lab
Hermitian matrices, Spectral theorem, Positive definite matrices and minima.
[0.75 Credits, 22.5 Hours Lab]
Introduction to Linear Transformations: Change of basis, and Singular
(Pre-requisite Courses: CSE-1212)
Value Decomposition. Computation with Matrices: Using
MATLAB/OCTAVE, norm of a matrix and condition number, Left and Right Contents related to the coursework EEE-2104 (Electronics Devices and
inverse and pseudo inverse, QR decomposition. Circuits).

SS-2106: Bangladesh Studies

[2.0 credits, 30 hours lecture]
(Pre-requisite Courses: None)
Introduction to the course and its objectives. History and Society of
Bengal under the British rule and Pakistan rule: The impact of British
and Pakistan rules on the economy and education of the people. Language
Movement of 1952, Events Leading to the Mass Upsurge of 1969, War of
Independence and the Emergence of Bangladesh in 1971. Study of
Geography and Resources of Bangladesh: Location, Area, Boundary,
Ecological Settings, River System, Climate, People and Resources of
Bangladesh. Social Structure of Bangladesh. Culture of Bangladesh:
Language, Literature, Art and Culture of Bangladesh. Politics,
Formation and role of major political parties in Bangladesh and
Constitutional development of Bangladesh. Economy of Bangladesh.
Achievements in different sectors (economy, culture, sports etc.) of
Bangladesh. Socio-cultural problems and prospects of Bangladesh.

CSE-2111: Data Structures and AIgorithms Lab

[1.5 Credits, 45 Hours Lab]
(Pre-requisite Courses: CSE-1211)

Contents related to the coursework CSE-2101 (Data Structures and

Algorithms).

CSE-2112: Object Oriented Programming Lab

[1.5 Credits, 45 Hours Lab]
(Pre-requisite Courses: CSE-1211)
Contents related to the coursework CSE-2102 (Object Oriented
Programming).

CSE-2113: Digital Electronics and Pulse Techniques Lab

[1.5 Credits, 45 Hours Lab]
(Pre-requisite Courses: CSE-1212)
Contents related to the coursework CSE-2103 (Digital Electronics and
Pulse Techniques).

26 27
 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
CSE-2201: Database Management Systems-I DC in expected linear time. Greedy Algorithms: Elements and properties
[3.0 credits, 45 hours lecture] of Greedy algorithms, fractional knapsack, job scheduling with deadline
(Pre-requisite Courses: CSE-2101) minimum spanning tree: Prim's algorithm and Kniskal's algorithm.
Introduction: General overview and purpose of Database Management Dynamic Programming: Basic idea, properties and comparison with
Systems (DBMSs), advantages, applications, common features and Divide & Conquer and Greedy Algorithms, general form of Dynamic
overall structure of the database. Data Modeling (Relational Model): Programming and Memorization, coin related problems, Longest
structure of relational model, key constraints, referential integrity Increasing Subsequence (LIS), Longest Common Subsequence (LCS), 0/1
constraints, general constraints; Relational Algebra: fundamental, Knapsack, Matrix Chain Multiplication, Applications of Dynamic
additional and extended operations, aggregate functions, outer joins and programming. Network Flow: Flow Networks, Max-Flow Min-cut
database modification using RA. E-R Model: entity and relationship sets, theorem, Ford Fulkerson method and its limitation, Edmonds Karp
constraints - key, mapping cardinality and participation constraints, algorithm, maximum bipartite matching, minimum path cover, edge
Cover.
strong and weak entity sets, E-R diagram, class hierarchies, aggregation,
conceptual database design with the ER model, converting ER to CSE-2203: Data and Telecommunication
relational model. Database Application Development (SQL-): data [3.0 credits, 45 hours lecture]
definition and data manipulation languages, integrity constraints, basic (Pre-requisite Courses: CSE-2101)
queries, nested and complex queries, modification of the database, Views: Introduction: Communication model, data communication tasks, data
definition, update on views, cursors, Extending DBMS functionality: communication network standards and organizations. Protocol
stored procedures, assertions and triggers, embedded and dynamic SQL, architecture, communications between layers, peer to peer
DBMS administration: DBA, users, privileges, security etc. Relational communication between remote layers, service access points, service
Database Design: Features of good relational design, functional primitives and communication between adjacent layers, encapsulation of
dependency theory - basic concept, uses, closure of a set of FDs, closure PDUs, addition of headers on transmission; removal on reception,
of attribute sets, canonical cover, algorithms for FDs, decomposition segmentation & reassembly by protocol layers. Physical Layer: Analog
using FDs & its desirable properties; Normalization: Atomic domains and digital data transmission, spectrum and bandwidth, transmission
and first normal form, BCNF and 3NF, multi-valued dependencies and impairments, data rate and channel capacity. Transmission Medium:
fourth normal form, decomposition algorithms for different normal forms, Characteristics and applications of various types of guided medium.
database design process. Wireless Transmission: Characteristics and- applications of wireless
transmission-terrestrial and satellite microwave, radio waves,
CSE-2202: Design and Analysis of Algorithms-I propagation mechanism, free space propagation, land propagation, path
loss, slow fading, fast fading, delay spread, inter symbol interference,
[3.0 credits, 45 hours lecture]
VSAT. Digital Transmission: Line coding techniques- NRZ, RZ,
(Pre-requisite Courses: CSE12101)
Manchester, and differential Manchester encoding, AMI, Block coding,
Introduction: Introduction to Algorithms, role of algorithms in
analog to digital conversion based on PCM, delta modulation, etc. Analog
computing with respect to state of the art researches. Complexity
Transmission: ASK, FSK, PSK, QPSK, QAM encodings, AM, PM, FM,
Analysis and Recurrence Relation: Asymptotic notations, growth of a
etc. Data Transmission: Synchronous and asynchronous data
function, methods to solve recurrence relation- Substitution method,
transmission techniques. Multiplexing: FDM, international FDM carrier
Recursion tree method, Master method. Graph Traversal: Review of
standards, synchronous TDM, international TDM carrier standards,
Breadth first search (BFS), Depth first search (DFS), Topological Sort,
statistical time division multiplexing. Spread Spectrum: Frequency
Strongly Connected Components, Euler Path, Articulation Point, Bridge,
hopping spread spectrum, direct sequence spread spectrum, code division
Bi-connected Components. Shortest Path Algorithms: Dijkstra's
multiple access. Data L.ink Layer: Error Detection and Correction;
Shortest Path Algorithm, Bellman -Ford algorithm and negative cycle
parity check, CRC, forward error correction technique, linear block code,
detection, Floyd-Warshall all pair shortest path algorithm, shortest path in
hamming code, etc. Data Link Control: Line configurations, flow
Directed Acyclic Graph. Divide & Conquer (DC): Counting inversion
control and error control techniques-sliding window, stop and wait ARQ,
selective reject ARQ and HDLC protocols.
28
29
 CSE-2204: Computer Architecture and Organization CSH-2211: Database Management Systems-I Lab
[3.0 credits, 45 hours lecture] [1.5 Credits, 45 Hours Lab]
(Pre-requisite Courses: CSE-1202) (Pre-requisite Courses: CSH-2111)
Micro-Computer Organization and its basic components: Carry Look Contents related to the coursework CSE-2201 (Database System and
Ahead adders, Carry Save adder, Multipliers (e.g. Booth's algorithm), Application).
Divider, Fixed and Floating point (IEEE754) number representations,
Finite State Machine (FSM) representation. Basic Accumulator based CSE-2212: Design and Analysis of Algorithms-I Lab
CPU: Organization, instruction set, programming considerations, RISC [1.5 Credits, 45 Hours Lab]
& CISC processors- Instruction sets, addressing modes. Introduction to (Pre-requisite Courses: CSE-2111)
the Basic MIPS: Instruction set. Fixed Point ALUs: Combinational and Contents related to the coursework CSE-2202 (Design and Analysis of
Sequential ALUs, ALU Expansion. Floating Point Arithmetic Circuits: Algorithms-I).
Pipelined processing, systolic arrays, resolving structural, data, control,
and name hazards; analyzing processor performance, memory CSE-2213: Data and Telecommunication Lab
mapping(e.g. RAM, cache); non-blocking cache memories; memory [0.75 Credits, 22.5 Hours Lab]
protection, translation and virtualization, synchronization, consistency (Pre-requisite Courses: CSE-2111)
and coherence, direct-mapped and associative caches; write-through and Contents related to the coursework CSE-2203 (Data and
write-back caches, pipelined caches, analyzing memory performance. Telecommunication).
Processor Architecture: Super-scalar execution, out-of-order execution,
register renaming, memory disambiguation, branch prediction,
speculative execution; multithreaded, VLIW, and SIMD processors. CSE-2216: Application Development Lab
Hardwired and Micro-programmed Control Design. Buses, bus [1.5 Credits, 45 Hours Lab|
arbitration, I/0 control interrupts and direct memory access, virtual (Pre-requisite Courses: CSE-2101, CSE-2102, CSH-2111, CSE-2112)
memory mapping and addressing. Contents are based on implementation of applications maintaining rules
of application development.
CSE-2205: Introduction to Mechatronics
[2.0 credits, 30 hours lecture]
(Pre-requisite Courses: EEE-1103, CSE-1202)
Introduction: Definition and applications of Mechatronics, relationship
amongst different disciplines. Basics of Ellectronics: Fundamental concepts
of circuits and electrics. Basics of Mechanical Engineering: Fundamental
concepts of Mechanics, measurement systems, control systems, mechanical
design, discrete linear systems. Sensors and Transducers: Sensors for
displacement, proximity, motion, sound, light, temperature, fluid Level and
flow, force, etc. Actuation Systems: Basics of pneumatic and hydraulic
systems, mechanical actuation systems, electrical actuation systems, servos.
System Models and Controllers: Fundamentals of electrical, mechanical,
fluid and thermal systems, electromechanical systems, process controllers,
control modes, PID and digital controllers, velocity, adaptive, digital logic,
microprocessor control. Programmable Logic Controllers: Fundamentals
of PLCs, mnemonics and timers, relays and counters, master and jump
control, data control, analog I/0 control. Design of Mechatronics Systems:
Steps of mechatronics system design, possible design solutions, case study.

31
30
 CSE-3103: Microprocessor and Microcontroller
[3.0 credits, 45 hours lecture]
CSH-3101: Computer Networking (Pre-requisite Courses: CSE-2204)
[3.0 credits, 45 hours lecture]
Hvolution of Microprocessor, 8086 Microprocessor: Architecture,
(Pre-requisite Courses: CSE-2203)
instruction sets, interrupts and 8259A, higher versions of 8086 (80286,
Introduction to Computer Networks: Protocol Layers, Network 80386, 80486). Pentium Microprocessor: Architecture, register sets,
performance metrics (delay, loss, throughput), Circuit and Packet cache, floating point operations, addressing modes, paging, instruction set,
Switching. Application Layer: Protocol overview of HTTP, FTP, Email, opcode, interrupt, protected mode operations. Next Generation
DNS, SNMP, P2P Networks. Transport Layer: Protocol overview of Microprocessors: Intel Core architecture, Intel dual core, core 2 duo, core 2
UDP and TCP, Reliable data transfer, Congestion Control, TCP Reno, quad, core i3, core i5, core i7, mobile microprocessors, ARM, helio, atom.
TCP Tahoe, TCP New Reno. Network layer: Overview of Ipv4 and IPv6, Microcontrollers: Microcontroller & embedded systems, 8051
IP Addressing, NAT, Routing Algorithms (RIP, OSPF, BGP). Wireless microcontroller architecture, operation and instruction set, memory and I/0
Networks: Introduction to wireless networks, Types of wireless networks, interfacing, inter facing to extemal devices. Programmable Logic Controller
Medium Access Control in wireless networks, Routing in wireless (PLC): Basic Structures, I/0, Programming, Mnemonics and Timers, Relays
networks, Mobility and mobile IPv6. and Counters, Master and Jump control, Data Control, Analog I/0 Control.

CSE-3102: Software Engineering

CSE-3104: Database Management Systems-II
[3.0 credits, 45 hours lecture]
[3.0 credits, 45 hours lecture]
(Pre-requisite Courses: CSE-2101, CSE-2102)
(Pre-requisite Courses: CSE12201)
Introduction, Software Process Model, Generic Model: fi-amework
DBMS Implementation Technology: Storage and file structure: different
activity, identifying task set, prescriptive model: waterfall model, v model,
storage types, RAID and RAID levels, file and record organization, data
evolutionary model: spiral, Software Project Management, schedule: dictionary storage, Indexing and Hashing: basic concepts, ordered indices,
people and effort, time line and schedule, risk: identification, refinement, B+-tree index files, B-tree index files, static & dynamic hashing, comparison
mitigation, User Requirement: Stakeholders, requirement gathering, of ordered indexing & hashing. Information Retrieval: Query processing:
process flow System Requirement Specification (SRS): Elementary overview,measuresofquerycosts,selectionoperation,sorting,joinoperation,
business logic, function description, use cases, priority, dependency, other operations and evaluation of expressions. Query optimization: introduction,
nonfunctional requirement, SRS standard and practice(IEEE 830), Project's transformation of relational expressions, evaluation plan, cost-based optimization
SRS Presentation, Architecture Design: Style, representing system in and heuristic optimization, optimizing nested sub-queries, materialized view
context, archetypes, complexity, System Design: Pattern, modularity, and view maintenance. Introduction to Modern Databases: Object-
separation of concern, information hiding, functional independence, relational and object-oriented databases: complex data types - structured,
refinement, refactoring , User Interface Design: Interface design steps, array and multiset types, inheritance, object identity and reference types,
interface design pattern, Data Design: Data, data base, data flow, Design obj ect-relational query, implementation, persistent progranming languages,
standard and practice (IEE 1016), Project's Design Presentation, Introduction to other databases: temporal, spatial, multimedia and mobile
Implementation and Testing: Unit testing, integration testing, white box databases. Data Processing and Visualization: Data object and attribute
testing: basis path testing: flow graph, cyclomatic complexity, control types: nominal, binary, ordinal, numeric, basic statistical description of data,
structure testing, black box testing, debugging, validation testing, System measuring data similarity and dissimilarity, Data Preprocessing: data
testing, User Acceptance testing, Quality Assurance: Plan, task, goal, cleaning, integration and reduction, Data transformation and data
metric, six sigma quality standard and practice (IEEE 730), Deployment: discretization, Data visualization: Pixel-oriented, geometric projection, icon-
Direct, parallel, pilot, Maintenance: Supportability, Reengineering, Final based, hierarchical and visualizing complex data and relations. Database
Projectpresentation. System Architecture: Centralized and client-server architecture; Parallel
databases: architecture, speedup and scaleup, interconnection networks, I/0
parallelism, interquery and intraquery parallelism, cost of parallel processing,
design of parallel systems. Distributed Databases: homogeneous and
heterogeneous, distributed data storage: data replication and fragmentation,
32 33
failure handling, distributed query processing. Introduction to Data Mining
and Machine Learning: Decision support systems, OLAP implementation,
data warehousing- components, schemas, data mining concept, applications -
association rules, classification, clustering. CSH-3201: Operating Systems
[3.0 credits, 45 hours lecture]'
MATH-3105: Multivariable Calculus and Geometry (Pre-requisite Courses: CSE12202, CSE-2204)
[3.0 credits, 45 hours lecture] Introduction: Operating System overview, computer system structure, structure
(Pre-requisite Courses: MATH-2105) and components of an operating system. System calls: Class of system calls
Vectors and Geometry of Space: 2D and 3D vectors, Dot and Cross and description. Process and Threads: Process and thread model, process
Products, Equations for lines, planes, cylinders and quadric surfaces; Vector and thread creation and termination, user and kernel level thread,
Functions: Differentiation and integration of vector functions, Arc length scheduling, scheduling algorithms, dispatcher, context switch, real time
and curvature, Motion in space; Partial Derivatives: Functions of multiple scheduling. Concurrency and Synchronization: IPC and inter-thread
variables, Limits and Continuity, Tangent and linear approximations, chain communication, critical region, critical section problems and solutions.
rule, directional derivatives, Max-Min values, Lagrange Multiplier, Resource management: Introduction to deadlock, ostrich algorithm,
Derivatives with vectors and matrices; Multiple Integral: Change of deadlock detection and recovery, deadlock avoidance, deadlock prevention,
variables in multiple integral, applications; Vector Calculus: Vec-tor flelds, starvation. File Management: File Naming and structure, file access and
line integrals, Green's theorem, Curl and divergence, parametric surfaces, attributes, system calls, file organization: OS and user perspective view of
Stroke's theorem, Divergence theorem. file, memory mapped file, file directories organization. File System
Implementation: Implementing file, allocation strategy, method of
CSE-3111: Computer Networking Lab allocation, directory implementation, UNIX i-node, block management,
[1.5 Credits, 45 hours lab] quota, and example file system. Memory Management: Basic memory
management, flxed and dynamic partition, virtual memory, segmentation,
(Pre-requite Courses: CSE-2213)
paging and swapping, MMU. Virtual Memory Management: Paging, page
Contents related to the coursework CSE-3101 (Computer Networking). table structure, page replacement, TLB, exception vector, demand paging and
segmentation, thrashing and performance. I/0 Management: I/0 Devices,
CSE-3112: Software Engineering Lab
I/0 Bus architecture and controller, interrupts, DMA, programmed I/0. Disk
[0.75 Credits, 22.5 hours lab] I/0 Management: Structure, performance, low-level disk formatting, Disk
(Pre-requisite Courses: CSE-2111, CSE-2112) arm scheduling algorithm, error handling, and stable storage.
Contents related to the coursework CSE-3102 (Software Engineering).
CSE-3202: Numerical Methods
CSE-3113: Microprocessor and Assembly Language Lab [3.0 credits, 45 hours lecture]
[1.5 Credits, 45 hours lab] (Prerequisite Courses: CSH-2202)
(Pre-requisite Courses: None) Locatingrootsofequations,numberrepresentationanderrors,usingMAILAB
Contents related to Microprocessor and Assembly Language. for mathematical experiments, numerical methods for nonlinear equations,
numericaldifferentiation,numericalintegration,Interpolationbypolynomials
CSE-3116: Microcontroller Lab and by spline functions, system of linear equations, numerical methods for
[0.75 Credits, 22.5 hours lab] ordinary differential equations, numerical methods for partial differential
(Pre-requisite Courses: None) equations, Numerical optimization.
Contents related to Microcontrollers.

34 35
 CSH-3203: Design and Analysis of Algorithms-II STAT-3205:Introductiontoprobabilityandstatistics
[3.0 credits, 45 hours lecture] [3.Ocredits, 45 hours lecture]
(Pre-requisite Courses: CSE-2202) (Pre-requisite Courses: None)
Hashing: Linear Probe, Quadratic Probe, Double hashing, Random Statistics: Types and Sources of Data, Descriptive 'and Inferential Statistics,
hashing, Computational Geometry: Vector Cross Product, segment Uses and Abuses of Statistics; Presentation of Data and Exploratory
intersection, point inside a polygon (convex), area of a polygon, convex Data Analysis Tools: Stem and Leaf plots, Frequency Tables, Histograms,
hull, Line, Segment, circle intersection, Number Theory: Sieve of Skewness and Modes, Percentiles and Quartiles, Estimating Percentiles from
Eratosthenes, Chinese Remainder Theorem, Euler phi, extended Euclid, Histograms, Extremes and Median, Hinges, Outliers and 5 Number
application of prime factorization application of phi. Backtracking: Basic Summaries, Box-and-Whisker plots, Use of R or MATLAB for exploratory
idea and control structure of backtracking, Permutation & Combination dataanalysis.CharacteristicsofData:Measuresoflocation-Mean,Median,
generation, Graph Coloring, N-queen problem, Hamiltonian cycle, Branch and Mode; Measures of Spread/Scale: Spread and Variability, Range, Standard
Bound in backtracking. For example in traveling salesman problem, String Deviation; Measures of Location: Trimmed Mean, Winsorized Mean;
Matching AIgorithms: Na.1.ve string matching algorithm, Rabin Kaap Robust Measures of Spread: Interquartile Range, Median Absolute
algorithm, String matching with finite automata, Knuth Morris Pratt (KMP) Deviation; Markov's inequality and Chebyshev's inequality for list data,
algorithm, Trie Suffix Array. NP Completeness: Polynomial time, Multivariate Data: Scattelplots and Scattexplot Matrices, Describing
Polynomial time verification, NP-completeness and reducibility, NP- Scattexplots: Linearity and Nonllinearity, Homoscedasticity and
complete problems, Online AIgorithms: Competitive Analysis, Online Paging Heteroscedasticity, Outliers, Correlation and Association: Correlation and
Problem, Randomized Online Algorithms, Adversary Models, Marker Causality, CoITelation Coefficient, the Effect of Nonlinear Association,
Algorithm, Parallel/Distributed/Multithreaded Algorithms: The basics of Homoscedasticity and Heteroscedasticity, and Outliers on the Correlation
dynamic multithreading, Recursive Fibonacci ' Iiumber computation. Coefficient; Rank Correlation, Experiments, Hvents, Set Theory:
Interpretations of probability, Axioms of Probability and Counting Methods
CSE-3204: Formal Language, Automata and Computability for Computi+i-!g Probability, Conditional Probability, Independence, Conditional
[3.0 credits, 45 hours lecture] lrideper!dL=£ice, and Bayes' Theorem, Discrete and Continuous Probability
(Pre-requisite Courses: CSH-1102) DistF§:tMiTif;€®n: Distribution Function, Expectation, Variance, Moments and
Fz`rome33t Generating Functions, Transfomiation of Variable, Special
Automata and Language Theory: Finite Automata (FA) and Regular
D3dsifi-te£-3 Distributions - Bemoulli, Binomial, Geometric, Multinomial,
Expressions: Equivalence of Deterministic FA, Non-Deterministic FA and
Regular Expressions; Properties of Regular Languages: Pumping lemma Hypei.geometric, and Poisson Special Continuous Distributions - Uniform,
Gamma, Exponential, and Beta. Special Continuous Distributions-Normal
and its application, Closure and Decision properties of Regular Languages;
Distribution and its properties Q-Q plots and the Normal Probability Plot,
Equivalence and Minimization of DFAs. FA with output - Mealy machines
ii,imit Theorems: Markov's and Chebyshev's Inequality, Central Limit
and Moore machines, The Chomsky Hierarchy, Context Free Grammars
Theorem, Laws of Large Numbers.
(CFGs) and Languages (CFLs), Chomsky and Greibach Normal Form; Push
Down Automata (PDA), Equivalence of pDAs & CFLs; Properties of CFLs:
Pumping Lemma, Closure and Decision properties, CYK algorithm.
CSE-3211:OperatingsystemsLab
Computability Theory: Tuning Machines, Computation with Turing [1.5Credits,45hourslab]
Machines, Church-Turing Hypothesis, Recursive and Recursively (Pre-requisite Courses: CSH-2212)
Enumerable Languages and their properties, Equivalence of Uurestricted Contents related to the coursework CSE-3201 (Operating Systems).
Grammars and Turing Machines, Context Sensitive Languages and Linear
Bounded Automata; Complexity Theory: Time Complexity: P, NP, NP CSH-3212:NumericalMethodsLab
Completeness-Cook's Theorem, Polynomial Time Reduction and NP [0.75Credits,22.5hourslab]
Complete Problems, Approximation Algorithms; Space Complexity: (Pre-requisite Courses: CSE-2212)
Savitch's Theorem, PSPACE and PSPACE complete, L, NL; Hierarchy Contents related to the coursework CSE-3202 0Vumerical Methods).
Theorems; Probabilistic Algorithms and the class BPP.

36 37
 CSE-3216:SoftwareDesignpatternsLab
[1.5 Credits, 45 hours lab]
(Pre-requisite Courses: CSE-3112) CSE-4101 : Artificial Inte.IIigence
Contents related to Software Design Patterns. [3.0 credits, 45 hours lecture]
(Pre-requisite Courses : CSE-2202)
ENG-3217: Technical Writing and Presentation Lab Introduction: Agents and environment, Problem solving by searching:
[0.75Credits, 22.5 hours lab] Un-Informed Search Strategies: Breadth first search, uniform cost search,
(Pre-requisite courses: HNG-1215) depth-flrstsearch,iterativedeepeningandbidirectionalsearch.Informedsearch
Contents based on Technical Writing and Presentation. algorithms: best-first search, A* search, Beam search, Heuristic searching,
Memory Bounded Search. Local Searches: Hill Climbing, Simulated Annealing,
Constraint Satisfaction Problems. Genetic Algorithm: selection, crossover,
mutation and fitness. Game Playing: motivation, min-max search, resource
limits and heuristic evaluation, Ci-P pruning, stochastic games, partially
observable games, continuous, embodied games. Logic: Propositional,
FOL: quantifiers, model, validity, inference, substitution, and unification and
Herbrand theorem. Machine Learning: Supervised leaming, decision trees,
reinforcement leaming, Q-leaning, neural networks (neuron, perceptron
leaming, linear and nonlinear separability, multi-layer neural networks, back
propagation, variations on back propagation), planning: Planning problems,
partial order plarming, plarming as logical inference planning, Probabilistic
Reasoning: Uncertainty, probability, independence, Bayes' rule, Bayesian
network, exact inference in Bayesian network and approximate inference,
Knowledge Representation: Ontological engineering, categories and
objects, events, reasoning systems for categories, reasoning with default
information, Application: Robotics: hardware, perception, leaning,
interaction.

CSE-4102: Mathematical and Statistical Analysis for Engineers (3.0

credits, 45 hours lecture)
(Pre-requisite Courses: MATH-2105, MATH-3105 and STAT-3205)
Linear Models: Introduction to linear models, modeling and measurement
scales, central tendency, univariate graphs, bivariate graphs, covariance, z-
scoresandcorrelation,Ordinaryleastsquares,samplingdistributionsandstatistical
inference, confidence intervals and hypothesis testing, type I and type 11
errors, multiple regressions, autocorrelation, cross-correlation and covariance
functions, correlation and covariance matrices. Laplace Transforms:
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 Transforms: Properties of Fourier series,
Fourier sine and cosine series, Fourier transform of continuous and discrete
signals, Fourier Coefficients and orthogonally, General periodic functions,
odd and even functions, Fourier transform of continuous and discrete signals

38 39
and the discrete Fourier transform and the FFT algorithm. Stochastic CSE-4111 : Artificial Intelligence Lab
Processes: Introduction, Poisson and Exponential processes, deterministic [1.5 Credits, 45 hours lab]
and nondeterministic processes, and ensemble and time averages, stationary (Prelrequisite Courses: CSE12212)
processes. Markov Chains: Introduction, finite Markov chain, continuous Contents related to the coursework CSE-4101 (Artificial Intelligence).
time Markov chain, Eigenvalues and Eigenvectors, Birth-Death Process, State
transition matrix, initial probability distribution, probability distribution after CSE-4113: Internet Programming Lab
K trials, regular Markov chains, long run behavior of a Markov chain, [1.5 Credits, 45 hours lab]
absorbing Markov chains, Gamblers ruin problem, Fundamental Matrix, (Pre-requisite Courses: CSE-2216)
finding steady state distribution vector - Eigenvector approach, Z-transform Contents related to Internet Programming.
approach. Queuing Model: Basics of Queuing process, Kendall's Notation,
Queue throughput, Efficiency or Access Probability, PASTA, Little's Formula, CSE-4114: Project
M/M/1/K Queue, Mm/M/c Queue, M/M/c/c Queue, D/M/1/B Queue, M/D/1re
[2.0 Credits]
Queue, Networks of Markovian queues: open Jackson network. Linear This is the 1 st part of the final year project. The 2nd part must be completed
Optimization: What is optimization, obj ective function and constraints,linear
in semester VIII by taking-4214.
optimization, sensitivity analysis, duality theory, Linear Programming in
standard form and their duals, LP with equalities and inequalities. -

SS-4103: Entrepreneurship for IT Business

(2.0 credits, 30 hours lecture)
(Prelrequisite Courses: None)
The foundations of entrepreneurship; Inside the entrepreneurship mind:
from ideas to reality; The rewards and challenges of entrepreneurship:
driving forces behind small business, ethics and social responsibility, creativity
and irmovation; new business planning process: conducting a feasibility
analysis, designing a competitive business model, building a solid strategic
plan and crafting a wiming business plan; Forms of business ownership:
franchising and the entrepreneur, buying an existing business; Building a
marketing plan: building a bootstrap marketing plan, creative use of
advertising and promotion, pricing and credit strategies, global marketing
strategies, e-commerce; Building a financial plan: creating a successful
financial plan, managing cash-flow, sources of financing-equity and debt;
Building an operational plan: location, layout and physical facilities,
supply chain management, managing inventory, stafflng and leading a
growing company; Legal Aspects Of Small Business: Succession, ethics,
business law and government regulation; Strategic plan and risk
management;Globalaspectsofentrepreneurship;Buildinganewventureteam
and planning for next generation.

40 41
 of adoption. Use and impact of technologies in various social aspects:
Robotics in warfare or replacement of workforce, Social media effect, artificial
ECO-4201 : Economics intelligence. Medical and biological technologies. Genetic technologies.
Technologies for the poor. Privacy and technology. Technology and Uncertainty.
[2.0 credits, 30 hours lecture]
Ethics of technology design and Use. Regulatory issues in governing
(Prerequisite Courses: None)
Introduction: What is economics, macro and micro economics, methods technologies.

used in microeconomics, microeconomic models, and basic concepts used in

economics (scarcity, opportunity cost, goods and bads, factors of CSE-4203: Engineering Ethics
production, market, equilibrium etc.). Theory of the consumer: Cardinal and [2.0 credits, 30 hours lecture]
ordinal utility, Concepts of diminishing marginal utility, indifference curves (Pre-requisite Courses: None)
and diminishing marginal rate of substitution, budget line, utility Introduction to Elngineering ethics and professionalism: What is
maximization conditions and derivation of individual demand curves, engineeringethics?Whystudyengineeringethics?ResponsibleProfessionals,
preference structure and existence of utility function, derivation of market Professions, and Corporations, The Origins of Ethical Thought, Ethics and the
demandcurve,1awofdemand,ownprice,crosspriceandincomeelasticityof Law; Moral Reasoning and Codes of Ethics: Ethical decision-making
demand, introduction to concept of interltemporal utility maximization. strategies, Ethical dilemmas, Codes of ethics; Case studies Moral
Uncertainty: Choices under risk and uncertainty, expected utility, risk Frameworks for Engineering Ethics: Ethical theories, Personal
aversion, applications of expected utility-buying lottery tickets and insurance commitments and professional life; Ethical Problem-Solving Techniques:
premium, maximin strategy. Theory of the Firm: Behavior of firms, Analysis of Issues in Ethical Problems, An Application of Problem-Solving
production function, Cobb-Douglas production function, returns to scale, Methods; Hngineering as Social Experimentation: Engineering as
extemaleconomiesanddiseconomies,technologicalprogress,differenttypes Experimentation, Engineers as Responsible Experimenters; Risk, Safety,
of costs,cost function,profitmaximization,supplycurve,1awofsupply,own and Accidents: Assessment of safety and risk, Design considerations,
price, cross price and elasticity of supply. Markets: Perfect competition and uncertainty, Risk-benefit analysis, safe-exit and fail safe systems;
the market, behavior of a competitive firin in short- run, consumer surplus, Engineer's Responsibilities and Rights: Employee/employer rights and
producer surplus, impact of taxes and subsidies, market equilibrium in the responsibilities, Confidentiality and conflict of interest, Whistle-blowing,
longrun,paretoefficiencyandperfectcompetition,priceandoutputinimperfect Case studies on whistle-blowing; Honesty and Research Integrity:
Truthfulness, Trustworthiness, Research Integrity, Protecting Research
?ompetition: -monopoly, oligopoly, monopsony, monopolistic competition,
Imperfect competition and efficiency. Strategies of` Players in Imperfect Subjects; Computer Ethics: The Internet and Free Speech, Power
Competition: Normal-Fom games, Nash equilibrium, dynamic games of Relationships, Property, Privacy; Additional Issues Environmental
completeinformation,staticgamesofincompleteinformation,dynamicgames Ethics: Engineering, ecology, economics, Sustainable development;
of incomplete information. Market Failure and Solutions: Public goods, Ethical Frameworks Global Issues: Multinational corporations,
extemalities, information asymmetry, problem of unobservability, moral hazard, 91obalization of engineering, Technology transfer, appropriate technology;
adverse selection, principallagent problem etc. , signaling, profit sharing, cost Cautious Optimism and Moral Leadership: Cautious optimism as a
sharing, efficiency wage, internalization of extemalities, and government technology development attitude, Moral leadership in engineering
intervention. Recommended Texts: [
CSE-4202: Society and Technology 1. Engineering Ethics: Charles 8. Fleddermann
[2.0 credits, 30 hours lecture] 2. Introduction to Engineering Ethics: Mike W. Martin, Roland Schinzinger
(Pre-requisite Courses: None)
Introduction and Overview. Hvolution of Scientirlc Thoughts: History and
CSH-4214: Project
Philosophy of Science. Social Complexity and Technology Change: Elman's
service's stages of social complexity, relationship between social complexity [4.0 Credits]
This is the 2nd part of the final year project. The 1 st part must be completed
and technological imovation, economy, craft specialization, population size and
in semester VII by taking-4114.
how they affect diffusion of technologies. Diffusion theory: The nature of
technologicaldiffusionintothesociety.Theattributesofimovationandtheirrate

42 43
 and non-parametric density estimation. Probabilistic Discriminative
Models: Logistic regression, log-linear models, Kernel methods and Sparse
CSE 4121: Robotic Science and Systems Kernel Machines. Clustering, mixture models and Expectation Maximization
algorithm. Sequential data and Markov models.
Introduction,microcontrollerboard,communicationandcollaboration,motor
control,cameras,images,andlow-1evelrobotvision,robotcontrolarchitectures
CSH 4155: Introduction to Machine Learning Lab
andsensing,motionplarming:conflgurationspace,graspingandobjecttransport,
localization, manipulation: mechanisms and Grasp analysis, inverse kinematics, Contents related to the coursework CSE-4125 (Introduction to Machine
mapping, simultaneous localization and mapping (SLAM). Leaming).
CSE 4127: Information Retrieval
CSH 4151: Robotic Science and Systems Lab Boolean Retrieval: Inverted Index, Processing Boolean queries, extended
Contents related to the coursework CSE-4121 (Robotic Science and Systems). Boolean retrieval; Term Vocabulary and Postings lists: Document
delineation and character sequence decoding, Tokenization, Dropping
tsE4123:ComputationalMethodsinBio-molecularSequence common terms: stop words, Normalization (equivalence classing of terms),
& Structure Analysis Stemming and lemmatization, skip pointers, Biword indexes, Positional
indexes; Dictionaries and Tolerant Retrieval: Search structures for
Scoring Matrices: Protein and nucleotide scoring matrices i:e. PAM,
dictionaries, General wildcard queries, k-gram indexes for wildcard queries,
BLOSUM, Gonett. How to construct scoring matrices. Difference between
Spelling correction; Index Construction: Blocked sort-based indexing,
PAM and Blosum. Database Homology Search: Concepts behind BLAST:
Single-pass in-memory indexing, Distributed indexing, Dynamic indexing;
Applications & Biological Significance; homology, similarity & identity
Scoring and Ranking: Parametric and zone indexes, Tern frequency and
Statistical significance of BLAST: E value, Scores BLAST versions-
weighting, The vector space model for scoring, variant tf-idf functions;
PLASTp, BLASTn, Difference between FASTA and BLAST. Phylogenetic Computing scores in a complete search system: Efficient scoring and
Analysis: Basic Terminology ln Phylogenetics: Distance and parsimony
ranking, Components of an information retrieval system; Hvaluation in
methods; Clustering methods. Rooted and un-rooted trees. Predictive
information retrieval: Evaluation of unranked retrieval sets, Evaluation of
Methods using DNA Sequences: Gene predictive methods- searching by
ranked retrieval results, Assessing relevance, Results snippets; Relevance
signal, searching by content, homology based predictions, Markov models,
feedback and query expansion: The Rocchio algorithm for relevance
andHiddenMarkovmodelsingeneprediction:Genscan,Glimmer,andGrail.
feedback, Relevance feedback on the web, Evaluation of relevance feedback
Promoteranalysisandpredictions.ProteinStructurePrediction:Secondary
strategies, Global methods for query reformulation; Language models for
structure prediction methods: CHAU FASMAN, GOR, NN Tertiary Structure
information retrieval; Enterprise Information Retrieval: Explore the
prediction methods- Homology Modeling, ThreadingITold recognition and Ab capacity of Apache Lucene as a text search framework.
initio.
CSE 4153: Computational Methods in Bio-molecular
CSH 4157: Information Retrieval Lab
Sequence & Structure Analysis Lab
Contents related to the coursework CSE4127 (Infomation Retrieval).
Contents related to the coursework CSE-4123 (Computational Methods in
Bio-molecular Sequence & Structure Analysis). CSE 4131: Introduction to VLSI Design
CSE 4125: Introduction to Machine Learning Current State of VLSI: Fabrication and Size Metrics, Performance Metrics,
System Complexity; Introduction to MOS Technology: PMOS, NMOS and
Supervised and Unsupervised Leaning, issues in machine learning:
CMOS, Transistors, CMOS Fabrication; Design Approaches: Fabrication
parametric and non-parametric models, curse of dimensionality, over-
fitting, and model selection. Linear Models for Regression: Maximum Steps, Stick Diagrams, Design Rules and Layout, Contact Cuts, Double Metal
Likelihood and least squares, regularized least squares, Bias variance MOS Process Rules, MOS Circuits; Delay Analysis: Inverter Delay and its
decomposition, Bayesian linear regression. Linear Models For Analysis, Delay of Different Sequential and Combinational Circuit; Design
Classification: Fisher's linear discriminant, Probabilistic generative models - Automation and VLSI: Layout, Placement, Routing, Silicon Compilation;
Switch logic: Pass Transistors and Transmission Gates. Gate Logic: The
p arametric (maximum likel iho o d and B ayesian)
44 45
inverter, Two-Input nMOS, CMOS and BicMOS Gate Design. Design of parity the ground work, Eliciting Requirements, Negotiating Requirements,
Generator and Multiplexers. Registers, Counters and Memory Realizations, Validating Requirements, Requirements Analysis, Scenario-Based
One Transistor and Three Transistors Dynamic RAM Cell Design; Hierarchical Modeling, UML Models, Data Modeling Concept, Class Based Modeling,
View of VLSI System Design: Behavioral Description High level Synthesis RequirementsModelingStrategies,Flow-OrientedModel,BehavioralModel,
Scheduling, Allocation and Data Path Synthesis; Logic Synthesis: Multilevel Requirements Modeling for Web Apps.
Minimization, PLA Reduction of Regular Structure Circuits; Testing: Testing of
VLSI, Testing of Stuck-at fault, Testing of PLAs; FPGA: Introduction to CSE 4165: Software Requirements Specification and Analysis Lab
FPGA.
Contents related to the coursework CSE-4135 (Software Requirement
Specification and Analysis).
CSE 4161: Introduction to VLSI Design Lab
Contents related to the coursework CSE-4131 (Introduction to VLSI Design). CSH 4137: Cryptography and Security
Introduction: Key security concepts. Various types of threats. Policy vs
CSE 4133: Algorithm Engineering J Mechanism. Security policy life cycle. Vulnerabilities. Controls. * Organizational
Context and Security policy. Human factors in security policy: Basic risk
Introduction. Review of NP-Completeness: The class P, NP, NPC,
analysis structure, Implementation of security plan. Integration of physical
Encoding; Polynomial Verification, Polynomial Reduction, Pro-ving NP-
and logical security. Internet and Email use policies. Computer security
Completeness; Randomized Algorithms: Review of Randomized Quick
incident response team (CSIRT). Security auditing. Basic Applied
Sort. Randomized Min-Cut, Las Vegas and Monte Carlo Algorithms,
Cryptography: Historical ciphers, modem ciphers like AES and RSA,
Randomized Complexity Classes, Approximation Algorithms, Review the
symmetric cryptography, cryptanalysis, stream ciphers and RC4, cipher
Concept of Lower Bound, Lower Bound for Sorting, Constant-factor
block modes of operation. key distribution, Differential cryptanalysis Public
Approximation Algorithms, FPTAS, Inapproximability, LP Based
key cryptography: Diffie-Hellman key exchange, RSA algorithm, elliptic-
Approximation Algorithms, Randomized Approximation Algorithms;
curve cryptography, security services, secure hash functions, SHA security
Amortized Analysis: Different Methods: Aggregate analysis, Accounting
hash functions. Key and Identity Management including certificate
Method, Potential Method, Examples: PUSH, POP, MULTIPOP; Binary
management: Key exchange and random numbers, key/identity management,
Counter, Dynamic Tables; Online Algorithms: Competitive Analysis, Online
Kerberos, PKI, digital signature, hierarchical x.509, web of trust.
Paging Problem, Randomized Online Algorithms, Adversary Models, Marker
Authentication: Password based authentication, Token based
Algorithm, Bioinformatics Algorithms: Introduction, Genome Sorting,
authentication, Biometric authentication, Remote user authentication,
Quantum Computing: Quantum Bits (Qbits), Quantum Gates and Circuits, security issues for user authentication. Access Control: Access control
Quantum Algorithms, Quantum Parallelism; Practical Computing and
principles, access control policies, discretionary access control, role based
Heuristics: Back tracking, Branch and Bound; Parallel/Distributed
access control, role based access control reference model, Access control
/Multithreaded Algorithms: Preamble, The basics of dynamic
matrix, Unix access control, Windows access control, capabilities Internet
multithreading, Recursive Fibonacci Number computation; Parameterized
Security: Secure Sockets Layer (SSL), Transport Layer Security (TLS),
Algorithms: Fixed Parameter Tractability, Parameterized Algorithm (Buss
HTTPS, IPv4 and IPv6 security, keberos, X.509, wireless security.
Algorithm) for Vertex Cover.
Database Security: Database Access Control, inference, database
encryption, cloud security. Denial-of-Service attacks: Flooding attacks,
CSE 4163: Algorithm Engineering Lab DDOS attacks, reflector and amplifier attacks, defense against DOS.
Contents related to the coursework CS`E-413 3(Algorithm Engineering). Trusted Operating System: The Bell-Lapadula model for computer
security, formal models for computer security, trusted systems, assurance
CSH 4135: Software Requirements Specification and Analysis and Evaluation. Program security and Design Principles: Software
security issues, handling program input, writing safe program code,
Review of - The Nature of Software, Software Engineering, The Software
interacting with operating system. System Evaluation: Assurance and
Process, Software Engineering Practices, Generic Software Process Model,
Evaluation. Malicious Software: Types of Malware, infected content,
Process Assessment and Improvement, Prescriptive Process Models, Specialized
vulnerability exploits, social engineering, system corruption, bots, zombie,
Process Model and Agile Development. Requirements Engineering, Establishing
46 47
key loggers, phasing, spyware, backdoors, counter measures. Forensics
Physical Security: Physical security prevention and mitigation measures,
recovery from physical security breaches, integration of physical and logical
CSH 4122: Mathematics for Robotics
security. Legal and Hthical Issues in Computer Security: Cybercrime,
intellectual property, privacy, ethical issues. Solution of linear equations, polynomial interpolation and approximation,
solutionofnonlinearequations,rootsofpolynomials,resultants,approximation
by orthogonal functions (includes Fourier series), integration of ordinary
CSH 4167: Cryptography and Security Lab differential equations, optimization, calculus of variations (with applications
Contents related to the coursework CSE-413 7 (Cryptography and Security). to mechanics), probability and stochastic processes (Markov chains),
computational geometry, differential geometry.
CSH 4139: Computer Graphics
CSH 4124: Introduction to Bioinformatics
Standard Graphics Primitives, Graphical User Interface; Graphics Hardware
Display devices, Raster refresh graphics display, Use of frame buffer and look Amino acids and Proteins: General properties. Classification and
uptableCoordinateconventionDevicecoordinateandwildcoordinatesystem. characteristics. Acid-base properties of amino acids. Essential and Non-
Vector graphics and raster graphics system. Scan Conversion Algorithms: Mid- standard amino acids. Introduction to Proteins & Protein Structure:
Primary, Secondary, Tertiary and Quartemary Structure. Enzymes : General
point Line, Circle and ellipse Creation Algorithms. Slope independent line
drawing using mid-point line algorithm. Polygons: Difference type of properties, specificity, classification, efficiency, regulation of enzyme
activity (rate, concentration, time, pH, temperature), enzyme kinetics---rate
polygons, polygon filling, triangulation, polygon filling algorithm.
Windowing and Clipping: Window Viewpoint, Zooming, panning, line, equations, steady state, Michaelis-Menten equation. Carbohydrates:
text and polygon, clipping algorithms. Transformation: Homogeneous Definition, classification and structure of monosaccharides, Disaccharides
coordination, Transformation in 3D, Transformation matrices, translation, polysaccharides, and glycoconjugates- proteoglycans, glycoproteins and
rotation, scaling. Projection: Parallel and perspective, standard projection 91ycolipids. Structural and functional roles of carbohydrates. Sequence
matrices. Hidden Surface removal: Painter's algorithm, Z-Buffering, Databases : Primary and secondary databases, Nucleotide sequence database,
Visible surface ray-tracing algorithm. Illumination and Shading: Light nucleotide sequence flat files. Protein Sequence Databases: Genpept,
Models, Ainbient light, diffuse and specular reflection, light attenuations, Uniprot, Swissprot, PIR, Sequence formats: Genbank, FASTA, ASN.
Goraud and Phong shading, Recursive Ray Tracing. Monochorome and Information retrieval from biological databases. The NCBI resource, Entrez,
colored light: Monochrome light, additive and suntractive light, Colored Pubmed, Medline. Entrez Boolean search terms and statements. Locuslink,
light- RGB, CMY, YIQ, HSV and HLS color model. Image File Format: NCBI bookshelf. Sequence Alignment: Pairwise sequence alignment, Global
PPM file, BMP file. Representing curves and surfaces: Polygonal surfaces, alignment, Local alignment, Scoring functions and matrices, General gap and
Parametric Cubic Curves- Hermite, Bezier and B-spline curces, parametric bi- affine gap penalty, Statistical significance. Multiple Sequence Alignment:
cubic surfaces: bicubic splines. Introduction to Graphics Programming. The SP (Sum of Pairs) measure, Star alignments, Tree alignments, Motifs and
nature ofcomputer animation. Profile, Alignment representation and Applications, Clustalw, Clustalx and
Tcoffee.
CSH 4169: Computer Graphics Lab CSH 4126: Introduction to Data Science
Contents related to the coursework CSE-4139 (Computer Graphics). Data collection and extraction, Preprocessing: Data quality, Data
cleaning: missing values, noisy data, Data Storage and integration: SQL and
NoSQL databases, redundancy and correlation analysis, tuple duplication,
conflict detection and resolution; Data Reduction: Overview, wavelet
transforination, principle component analysis, attribute subset selection,
regression and log-linear models, histograms, clustering, sampling, Data cube
aggregation; Data Transformation and Discretization: overview, normalization,
binning, histogram analysis, concept hierarchy generation, Data
visualization, Exploratory Data Analysis, Introduction to data modeling.

48 49
 CSE 4128: Wireless Networks CSE 4132: Graph Theory
Overview of wireless communication networks and protocols: Brief
Fundamental concepts: Varieties of graphs, path, cycles and components,
introduction to wireless physical layer fundamentals, Understand the
degrees and distances, clique. Trees: Properties, spanning trees, forests,
architecture and applications of current and next generation wireless
centroids, generation of trees and cycles, ent cycles and co-cycles.
networks: Cellular, WLANs, sensor networks, mesh networks, mobile ad-
Connectivity: Vertex and edge comectivity, blocks, eccentricity, Menge's
hoc networks and intermittently connected mobile networks. Modern
Theorem. Traversability: Eulerian graphs, kuratowski's theorem, embedding
physical layer wireless and mobile communications: Radio propagation
graphs on surfaces, genus, thickness and crossing number. Graph Coloring:
modeling, performance of digital modulation schemes and coding
Vertex coloring, edge coloring, chromatic number, five color theorem, four
techniques in fading environments; CDMA and OFDM, Diversity and
color conjecture, critical graph. Homomorphism Digraph: Different
MIMO. Medium access and resource allocation techniques: Medium
comectedness, oriented graphs-tournaments, network flows and related
access control, power control for fixed-rate and rate-adaptive systems,
algorithms. Groups, polynomials and graph enumeration, matching and
Aloha and CSMA-based randomized medium access, scheduling for
factorization, perfect graphs, Ramsey number and Ramsey theorem, forbidden
TDMAffDMA/CDMA-based wireless networks. Design and analyze
graph theory, miscellaneous applications.
network layer routing protocols: link metric estimation and neighborhood
table management for proactive and reactive routing protoco_ls- AODV, CSE 4134: Software Project Management
DSR, and their variants, opportunistic routing, backyressure routing,
network coding, cooperative routing, routing with mobility and intermittent Introduction: What is project? What is project management? Program and
contacts. Design and analyze transport layer protocols: Emphasis on proj ect portfolio management, role of project manager, project management
congestion control, including TCP over wireless, congestion sharing profession. Project management and information technology context: A
system view of project management, understanding organization,
mechanisms, explicit and precise rate control, utility optimization-based
stakeholder management, project phases and the project Lifecycle, The
approaches, and backyressure-based utility optimization.
context of information technology proj ects, recent trends affecting IT proj ect
management. Project management process groups: Introduction, process
CSE 4130: Introduction to Quantum Logic
groups, mapping the process groups to the knowledge areas, developing an IT
Overview of Nanotechnology, Quantum Building Blocks, Unitary Matrix, project management methodology, case study. Project Integration
Hermitian Matrix, Pauli Matrix, Qubits, Single-Qubit Quantum Systems: Management: Introduction, strategic planning and project selection,
Single Quantum Bits, Single Qubit Measurement, A Quantum Key developing a proj ect management plan, directing and managing project work,
Distribution Protocol, The State Space of a Single Qubit System; Multiple- monitoring and controlling project work, performing integrated change
Qubit Systems: Quantum State Spaces, Measurement of Multiple-Qubit control, closing projects or phases. Project Scope Management:
System, Quantum State Transformation; Quantum Gates: Hadamard gate, Introduction, plarming scope management, collecting requirements, deflning
Pauli-X gate, Pauli-Y gate, Pauli-Z gate, Phase shift gates, Swap gate, scope, controlling scope. Project Time Management: Introduction,
Square root of Swap gate, Controlled gates, Universal Quantum Gates, importance of project schedules, planning schedule management, deflning
Application of Quantum Gates; Quantum Logic Synthesis, Quantum activities, sequencing activities, estimating activity resources, estimating
Circuits: Quantum Adder, Quantum Subtractor, Quantum Multiplier, activity duration, developing the schedule, controlling the schedule. Project
Cost Management: Introduction, importance of cost management, basic
Quantum Divider, Quantum Decoder, Quantum Encoder, Quantum
Multiplexer, Quantum Demultiplexer, Quantum Comparator; Introduction principles of cost management, planning cost management, estimating costs,
determining the budget, controlling costs. Project Quality Management:
to Quantum Algorithms: Computing with Super Positions, Notions of
Introduction, importance of project quality management, planning quality
Complexity, Deutsch's Problem, Simon's Problem.
management, performing quality assurance, controlling quality, tools and
techniques of quality control, modem quality management, improving IT
project quality. Project Human Resource Management: Introduction,
importance of human resource management, keys to managing people,
developing the human resource plan, acquiring the project team, developing
the project team, managing the project team. Project Communication
Management: Introduction, importance of project communication
50
51
management, keys to good communications, planning communications
management, managing communications, controlling communications. checking, Runtime structures- Activation Records, Static and Dynamic
Project Risk Management: planning risk management, common sources of Scoping. Intermediate Representation: Abstract syntax trees, 3-address code,
risk on IT projects, identifying risks, performing qualitative risk analysis, etc. Generation of 3-address codes - Syntax directed translation for Declarations,
plarming risk responses, controlling risks. Project Procurement Assignment statements, Flow of Control statements, Array reference. Target
Management: Introduction, importance of project procurement
Code generation. Optimization: Control flow graphs, Data flow Analysis:
management, plaming procurement management, conducting procurements,
Reaching definitions and Live-variable analysis and Def-use & use-clef chains,
controlling procurements. Project Stakeholder Management:
Introduction, importance of project stakeholder management, identifying Available Expression analysis and Global corrmon sub expression elimination,
stakeholders, planning stakeholder management, managing stakeholder Dominators, Loops in control flow graphs, Loop invariants and code motion,
engagement, controlling stakeholder engagement. Elimination of Induction variables, Partial redundancy elimination, constant
folding and constant propagation, copy propagation, Dealing with Aliasing,
CSE 4136: Computer Security - Inter-procedural r`ataflow Analysis, Introduction to Static Single-Assignment
Web security: Basic three tire model of web architecture, various attacks on (SSA) form; GIL;udLI Register allocation by graph coloring; Instruction
web, SQL injection attacks, various types of SQL injection attacks, protection Scheduling: List scheduling, Optimization for memory hierarchies.
against SQL injection attacks, prepared statements, sanitizing, single origin
principle, Cross site scripting attacks/protections, cross site request forgery
attacks/protection, case study. Network security: Internet architecture, security
flaws on the Internet, attacks on networks, DDOS attacks, reflection attacks,
amplification attacks, wireless security, WEP cracking, DNS hijacking, routing
attacks, case study: NTP DDOS attack, spamhaus DDOS attack. Buffer
Overflow and control flow attacks: gdb tutorial, c stack fi.ame, conversion of c
code to assembly, stack push and pop while function calls, buffer over flow
example, shell injections, exploiting buffer overflow, shellcode, call instruction
tricks for shell code, integer over flow, safe/unsafe functions, buffer over flow
protections, stack canaries, no execution, address space layout randomization,
return to libc function chaining, return oriented programming. Malware analysis:
How malware run, insider attack, backdoors, analysis of brain virus and morris
worm, rootkits, botnets, code injection attacks, worm propagation, malware
counter measures. Reversing Malware: Introduction to IDA-Pro, ollydbg and
REMnux, identifying key x86 assembly logic structure using disassembler,
common malware characteristics at windows api level (DLL injection, function
hooking etc), recongnizing packed malware, manual unpacking of malware
using OllyDbg, interacting with malicious websites to examine their nature.

CSE 4140: Compiler Design

Phases of a compiler, front and back end of a compiler. Lexical Analysis:
regular expressions and regular languages, Finite Automata based pattern
matching, Input buffering techniques, Syntax Analysis: Context free grammars,
Top-downparsing:LLparsing,RecursiveDescentparsing,Bottom-upparsing;
LRparsing, syntactic error recovery, Symbol Tables, Type expressions and type

52
 CSE-4225: Introduction to Data Mining and Warehousing
Data warehousing: Basic concepts: difference between operational DB and
CSE 4221: Robot Learning DW, multi-tiered architecture of DW, enteaprise warehouse, data mart and
Introduction, supervised leaming, linear regression leaning, gradient decent virtual warehouse; Data Warehouse Modeling: Data cube and OLAP; Data
leaming, Markov process, discrete HMM, HMM: inference and leaming, Cube: A multidimensional data model; Stars, Snowflakes, and Fact
Kalman filter, reinforcement leaning: MDP, bellmont equation, value/policy Constellations: schemas for multidimensional databases; Dimensions and
iteration, continuous state/ finite horizon, maximum likelihood, kemel, large Measures, Typical OLAP operations: roll-up, slice and dice; Data warehouse
margin classifier: SVM, SVM with margin, clustering, PCA and particle filters, design and usage, Data warehouse implementation, Data generalization by
1eaming by observation, 1eaming by demonstration, model leaming, deep attribute oriented indexing. Mining Frequent Patterns: Definitions and
background, Market basket analysis, Methods for mining frequent patterns (i)
leaming, meta-1eaming.
Apriori algorithm (mining frequent itemsets using candidate generation,
Improving the efficiency of Apriori), (ii) FP-growth algorithm (mining
CSE 4251: Robotic Learning Lab frequent itemsets without candidate generation), (iii) Mining frequent itemsets
Contents related to the coursework CSE-4221 (Robotic Leaming). using vertical data format; Mining closed and maximal frequent itemsets;
Mining frequent patterns in data streams. Mining association rules and
correlation: Mining association rules, generating association rules from
CSH 4223: Fundamentals of Genomics and Proteomics
frequent item sets, Mining correlations from association rules, Significance of
Human Genome as a model: History of Genome sequencing project. The
correlation mining in presence of association rules, Pattern evaluation methods,
human Genome project. Organization of the Human genome. The human Various Correlation Measures: lift, chi-square, all_conf, max_conf, cosine
genome sequence: Annotation Repeats, coding regions, non-coding regions. and Kulc; their performance and applicability analysis. Mining Sequential
Genome sizes. Genome Annotation. DNA Sequencing Methods: manual & Patterns: Concepts and primitives, applications, domains; mining methods in
automated:MaxamandGilbertandSangersmethod.Chainterminationmethod, transactionaldatabases(i)Aprioribasedapproaches(GSP,SPADE),
Pyrosequencing Genome Sequencing methods: Shotgun & Hierarchical (clone (ii)Pattemgrowthbased(Prefixspan);closedandmaximalsequentialpattems;
contig) methods, Computer tools for sequencing projects: Genome sequence Mining sequential patterns in biological databases, web access databases and
assembly software. Polymorphisms: Repeats and Single Nucleotide time series databases.
Polymoxphhisms (SNPs), SNP detection methods: SSCP, PCR-based, dHPLC
sequencing. SNP and disease. Molecular Markers: RFLP, VNTR, RAPD, CSE-4255: Introduction to Data Mining and Warehousing Lab
SSR, AFLP ; Managing and Distributing Genome Data: Web based Contents related to the coursework CSE-4225 (Introduction to Data Mining
servers and software for genome analysis: ENSEMBL, VISTA, UCSC and Warehousing Lab).
Genome Browser, NCBI genome. Selected Model Organismal Genomes and CSH-4227: Cloud Computing
Databases. Introduction to Proteomics: The proteome. Analysis of Introduction to Cloud Computing: Definition and applications including
proteomes.2D-PAGE. Sample preparation3 solubilization, reduction, benefits, challenges, and risks, Enabling Technologies and System Models for
resolution. Reproducibility of 2D-PAGE. Mass spectrometry based methods Cloud Computing, Cloud Computing Models: Infrastructure as a Service
for protein identification. De novo sequencing using mass spectrormetric data. (Iaas),PlatformasaService(Paas),SoftwareasaService(Saas)andemerging
Xaas, Types of Cloud Computing: Public cloud, private cloud and hybrid
CSH-4253: Fundamentals of Genomics and Proteomics Lab clouds, Cloud OSs and platforms, Cloud Architectures: Architectural
design of Cloud computing, Interaction among infrastructure provider,
Contents related to the coursework esE4223 (Fundamentals of Genonrics
and Proteomics). business providers and the customers, roles of cloud broker, Tradeoffs
between costs and customer satisfactions, Federated Clouds, VM Resource
Provisioning: Static and dynamic resource provisioning approaches,
HARMONY architecture, Capacity provisioning approaches, Scalability and
55
54
Fault Tolerant Issues: Scalable computing, energy optimization vs. fault Delaunay triangulation, Incremental algorithm for construction, Relation to
tolerant service platforms, Performance, QoS, Power management in Cloud Nearest Neighbor graphs, MST, Largest empty circle, Medial axis and Straight
Computing data centers, Principles of Virtualization platforms: VMware skeleton; Arrangements and Duality: Arrangements of straight lines in 2D,
ESX Memory Management, Security and Privacy issues in the Cloud, Definition and assumption, Combinatorics of arrangements, Zone theorem,
Introduction to Mobile Cloud Computing: Architecture and applications Incremental algorithm for computing the arrangements, Duality between, lines
of MCC, Code partitioning, Code offloading and VM migration techniques. and points; Application of duality: Ham-Sandwich cut, red-blue matching;
Line Segment Intersection: Intersection of Segments, Overlap of two
CSE-4257: Cloud Computing Lab
polygons---convex and non-convex polygon; Graph Drawing; Orthogonal
Contents related to the coursework CSE-4227 (Cloud Computing). Range Searching: Motivation from Database,1 d, 2d.

CSE-4229: Introduction to Reversible Computing CSH-4261: Computational Geometry Lab

Introductory Concepts: Theory of reversibility, Energy arid Information Contents related to the coursework CSE-4231 (Computational Geometry)
loss, Popular Reversible logic gates: Feynman Gate, Fredkin Gate, Toffoli
CSE-4233: Software Testing and Verification
Gate, Double Feynman Gate; Garbage outputs, Delay, Quantum cost,
The Psychology and Economics of Software Testing, Software Testing Life
Reversible Combinational Circuits: Reversible Half Adder, Reversible Full
Cycle (STLC), Software Testing Terminology and Methodology, V&V Model,
Adder, Reversible Cany Look Ahead Adder, Reversible Carry Skip Adder,
Dynamic Black Box Testing - Boundary Value Analysis, Equivalence
Reversible BCD Adder, Reversible Subtractor, Reversible Multiplier,
Partitioning, State Transition based Testing, Decision Table based Testing,
Reversible Divider, Reversible Comparator, Reversible Decoder, Reversible
Cause-Effect Graphing based Testing and Error Guessing, Dynamic White Box
BCD to Decimal Decoder, Reversible BCD to 7-Segment Decoder,
Testing - Basis Path Testing, Data Flow Testing and Mutation Testing,
Reversible Encoder, Reversible Multiplexer, Reversible Demultiplexer;
Inspections, Walkthroughs, Technical Reviews, Unit Testing, Integration
Reversible Sequential Circuits: Reversible SR, JK, T and D Flip Flop,
Testing, Function Testing, System Testing, Acceptance Testing, Regression
Reversible Register, Reversible Shift Register, Reversible Frequency Division
Testing, Test Management - Test Organization, Test Plan, Test Design and
and Counter Circuit, Reversible Synchronous Counter, Reversible
Specifications, Software Metrics, Software Quality, Quality Control and Quality
Asynchronous Counter, Reversible Parallel Up-Down Counter, Reversible
Assurance, Quality Management and Project Management, Software Quality
RAM, Reversible ROM; Reversible Complex Circuits: Reversible PLA,
Metrics, Testing Internet Applications - Security and Performance Testing,
PLD, CPLD, FPGA; Synthesis of Reversible Logic: Transformation based
Debugging, Test Driven Development (TDD), Behavior Driven Development
Synthesis, BDD-based Synthesis.
(BDD).
CSH-4259: Introduction to Reversible Computing Lab
Csn-4263: Software Testing and Verification Lab
Contents related to the coursework CSE-4229 (Introduction to Reversible
Contents related to the coursework CSE-4233 (Software Testing and
Computing).
Verification).
CSE-4231 : Computational Geometry CSE-4235: Digital Forensic
Introduction: Course information, Course policies; Polygon Triangulation and
Introduction: Key digital forensics concepts. Computer forensics, network
Polygon Partitioning; Art Gallery Theorems: Necessity and sufficiency, forensics, mobile device forensics, malware forensics, memory forensics,
Triangulation theory, Triangulation dy Ear Removal, Monotone partitioning, scientific method of digital forensics, digital evidences, circumstantial vs
Trapeziodalization,Triangulatingmonotonepolygons;ConvexHullin2Dand digital evidence, Evidence integrity and cryptographic hash functions, chain
3D: Graham's scan, Output sensitive algorithms: Gift wrapping or Jarvi's of custody, using forensic copies, reporting and testimony, case study of real
march, Lower bound of CH, Chan's algorithm, Convex hull in 3D: Euler's world crime investigation involving digital forensics. Legal system in
formula and its consequence, gift wrapping algorithm; Voronoi Diagrams and Bangladesh: Legal system in Bangladesh, criminal vs civil justice system,
Delaunay Triangulations: Definition and properties of Voronoi diagram and court room scenario, Lawyers vs prosecutors, defense attorneys, law

57
56
enforcement, warrant requirement, e-discovery, Judges and decision makers,
laws related tocyber crimes and digital forensics, accepted digital evidences CSE-4237: Digital Image Processing
in Bangladesh legal system, finger print analysis, privacy law and digital Introduction to image processing, Differences between image processing, image
forensics. Computer Forensics: Computer forensics investigation process, analysis, and computer vision, Image Representation, Color Space, Image
evidence acquisition and preservation, file systems, forensics duplication/ Sampling and Quantization, Image Quality Measurement, Image Quality
imaging technique, write blockers, device configuration overlay, SSD Enhancement: Intensity transformations, Contrast ' stretching, Histograng
forensics. Windows Forensics: NTFS basics, File Record attributes, NTFS equalization, Spatial domain filtering - mean and median filters, Sharpening
analysis, file system met data files, file carving, carving with fragmented filters - Laplacian and Sobel, Discrete Fourier Transform, Frequency-Domain
clusters, windows registry, registry keys and values, traces of user log on/off, Filtering - Gaussian and Butterworth low pass and High pass filters, Image
comection of usb devices, determining installation time, recently played files Transform - Discrete Cosine Transform, Wavelet transform, Multi-resolution
in windows media player, last 25 urls visited, timestamp changes, Event Analysis and Discrete Wavelet Transform, Introduction to Image Restoration
Logs, Recycle bin. Windows Application Analysis: Application Metadata, - Noise models, spatial and frequency filters, Weiner filter, Moaphological Image
MS office metadata, multi-media file metadata, web browser forensics, email Processing, Image Feature Extraction and Representation: Edge and Line, Region
forensics, pre-fetch files, Diffie-Hellman key exchange, RSA algorithm, Segmentation and Representation, Image and Videocompression.
elliptic-curve cryptography, security services, secure hash functions, SHA
security hash functions. Psychological Aspects of Digital Forensics:
CSH-4267: Digital Image Processing Lab
Forensics psychology, cyber-crime overview, roles of forensics
Contents related to the coursework CSE-4237 (Digital Image Processing).
psychologists, theories of crime, psychological profiling hackers and
malware distributors, Rogers's hacker circumplex, case studies: Kevin
Mitnich, Edward Snowden, Gary MCKinnon; Network Forensics: Network CSE 4239: Parallel and Distributed Systems
forensics concepts, investigation methodology, sources of network-based Distributed System Models: High Performance Computing, Grid Computing,
evidence, Intemetworking fundamentals, OSI model, TCP/IP model, three- Cloud Computing, Many core Computing, Many Task Computing; Programming
way handshake, TCP and IP/IPv6 header, ARP, ICMP, DNS, HTTP, DHCP, Systems and Models: Processes and threads, MapReduce, Workflow Systems,
SMTP, Evidence acquisition, sniffing packets from switches and wireless Virtualization Techniques; Distributed Storage & File systems: Data
negivorks, 1ibpcap, tcpdump, active acquisition, strategies for collection Intensive Computing, Distributed Hash Tables; Consistency and
ev'idence Password based authentication, Token based authentication, Replication: Reasons for replication, Consistency Models, Data Centric
Biometric authentication, Remote user authentication, security issues for user Consistency Models, Client Centric Consistency Models, Consistency Protocols;
authentication, packet analysis, protocol analysis, flow analysis, statistical Fault Tolerance: Byzantine failure and k-fault tolerant systems, Performance
flow analysis, flow record collection and aggregation protocol, tools: silk, analysis and tuning, scalability and performance studies, scheduling, storage
argus, nfidump, analysis technique and tools, identifying port scanning systems, synchronization, and tools (Cuda, Swift, Globus, Condor, Amazon
through statistical analysis. Network Intrusion Detection and Analysis: AWS, Open Stack, Cilk, gdb, threads, MPICH, QpenMP, Hadoop, FUSE),
NIDSINIPS functionality, Modes and types of NIDS, NIDSINIPS evidence Parallel Architectures: Parallel algorithms & architectures, parallel I/0,
acquisition, snort rules and alerts, Case study. Fraud investigations: Fraud performance analysis and tuning, power, programming models (data parallel,
examiner vs forensic accountant, fraud examination methodology, Bendord' s task parallel, process-centric, shared/distributed memory); Multithreaded
law, Secure Sockets Layer (SSL), Transport Layer Security (TLS), HTTPS, Programming: GPU architecture and programming, Message passing
IPv4 and IPv6 security, Kerberos, X.509, wireless security. Mobile interface (MPI), heterogeneity, interconnection topologies, load balancing,
Forensics: Mobile network basics, mobile OS, NAND flash memory, memory consistency model, memory hierarchies.
YAFFS2, types of evidence obtainable from mobile devices, Proper handling
of evidentiary mobile devices, Android forensics, IOS forensics.
CSH 4269: Parallel and Distributed Systems Lab
Contents related to the coursework CSE-4239 (Parallel and Distributed
CSH-4265: Digital Forensic Lab Systems).
Contents related to the coursework CSE-4235 (Digital Forensic).

58
59
 CSE-4230: Human Computer Interaction
Introduction to HCI. Cognitive Models. Socio-Organizational Issues.
CSE-4222: Human Robot Interaction Understanding the Users: Need finding, Communicating with the Users,
Introduction,sensorsandperceptionforHRI,expressionandgaze,multi-modal Observation, Interviewing. Prototyping. Research Method - I: Qualitative
human-robot communication, Human-robot interaction architectures, museum Approaches: Survey Design, Introduction to Decision Analytic Approaches,
robotics, educational robotics, assistive robotics, social robotics, shared Mental Models. Design Heuristic and Hvaluation Learning Strategies.
autonomy and situation awareness, urban search and rescue: an HRI focus Research Method - 11: Quantitative Approaches: Statistical Thinking,
example, quality of life technologies: an HRI foous example. Introduction to Data Analytics, Uncertainty. Design Issues with the New
Media: Online Education, Introduction to Second Life. Design Issues with
CSH-4224: Mobile Robotics Mobile Systems. Social Usability: Analyzing the Social Network.
Introduction,1egsandkinematics,wheeledlocomotion,differentialkinematics, Introduction to Complex Network. Research Methods - Ill: Introduction
wheeled kinematics, perception: camera image, omni-directional projection, to Data ScientiiL~ L'rocesses, Introduction to Various Machine Leaning Tools
stereo camera, correlation and convolution, edge and points, place recognition, and Algorithms. Visual Design: Representation, Visual Layout, Typography,
error propagation, line extraction, planning: collision avoidance, potential field Information Design. Designing for Children and the Society: Playful User
methods, localization and mapping, graph search. Interface, Interface Designs that invite Social and Physical Interactions,
Games for Change, Personalization and Teaching, Health and Sports,
CSI]-4226: Aerial Robotics Designing Interactions for Children, Perils of Children's Digital Life, Pro -
Introduction, stability and derivation of a dynamic model, flight dynamics and Poor User Interface, Designing for Development. Crowd Computing:
flight control, dynamic modeling of rotorcraft, autonomous flight and data Designing Software for Collaboration, Augmented Reality, Wearable.
collection, obstacle avoidance, path plaming and formation flying, navigation
and mission planning, human factors in aerial systems, design of electronics CSE-4232: Internet of Things
and software for control, design methods of avionics systems specific to small Introduction to Internet of Things: Definition, applications, the IoT
UAVs with civilian applications. paradigm, Smart objects, IOT components and diversities, convergence of
technologies, Industry domains: IOT Service design and analysis in various
industrial applications - IOT in Sports, IOT in Cities/Transportation, IOT in the
CSE-4228: Application of Computational Biology
Home, IOT in Retail, IOT in Healthcare, Profit and Satisfaction analysis for IoT-
GenomeAnnotation:Introductiontothegenomesequencingprojects-the first
enabled utility services, IOT Platforms: Hardware, SoC, sensors, device
bacterial genome, eukaryotic genome, traditional routes of gene identiflcation:
drivers, IOT standards, Cloud computing for IoT, Bluetooth, Bluetooth Low
Experimental and in silicomethods, software programs for finding genes: ORE
Energy,beacons, IOT Communication Protocols: NFC, RFID, Zigbee, MIPI,
finders,Genemark,Glimmer,Genscan,Grail.PredictiveMethodsUsingDNA
M-PHY, Unipro, SPMI, SPI, M-Pcle, Wired vs. Wireless communication,
Sequences: Methods for gene identification- signal based methods, content
GSM, CDMA, LTE, GPRS, small cell, etc. Services/Attributes: Big-Data
based methods, homology based methods. Computational bias, machine
Analytics and Visualization, Dependability, Security, Maintainability; Creative
leaming methods: artificial neural networks, Markov chain, Hidden markov
Thinking Techniques: Modifications, Combination Scenarios, Breaking
model. Promoter analysis, repeat finders. Predictive Methods using RNA
Assumptions, Solving problems.
Sequence: RNA secondary structure thermodynamics, RNA secondary structure
prediction, programs for prediction of RNA secondary structure: M fold, RNA
fold, S fold, Vierma RNA package.

60
 CSE-4234: Introduction to Multiple-Valued Logic CSE-4240: Applied Cryptography
Multiple-Valued Logic Functions, Shannon Expansion for Multiple-Valued
Mathematical Background: Information theory, Entropy, mutual information,
Logic, MVL Reed-Muller Expansion, MVL Applications, MVL in EDA-CAD
randomized algorithms, number theory, integer arithinetic, rings, fields, groups,
Methods, Multiple-Valued Combinatorial Circuits: Multiple-Valued Half Adder,
cyclic groups, subgroups, finite fields, the Euclidean algorithm for polynomials,
Multiple-Valued Full Adder, Multiple-Valued BCD Adder, Multiple-Valued
Carry Look-Ahead Adder, Multiple-Valued Subtractor, Multiple-Valued extended Euclidean algorithm, integer factorization problem, elliptic curve
Multiplier, Multiple-Valued Divider, Multiple-Valued Decoder, Multiple-Valued factoring; Symmetric ciphers and applications: Symmetric cryptography and
Encoder, Multiple-Valued Multiplexer, Multiple-Valued Demultiplexer, Multiple- correctness property, analysis of one time pad, properties of perfect cipher,
Valued Comparator, Multiple-Valued Sequential Circuits: Multiple-Valued SR, modem symmetric ciphers, generating random keys, modes of operations for
JK, T and D Flip Flop, Multiple-Valued Register, Multiple-Valued Shift Register, symmetric ciphers, cryptographic hash functions, strong passwords, dictionary
Multiple-Valued Frequency Division and Counter Circuit, Multiple-Valued attacks, hash chain. Key distribution: Discrete logarithm problem and proving
Synchronous Counter, Multiple-Valued Asynchronous Counter, Multiple-Valued Diffie-Hellman key exchange, attacks against discrete logarithmic problem,
Parallel Up-Down Counter, Multiple-Valued RAM, Multiple-Valued ROM, implementingDiffie-Hellman,Findinglargeprimes,primalitytestFermat'sLittle
Theorem, Rabin-Miller test. Key establishment with symmetric-keys, with a
Multiple-Valued PLA, Multiple-Valued PAL, Multiple-Valued PLD, Multiple-
distribution center, Kerberos, problems with symmetric key distribution,
Valued CPLD, MVL Algebras, MVL Finite State Diagrams, Functional
Asymmetric Cryptosystems and Applications: Correctness of RSA, Euler's
ExpressionforMultiple-ValuedFunctions,DecisionDiagramsforMultiple-Valued
theorem, Proving euler' s theorem, invisibility of RSA, security property ofRSA,
Functions, Reduction Rules, Multiple-Valued Reversible Gates and Circuits,
best known algorithm for factoring, public-key cryptography standard, insecurity
Quantum Multiple-Valued Decision Diagrams.
of RSA in practice, using RSA to sign a document, problem with RSA.
CSE-4236: VLSI Layout Algorithms Cryptographic Protocols: SSH, TLS, TLS information leaks, certiflcate,
VLsldesigncycle,physicaldesigncycle,designstyles;Basicgraphalgorithmsand signature validation. Elliptic Curve: How to compute with elliptic curves,
computational geometry algorithms related to VLSI layout; Partitioning building a discrete logarithm problem with elliptive curves, group operations on
algorithms: group migration algorithms, simulated annealing and evaluation, elliptic curve, Diffie-Hellman key exchange with Elliptic curves, Elliptic curve
digital signature algorithm and its computational aspect. Using Cryptography:
performance driven partitioning; Floor plaming and placement algorithms:
constraint based floor planning, rectangular dualization and rectangular Trafflc analysis, onion routing, voting, digital cash, RSA blind signature, blind
signature protocol, bit-coin, encrypted circuits.
drawings, integer programming based floor planning, simulation based
placement algorithms, partitioning based placement algorithms; Pin assignment
CSE-4242: Computer Vision
algorithms; Routing algorithms: maze routing algorithms, line prob algorithms,
shortest-path based and steiner tree based algorithms, river routing algorithms, Review of Image formation - 3D to 2D transformation, lighting, reflection
orthogonal drawing based algorithms; Compaction algorithms: constraint-graph and shading models, Modern digital camera - properties, image sensing
based compaction, virtual grid based compaction, hierarchical compaction;
pipeline; image filtering, Template matching, Image pyramids and
Algorithms for Multi-Chip Module (MCM) physical design automation.
application; Feature detection and matching - Edge detection, Interest
point and comers, local image features - Scale Invariant Feature
CSH-4238: Concepts of Concurrent Computation Transform and its variants, Feature matching - Hugh transform, model
Introduction to Concurent Computation. Challenges of Concurency. fitting, RANSAC; Feature Tracking - KLT tracker, Optical Flow; Image
Synchronization Algorithms. Semaphores. Simple Concurrent Obj ect Oriented Segmentation - Split and Merge methods, Mean shift and mode flnding
Programming (SCOOP) Principles. SCOOP Type Systems. Monitors. Calculus of methods, Graph cuts and energy based methods; Object Detection and
Communicating Systems (CCS). CCS Advanced Topics. Communicating Recognition-Eigenfaces,InstanceRecognition-bagofwords,partbased
Sequential Processes (CSP). SCOOP Outlook. Lock - Free Approaches. methods. Recognition and large scale data sets.
Languages for Concurrency and Parallelism.
 CSH-4244: Computer and Network Security
Control Hijacking Attacks: Exploits and defenses - Buffer Overflows:
Attacks and Defenses, Basic Integer Overflows, Bypassing Browser Memory
Protections; Dealing with legacy code: Sandboxing and isolation, Tools for
writing robust application code - Unassisted and Automatic Generation of
High-Coverage Tests for Complex Systems Programs, Static Analysis of
programs; Principle of least privilege, access control, and operating systems
security; Exploitation techniques and fuzzing, Effective Bug Discovery; Web
Security - Basic web security model, Securing Browser Frame
Communication, Web application security - Cross site scripting, SQL
Injection attacks, Cross-Site Request Forgery, Content Security Policies, Web
workers, and extensions, Session management and user authentication - Secure
Session Management, Overview of cryptography - One time pads, Hash
functions, Block ciphers, Key exchange methods, Public Key Ehcryption,
HTTPS: goals and pitfalls; Network Security: Security issues in Internet
protocols: TCP, DNS, and routing, IPsec, Network Defense Tools: Firewalls,
VPNs, Intrusion Detection, and filters, denial of service attacks, Security of
mobile platforms -Mobile platform security models, Mobile threats and
malwares - viruses, Spyware and key-loggers.

CSE 4246: Natural Language Processing

Introduction and Overview: Welcome, motivations, what is Natural
Language Processing, hands-on demonstrations. Ambiguity and uncertainty in
language. Language modeling and Naive Bayes: Probabilistic language
modeling and its applications. Markov models.N-grams. Estimating the
probability of a word, and smoothing. Generative models of language. Part of
Speech Tagging and Hidden Markov Models: The concept of parts-of-
speech, examples, usage. The Pem Treebank and Brown Corpus. Probabilistic
(weighted) finite state automata. Hidden Markov models (HMMs), definition
and use. Context Free Grammars: Constituency, CFG definition, use and
limitations. Chomsky Normal Form. Top-down parsing, bottom-up parsing,
and the problems with each. Probabilistic Context Free Grammars:
Weighted context free grammars. Weighted CYK. Pruning and beam search.
A treebank and what it takes to create one. The probabilistic version of CYK.
Also: How do humans parse? Machine Translation: Probabilistic models for
translating French into English. Alignment, translation, language generation.
IBMModel# 1 and#2. Expectation Maximization. MTevaluation