Rajasthan Technical University, Kota

Detailed Syllabus for B.Tech. (Computer Engineering)

Session 2009-10 (Main Examination)
Name of Subject : COMPILER CONSTRUCTION (7 CS 1)
Unit Contents

I
Compiler, Translator, Interpreter definition, Phase of compiler introduction to one pass & Multipass
compilers,
Bootstrapping, Review of Finite automata lexical analyzer, Input, buffering, Recognition of tokens,
Idea about LEX: A
lexical analyzer generator, Error handling.

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

III
Syntax directed definitions; Construction of syntax trees, L-attributed definitions, Top down
translation. Specification
of a type checker, Intermediate code forms using postfix notation and three address code,
Representing TAC using
triples and quadruples, Translation of assignment statement. Boolean expression and control
structures.

IV
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.

V
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.
Rajasthan Technical University, Kota
Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Name of Subject : DATA MININIG AND WAREHOUSING (7 CS 2)
Unit Contents

I
Overview, Motivation(for Data Mining),Data Mining-Definition & Functionalities, Data Processing,
Form of Data
Preprocessing, Data Cleaning: Missing Values, Noisy Data, (Binning, Clustering, Regression,
Computer and Human
inspection), Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube
Aggregation,
Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and
Concept hierarchy
generation.

II
Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysis of
attribute relevance, Mining
Class comparisons, Statistical measures in large Databases. Measuring Central Tendency, Measuring
Dispersion of Data,
Graph Displays of Basic Statistical class Description, Mining Association Rules in Large Databases,
Association rule mining,
mining Single-Dimensional Boolean Association rules from Transactional Databases– Apriori
Algorithm, Mining Multilevel
Association rules from Transaction Databases and Mining Multi- Dimensional Association rules
from Relational Databases.

III
What is Classification & Prediction, Issues regarding Classification and prediction, Decision tree,
Bayesian
Classification, Classification by Back propagation, Multilayer feed-forward Neural Network, Back
propagation Algorithm,
Classification methods K-nearest neighbor classifiers, Genetic Algorithm. Cluster Analysis: Data
types in cluster analysis,
Categories of clustering methods, Partitioning methods. Hierarchical Clustering- CURE and
Chameleon. Density Based
Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE. Model Based Method –
Statistical Approach, Neural
Network approach, Outlier Analysis
IV
Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System
and Data Warehouse,
Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept
hierarchy, Process
Architecture, 3 Tier Architecture, Data Marting.

V
Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAP Servers,
ROLAP, MOLAP, HOLAP,
Data Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data
Warehouse.

Rajasthan Technical University, Kota

Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Name of Subject : LOGIC SYNTHESIS (7 CS 3)
Unit Contents

I
Introduction to VLSI, circuits Asics and Moore's Law. Microelectronic Design, Styles, four phases in
creating
Microelectronics chips computer Aided Synthesis and Optimization. Algorithms Review of Graph
Definitions and Notations
Decision and Optimization Problems, Shortest and Longest Path Problems, Vertex Cover, Graph,
Coloring, Clique covering
and partitioning Algorithms Boolean Algebra and Representation of Boolean Functions, binary
Decision diagrams.
Satisfiability and cover problems.

II
Hardware Modeling: Introduction to Hardware Modeling Language, State Diagrams. Data flow and
Sequencing
Graphs. Compilation and Behavioral Optimization Techniques. Circuits Specifications for
Architectural Synthesis
Resources and constraints. Fundamental Architectural Synthesis Problems Temporal Domain
Scheduling Spatial Domain
Binding Hierarchical Models and Synchronization Problem. Area and performance estimation-
Resource Dominated circuits
and General Circuits.
III
Scheduling Algorithms: Model for Scheduling Problems, Scheduling without Resource, Constraints-
Unconstrained
Scheduling ASAP Scheduling Algorithms Latency. Constrained Scheduling. ALAP scheduling.
Under Timing Constraints
and Relative Scheduling with Resource Constraints Integer Linear Programming Model,
Multiprocessor Scheduling,
Heuristic Scheduling Algorithms (List Scheduling). Force Directed Scheduling.

IV
Two Level Combination Logic Optimization: Logic Optimization Principles-Definitions, Exact
Logic Minimization,
Heuristic, Logic Minimization, and Testability Properties Operations on Two level logic Cover-
positional Cube Notation,
Functions with Multivolume inputs and list oriented manipulation. Algorithms for logic
minimization.

V
Sequential logic optimization: Introduction, Sequential circuit optimization using state based models-
state minimization,
state encoding. Sequential circuit optimization using network models. Implicit finite state machine
traversal methods.
Testability consideration for synchronous circuits.

Rajasthan Technical University, Kota

Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Name of Subject : ARTIFICIAL INTELLIGENCE (7 CS 4)
Unit Contents

