4th Year Odd: Routine & Syllabus

8:00 am 8:50 am 9:40 am 10:50 11:40 12:30 2:30 pm 3:20 pm 4:10 pm

am am pm
CSE 4101 CSE 41 CSE 4107 CSE 4102
A MKP MAR EKH JR + MKP
101 101 101 New Lab
CSE 4108 / CSE 4106 CSE 4105 CSE 4101 CSE 41
B MRI + EKH / MAM + RT RT MKP MAR
New / SW2 103 103 103
CSE 4104 CSE 4107 CSE 41 CSE 4103
C AA + MAR EKH MAR AA
New 204 204 204
CSE 4101 CSE 4103 CSE 4107 CSE 4105
D MKP AA EKH RT
102 102 102 102
CSE 4103 CSE 4105
E AA RT
201 201

Sl. Theory Sessional

Course No. Course Title Credit
No. Hrs./Week Hrs./Week
1 CSE 4100 Project/Thesis I 0 2 1.00
2 CSE 4101 Compiler Design 3 0 3.00
3 CSE 4102 Sessional Based on CSE 4101 0 3/2 0.75
4 CSE 4103 Digital Signal Processing 3 0 3.00
5 CSE 4104 Sessional Based on CSE 4103 0 3/2 0.75
6 CSE 4105 Digital Image Processing 3 0 3.00
7 CSE 4106 Sessional Based on CSE 4105 0 3/2 0.75
8 CSE 4107(*) Optional I 3 0 3.00
9 CSE 4108(*) Sessional Based on Optional I 0 3/2 0.75
10 CSE 4109(*) Optional II 3 0 3.00
Total= 15 9.00 19.00

1|Page
 List of Optional Courses
Theory Sessional
Course No. Course Title Credit
Hrs./Week Hrs/Week
CSE 4107(a) Information System Analysis & Design 3 0 3.00
CSE 4108(a) Sessional Based on CSE 4107 0 3/2 0.75
Optional I

CSE 4107(b) Unix Programming 3 0 3.00

CSE 4108(b) Sessional Based on CSE 4109 0 3/2 0.75
CSE 4107(c) Digital System Design 3 0 3.00
CSE 4108(c) Sessional Based on CSE 4111 0 3/2 0.75
CSE 4107(d) Simulation & Modeling 3 0 3.00
CSE 4108(d) Sessional Based on CSE 4113 0 3/2 0.75
CSE 4107(e) Wireless Networks 3 0 3.00
CSE 4108(e) Sessional Based on CSE 4115 0 3/2 0.75
CSE 4109(a) Parallel and Distributed Processing 3 0 3.00
Optional

CSE 4109(b) Human Computer Interaction 3 0 3.00

II

CSE 4109(c) Switching Systems 3 0 3.00

CSE 4109(d) Control System Engineering 3 0 3.00

4TH YEAR ODD SEMESTER

CSE 4100 Contact hours/week: 2

Project / Thesis I Credits: 1.00
Prerequisite: None

Study of problems in the field of Computer Science and Engineering.

N.B. The project/thesis topic selected in this course is to be continued in the CSE 4200 course.

CSE 4101 Contact hours/week: 3

Complier Design Credits: 3.00
Prerequisite: CSE 2205

Introduction to Compiler: Compiler structure, analysis-synthesis model of compilation, various phases of a

compiler, tool based approach to compiler construction, Complier-compliers and translator writing systems.

Lexical Analysis: interface with input, parser and symbol table, token, lexeme and patterns, difficulties in
lexical analysis, error reporting, implementation, regular definition, transition diagrams, LEX.

Syntax Analysis: CFGs, ambiguity, associativity, precedence, top down parsing, recursive descent parsing,
transformation on the grammars, predictive parsing, bottom up parsing, operator precedence grammars, LR
parsers (SLR, LALR, LR), YACC.

Syntax Directed Definitions: inherited and synthesized attributes, dependency graph, evaluation order,
bottom up and top down evaluation of attributes, L- and S-attributed definitions.

