SEU CSE Course Curriculum Fresh 150credit

COURSE CURRICULUM OF
Department of Computer Science and Engineering (CSE)

[ IEB ACCREDIATED ]
B.Sc. in Computer Science & Engineering (CSE) is a 4-year program offered by the Department of
Computer Science & Engineering under the School of Science and Engineering of this University.
Aims and Objectives:

Computer Science and Engineering is the most influential subject in the World and in Bangladesh. The
President of ACM David Patterson has said in 2006 that Computer Science is there for 60 years and it
will be there for at least another 60 years. The Turing award (Noble Prize of Computer Science) winner
of 2008 Dr. Barbara Liskov of MIT has also said that the importance of Computer Science and
Engineering will increase in future. But Bangladesh still needs a lot of skilled manpower in this field.
The aim of the Computer Science and Engineering Department is to create international standard skills
in Computer Science & Engineering and related fields through innovative ideas and by providing world
class education.
To achieve this vision the department educates the students with the latest art of Computer Science and
Engineering with the help of modern teaching techniques. Many of our courses are lab based so that the
students can learn their subjects easily with the help of a lot of practical classes. In this way we are
fulfilling our mission of providing world class computer science education at an affordable cost.
Entry requirements:
For admission in B.Sc. in Computer Science & Engineering (CSE) a student must have Physics,
Chemistry and Mathematics in SSC/O-Level and HSC/A-level. The minimum CGPA requirement for
entry is revised by the university from time to time.
Degree requirements:
At least 150 credit hours must be earned to be eligible for graduation, and this must include all the core
courses. The minimum CGPA requirement for obtaining a Bachelor degree in engineering is 2.5. The
following table shows detailed degree requirements for the program.
Page 1 of 31
Program Structure:
Description No. of Course(s) Total Credits
English Language 4 12
General Education 4 12
Basic Sciences (Theory) 2 6
Basic Sciences (Lab) 1 1
Mathematics & Statistics 5 15
Interdisciplinary Engineering Courses (Theory) 3 9
Interdisciplinary Engineering Courses (Lab) 3 3
Core Courses (Theory) 18 54
Core Courses (Lab) 12 12
Core Courses (Research & Project or Internship) 2 6
Two optional courses with Lab 2 8
Other optional courses (With or without lab) 4 or above 12
Total 60 or above 150
Semester view
Semester 1
Sl No. Course Code Course Title Prerequisite(s) Credit(s)
1 CSE141 Computer Fundamentals Nil 3
2 ENG101 Basic Composition Nil 3
3 MAT141 Differential & Integral Calculus Nil 3
4 ACT141 Introduction to Accounting Nil 3
Total: 12
Semester 2
1 ENG102 Intermediate Composition ENG101 3
2 PHY161 Physics – I Nil 3
3 CSE161 Programming Language I CSE141 3
4 CSE162 Programming Language I Lab CSE141 1
5 MAT161 Coordinate Geometry and Vector Analysis MAT141 3
Page 2 of 31
Total: 13
Semester 3
1 CSE181 Discrete Mathematics CSE161 3
2 ENG103 Advanced English Skills ENG102 3
3 EEE181 Electrical Circuits Design I Nil 3
4 EEE182 Electrical Circuits Design I Lab Nil 1
5 PHY181 Physics II PHY161 3
6 PHY182 Physics II Lab PHY161 1
Total: 14
Semester 4
1 CSE241 Data Structures CSE181 3
2 CSE242 Data Structures Lab CSE181 1
3 ENG105 Public Speaking ENG103 3
4 MAT241 Complex Variables and Transforms (Laplace & Fourier) MAT141 3
5 EEE241 Electronic Devices & Circuits I EEE181 3
6 EEE181, 1
EEE242 Electronic Devices & Circuits I Lab EEE182
Total: 14
Semester 5
1 CSE181,
CSE261 Numerical Methods MAT161 3
2 CSE263 Digital Logic Design CSE161 3
3 CSE264 Digital Logic Design Lab CSE161 1
4 MAT261 Linear Algebra and Matrices MAT241 3
5 CSE265 Algorithm CSE241 3
6 CSE241,
CSE266 Algorithm Lab CSE242 1
Total: 14
Semester 6
1 MGT281 Introduction to Business & Management CSE241 3
2 CSE161,
CSE281 Introduction to Programming Language II (Java) CSE162 3
3 CSE282 Introduction to Programming Language II (Java) Lab CSE161, 1
Page 3 of 31
CSE162
4 MAT241,
ETE281 Communication Theory EEE241 3
5 MAT241,
ETE282 Communication Lab EEE241 1
6 STA281 Statistical Methods & Probability Nil 3
Total: 14
Semester 7
1 CSE341 Computer Networking ETE281 3
2 CSE342 Computer Networking Lab ETE281 1
3 CSE343 Computer Architecture CSE263 3
4 CSE281,
CSE345 Information System Design & Software Engineering CSE282 3
5 CSE281,
CSE346 Information System Design & Software Engineering Lab CSE282 1
6 Completion of
SOC341 Engineering Ethics 80 Credits 3
Total: 14
Semester 8
1 Elective 1* Any Course from Group A 3
2 CSE383 Database Design CSE281 3
3 CSE384 Database Design Lab CSE281 1
4 CSE161,
CSE363 Microprocessor Design & Assembly Language Programming CSE263 3
5 CSE161,
CSE364 Microprocessor Design & Assembly Language Programming Lab CSE263 1
6 CSE365 Artificial Intelligence CSE265 3
Total: 14
Semester 9
1 CSE381 Introduction to Embedded Systems CSE363 3
2 CSE382 Introduction to Embedded Systems Lab CSE364 1
3 CSE343,
CSE361 Operating Systems CSE265 3
4 CSE343,
CSE362 Operating Systems Lab CSE266 1
5 Elective II Any course from Group B 3
Page 4 of 31
6 Elective II* Lab Associated Lab of Elective II * 1
Total: 12
Semester 10
1 CSE441 Theory of Computing CSE265 3
2 CSE281,
CSE443 Computer Graphics & Animation MAT261 3
3 CSE281,
CSE444 Computer Graphics & Animation Lab MAT261 1
4 Elective III* Any course from Group A * 3
5 Elective IV* Any course from Group B * 3
6 Elective IV* *
Lab Associated Lab of Elective IV 1
Total: 14
Semester 11
1 Completion of
CSE459 Research Methodology 110 credit hours 3
2 ECO461 Introduction to Economics Nil 3
3 Elective V* Any course from Group A * 3
4 Elective VI* Any course from Group A * 3
Total: 12
Semester 12
1 CSE489 Project OR Internship CSE459 3
Total: 3
*Students need to take a minimum 20 credits of optional courses. Students can follow the pattern shown in semester
view above or choose elective courses of their own choice from group A and group B with the following restrictions:
They must take at least two theory courses and corresponding lab courses from group B. Rest of the credits can be
fulfilled by taking any theory courses from group A or Group B.
Elective Courses: Group A (Without Lab)::
Course Course Title Credits Prerequisites

Code
Page 5 of 31
STA281,
CSE349 Mathematical Analysis for Computer Science (theory) 3 CSE181
CSE469 Compiler Construction 3 CSE441
CSE383,
CSE467 E-Commerce & E-Governance 3 SOC341
CSE359 Graph Theory 3 CSE265
CSE281,
CSE355 Image Processing 3 CSE265
CSE479 Cryptography & Network Security 3 CSE341
CSE477 Cloud Computing 3 CSE361
After Completion of 110
CSE475 Management Information System 3 Credit Hours
CSE281,
CSE445 Smart Device App Development 3 CSE341
CSE353 Introduction to Data Mining 3 CSE265
ETE281,
ETE399 Digital Communication 3 MAT261
Elective Courses with Lab: Group B (Students must take at least two courses with associated lab from
the list below)
Course Course Title Credits Prerequisites

Code
EEE241,
ETE357 Telecommunication Engineering 3 ETE281
EEE242,
ETE358 Telecommunication Engineering Lab 1 ETE282
ETE451 Digital Signal Processing 3 ETE357
ETE452 Digital Signal Prosessing Lab 1 ETE358

CSE263,
EEE425 VLSI Design 3 CSE264
CSE263,
EEE456 VLSI Design Lab 1 CSE264
CSE347 Advanced Networking 3 CSE341
CSE341,
CSE348 Advanced Networking Lab 1 CSE342
CSE375 Advanced Algorithm 3 CSE265
CSE376 Advanced Algorithm Lab 1 CSE266
CSE457 Advanced Embedded Systems 3 CSE381
CSE458 Advanced Embedded Systems Lab 1 CSE381
CSE471 Web and Internet Programming 3 CSE345
Page 6 of 31
CSE472 Web and Internet Programming Lab 1 CSE345
CSE473 Software Development and Project Management 3 CSE345
CSE474 Software Development and Project Management Lab 1 CSE345
CSE361,
CSE465 Parallel and Distributed Computing 3 CSE381
CSE361,
CSE466 Parallel and Distributed Computing Lab 1 CSE381
CSE351 Advanced Java 3 CSE281

