Lab works based on CSE 4401.
Course Catalogue
Course Code: CSE 4402
Course Name:
Computer Graphics Lab
Credit Hours:
1.00
Detailed Syllabus:
Course Code: CSE 4403
Course Name:
Advanced Algorithm
Credit Hours:
3.00
Detailed Syllabus:
Computational complexity, Parameterized complexity, Algorithms for combinatorial optimization, practical computing and heuristics, Approximation algorithms, LP based approximation algorithms, randomized algorithms, Experimental algorithmic, Algorithms in state-of-the-art fields like Bioinformatics, Grid Computing, VLSI design etc.
Course Code: CSE 4405
Course Name:
Compiler Design
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:
Theory and Practice; An introduction to compiler and interpreter design, with emphasis on practical solutions using compiler writing tools such as Yacc in UNIX, and the C programming language, Topics covered include: lexical scanners, context free languages and pushdown automata, recursive descent parsing, bottom up parsing, attributed grammars, symbol table design, run time memory allocation, machine language, code generation and optimisation.
Course Code: CSE 4406
Course Name:
Compiler Design Lab
Prerequisite:
Credit Hours:
1.00
Detailed Syllabus:
Lab works based CSE 4405.
Course Code: CSE 4407
Course Name:
Basic Graph Theory
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:
simple graphs, digraphs, subgraphs, vertex-degrees, walks, paths and cycles; Trees, spanning trees in graphs, distance in graphs; Complementary graphs, cut-vertices, bridges and blocks, k-connected graphs; Euler tours, Hamiltonian cycles, Chinese Postman Problem, Traveling Salesman Problem; Chromatic number, chromatic polynomials, chromatic index, Vizing’s theorem, planar graphs, perfect graphs.
Course Code: CSE 4407
Course Name:
Basic Graph Theory
Prerequisite:
Credit Hours:
3.00
Detailed Syllabus:
Simple graphs, digraphs, subgraphs, vertex-degrees, walks, paths and cycles; Trees, spanning trees in graphs, distance in graphs; Complementary graphs, cut-vertices, bridges and blocks, k-connected graphs; Euler tours, Hamiltonian cycles, Chinese Postman Problem, Traveling Salesman Problem; Chromatic number, chromatic polynomials, chromatic index, Vizing’s theorem, planar graphs, perfect graphs.
Course Code: CSE 4409
Course Name:
Mathematical Analysis for Computer Science
Credit Hours:
3.00
Detailed Syllabus:
Recurrent problems; Manipulation of sums; Number theory; Special numbers; Generating functions. Random variables; Stochastic process; Markov chains: discrete parameter, continuous parameter, birth-death process; Queuing models: birth-death model, Markovian model, open and closed queuing network; Application of queuing models.
Course Code: CSE 4411
Course Name:
Computational Geometry
Credit Hours:
3.00
Detailed Syllabus:
Topics in surface modeling: b-splines, non-uniform rational b-splines, physically based deformable surfaces, sweeps and generalized cylinders, offsets, blending and filleting surfaces. Non-linear solvers and intersection problems. Solid modeling: constructive solid geometry, boundary representation, non-manifold and mixed-dimension boundary representation models, octrees. Robustness of geometric computations. Interval methods. Finite and boundary element discretization methods for continuum mechanics problems. Scientific visualization. Variational geometry. Tolerances. Inspection methods. Feature representation and recognition. Shape interrogation for design, analysis, and manufacturing. Involves analytical and programming assignments.
Course Code: CSE 4413
Course Name:
Topics of Current Interest
Credit Hours:
3.00
Detailed Syllabus:
As necessary.
Course Code: CSE 4415
Course Name:
Data Communication
Credit Hours:
3.00
Detailed Syllabus:
Signal and random processes; Review of Fourier Transform; Hilbert Transform, continuous wave modulation: AM, PM, FM; Sampling theorem; Pulse modulation: PAM, PDM, PPM, PCM, companding, delta modulation, differential PCM; Multiple access techniques: TDM, FDM; Digital modulation: ASK, PSK, BPSK, QPSK, FSK, MSK, constellation, bit error rate (BER); Noise; Echo cancellation; Intersymbol Interference; Concept of channel coding and capacity. Synchronous and asynchronous communications; Hardware interfaces, multiplexers, concentrators and buffers; Communication mediums and their characteristics; Data communication services: SMDS and ATM; Error control codes: linear block codes, cyclic codes, MLDC codes, convolution codes, Trellis code modulation; Digital switching: space and time division switching; Radio system design; Fiber optics communication: transmitter, receivers, network components, WDM; Line coding, trunks, multiplexing, switching, ATM switches; Satellite communications: frequency bands and characteristics, types of satellites, transmission impairments, capacity allocation; Multiple access techniques.