Type Checking: type system, type expressions, structural and name equivalence of types, type conversion,
overloaded functions and operators, polymorphic functions.

Run Time System: storage organization, activation tree, activation record, parameter passing, symbol table,
dynamic storage allocation, Heap storage management.

2|Page
Intermediate Code Generation: intermediate representations, translation of declarations, assignments,
control flow, boolean expressions and procedure calls, implementation issues.

Code Generation and Instruction Selection: issues, basic blocks and flow graphs, register allocation, code
generation, dag representation of programs, code generation from dags, peep hole optimization, code generator
generators, specifications of machine.

CSE 4102 Contact hours/week: 3/2

Sessional based on CSE 4101 Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4101.

CSE 4103 Contact hours/week: 3

Digital Signal Processing Credits: 3.00
Prerequisite: None

Introduction: signals, systems and signal processing, classification of signals, the concept of frequency in
continuous time and discrete time signals, analog to digital and digital to analog conversion, Sampling and
quantization.

Discrete time signals and systems: Discrete time signals, discrete time systems, analysis of discrete time
linear time invariant systems. Discrete time systems described by difference equations, implementation of
discrete time systems, correlation and convolution of discrete time signals.

The z-transform: Introduction, definition of the z-transform, z-transform and ROC of infinite duration
sequence, properties of z-transform inversion of the z-transform, the one-sided z-transform.

Frequency analysis of signals and systems: Frequency analysis of continuous time signals, Frequency
analysis of discrete time signals, Properties of Fourier transform of discrete time signals, Frequency domain
characteristics of linear time invariant system, linear time invariant systems as frequency selective filters,
Inverse systems and deconvolution.

Discrete Fourier Transform (DFT): Discrete Fourier Series (DFS), Properties of DFS, Discrete Fourier
Transformation (DFT), Properties and application of DFT.

Fast Fourier Transform Algorithms: FFT algorithms, applications of FFT algorithm.

Digital Filter Design Techniques: Differential and difference equations, Digital Transfer Functions,
frequency response, Digital filter realization scheme, Finite Impulse response (FIR) Infinite Impulse Response
(IIR) filter design.

Application of DSP: Speech processing, analysis and coding, Matlab application to DSP.
Recommended Books :

CSE 4104 Contact hours/week: 3/2

Sessional based on CSE 4103 Credits: 0.75
Prerequisite: None
Sessional based on the theory of course CSE 4103.

3|Page
CSE 4105 Contact hours/week: 3
Digital Image Processing Credits: 3.00
Prerequisite: None

Digital Image Fundamentals: Different types of digital images, sampling and quantization, imaging
geometry, image acquisition systems.

Bilevel Image Processing: Basic concepts of digital distances, distance transform, medial axis transform,
component labeling, thinning, morphological processing, extension to grey scale morphology.

Binarization of Grey level images: Histogram of grey level images, optimal thresholding using Bayesian
classification, multilevel thresholding.

Detection of edges : First order and second order edge operators, multi-scale edge detection, Canny's edge
detection algorithm, Hough transform for detecting lines and curves, edge linking.

Images Enhancement: Point processing, Spatial Filtering, Frequency domain filtering, multi-spectral image
enhancement, image restoration.

Image Segmentation: Segmentation of grey level images, Water shade algorithm for segmenting grey level
image. Image representation and description, recognition and interpretation.

Image compression: Lossy and lossless compression schemes, prediction based compression schemes, vector
quantization, sub-band encoding schemes, JPEG compression standard, Fractal compression scheme, Wavelet
compression scheme.

CSE 4106 Contact hours/week: 3/2

Sessional based on CSE 4105 Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4105.

Optional I

CSE 4107(a) Contact hours/week: 3

Information System Analysis & Design Credits: 3.00
Prerequisite: CSE 3105

Application Development Policy and Strategies: Planning of information system, Policy in information
system development, Strategies for achieving information system Goals.

Application System Development Life Cycle: Phases in application system development, Interrelationship
among each phase.