CSE352 Advanced Java Lab 1 CSE281
COURSE CATALOG
ACT141: INTRODUCTION TO ACCOUNTING (3 CREDITS)
PREREQUISITE(S): Nil
TOPICS:
Financial Accounting: Objectives and importance of accounting, accounting as an information
system, computerized systems and applications in accounting, recording system – double entry
mechanism, accounts and their classification, accounting equation, accounting cycle, journal, ledger,
trial balance, preparation of financial statements considering adjusting and closing entries, accounting
concepts and conventions.
Cost & Management Accounting: Cost concepts and classification, overhead cost – meaning and
classification, distribution of overhead cost, overhead recovery method, job order costing, preparation
of job cost sheet and quotation prite, inventory valuation, absorption costing and marginal/variable
costing technique, cost-volume-profit analysis, contribution-margin approach, sensitivity analysis.
Short term investment decisions – relevant and differential cost analysis, long term investment
decisions – capital budgeting, various techniques of evolution of capital investment
CSE161: PROGRAMMING LANGUAGE I (3 CREDITS)

PREREQUISITE(S): CSE141
TOPICS:
Computer and C Fundamentals, C Data types, Operators and Expressions, Basic I/O functions, if-else
statement, loops – for loop, while loop, do-while loop, functions, global, local, static and register
variables, arrays, bubble sort, selection sort, pointer arithmetic, arrays and pointers, pointer to pointer
to integer, structures.
CSE162: PROGRAMMING LANGUAGE – I (C) LAB (1 CREDIT)

TOPICS: Laboratory Work based on CSE161

Page 7 of 31
CSE141: COMPUTER FUNDAMENTALS (3 CREDITS)
TOPICS:
Introduction to computers, representation of data, input/output – keyboard (standard layout), mouse,
monitor, printer, memory, physical devices - disk drives, types of diskettes, hard disks, removable hard
disks, CD-ROM, CD-recordable, WORM disks and PhotoCD, Phase change rewritable drives,
measuring drive performances, processors, binary arithmetic, floating point representation of numbers,
arithmetic operations with normalized floating point numbers, introduction to software – different sorts
of software, logic circuits, computer architecture, computer languages and operating systems,
computer history, introduction to Internet – how Internet works, introduction to telecommunication,
satellite communication, fiber-optic communication
CSE181: DISCRETE MATHEMATICS (3 CREDITS)

PREREQUISITE(S): CSE161, CSE162
TOPICS:
Propositional equivalence, predicate, quantifiers, methods of proof, sets, functions, growth of
functions, complexity of algorithms, integers and divisions, number theory & its applications,
matrices, proof strategy, mathematical induction, recursive definitions, basic counting techniques,
Pigeonhole principle, permutations and combinations, binomial coefficients, generating permutations
and combinations, discrete probability, probability theory, recurrence relations, divide-and-conquer
algorithm, generating functions, relations, n-ary relations and their applications, closures of relations,
equivalent relations, partial ordering, graphs and graph models, connectivity, graph coloring, trees,
application of tree and tree traversal.
CSE261: NUMERICAL METHODS (3 CREDITS)

PREREQUISITE(S): CSE161, CSE162, MAT161
TOPICS:
Representation of numeric values in Computer, arithmetic operations of floating-point numbers,
precision error, bracketing and open methods of root finding, Solving system of linear equations,
forward and backward differences, Taylor series, different types of interpolating polynomials,
Numerical integration: Trapezoidal rule, Simpson’s rule, Runge–Kutta methods.
.
CSE241: DATA STRUCTURES (3 CREDITS)

TOPICS:
Elementary data types, structures, arrays, pointers; introduction to Object Oriented Programming;
elementary searching: linear search, binary search; implementation and applications of stacks and
queues; solving problems with recursion; binary search trees, balanced search trees; priority queue
implementation with heaps; graph representation and elementary graph algorithms.
CSE242: DATA STRUCTURES (1 CREDIT)
Page 8 of 31
TOPICS: Laboratory Work based on Theory Course CSE241
CSE263: DIGITAL LOGIC DESIGN (3 CREDITS)

TOPICS:
Binary Systems, Boolean algebra and Logic Gates, Gate Level Minimization, Combinational Logic,
Synchronous Sequential Logic, Registers and Counters, Memory and Programmable Logic.
CSE264: DIGITAL LOGIC DESIGN LAB (1 CREDIT)

CSE281: PROGRAMMING LANGUAGE – II (OOP IN JAVA AND C++) (3 CREDITS)

TOPICS:
Introduction to OOP, OOP in Java, Object, Classes, Methods, Variables, Operators, Expressions,
Statements and Blocks, Control Statements, Strings, Arrays, Inheritance, Package, Interface,
Exceptions, I/O, AWT, Swing, Database using JDBC, String Handling, Threads, Events, Applets,
Images, Project Work.
CSE282: PROGRAMMING LANGUAGE – II (OOP IN JAVA AND C++) LAB (1 CREDIT)

CSE265: ALGORITHM (3 CREDITS)

TOPICS:
Sorting (Insertion, Selection, Merge, Quick, Counting, Radix), Growth of Function, Divide and
Conquer, Solving Recurrences, Heap, Median and Order Statistics, Hashing, Elementary Graph
Algorithms, Shortest Paths, Sets and Disjoint Sets, Minimum Spanning Tree, Backtracking,
Introduction to Computational Geometry, Introduction to Greedy Algorithms, Introduction to Dynamic
Programming.
CSE266: ALGORITHM LAB (1 CREDIT)

CSE375: ADVANCED ALGORITHM (3 CREDITS)

Page 9 of 31
TOPICS:
Introduction to the design and analysis of efficient algorithms, models of computation, efficient sorting
and searching, algorithms for algebraic problems, graph algorithms, polynomial time algorithms for
matching, Fusion trees and their applications to integer sorting, Fibonacci heaps and self adjusting
search trees, splay trees, linking and cutting trees. State-of-the-art algorithms for minimum spanning
trees, shortest path problem, Network flows pre flow-push algorithms, max flow algorithms, linear
programming, scaling algorithms, dynamic programming, probabilistic methods, approximation
algorithms, completeness, lower bound theory for parallel computation, lower bounds on the resource
requirements of algorithms. Non polynomial Algorithm and satisfiability set construction.
CSE376: ADVANCED ALGORITHM LAB (1 CREDIT)

CSE383: DATABASE DESIGN (3 CREDITS)

TOPICS:
Concept of Database Systems; Semantic Database Design: High level Conceptual Modeling, ER Model
& Relational Model, ERD, Integrity Constraints, Enhanced ER (EER) Model; Relational Algebra;
SQL; Relational Database Design: Concepts of FDs, Decomposition & Desirable Properties,
Normalization, Algorithms for 1NF, 2NF, 3NF, BCNF, 4NF, 5NF; Other Dependencies & Normal
Forms; Storage & Indexing: Storage Structures, File Organization, Heap, Indexing Methods, B+ Tree
Indexing, Hash Indexing; Transaction Processing & Concurrency Control: Transaction Fundamentals,
OLTP Environments, ACID Properties, Locking, Deadlock & Starvation; Database Recovery
Techniques; Query Processing & Optimization; Database Security & Authorization; Enhanced Data
Models for Specific Applications; Distributed Databases & Issues.
CSE384: DATABASE DESIGN LAB (1 CREDIT)

TOPICS: Laboratory Works based on Theory Course CSE383
CSE363: MICROPROCESSOR DESIGN & ASSEMBLY LANGUAGE PROGRAMMING (3

CREDITS)
TOPICS:
Hardware and software architecture, instruction types and their formats, assembly program format,
assembly process, interrupts and system services, addressing methods, high level control structure
formation, use of subroutines and macros, numeric processing and string processing, concurrent
processes & high level linking, disk geometry, file system and file I/O handling.
Page 10 of 31
Introduction to 8-bit, 16-bit, and 32-bit microprocessor – architecture, addressing modes, instruction
set, interrupts, multi-tasking and virtual memory – memory interface, bus interface, arithmetic
co-processor, Micro-controllers, integrating microprocessors with interfacing chips.
CSE364: MICROPROCESSOR DESIGN & ASSEMBLY LANGUAGE PROGRAMMING LAB

(1 CREDIT)
CSE343: COMPUTER ARCHITECTURE (3 CREDITS)

TOPICS:
Fundamentals of computer design – tasks of a computer architect, technology and trends, cost and
trends, measurement of performance, quantitative principles of computer design, the concepts of
memory hierarchy, Instruction set principles – classification, memory addressing, operations, types and
size of operands, encoding, study of sample instruction set architecture, pipelining – hurdles and
Hazards, data hazards and control hazards, handling multi-cycle operations, instruction level
parallelism (ILP) – overcoming data hazards with dynamic scheduling, reducing Brance penalties with
dynamic hardware prediction, compiler support for exploiting ILP, hardware support for extracting
more parallelism, Memory hierarchy design – Caches, reducing cache misses & penalty, reducing hit
time, main memory, virtual memory, protection and examples of virtual memory, Storage systems –
types of storage devices, Buses, I/O performance measures, reliability, availability and RAID,
multiprocessors – centralized & distributed shared memory architectures, synchronization, computer
arithmetic, vector processors, survey of RISC architectures and Intel 80x86.
CSE349: MATHEMATICAL ANALYSIS FOR COMPUTER SCIENCE (3 CREDITS)

