RTU 5th Sem CSE Syllabus
Unit-wise

1. Unit 1

   Introduction:Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Introduction to information theory: Uncertainty, Information and Entropy, Information measures for continuous random variables, source coding theorem. Discrete Memory less channels, Mutual information, Conditional entropy.

   5 hrs
3. Unit 3

   Source coding schemes for data compaction: Prefix code, Huffman code, Shanon -Fane code &Hempel -Ziv coding channel capacity. Channel coding theorem. Shannon limit.

   5 hrs
4. Unit 4

   Linear Block Code: Introduction to error connecting codes, coding & decoding of linear block code, minimum distance consideration, conversion of non -systematic form of matrices into systematic form.

   5 hrs
5. Unit 5

   Cyclic Code: Code Algebra, Basic properties of Galois fields (GF) polynomial operations over Galois fields, generating cyclic code by generating polynomial, parity check polynomial. Encoder & decoder for cyclic codes.

   6 hrs
6. Unit 6

   Convolutional Code: Convolutional encoders of different rates. Code Tree, Trllis and state diagram. Maximum likelihood decoding of convolutional code: The viterbi Algorithm fee distance of a convolutional code.

   6 hrs

Total: 28 lecture hours

1. Unit 1

   Introduction:Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Introduction: Objective, scope and outcome of the course. Compiler, Translator, Interpreter definition, Phase of compiler, Bootstrapping, Review of Finite automata lexical analyzer, Input, Recognition of tokens, Idea about LEX: A lexical analyzer generator, Error handling.

   6 hrs
3. Unit 3

   Review of CFG Ambiguity of grammars: Introduction to parsing. Top down parsing, LL grammars & passers error handling of LL parser, Recursive descent parsing predictive parsers, Bottom up parsing, Shift reduce parsing, LR parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing with ambiguous grammar. Operator precedence parsing, Int roduction of automatic parser generator: YACC error handling in LR parsers.

   10 hrs
4. Unit 4

   Syntax directed definitions; Construction of syntax trees, S - Attributed Definition, L -attributed definitions, Top down translation. Intermediate code forms using postfix nota tion, DAG, Three address code, TAC for various control structures, Representing TAC using triples and quadruples, Boolean expression and control structures.

   10 hrs
5. Unit 5

   Storage organization; Storage allocation, Strategies, Activation records, Accessing local and non-local names in a block structured language, Parameters passing, Symbol table organization, Data structures used in symbol tables.

   8 hrs
6. Unit 6

   Definition of basic block control flow graphs; DAG representation of basic block, Advantages of DAG, Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation, Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from DAG.

   7 hrs

Total: 42 lecture hours

1. Unit 1

   Introduction:Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Introduction a nd H istory of Operating systems: Structure and operations; processes and files Processor management: inter process communication, mutual exclusion, semaphores, wait and signal procedures, process scheduling and algorithms, critical sections, threads, multithreading

   4 hrs
3. Unit 3

   Memory management: contiguous memory allocation, virtual memory, paging, page table structure, demand paging, page replacement policies, thrashing, segmentation, case study

   5 hrs
4. Unit 4

   Deadlock: Shared resources, resource allocation and scheduling, resource graph models, deadlock detection, deadlock avoidance, deadlock prevention algorithms Device management: devices and their characteristics, device drivers, device handling, disk scheduling algorithms and policies

   15 hrs
5. Unit 5

   File management: file concept, types and structures, directory structure, cases studies, access methods and matrices, fil e security, user authentication

   7 hrs
6. Unit 6

   UNIX and Linux operating systems as case studies; Time OS and case studies of Mobile OS

   8 hrs

Total: 40 lecture hours

1. Unit 1

   Introduction: Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Basic of Computer Graphics: Basic of Computer Graphics, Applications of computer graphics, Display devices, Random and Raster scan systems, Graphics input devices, Graphics software and standards

   6 hrs
3. Unit 3

   Graphics Primitives:Points, lines, circles and ellipses as primitives, scan conversion algorithms for primitives, Fill area primitives including scan - line polygon filling, inside -outside test, boundary and flood -fill, character generation, line attributes, area-fill attributes, character attributers. Aliasing, and introduction to Anti Aliasing (No anti aliasing algorithm).

   7 hrs
4. Unit 4

   Two Dimensional G raphics:Transformations (translation, rotation, scaling), matrix representation, homogeneous coordinates, composi te transformations, reflection and shearing, viewing pipeline and coordinates system, window -to-viewport transformation, clipping including point clipping, line clipping (cohen -sutherland, liang - bersky, NLN), polygon clipping

   8 hrs
5. Unit 5

   Three Dimensional Graphics:3D display methods, polygon surfaces, tables, equations, meshes, curved lies and surfaces, quadric surfaces, spline representation, cubic spline interpolation methods, Bazier curves and surfaces, B -spline curves and surfaces.3D scaling, rotation a nd translation, composite transformation, viewing pipeline and coordinates, parallel and perspective transformation, view volume and general (parallel and perspective) projection transformations.

   8 hrs
6. Unit 6

   Illumination and Colour M odels:Light sources – basic illumination models – halftone patterns and dithering techniques; Properties of light – Standard primaries and chromaticity diagram; Intuitive colour concepts – RGB colour model – YIQ colour model – CMY colour model – HSV colour model – HLS colour model; Colour selection.

   6 hrs
7. Unit 7

   Animations &Realism:Design of Animation sequences – animation function – raster animation – key frame systems – motion specification – morphing – tweening. ComputerGraphics Realism: Tiling the plane – Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals – Grammar based models – fractals – turtle graphics – ray tracing.

   6 hrs