Feasibility Assessment: Problems and Needs in information system development, Preliminary application
requirements determination, Feasibility assessment: Economic, technical, operational and schedule feasibility.

Information Requirements Determination: Strategies for obtaining information requirements, Technique

for information requirements determination, Methods for providing assurance that requirement are correct and
complete.

4|Page
Structured Systems Analysis: Steps in structured systems analysis, Activity diagrams and related
documentation, Data dictionary, Problem analysis, structured walk through.

Systems Design Methodology: Check list methodology, Process-oriented methodology, Application

Generator, Structured design, Program development and testing: structured Programming and Method for
testing.

CSE 4108(a) Contact hours/week: 3/2

Sessional based on CSE 4107(a) Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4107(a).

CSE 4107(b) Contact hours/week: 3

Unix Programming Credit: 3.00
Prerequisite: None

Introduction: Introduction to Unix Programming.

Unix Environment: command line, globbing, I/O redirection, piping, basic commands, Memory layout.

Debugging: GDB, valgrind, essential x86, Fork, exec, wait, Process status, bit manipulation, sending signals
Unix I/O Implementing I/O redirection, piping Directories and files. Walking a directory tree, exploring
attributes. Implementing ls -l. Permissions, file owner / group, time-stamps. Signals and signal handling
Design / implementation of sleep Process Relationships Backgrounding. Popen / pclose Midterm Terminal
handling Review midterm Networking Client / Server. I/O multiplexing.

Multi-threading: basics, mutual exclusion Multi-threading: bounded buffers, condition variables Multi-
threading: deadlocks Non-blocking I/O. Regular expressions. Sys V IPC. Semaphores and shared memory.
Shell scripting.

CSE 4108(b) Contact hours/week: 3/2

Sessional based on CSE 4107(b) Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4107(b).

CSE 4107(c) Contact hours/week: 3

Digital System Design Credit : 3.00
Prerequisite: CSE 2103

System Design: Designing I/O system; I/O devices; Designing Microprocessor based system with interfacing
chips;

Programmable Design: Programmable peripheral interface (interface to A/D and D/A converter);
Keyboard/display interface; Programmable timer; Programmable interrupt controller, DMA controller;

Memory Design: Design using MSI and LSI components; Design of memory subsystem using SRAM and
DRAM;

Design of various components of a computer: ALU, memory and control unit, hardwired and micro
programmed; Microprocessor based designs; Computer BUS standards; Design special purpose controllers.
5|Page
 CSE 4108(c) Contact hours/week: 3/2
Sessional based on CSE 4107(c) Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4107(c).

CSE 4107(d) Contact hours/week: 3

Simulation & Modeling Credits: 3.00
Prerequisite: None

Simulation modeling basics: systems, models and simulation; Classification of simulation models; Steps in
a simulation study.

Concepts in discrete-event simulation: event-scheduling vs. process-interaction approaches, time-advance

mechanism, organization of a discrete-event simulation model; Continuous simulation models; Combined
discreet-continuous models; Monte Carlo simulation; Simulation of queuing systems.

Building valid and credible simulation models: validation principles and techniques, statistical procedures
for comparing real-world observations and simulated outputs, input modeling; Generating random numbers
and random variates; Output analysis. Simulation languages; Analysis and modeling of some practical
systems.

CSE 4108(d) Contact hours/week: 3/2

Sessional based on CSE 4107(d) Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4107(d).

CSE 4107(e) Contact hours/week: 3

Wireless Networks Credits: 3.00
Prerequisite: CSE 3205

Introduction to wireless networks: wireless access networks – wireless mesh networks, personal area
networks (wireless sensor networks, body area networks, LowPan, and Bluetooth), wireless and mobile ad
hoc networks, challenged networks (DTNs, VANETs).

Wireless MAC protocols: IEEE 802.11, IEEE 802.11e, IEEE 802.11n, IEEE 802.11s, IEEE 802.15.4, S-
MAC, B-MAC, IEEE 802.22/20, IEEE 802.16d/e.