TOPICS:
Systematic ways of proving, mathematical notations, sums and recurrences, modular arithmetic, basic
number theory, some well known functions related to number theory, Binomial coefficients, Generating
functions, mechanical summations, Stirling, Eulerian, Harmonic, Bernoulli and Fibonacci numbers,
Domino theory, solving recurrences using generating functions.
CSE381 : Introduction to Embedded Systems and Interfacing (3 Credits)

Course Instructor is requested to target a specific mid-range 8-bit Microcontroller (MCU) with
following basic features :
1. Analogue to Digital Converter (ADC);
2. Analog Comparator; (optional)
3. Pulse Width Modulation and or Output Compare channels;
4. External interrupt(s);
5. Watch Dog Timer
6. Internal Timers
Page 11 of 31
7. External and internal clock input.
8. Hardware I2C and or SPI and or CAN bus capabilities.
9. USART/ USB communication.
10. Parallel I/O ports.
Software(s) : Course instructor is requested to target open-source / freely available tool-chain, IDE.
Target language : C/C++/assembly/Processing/ Java.
Suggested MCU: AVR ATMega168/ ATMega328; AVR Attiny 2313/4313; Microchip PIC
16F/18Fseries
Topics
1. Introduction to embedded system and interfacing: Why is computer interfacing important?; Typical
Interfacing Activities; Inside the embedded system ; Replacement for discrete logic-based circuits;
Von-Neuman Architecture vs. Harvard Architecture; Microcontroller's fundamental components; Basic
microcontroller architecture; Microcontrollers vs. Microprocessors; Different Microcontroller
manufcaturer; Review: basic circuits; Digital and Analogue concepts.
2. Detailed Architecture of the Target Microcontroller;
3. Setting up development environment
4. Basic Peripherals : Digital input / output using parallel I/O ports
5. Timer unit
6. PWM and Output Compare Channels
7. Interfacing with Analogue world
8. Interrupts and exception handling
9. Interfacing with X86/ AMD64 Computer: Introduction to USART
10. Developing X86/ AMD64 Computer software to control MCU
11. Introduction to I2C, SPI and or CAN bus
12. Finite State Machine and its application in embedded ayatem
13. Working with sensors and modules: Proximity Sensor, Distance Sensor, Real Time Clock module
(i2c), Accelerometer (i2c/SPI), Gyroscope, Temperature Sensors, Light sensors, Sensor networking,
Relays, ethernet/WIFI etc.
14. Working with Motors: Introduction to H-bridge, Brushed D.C., Unipolar/Bipolar Stepper motor,
Servo Motor Torque vs. Speed, Basic Gear box design, Converting rotational motion to linear motion.
15. USB protocol: USB Human interface device (HID), USB Host device.
CSE382 : Introduction to Embedded Systems and Interfacing Lab (1 Credit)

TOPICS: Laboratory works based on Theory course CSE381
CSE441: THEORY OF COMPUTING (3 CREDITS)

TOPICS:
Formal proofs, finite automata, DFA/NFA and their equivalence, properties of regular languages,
minimizing automata, regular expressions, Pumping lemma, non-regular languages, context-free
grammar, Chomsky and Greibach normal forms, pushdown automata, non-context free languages,
Turing machines, variants of Turing machines, definition of algorithms, decidable languages,
Page 12 of 31
Undecidability of the Halting problem, Diagonalization and reduction, time complexity, classes P, NP,
NPC.
CSE361: OPERATING SYSTEMS (3 CREDITS)

TOPICS:
COMPUTER SYSTEM OVERVIEW: Basic Elements; Processor Registers; Instruction Execution;
Interrupts; The Memory Hierarchy; Cache Memory; I/O Communication Techniques;
OPERATING SYSTEM OVERVIEW: Operating System Objectives and Functions; The Evolution of
Operating Systems; Developments Leading to Modern Operating Systems; Microsoft Windows
Overview; Modern UNIX Systems; Linux;
PROCESS DESCRIPTION AND CONTROL: Process States; Process Description; Process Control;
Execution of the Operating System; Security Issues; Linux Process Management; Security Issues
SCHEDULING: Uniprocessor Scheduling: Types of Professor Scheduling, Scheduling Algorithms,

Traditional UNIX Scheduling; Multiprocessor Scheduling: Granularity,Design Issues, Process
Scheduling,Thread Scheduling,Real-Time Scheduling: Characteristics of Real-Time Operating
Systems, Real-Time Scheduling, Deadline Scheduling,Rate Monotonic Scheduling, Priority Inversion,
Linux Scheduling
Assignment 1
THREADS, SMP, AND MICROKERNELS: Processes Vs.Threads:Multithreading, User-Level and
Kernel-Level Threads; Symmetric Multiprocessing : Modern Multi Core Processor and Process
Management and GPU architecture; Microkernels; Linux/Windows Process and Thread Management
Assignment 2
CONCURRENCY: Principles of Concurrency; Mutual Exclusion; Semaphores; Monitors (Java as
example); Message Passing; Classical Problems: Readers/Writers Problem, Dining Philosophers
Problem, Sleeping Barber Problem; Principles of Deadlock; Deadlock Prevention; Deadlock
Avoidance; Deadlock Detection; Linux Concurrency Mechanisms: Pipes, Messages, Shared Memory,
Semaphores; Signals; Linux Kernel Concurrency Mechanisms: Atomic Operations, Spinlocks,
Semaphores, Barriers
Assignment 3
MEMORY MANAGEMENT: Memory Management Requirements; Memory Partitioning; Paging;
Segmentation; Security Issues; Virtual Memory: Hardware and Control Structures, Operating System
Software; Linux/Windows Memory Management
Assignment 4
FILE MANAGEMENT: File Organization and Access; File Directories; File Sharing; Record
Blocking; Secondary Storage Management; File System Security; UNIX File Management: File
Allocation, Directories, Volume Structure, Traditional UNIX File Access Control, Access Control Lists
in UNIX; LINUX Virtual File System; Windows File System;
Assignment 5
COMPUTER SECURITY THREATS: Computer Security Concepts; Threats, Attacks, and Assets;
Intruders; Malicious Software Overview; Viruses,Worms, and Bots; Rootkits;
Assignment 6
Page 13 of 31
CSE362: OPERATING SYSTEMS LAB (1 CREDIT)
Suggested Lab Topics (Linux and Java Based):
Lab 1: Linux system overview and shell commands.
Lab 2: Linux File I/O Model; Introduction to System CallsAssignment 1
Lab 3: Bare Metal Programming: Boot LoaderAssignment 2
Lab 4: Linux Process creation and Management- fork, exec, wait.Assignment 3
Lab 5: Linux Inter Process Communication: PipeAssignment 4
Lab 6: Linux Pthread basics:Pthread create, join, exit Assignment 5
Lab 7: Linux Semaphore and Mutex basics.
Lab 8: Advanced topic on Linux Semaphore and MutexAssignment 6
Lab 9: Java Monitor
Lab 10: Linux Memory Management and scheduling system calls Assignment 7
Lab 11: Introduction to Linux Kernel Module (LKM)Assignment 8
CSE469: COMPILER CONSTRUCTION (3 CREDITS)

TOPICS:
Lexical analysis, parsing (LL, LR parsers), syntax directed translation, intermediate code generation,
error detection and recovery, design and implementation of lexical analyzers and parsers using tools
like flex and bison.
CSE345: INFORMATION SYSTEM DESIGN & SOFTWARE ENGINEERING (3 CREDITS)

TOPICS:
Introduction to information system (information, information system, information gathering,
information sources, system analysis), data collection process (interviewing), fact finding techniques
(questionnaire, joint application design (JAD)), prototyping, system design tools overview, data flow
diagram, data dictionary, process specifications, E-R diagram, state diagram, variations of modeling
tools (flowcharts and its variations, Nassi-Shneiderman diagram, Ferstl diagram, Hamilton-Zeldin
diagram, problem analysis diagrams (PAD), system flowchart, HIPO diagrams, structure charts,
variations on data flow diagram and E-R diagram), analysis models (essential model, environmental
model, behavior model, user implementation model), introduction to UML (use case modeling and use
case diagram, class modeling, relationship, class diagrams, object interaction – modeling sequence,
collaboration diagram, state chart diagram, activity diagram, component and deployment diagram),
ethical and social issues, security issues, project estimation, COCOMO model, PERT/CPM analysis,
Gantt charts, cost benefit analysis, introduction to linear programming, project work
Software Quality Concepts, Process Models, Software Requirements Analysis, Design Methodologies,
Software Testing, Software Maintenance, Testing and Debugging, Modularity, Specification, Data
Abstraction, Object Modeling, Design Patterns, Testing, RUP, UML, Project Work.
Page 14 of 31
CSE459: PROJECT (6 CREDITS)
PREREQUISITE(S): Successful completion of 110 or more credits.
TOPICS:
Study of problems in the field of Computer Science & Engineering. A student needs to select a suitable
topic of his/her interest or supervisors may display a list of project works related with the academic
needs in research activities.
CSE341: COMPUTER NETWORKING (3 CREDITS)