Total: 42 lecture hours

1. Unit 1

   Introduction: Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Background: Review of Algorithm, Complexity Order Notations: definitions and calculating complexity. Divide And Conquer Method: Binary Search, Merge Sort, Quick sort and Strassen's matrix multiplication algorithms.

   6 hrs
3. Unit 3

   Greedy Method: Knapsack Problem, Job Sequencing, Optimal Merge Patterns and Minimal Spanning Trees. Dynamic Programming: Matrix Chain Multiplicatio n. Longest CommonSubsequence and 0/1 Knapsack Problem.

   10 hrs
4. Unit 4

   Branch And Bound: Traveling Salesman Problem and Lower Bound Theory. Backtracking Algorithms and queens problem. Pattern Matching Algorithms: Naïve and Rabin Karp string matching algorithms, KMP Matcher and Boyer Moore Algorithms.

   8 hrs
5. Unit 5

   Assignment Problems: Formulation of Assignment and Quadratic Assignment Problem. Randomized Algorithms - Las Vegas algorithms, Monte Carlo algorithms, randomized algorithm for Min -Cut, randomized algorithm for 2 - SAT. Problem definition of Multicommodity flow, Flow shop scheduling and Network capacity assignment problems.

   8 hrs
6. Unit 6

   Problem Classes Np, Np -Hard And Np -Complete: Definitions of P, NP -Hard and NP -Complete Problems. Decision Problems.Cook's Theorem. Proving NP - Complete Problems - Satisfiability problem and Vertex Cover Problem. Approximation Algorithms for Vertex Cover andSet Cover Problem.

   8 hrs

Total: 41 lecture hours

1. Unit 1

   Introduction: Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Wireless Channels:Large scale path loss – Path loss models: Free Space and Two -Ray models -Link Budget design – Small scale fading- Parameters of mobile multipath channels – Time dispersion parameters-Coherence bandwidth – Doppler spread & Coherence time, Fading due to Multipath time delay spread – flat fading – frequency selective fading – Fading due to Doppler spread – fast fading – slow fading.

   6 hrs
3. Unit 3

   Cellular Architecture: Multiple Access techniques - FDMA, TDMA, CDMA – Capacity calculations–Cellular concept- Frequency reuse - channel assignment - hand off - interference & system capacity- trunking & grade of service – Coverage and capacity improvement.

   5 hrs
4. Unit 4

   Digital Signaling For Fading Channels: Structure of a wireless communication link, Principles of Offset -QPSK, p/4 -DQPSK, Minimum Shift Keying, Gau ssian Minimum Shift Keying, Error performance in fading channels, OFDM principle – Cyclic prefix, Windowing, PAPR.

   5 hrs
5. Unit 5

   Multipath Mitigation Techniques: Equalisation – Adaptive equalization, Linear and Non -Linear equalization, Zero forcing and LMS Algorit hms. Diversity – Micro and Macrodiversity, Diversity combining techniques, Error probability in fading channels with diversity reception, Rake receiver,

   6 hrs
6. Unit 6

   Multiple Antenna Techniques: MIMO systems – spatial multiplexing -System model -Pre-coding - Beam forming - transmitter diversity, receiver diversity- Channel state information- capacity in fading and non-fading channels.

   5 hrs

Total: 28 lecture hours

1. Unit 1

   Introduction: Objective, scope and outcome of the course.

2. Unit 2

   Historical evolution of the field, Interactive system design, Concept of usability -definition and elaboration, HCI and software Engineering, GUI design and Aesthetics, Prototyping techniques. 2 Model-based Design and evaluation: Basic idea, introduction to different types of models, GOMS family of models (KLM and CMN - GOMS), Fitts’ law and Hick-Hyman’s law, Model-based design case studies,

3. Unit 3

   Guidelines in HCI: Shneiderman’s eight, golden rules, Norman’s seven principles, Norman’s model of interaction, Nielsen’s ten heuristics with example of its use Heuristic evaluation, Contextual inquiry, Cognitive walkthrough

4. Unit 4

   Empirical research methods in HCI: Introduction (motivat ion, issues, research question formulation techniques), Experiment design and data analysis (with explanation of one-way ANOVA)

5. Unit 5

   Task modelling and analysis: Hierarchical task analysis (HTA), Engineering task models and Concur Task Tree (CTT),Iintroduction to formalism in dialog design, design using FSM (finite state machines) State charts and (classical) Petri Nets in dialog design

6. Unit 6

   Introduction to CA, CA types, relevance of CA in IS design Model Human Processor (MHP), OOP- Introduction OOM- Object Oriented Modeling of User Interface Design

1. Unit 1

   Introduction: Objective, scope and outcome of the course.

   1 hr
2. Unit 2

   Introduction: Basics of biology

   2 hrs
3. Unit 3

   Sequences: Problem Statement, Edit distance and substitution matrices, HMMs and pairwise HMMs, Global and local alignments, Spliced alignment, Space -efficient sequence alignment, Multiple alignment, Database searching tools, Sequence by hybridization, Profile HMMs

   7 hrs
4. Unit 4

   Structures: Protein structure alignment, Protein structure prediction

   6 hrs
5. Unit 5

   Phylogenetic trees: Large parsimony and small parsimony problems, Probabilistic approaches, Grammar-based approaches

   7 hrs
6. Unit 6

   Miscellaneous topics: Pathways and networks, Microarrays, Biomedical images

   5 hrs

Total: 28 lecture hours