Wireless routing: routing matrix – ETX, ETT, WCETT, Air Time Metric, routing protocols – AODV, DSR,
DSDV, HWMP, sensor network routing, VANET routing etc.

Others: Wireless Transport protocols; Wireless TCP and its variants, Hop by Hop Congestion Control, Rate
based Congestion Control etc. Quality of Service in Wireless Networks.

CSE 4108(e) Contact hours/week: 3/2

Sessional based on CSE 4107(e) Credits: 0.75
Prerequisite: None

Sessional based on the theory of course CSE 4107(e).

6|Page
 Optional 2
CSE 4109(a) Contact Hours/week: 3
Parallel and Distributed Processing Credits:3.00
Prerequisite: None

Multithreaded computing: Basic concepts: processes, threads, scheduling, Multithreaded programming,

Thread synchronization: semaphores, locks, monitors , Concurrency issues: deadlock, starvation , Multi-core
computers.

Networked computers: Basic concepts: client-server, connections, datagrams , Application protocol design ,
Client-side socket programming ,Server-side socket programming, Datagram programming.

Network protocols and security: Physical/data link/network/transport/application layers, Network security.

Distributed systems: Architectures: Two-tier, multi-tier, peer-to-peer, many-to-many, Middleware:

distributed objects, web services.

Parallel computing: Architectures: SMP, cluster, hybrid, grid, GPGPU ,Middleware: OpenMP, MPI, grid
middleware.

CSE 4109(b) Contact hours/week: 3

Human Computer Interaction Credits: 3.00
Prerequisite: None

Process and Model: Introduction to Human-computer interaction (HCI), human information processing
systems, Models of interaction, Approaches to HCI, User interface, HCI in software process, Cognitive
models.

Issues and Requirements: Socio-organizational Issues and stakeholders Requirements, Communication and
collaboration models, Task Analysis, Dialog notation and design, Groupware, CSCW and social issues.

User system interaction: analysis and design, User interface design, Interface technique and technology, case
studies.

CSE 4109(c) Contact hours/week: 3

Switching Systems Credits: 3.00
Prerequisite: None

Evolution of Switching Systems: The Role of Switching Systems in Telecommunication Networks, Step By
Step and Crossbar, Stored Program Control (SPC), Digital Switching, ATM Switching.

Switching System Architecture: Subscriber and Line Interface, Switching Network: Matrix and Channel
Graph Representations, Blocking, Non-Blocking, and Rearrangeable Networks, Control Unit, Operation and
Maintenance, Switching Process: Call Detecting, Number Analysis, Call Routing, Supervision, and Metering,
Signaling Equipment.

7|Page
Hardware and Software Structure of the Digital Switch: Time Switches and Space Switches, Path
Searching, Processor Systems Architecture and Functions, Reliability and Fault Recovery, Man Machine
Interface (MMI), Examples of the Present Digital Switching Systems.

ATM Switching Architectures and Performance: ATM Switch Architectures, Full-, and Partial-Connection
Multistage Networks, Self-Routing Networks, ATM Switching Structures: Minimum-Depth Blocking
Networks, Non-Blocking Single-, and Multiple-Queuing Networks, Arbitrary-Depth Blocking Networks,
Fault-Tolerant ATM Switching Architectures.

New Trends in Switching: Photonic Switching, IP Switching

CSE 4109(d) Contact hours/week: 3

Control System Engineering Credits: 3.00
Prerequisite: None

Introduction to control system: Conventional control system, steady state response to step, ramp, and
parabolic inputs, transient response, poles and zeros, frequency response from pole-zero diagram, Routh’s
stability criterion; block diagrams, canonical forms, transfer functions and signal flow graph, root locus,
frequency response, Nyquist’s stability criterion.

Modern control system: Introduction, state variable analysis, controllability and observability, application
of Eigen value, linear control system design by state feedback.

Controller design: On-off, fuzzy, P, PI, PD and PID types, introduction to programmable logic controllers
(PLC), temperature control system, position control system.

8|Page