PREREQUISITE(S): ETE281
TOPICS:
Overview of OSI reference model. Topology design, Media Access Control Level, Services, Problems
and protocols, Practical local area network design and implementation. IEEE LAN Standards, Logical
Link Control protocols, HDLC, ALOHA, SLOTTED ALOHA, FDDI, Client Server model and related
softwares.
Network Layer level services, problems and protocols. WAN, MAN, interconnection networks related
softwares, TCP/IP, Novel NetWare, Routers, Bridges and Gateways their Practical implementation
aspects. X.25, Internet and related softwares.
Transport layer, services, problems and their protocol.
Brief functioning of upper layers, E-mail and other application.
CSE342: COMPUTER NETWORKING LAB (1 CREDIT)

CSE443: COMPUTER GRAPHICS & ANIMATION (3 CREDITS)

PREREQUISITE(S): CSE281, MAT261
TOPICS:
Modeling shapes with meshes, affine transformation, three dimensional viewing, lighting and shading
techniques, texture mapping, skinning, animating models, collision detection, ray tracing.
CSE444: COMPUTER GRAPHICS & ANIMATION LAB (1 CREDIT)

PREREQUISITE(S): CSE281, MAT261
TOPICS: Laboratory Works based on Theory Course CSE443 using OpenGL and Blender.
CSE467: E-COMMERCE & E-GOVERNANCE (3 CREDITS)

PREREQUISITE(S): CSE383, SOC341
Page 15 of 31
Software to be used: Any Enterprise Resource Planning (ERP) Software. e.g.:
OpenERP/Odoo/Titanium/ SAP ERP
TOPICS:
Introduction to Electronic Commerce: What electronic commerce is and how it has evolved into a
second wave of growth; Why companies concentrate on revenue models and the analysis of business
processes instead of business models when they undertake electronic commerce initiatives; How
economic forces have created a business environment that is fostering the second wave of electronic
commerce; How businesses use value chains and SWOT analysis to identify electronic commerce
opportunities ; The international nature of electronic commerce and the challenges that arise in
engaging in electronic commerce on a global scale
Technology Infrastructure: The Internet and the World Wide Web:The origin, growth, and current
structure of the Internet;How packet-switched networks are combined to form the Internet; How
Internet protocols and Internet addressing work; The history and use of markup languages on the Web,
including SGML,
HTML, and XML; How HTML tags and links work on the World Wide Web; The differences among
internets, intranets, and extranets; Options for connecting to the Internet, including cost and bandwidth
factors; Internet2 and the Semantic Web
Business Strategies For E-Commerce: Revenue models; How some companies move from one
revenue model to another to achieve success; Revenue strategy issues that companies face when selling
on the Web; Creating an effective business presence on the Web; Web site usability; Communicating
effectively with customers on the Web; When to use product-based and customer-based marketing
strategies; Communicating with different market segments; Customer relationship intensity and the
customer relationship life cycle; Using advertising on the Web; E-mail marketing; Technology-enabled
customer relationship management; Creating and maintaining brands on the Web; Search engine
positioning and domain name selection; Social Network, Viral Marketting;
Business-to-Business Activities: How businesses use the Internet to improve purchasing, logistics,
and other support activities; Electronic data interchange and how it works; How businesses have
moved some of their electronic data interchange operations to the Internet; Supply chain management
and how businesses are using Internet technologies to improve it; Electronic marketplaces and portals
that make purchase–sale negotiations easier and more efficient
Legal, Ethical, and Tax Issues: Laws that govern electronic commerce activities; Laws that govern
the use of intellectual property by online businesses; Online crime, terrorism, and warfare; Ethics
issues that arise for companies conducting electronic commerce; Conflicts between companies’ desire
to collect and use data about their customers and the privacy rights of those customers; Taxes that are
levied on electronic commerce activities
Electronic Commerce Software & Security: Web server basics; Software for Web servers; E-mail
management and spam control issues; Internet and Web site utility programs; Web server hardware;
Finding and evaluating Web-hosting services; Basic functions of electronic commerce software;
Advanced functions of electronic commerce software; Electronic commerce software for small and
midsize businesses; Electronic commerce software for midsize to large businesses; Electronic
commerce software for large businesses that have an existing information technology infrastructure;
Online security issues ; Security for client computers; Security for the communication channels
Page 16 of 31
between computers; Security for server computers; Organizations that promote computer, network, and
Internet security;
Payment Systems for Electronic Commerce: The basic functions of online payment systems; The
use of payment cards in electronic commerce; The history and future of electronic cash; How
electronic wallets work; The use of stored-value cards in electronic commerce; Internet technologies
and the banking industry
The Need for Enterprise Architecture: Enterprises and their challenges; Stakeholders and Their
Concerns; Traditional Approaches; Requirements on Enterprise Architecture;
Governance Paradigm: Key Applications for Enterprise Architecture; Defining Enterprise

Architecture; Key Concept of Enterprise Architecture; Benefits of Enterprise Architecture;
Competencies of an Enterprise Architect;
The Results of Enterprise Architecting: Case Study on an Enterprise Architecture; Quality of the
Produced Results; Enterprise Architecture Frameworks : Tapscott & Caston’s Views, The Integrated
Architecture Framework, The ArchiMate Framework, The Zachman Framework, The Open Group’s
Architecture Framework; Dimensions for Architecture Frameworks: Subject Dimensions, Purpose
Dimensions, Form Dimensions
The Process of Enterprise Architecting: The Core Process of Enterprise Architecting: Creating,
Using and Maintaining Enterprise Architecture; Patterns for Enterprise Architecting; Architecture
Effectiveness and Organizational Context: Architecture Maturity Level of the Enterprise, Assessing an
Organization’s Architecture Effectiveness, Assessing an Organization’s Culture and Management
Style; Organizing the Architecture Function: Planning Learning and Organizinging Architecture
Activities
CSE477: Cloud Computing (3 CREDITS)

Intro to Clouds, Software as a service (SaaS), Platform as a serivce (PaaS), Infrasturcture as a Service,
MapReduce, Gossip, Membership, Grids, P2P Systems, KeyValue Stores, Time and Ordering,
Snapshots, Multicast, Paxos, Leader Election, Mutual Exclusion, Concurrency Control, Replication
Control, Stream Processing, Graph Processing, Structure of Networks, Scheduling,Distributed File
Systems, Distributed Shared Memory, Sensor Networks, Security, Data-center Outage Studies, Cloud
computing service deployment and maintenance.
CSE359: Graph Theory (3 CREDITS)

Basic Concepts: Graphs and digraphs, incidence and adjacency matrices, isomorphism, the
automorphism group;
Trees: Equivalent definitions of trees and forests, Cayley's formula, the Matrix-Tree theorem, minimum
spanning trees;
Page 17 of 31
Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger’s
theorem;
Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal,
girth, circumference, the Chinese Postman Problem, the Travelling Salesman problem, diameter and
maximum degree, shortest paths;
Matchings: Berge's Theorem, perfect matchings, Hall's theorem, Tutte's theorem, Konig's theorem,
Petersen's theorem, algorithms for matching and weighted matching (in both bipartitie and general
graphs), factors of graphs (decompositions of the complete graph), Tutte's f-factor theorem;
Extremal problems: Independent sets and covering numbers, Turan's theorem, Ramsey theorems;
Colorings: Brooks theorem, the greedy algorithm, thWelsh-Powell bound, critical graphs, chromatic
polynomials, girth and chromatic number, Vizing's theorem;
Graphs on surfaces: Planar graphs, duality, Euler's formula, Kuratowski's theorem, toroidal graphs,
2-cell embeddings, graphs on other surfaces;
Directed graphs: Tournaments, directed paths and cycles, connectivity and strongly connected
digraphs, branching;
Networks and flows: Flow cuts, Max flow min cut theorems, perfect square;
Selected topics: Dominating sets, the reconstruction problem, intersection graphs, perfect graphs,
random graphs, Chordal graphs.
Famous problems in Graph Theory include: Minimum Connector Problem, Marriage Problem, the
Assignment Problem, the Network Flow Problem, the Committee Scheduling Problem, the Four Color
Problem, the Traveling Salesman, Transportation and Transshipment Problem, etc.
CSE347: ADVANCED NETWORKING (3 CREDITS)