I
Meaning and definition of artificial intelligence, Various types of production systems, Characteristics
of production
systems, Study and comparison of breadth first search and depth first search. Techniques, other
Search Techniques like hill
Climbing, Best first Search. A* algorithm, AO* algorithms etc, and various types of control
strategies.

II
Knowledge Representation, Problems in representing knowledge, knowledge representation using
propositional and predicate
logic, comparison of propositional and predicate logic, Resolution, refutation, deduction, theorem
proving, inferencing,
monotonic and non-monotonic reasoning.
III
Probabilistic reasoning, Baye's theorem, semantic networks scripts schemas, frames, conceptual
dependency and fuzzy logic,
forward and backward reasoning.

IV
Game playing techniques like minimax procedure, alpha-beta cut-offs etc, planning, Study of the
block world problem in
robotics, Introduction to understanding and natural languages processing.

V
Introduction to learning, Various techniques used in learning, introduction to neural networks,
applications of neural
networks, common sense, reasoning, some example of expert systems.

Rajasthan Technical University, Kota

Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Name of Subject : MULTIMEDIA SYSTEMS (7 CS 5)
Unit Contents

I
Introduction to Multimedia, Multimedia Information, Multimedia Objects, Multimedia in business
and work.
Convergence of Computer, Communication and Entertainment products and Stages of Multimedia
Projects, Multimedia
hardware, Memory & storage devices, Communication devices, Multimedia software's, presentation
tools, tools for object generations, video, sound, image capturing, authoring tools, card and page
based authoring tools.

II
Multimedia Building Blocks Text, Sound MIDI, Digital Audio, audio file formats, MIDI under
windows environment
Audio & Video Capture.

III
Data Compression Huffman Coding, Shannon Fano Algorithm, Huffman Algorithms, Adaptive
Coding, Arithmetic Coding
Higher Order Modeling. Finite Context Modeling, Dictionary based Compression, Sliding Window
Compression,
LZ77, LZW compression, Compression, Compression ratio loss less & lossy compression.

IV
Speech Compression & Synthesis Digital Audio concepts, Sampling Variables, Loss less
compression of sound, loss
compression & silence compression.

V
Images: Multiple monitors, bitmaps, Vector drawing, lossy graphic compression, image file formatic
animations
Images standards, JPEG Compression, Zig Zag Coding, Multimedia Database. Content based
retrieval for text and images,
Video: Video representation, Colors, Video Compression, MPEG standards, MHEG Standard Video
Streaming on net, Video
Conferencing, Multimedia Broadcast Services, Indexing and retrieval of Video Database,
recent development in Multimedia

Rajasthan Technical University, Kota

Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Name of Subject : REAL TIME SYSTEMS (7 CS 6.3)
Unit Contents

I
Introduction: Definition, Typical Real Time Applications: Digital Control, High Level Controls,
Signal Processing etc.,
Release Times, Deadlines, and Timing Constraints, Hard Real Time Systems and Soft Real Time
Systems, Reference Models
for Real Time Systems: Processors and Resources, Temporal Parameters of Real Time Workload,
Periodic Task Model,
Precedence Constraints and Data Dependency.

II
Real Time Scheduling: Common Approaches to Real Time Scheduling: Clock Driven Approach,
Weighted Round Robin
Approach, Priority Driven Approach, Dynamic Versus Static Systems, Optimality of Effective-
Deadline-First (EDF) and
Least-Slack-Time-First (LST) Algorithms, Offline Versus Online Scheduling, Scheduling Aperiodic
and Sporadic jobs in
Priority Driven and Clock Driven Systems.

III
Resources Access Control: Effect of Resource Contention and Resource Access Control (RAC),
Non-preemptive Critical
Sections, Basic Priority-Inheritance and Priority-Ceiling Protocols, Stack Based Priority-Ceiling
Protocol, Use of Priority-
Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol, Access Control in
Multiple-Unit Resources,
Controlling Concurrent Accesses to Data Objects.

IV
Multiprocessor System Environment: Multiprocessor and Distributed System Model, Multiprocessor
Priority-Ceiling
Protocol, Schedulability of Fixed-Priority End-to-End Periodic Tasks, Scheduling Algorithms for
End-to-End Periodic
Tasks, End-to-End Tasks in Heterogeneous Systems, Predictability and Validation of Dynamic
Multiprocessor Systems,
Scheduling of Tasks with Temporal Distance Constraints.

V
Real Time Communication: Model of Real Time Communication, Priority-Based Service and
Weighted Round- Robin
Service Disciplines for Switched Networks, Medium Access Control Protocols for Broadcast
Networks, Internet and
Resource Reservation Protocols, Real Time Protocols, Communication in Multicomputer System, An
Overview of Real
Time Operating Systems.