TOPICS:
Internet addressing, routing and routed algorithm., NAT, PAT, Sub-netting, Sub-netting the subnet
(VLSM), VLAN, ICMP v4 and v6. IP multicasting, RSVP, next generation IP – IPng, ATM, wireless –
radio basics, satellite systems, WAP, current trends, issues with wireless over TCP, multiple
conversation, socket, Denial service attack, congestion control – control vs. avoidance, overview of
algorithms, congestion in the internet, Mobile IP, Voice over IP (VoIP), VPNs, network security,
management – Quality of Service (QoS), network vs. distributed systems management, protocols,
web-based management and other advanced TOPICS: Bluetooth, Wi-Fi (IEEE 802.11g), Wi-Max
(IEEE 802.16).
CSE348: ADVANCED NETWORKING LAB (1 CREDIT)

CSE355: IMAGE PROCESSING (3 CREDITS)

TOPICS:
Page 18 of 31
Digital image fundamentals, perceptions, representation, image transforms – Fast Fourier Transform
(FFT), Discrete Cosine Transforms (DCT), Karhunen and Loeve Transforms (KLT), Wavelet transform
and sub-band decomposition, image enhancement and restoration techniques, image compression
techniques, image compression standards – JPEG, MPEG, H.261, H.263
CSE471: WEB AND INTERNET PROGRAMMING (3 CREDITS)

TOPICS:
HTML, CSS, Basic web programming, PHP basics, OOP in PHP, Relational Database and MySQL,
JavaScript, Regular Expression, Sessions and Cookies, MVC, PHP Frameworks, JQuery, AJAX,
Project Work.
CSE472: WEB AND INTERNET PROGRAMMING LAB (3 CREDITS)

TOPICS:
Lab works Based on theory course CSE471
CSE473: SOFTWARE DEVELOPMENT AND PROJECT MANAGEMENT (3 CREDITS)

Instructions for Course Instructor: Course Instructor is requested to target a software development
framework (preferably Model-View-Controller MVC) and topics are presented in the context of the
framework. Instructor is also requested to chose an enterprise size software where different
component(s) will be developed by individual groups. A group may be formed of by 3 to 5 students
(depending on class size). The groups must co-ordinate / communicate among them to ensure the
component(s) developed by each group works as a whole.
Suggested Framework(s): Ruby on Rails, Groovy on Grails, Django, Yii, Symphony, Codeigniter,
Zend etc.
TOPICS:
Foundations of software project management; organization structure and staffing; motivation, authority
and influence; conflict management; proposal preparation; a large engineering software system
management; client management; managing software project teams; project planning and scheduling;
risk management; configuration management; pricing estimation and cost control; quality assurance
and accreditation; factors affecting software quality; software quality assurance plans; business context
and legal issues for software projects; software measurement: Software testing- white-box testing,
black-box testing, Unit testing, Functional testing, load testing; upgrading and maintenance; network
systems; and international project management; Understanding Cloud computing, Differences between
hosted services and cloud services; Learning about bigdata and problem solving using bigdata.
CSE474: SOFTWARE DEVELOPMENT AND PROJECT MANAGEMENT LAB (1 CREDIT)

TOPICS:
Page 19 of 31
Lab works based on theory course CSE473.
CSE479: CRYPTOGRAPHY & NETWORK SECURITY (3 CREDITS)

TOPICS:
Classical Cryptography: Introduction to simple cryptosystems, Cryptanalysis; Shannon's Theory:
Perfect secrecy, Entropy, Product cryptosystems; Data Encryption Standard: Description of DES,
Differential cryptanalysis; RSA System and Factoring: Public-key cryptography, RSA cryptosystem,
Attacks on RSA, Factroing algorithms; Other Public-key cryptosystems: ElGamal cryptosystem and
discrete logs, Merkle-Hellman Knapsack System; Signature Schemes: ElGamal signature schemes,
Digital signature standard, Fail-stop signatures; Hash Functions: Signatures and Hash functions,
Collision-free Hash functions, Birthday attack; Key Distribution and Key Agreement: Key
predistribution, Kerboros, Diffie-Hellman key exchange; Identification Schemes: Schnorr identification
scheme, Okamoto identification schemes; Authentication Codes: Computing deception probabilities,
Combinatorial bounds, Entropy bounds; Secret Sharing Schemes: Shamir threshold scheme, Access
structure and general secret sharing; Pseudo-random Number Generation: Indistinguishable probability
distribution, probabilistic encryption; Zero-knowledge proofs: Interactive proof systems, computational
Zero-knowledge proofs.
CSE475: MANAGEMENT INFORMATION SYSTEM (3 CREDITS)

PREREQUISITE(S): Successful completion of 110 or more credits
TOPICS:
Introduction to the components of the management information system and their integration for
managerial control and decision support, major functional applications and impacts of information
technology on individuals and the society, basic discussion of the environments, approaches, principles
and processes of management, environmental forces, planning, organizing and control processes,
motivation, teamwork, group dynamics and leadership in business and non-business organizations.
CSE365: ARTIFICIAL INTELLIGENCE (3 CREDITS)

TOPICS:
Searching: conventional graph searching, A*, IDA*, jump point search, local searching: hill climbing,
simulated annealing, constraint satisfaction, adversarial search using minimax, knowledge
representation and inference using propositional and first order logic and implementation using prolog,
artificial neural networks.
CSE353: INTRODUCTION TO DATA MINING (3 CREDITS)

Introduction to Data Mining:

Introduction to Data Mining, Data Warehousing, and OLAP, Classification Concepts, Decision Trees,
Model Evaluation, and Classification Alternative Techniques, Association Analysis Concepts,
Algorithms, and Association Analysis Advanced Concepts, Cluster Analysis Concepts, Algorithms,
and Cluster Analysis Issues, Frequent-Pair Algorithms, Anomaly Detection.
Page 20 of 31
Machine Learning:
Inductive learning, Rule Induction, Bayesian Learning, Neural Networks, and Genetic Algorithms,
Model Ensembles, Learning Theory, and Instance-based Learning.
Advance Data Mining:

Query Flocks, Page-Rank, Hubs-and-Authorities, Web Mining, Stream Mining, Matching Sequences,
Mining Event Sequences, Event Discovery.
CSE351: Advanced Java

PREREQUISITE: CSE281
TOPICS:
Threads, Generics, Reflection API, Java Network Programming, Advanced JDBC Programming,
Introduction to J2EE, Java Server Technology, JSP, RMI, Frameworks, Project Work.
CSE352: Advanced Java Lab

PREREQUISITE: CSE282
TOPICS: Laboratory Work based on Theory Course CSE4047 (Advanced Java).
CSE457: Advanced Embedded Systems

Course Instructor is requested to target a specific mid-range 32/64-bit Microcontroller (MCU) with
following basic features :
1. Analogue to Digital Converter (ADC);
2. Analog Comparator; (optional)
3. Pulse Width Modulation and/or Output Compare channels;
4. External interrupt(s);
5. Watch Dog Timer
6. Internal Timers
7. External and internal clock input.
8. Hardware I2C, SPI and CAN bus capabilities.
9. USART, USB communication.
10. Parallel I/O ports.
11. JTAG/SWD
12. Memory Protection Unit(MPU).
13. Multi- Threading
14. Multi-Core (optional)
15. Digital to Analogue (DAC) Converter
16. Direct Memory Access (DMA)
Software(s) : Course instructor is requested to target open-source / freely available tool-chain, IDE.
Target language : C/C++/assembly/ Java.
Suggested MCU: ARM Cortex M3 / M4 based mcu (as on 2014) or any popular 32/64 bit MCU with
System on Chip (SoC) and Real Time OS capability
Page 21 of 31
Following Topics are based on ARM Cotex M3/M4 MCU (as on 2014):
1. Introduction: What Is the ARM Cortex-M3/M4 Processor?; Background of ARM and ARM
Architecture; The Thumb-2 Technology and Instruction Set Architecture.; Cortex-M3 Processor
Applications;
2. Overview of the Cortex-M3/M4: Registers; Operation Modes; The Built-In Nested Vectored
Interrupt Controller; The Memory Map; The Bus Interface; The MPU;Interrupts and Exceptions;
Debugging Support and Tool chain setup.
3. Configuration: Registers; Special Registers; Clock Distribution; I/O Pins; Pin Remapping; Peripheral
Configuration; Vector Tables; Stack Memory Operations
4. Memory Systems : Memory System Features Overview; Memory Maps; Memory Access Attributes;
Bit-Band Operations
5. Cortex-M3/ M4 Implementation Overview: The Pipeline; Bus Interfaces on the Cortex-M3/M4;

Other Interfaces on the Cortex-M3/M4
6. Exceptions: Exception Types; Definitions of Priority; Vector Tables;Interrupt Inputs and Pending
Behavior; Fault Exceptions; Supervisor Call and Pendable Service Call
7. The Nested Vectored Interrupt Controller and Interrupt Control: Nested Vectored Interrupt Controller
Overview; The Basic Interrupt Configuration;Software Interrupts; The SYSTICK Timer
8. The Memory Protection Unit: MPU Registers; Setting Up the MPU

9. Power Management: Sleep Modes; Multiprocessor Communication
10. Asynchronous Serial Communication: Polling Implementation; Initialization;
11. SPI: Protocol; SPI Peripheral; EEPROM Interface
12. I 2 C: I 2 C Protocol; I 2 C Interface;
13. CAN Bus: CAN Protocol; CAN Interface
13. Timers: PWM Output; Input Capture;
14. Direct Memory Access: DMA Architecture; SPI DMA Support;
15. Digital Analog Converter
16. Analog Digital Converter
17. Real-Time Operating Systems(RTOS): System on a Chip (SoC);Threads; Synchronization;

Interrupt Handlers;Multitasking;
Page 22 of 31
18. Sensors and modules: NAND Flash, external RAM; Ultrasonic Sensors; LCD Touch Screen; VGA
display etc.
CSE465 : Parllel and Distributed Computing (3 CREDITS)

PREREQUISITE(S): CSE375, CSE361, CSE347
Goal of this course:-
This course is to present foundational concepts of high performance and distributed computing.
To introduce advanced computer architectures, organisation, and design.
To introduce the basics of parallel programming – algorithm design and analysis.
To encourage students to think in new way i.e. the parallel way.
Course Content:
· Issues in High Performance Computing : Moore’s Law, Processor Performance; Technological
Limitations: Frequency, Power, Instruction Level Parallelism and Memory Wall; Multi-Core
Technology; Introduction to Cluster, Grid and Cloud Computing; Parallel vs Distributed Computing;
· Parallel Architectures: Implicit Parallelism; Introduction to Pipelining and Limitation(s); Introduction
to Superscalar and Limitation(s); Graphics Processing Unit (GPU); Flynn’s Taxonomy: SISD, SIMD,
MISD, MIMD; Interconnection Networks: Static, Dynamic; Evaluating Interconnection Networks;
Communication Costs in Parallel Machines; Memory System Performance; Cache Coherence in
Multiprocessor Systems.
· Parallel Algorithm Design: Parallel Computing Platforms: Control Structure, Communication Model,
Shared-Address-Space Machine, Message-Passing Platform; Designing Parallel Algorithms:
Partitioning, Data Decomposition, Functional Decomposition, Communication, Agglomeration,
Mapping; Common Parallel Programming Models; Parallel Algorithm Design Examples.
· Performance Analysis: Performance Metrics: Execution Time, Total Parallel Overhead, Speedup,
Efficiency; Cost of a Parallel System; Effect of Granularity on Performance; Scalability of Parallel
Systems; Amdahl’s Law; Gustafson-Barsis Law; Scaling Characteristics of Parallel Programs;
Isoefficiency Metric of Scalability.
· Message Passing Interface : MPI Basics, MPI blocking send/receive function calls; Inter Process
Communication; Asynchronous communication; Split-recombine task/data; MPI Derived Data Types
· Programming Shared Address Space Platforms: Programming Shared Address Space
Platforms(PtThread), Thread Basics, Pthreads API, Thread Management, Creating Threads, Thread
Attributes, Terminating Thread, Passing Arguments to Threads, Joining & Detaching Threads,
Synchronization Issues, Mutex: Creating & Destroying, Locking & Unlocking, Overheads of Locking,
Alleviating Locking Overhead, Monitor; Read-Write Locks
· Advanced Topic on Parallel and Distributed Computing: e.g. Map Reduce.
· Distributed Computing: Client/Server Computing: Client, Server, Network; Client/Server Terminology,
Characteristics, Applications, Database Usage; Classes of Client/Server Applications: Host-Based
Processing, Server-Based Processing, Client-Based Processing; Disadvantages of Two-Tier
Architecture; Three-Tier Client/Server Architecture; Middleware; Distributed Message Passing:
Reliability versus Unreliability, Blocking versus Nonblocking; Client/Server Binding;
Service-Oriented Architecture (SOA); Clusters; Load Balancing
CSE445: Smart Device App Development

Goal of the course
Page 23 of 31
Something to offer both the beginner and the experienced developer who is looking to sell his or her application
in the ever expanding application market. course covers important beginner topics such as “What is Smart device
Application” and installing and using the development environment. This course then advance to practical
working examples of core programming topics any developer will be happy to have at the ready on the reference
shelf.
Assumed Knowledge:
it’s not necessary, nor is prior experience in mobile phone development. It’s expected that participants will have
some experience in software development and be familiar with basic development practices.
Target Platform(s): Android, iOS, firefox, tizen, ubuntu, Phonegap or any other future popular development
platform
Contents:
● Developing for Mobile Devices: Hardware-Imposed Design Considerations ; Considering the Users’
Environment; Development Tools
● Creating Applications: Introducing the Application functionality; Application Life Cycle;
Understanding Application Priority and Process States
● Fundamental U.I. Design : Introducing Views; Introducing L ayouts; Creating and Using Menus
● Intents, Broadcast Receivers, Adapters, and the Internet

● Data Storage, Retrieval, and Sharing
● Maps, Geocoding, and Location-Based Services
● Working in the Background: Services; Threads; Notifications
● Peer-to-Peer Communication: Instant Messaging; SMS;
● Accessing Hardware: Media APIs; Camera; using Sensors; Telephony; Bluetooth; Managing
Network and Wi-Fi Connections; Controlling Device Vibration.
● Graphics and animation: Drawing graphics; Creating animations
● Advanced Development: Security; Declaring and Enforcing Permissions; Using Int ernet Ser vices;
Localization
ECO461: PRINCIPLE OF ECONOMICS (3 CREDITS)

TOPICS:
Definition of economics, economics and engineering, principles of economics. Introduction to various
economic systems – capitalist, command and mixed economy, fundamental economic problems and
mechanisms through which these problems can be solved, theory of demand and supply and their
elasticities, theory of consumer behavior, cardinal and ordinal approaches of utility analysis, price
determination, nature of an economic theory, applicability of economic theories to the problems of
developing countries, indifference curve techniques, theory of production, production function, types of
productivity, rational region of production of an engineering firm, concepts of market and market
structure, cost analysis and cost function, small and large scale production, optimization, theory of
distribution, use of derivatives in economics, maximization and minimization of economic functions,
relationship among total, marginal and average concepts. Micro-Economics: Savings, investment,
employment, national income analysis, inflation, monetary policy, fiscal policy and trade policy with
reference to Bangladesh, economics and development and planning.
Page 24 of 31
EEE181: ELECTRICAL CIRCUIT DESIGN – I (3 CREDITS)
TOPICS:
Units, DC sources, Resistance and Conductance, Ohm’s law, Power and Energy, Series and parallel
circuits, Series-Parallel Networks; Methods of analysis: Mesh analysis, Node analysis and other
methods of analysis; Kirchhoff’s laws, Y-delta transformation; Circuit theorems: Superposition
Theorem, Norton’s Theorem, Thevenin’s Theorem, Millman’s Theorem, Capacitors, Magnetic circuits,
Inductors, R-C and R-L circuits with DC excitation.
EEE182: ELECTRICAL CIRCUIT DESIGN – I LAB (1 CREDIT)

TOPICS: Laboratory Works based on Theory Course EEE181
EEE241: ELECTRONIC DEVICES AND CIRCUITS – I (3 CREDITS)

PREREQUISITE(S): EEE181, EEE182
TOPICS:
Introduction to semiconductors, The p-n junction diode: p-n junctions under forward and reverse
biases, The ideal diode and real diode, Load line analysis of diode circuits, graphical analysis of diode
circuits, equivalent circuits and frequency response, diode applications characteristics of different types
of diodes Bipolar Junction Transistors (BJT): Bipolar junction transistor-Construction and Operation,
Amplifying action, Common-base (CB), Common-collector (CC) and Common-emitter (CE)
configurations, Different methods of transistor biasing, Darlington pair, Load Line (AC and DC), BJTs
at low frequencies.
EEE242: ELECTRONIC DEVICES AND CIRCUITS LAB (1 CREDIT)

TOPICS: Laboratory Work based on EEE241
TOPICS:
Study on D.C. and A.C. Circuits, D.C. Motors, Induction Motor, A.C. and D.C. Generators, Single
Phase and 3-Phase transformer, star-Delta Starter, rectifiers. Transistor amplifier circuit, Application of
I.C’s in every day and industrial use. House wiring and layout of a factory (Electrical) etc.
ETE357: TELECOMMUNICATION ENGINEERING (3 CREDITS)

PREREQUISITE(S): EEE241, ETE281
TOPICS:
Introduction: Principle, evolution, networks, exchange and international regulatory bodies. Telephone
apparatus: Microphone, speakers, ringer, pulse and tone dialing mechanism, side-tone mechanism,
local and central batteries and advanced features. Switching system: Introduction to analog system,
Page 25 of 31
digital switching systems – space division switching, blocking probability and multistage switching,
time division switching and two dimensional switching. Traffic analysis: Traffic characterization,
grades of service, network blocking probabilities, delay system and queuing. Modern telephone
services and network: Internet telephony, facsimile, integrated services digital network, asynchronous
transfer mode and intelligent networks. Introduction to cellular telephony and satellite communication.
ETE358: TELECOMMUNICATION ENGINEERING LAB (1 CREDIT)

TOPICS: Laboratory Works based on ETE357
ETE451: DIGITAL SIGNAL PROCESSING (3 CREDITS)

TOPICS:
Introduction to digital signals and digital signal processing, A/D conversion, sampling theorem,
Illustration of aliasing, analysis of Discrete-Time Linear-Tme-Invariant (LTI) systems, Resolution of
Discrete-Time signals into impulse, Convolution and correlation, Z-transform, Concept of Pole and
Zero, Frequency domain representation of discrete-time systems and signals, Discrete Fourier series
and discrete Fourier transform (DFT), computation of the DFT, Fast Fourier Transform (FFT), Discrete
Cosine Transform (DCT), Signal flow graph representation of digital networks. Filter structure for IIR
and FIR filters, Introduction to speech and Image processing.
EEE425: VLSI DESIGN (3 CREDITS)

TOPICS:
VLSI technology: terminologies and trends,MOS transistor characteristics and equations, MOS
fabrication process, nMOS & CMOS inverters: dc & transient characteristics, pass transistor & pass
gates, Derivation of drain-to source current (Ids), Ids VS Vds, Pull-up to pull down ratio, CMOS &
nMOS design Style, Stick Diagrams, CMOS layout and design rules: λ-based design rule. Complex
CMOS gates: NAND, NOR, Exclusive OR, Resistance & Capacitance estimation and Modeling, raise
time and fall time calculation of gate capacitance, Scaling & scaling factor of different parameters.
Signal propagation delay, noise margin and power consumption, Interconnect, BiCMOS circuits.
CMOS building blocks: adders, counters, multipliers and barrel shifters, Parity generator, Data paths,
memory structures: Dynamic RAM cells, PLAs and FPGAs, VLSI testing: objectives & strategies.
EEE456: VLSI DESIGN LAB (1 CREDIT)

TOPICS:
Lab works based on theory course CSE359.
ENG101: BASIC COMPOSITION (0 CREDITS)

Page 26 of 31
TOPICS:
Basic Composition is a non-credit foundation course. It is designed to brush up students’ existing
English skills. This course will help them to review the grammatical items they already know and will
prepare them to study at the tertiary level by enhancing their English language skills. The main focus of
this course is on reading and writing. Students will also learn to communicate in English by interacting
with the instructor. Students will also explore the creative side of language by solving different sorts of
tasks and preparing assignments on picture description and story completion. They will also be
conditioned to write formal applications and Emails. At the end of the course they are expected to carry
out their academic activities in English effectively.
ENG102: INTERMEDIATE COMPOSITION (3 CREDITS)

PREREQUISITE(S): ENG101
TOPICS:
The goal of this course is to provide students with tertiary level reading and writing skills. The course
focuses on composition, nevertheless includes grammar so as to provide the students with necessary
background knowledge of grammatical structures, and common mistakes. This knowledge will help
them framing paragraphs effectively maintaining cohesion and coherence. The types of paragraphs
selected for this course will not only excel their writing skill, but will also introduce them with the
process and techniques of writing they will be using in their other academic courses as well as in real
life. The reading section attempts to augment their reading skill adopting various strategies that can be
effective in different writing dimensions. In addition to that, the journal writing section has been
designed to explore and motivate the students into more free and creative writing. This multifaceted
course will help the students learn to engage critically and clearly with texts and topics by developing
their own academic writing skills.
ETE281: COMMUNICATION THEORY (3 CREDITS)

PREREQUISITE(S): MAT241, EEE241
TOPICS:
Overview of communication systems: Basic principles, fundamental elements, system limitations.
Noise: Source, characteristics of various types of noise, Information theory: Measure of information,
source encoding, channel capacity, Communication systems: Analog and digital. amplitude
modulation- introduction, double side band, single side band, vestigial side band, quadrature; envelope
and synchronous detection; angle modulation- frequency modulation (FM) and phase modulation
(PM), demodulation of FM and PM. Pulse modulation: Sampling- sampling theorem, Nyquist criterion,
pulse code modulation (PCM), differential PCM, demodulation of PCM; delta modulation (DM)-
principle, adaptive DM;Digital modulation: Amplitude-shift keying- principle, ON-OFF keying,
bandwidth requirements, detection, noise performance; phase-shift keying (PSK)- principle, bandwidth
requirements, detection, differential PSK, Quadrature PSK, noise performance; frequency-shift keying
(FSK)- principle, continuous and discontinuous phase FSK, minimum-shift keying, bandwidth
requirements, detection of FSK. Multiplexing: Time-division multiplexing (TDM), frequency-division
multiplexing (FDM), multiple-access network- time-division multiple-access (TDMA),
frequency-division multiple access (FDMA); code-division multiple-access (CDMA). Communication
system design: design parameters, channel selection criteria and performance simulation.
ETE282: COMMUNICATION THEORY LAB (1 CREDIT)
Page 27 of 31
PREREQUISITE(S): MAT241, EEE241
TOPICS:
Laboratory Works based on ETE281
MAT161: COORDINATE GEOMETRY AND VECTOR ANALYSIS (3 CREDITS)

TOPICS:
Transformation of coordinates, Straight lines, Parallel lines, Perpendicular lines, Number line,
Interval Notation, Rational Equation, Absolute Value Theorem, Inequality, Discriminate, Asymptotes,
Symmetricity, Matrix Application, Division Algorithm and Synthetic Division.
MAT141: DIFFERENTIAL AND INTEGRAL CALCULUS (3 CREDITS)

TOPICS:
Differential Calculus: Limits, continuity and differentiability, successive differentiation of various
types of functions, Leibnitz’s theorem, Mean-value theorem in finite and infinite forms, Lagrange’s
form of remainders, Cauchy’s form of remainder, expansion of functions, evaluation of indeterminate
forms by L’Hospital’s rule, partial differentiation, Tangent and Normal, Subtangent and Subnormal in
Cartesian and Polar coordinates, maximum and minimum values of functions of single variable, points
of inflexion, curvature – radius of curvature, centre of curvature, asymptotes, curve tracing.
Integral Calculus: Definitions of Integration, integrations by methods of substitutions, integration by

parts, standard integrals, integration by the method of successive reduction, definite integrals and its
properties and use in summing series, Walli’s formula, Improper integrals, Beta function & Gamma
function, area under a plane curve in Cartesian and polar coordinates, area of the region enclosed by
two curves in Cartesian and Polar coordinates: Arc lengths of curves in Cartesian and Polar
coordinates, parametric and pedal equations, intrinsic equations, volume of solids of revolutions,
volume of hollow solids of revolution by shell method, area of surface of revolution, Jacobian, multiple
integrals and its applications.
MAT241: COMPLEX VARIABLES AND TRANSFORMS (LAPLACE AND FOURIER) (3

CREDITS)
PREREQUISITE(S): MAT161, MAT141
TOPICS:
Complex Variables: complex number system, general function of a complex variable, limits and
continuity of a function of a complex variable and related theorems, complex differentiation, the
Cauchy-Riemann equation, mapping by elementary functions, line integral of a complex function,
Cauchy’s Integral Theorem and formula, Liouville’s theorem, Taylor’s theorem, Laurent’s theorem,
Singular points, Residue, Cauchy’s Residue Theorem, evaluation of Residues, Contour integration,
conformal mapping.
Laplace Transforms: Laplace transforms of some elementary functions, sufficient conditions for
existence of Laplace Transforms, inverse Laplace transforms, Laplace transforms of derivatives, the
Page 28 of 31
unit step function, periodic function, some special theorems on Laplace transforms, partial fractions,
solutions of differential equations.
Fourier Transforms: Real and complex form of Fourier series, finite transforms, Fourier Integral,
Fourier transforms and their uses in solving boundary value problems of wave equations.
MAT261: LINEAR ALGEBRA AND MATRICES (3 CREDITS)

PREREQUISITE(S): MAT241
TOPICS:
Definition of matrix, different types of matrices, algebra of matrices, adjoint and inverse of a matrix,
elementary transformations of a matrix, matrix polynomials, canonical forms, Rank of matrices.
System of linear equations (homogeneous and nonhomogeneous) and their solutions. Applications of
system linear equations in real life problems.
Definition and properties of vector space, subspaces, Linear combination of vectors, Linear
dependence and independence of vectors, basis and dimension, linear transformations ,kernel and
image of a linear transformation(LT), definition and properties, linear operator matrix, matrix
representation of linear transformations, change of basis, Eigenvalues and eigenvectors,
Diagonalization, Cayley-Hamilton theorem and its application.
MGT281: INTRODUCTION TO BUSINESS AND MANAGEMENT (3 CREDITS)

TOPICS:
Concepts of Business, its components, classifications, importance, national and international business,
group dynamics and leadership in business and non-businesses organizations.
Introduction to the components of management in information system and their integration for
managerial control and decision support. Principle and process of management, types of management,
Management in Engineering.
PHY161: PHYSICS – I (3 CREDITS)

TOPICS:
Mechanics: Kinematics, Graphical representations of displacement-time, velocity-time and
acceleration-time. Terminal velocity. Motion in two and three dimensions – projectile motion.
Applications of Newton’s laws of motion, Analyses of frames of trusses, Friction, Equilibrium of
forces, Work-kinetic energy theorem., Power, Conservative forces. Conservation of energy.
Conservation of linear momentum for a system of particles. Center-of-mass motion. Elastic and
inelastic collision in one dimension. Rotational kinematics. Angular momentum of a single particle.
Conservation of angular momentum Moment of Inertia, Balancing of rotating masses. Gravitation:
Gravitational field. Kepler’s laws.
Waves and oscillations: Differential equation of simple harmonic oscillator, total energy and average
energy, combination of simple harmonic oscillations, spring mass system, torsional pendulum; two
body oscillation, reduced mass, damped oscillation, forced oscillation, resonance, progressive wave,
power and intensity of wave, stationary wave, group and phase velocities.
Page 29 of 31
Heat and Thermodynamics: Heat and work- the first law of thermodynamics and its applications;
Kinetic Theory of gases- Kinetic interpretation of temperature, specific heats of ideal gases,
equipartition of energy, mean free path, Maxwell’s distribution of molecular speeds, reversible and
irreversible processes, Carnot’s cycle, second law thermodynamics, Carnot’s theorem, entropy,
Thermodynamic functions, Maxwell relations, Clausius and Clapeyron equation.
PHY181: PHYSICS-II (3 CREDITS)

PREREQUISITE(S): PHY161
TOPICS:
Electricity and Magnetism: Electric charge and Coulomb’s law, Electric field, concept of electric flux
and the Gauss’s law- some applications of Gauss’s law, Gauss’s law in vector form, Electric potential,
relation between electric field and electric potential, capacitance and dielectrics, gradient, Laplace’s
and Poisson’s equations, Current, Current density, resistivity, the magnetic field, Ampere’s law,
Biot-Savart law and their applications.
Optics: Defects of images: spherical aberration, astigmatism, coma, distortion, curvature, chromatic
aberration. Theories of light; Interference of light: Young’s double slit experiment, displacement of
fringes and its uses, Fresnel bi-prism, interference in thin films, Newton’s rings,Bragg’s law and
diffraction, interferometers; Diffraction: Diffraction by single slit, diffraction from a circular aperture,
resolving power of optical instruments, diffraction at double slit and N-slits, diffraction grating;
polarization: Production and analysis of polarized light, Brewster’s law, Malus law, polarization by
double refraction, Nicol prism, optical activity, Polarimeters.
Reference Book(s):
1.A Text Book of Optics - Brijlal and Subramannyam
2.Fundamentals of optics - Francis and harve
3. Waves and oscillation - Brijlal and Subramannyam
4.Physics part-I - Resnick and Haliday
5.Physics part-II - Resnick and Haliday
6.Fundamentals of Physcs - Haliday, Resnick and Walker
7.Electricity & Magnetism - K.K Tewari
8.Elementary Solid State Physics -M Ali Omar
PHY182: PHYSICS LAB (1 CREDIT)

PREREQUISITE(S): PHY161
TOPICS: Laboratory Works based on PHY161 and PHY 1031.

Page 30 of 31
Reference Book(s):
1. Practical Physics –Dr. Giasuddin.

2. Practical Physics –C.L Arora.
SOC341: ENGINEERING ETHICS (3 CREDITS)

PREREQUISITE(S): Completion of 80 Credits
TOPICS:
Ethics and Professionalism: Micro & Macro Issues, Dimension of Engineering; Moral Reasoning and
Code of Ethics; Right, Duty, Virtue, Self Realization Ethics, Utilitarians; Engineering as Social
Experimentation, Workplace Responsibilities: Confidentiality, Conflict of Interest, Professional Right;
Whistle Blowing; Academic and Research Integrity; Computer Ethics: Ethics for IT Professional and
IT Users, Internet Crime; Environmental Ethics; Global Justice and International Rights; Case Studies
in Professional behavior.
STA281: STATISTICAL METHODS AND PROBABILITY (3 CREDITS)

TOPICS:
Data and variables, central tendency, dispersion, skewness, kurtosis, probability, random variables,
probability distributions, mathematical expectation and moment generating functions, joint & marginal
distributions, stochastic independence, central limit theorem, concepts of Sampling & its various
methods, design of an experiment & analysis of variance, concepts of estimation, methods of
estimation, hypothesis testing & inference. Concepts of Sample Survey & its various methods- S.R.S;
St.R.S. Systematic Sampling & Multi stage Sampling. Analysis of variance- One way, Two way &
Three way Classification. Design of an experiment-CRD, RBD,LSD & Fractorial Experiment.
Concepts of estimation- Criteria of a good estimator, Point estimation- Method of Moment, Least
square, MLE, Min. Chai-square & Bayes Estimator. Interval Estimation-Confidence Interval, Feducial
interval. Large & small Sample Test of significance & Hypothesis Testing. Non-Parametric Test.
Page 31 of 31

SEU CSE Course Curriculum Fresh 150credit

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SEU CSE Course Curriculum Fresh 150credit

Uploaded by

Copyright:

Available Formats

COURSE CURRICULUM OF

Department of Computer Science and Engineering (CSE)

Aims and Objectives:

Basic Sciences (Theory) 2 6

Basic Sciences (Lab) 1 1

Mathematics & Statistics 5 15

Interdisciplinary Engineering Courses (Theory) 3 9

Interdisciplinary Engineering Courses (Lab) 3 3

Core Courses (Theory) 18 54

Core Courses (Lab) 12 12

Core Courses (Research & Project or Internship) 2 6

Two optional courses with Lab 2 8

Other optional courses (With or without lab) 4 or above 12

Total 60 or above 150

2 ENG103 Advanced English Skills ENG102 3

3 EEE181 Electrical Circuits Design I Nil 3

4 EEE182 Electrical Circuits Design I Lab Nil 1

5 PHY181 Physics II PHY161 3

6 PHY182 Physics II Lab PHY161 1

2 CSE263 Digital Logic Design CSE161 3

3 CSE264 Digital Logic Design Lab CSE161 1

4 MAT261 Linear Algebra and Matrices MAT241 3

5 CSE265 Algorithm CSE241 3

3 CSE282 Introduction to Programming Language II (Java) Lab CSE161, 1

6 STA281 Statistical Methods & Probability Nil 3

2 CSE342 Computer Networking Lab ETE281 1

3 CSE343 Computer Architecture CSE263 3

2 CSE383 Database Design CSE281 3

3 CSE384 Database Design Lab CSE281 1

6 CSE365 Artificial Intelligence CSE265 3

2 CSE382 Introduction to Embedded Systems Lab CSE364 1

5 Elective II Any course from Group B 3

4 Elective III* Any course from Group A * 3

5 Elective IV* Any course from Group B * 3

2 ECO461 Introduction to Economics Nil 3

3 Elective V* Any course from Group A * 3

4 Elective VI* Any course from Group A * 3

Elective Courses: Group A (Without Lab)::

Course Course Title Credits Prerequisites

Course Course Title Credits Prerequisites

ETE452 Digital Signal Prosessing Lab 1 ETE358

CSE351 Advanced Java 3 CSE281

CSE161: PROGRAMMING LANGUAGE I (3 CREDITS)

CSE162: PROGRAMMING LANGUAGE – I (C) LAB (1 CREDIT)

TOPICS: Laboratory Work based on CSE161

CSE181: DISCRETE MATHEMATICS (3 CREDITS)

CSE261: NUMERICAL METHODS (3 CREDITS)

CSE241: DATA STRUCTURES (3 CREDITS)

CSE242: DATA STRUCTURES (1 CREDIT)

TOPICS: Laboratory Work based on Theory Course CSE241

CSE263: DIGITAL LOGIC DESIGN (3 CREDITS)

CSE264: DIGITAL LOGIC DESIGN LAB (1 CREDIT)

TOPICS: Laboratory Work based on Theory Course CSE263

CSE281: PROGRAMMING LANGUAGE – II (OOP IN JAVA AND C++) (3 CREDITS)

CSE282: PROGRAMMING LANGUAGE – II (OOP IN JAVA AND C++) LAB (1 CREDIT)

TOPICS: Laboratory Work based on Theory Course CSE281

CSE265: ALGORITHM (3 CREDITS)

CSE266: ALGORITHM LAB (1 CREDIT)

TOPICS: Laboratory Work based on Theory Course CSE265

CSE375: ADVANCED ALGORITHM (3 CREDITS)

CSE376: ADVANCED ALGORITHM LAB (1 CREDIT)

TOPICS: Laboratory Work based on Theory Course CSE375

CSE383: DATABASE DESIGN (3 CREDITS)