SCHEME OF TEACHING AND EXAMINATION FOR

Hours per Week Marks for

Duration
Subject Field Total
Name of the Subject of Exam
Code Lecture Practical Work/ I.A. Exam Marks
in Hours
Tutorials
10SCE21 Advances in Computer Architecture 04 -- 02 03 50 100 150
Advances in VLSI Design and
10SCE22 04 02 -- 03 50 100 150
Algorithms
10SCE23 Computer Networks 04 02 -- 03 50 100 150
10SCE24 Embedded Computing Systems 04 -- 02 03 50 100 150
10SCE25x Elective – II 04 -- 02 03 50 100 150
10SCE26 *Project Phase-I(6 Week Duration) -- -- --
10SCE27 Seminar 03 50 -- 50
Total 20 04 09 15 300 500 800
Elective – II
10SCE251 Web Programming
10SCE252 Data warehousing and Data Mining
10SCE253 Advances in Digital Image Processing
M.TECH. COMPUTER ENGINEERING
II Semester
*Between the II Semester and III Semester. After availing a vacation of 2 weeks.
Note: The Internal Assessment marks of 50 for the core subjects with 2 hours of practical will have 30 marks for
theory and 20 marks for practical work

II SEMESTER

Advances in Computer Architecture

Subject Code : 10SCE21 IA Marks : 50
No of Lecture Hrs/Week : 4 Exam hours : 3
Total No of Lecture Hours : 52 Exam Marks : 100

1. Introduction and Review of Fundamentals of Computer Design: Introduction; Classes computers;

Defining computer architecture; Trends in Technology; Trends in power in Integrated Circuits; Trends in cost;
Dependability, Measuring, reporting and summarizing Performance; Quantitative Principles of computer design;
Performance and Price-Performance; Fallacies and pitfalls; Case studies.
2. Some topics in Pipelining, Instruction –Level Parallelism, Its Exploitation and Limits on ILP:
Introduction to pipelining, ILP; Crosscutting issues, fallacies, and pitfalls with respect to pipelining; Basic
concepts and challenges of ILP; Case study of Pentium 4, Fallacies and pitfalls. Introduction to limits in ILP;
Performance and efficiency in advanced multiple-issue processors.
3. Memory Hierarchy Design, Storage Systems: Review of basic concepts; Crosscutting issues in the design
of memory hierarchies; Case study of AMD Opteron memory hierarchy; Fallacies and pitfalls in the design of
memory hierarchies. Introduction to Storage Systems; Advanced topics in disk storage; Definition and examples
of real faults and failures; I/O performance, reliability measures, and benchmarks; Queuing theory; Crosscutting
issues; Designing and evaluating an I/O system – The Internet archive cluster; Case study of NetAA FAS6000
filer; Fallacies and pitfalls.
4. Hardware and Software for VLIW and EPIC
Introduction: Exploiting Instruction-Level Parallelism Statically, Detecting and Enhancing Loop-Level
Parallelism, Scheduling and Structuring Code for Parallelism, Hardware Support for Exposing Parallelism:
Predicated Instructions, Hardware Support for Compiler Speculation, The Intel IA-64 Architecture and Itanium
Processor, Concluding Remarks.
5. Large-Scale Multiprocessors and Scientific Applications
Introduction, Interprocessor Communication: The Critical Performance Issue, Characteristics of Scientific
Applications, Synchronization: Scaling Up, Performance of Scientific Applications on Shared-Memory
Multiprocessors, Performance Measurement of Parallel Processors with Scientific Applications, Implementing
Cache Coherence, The Custom Cluster Approach: Blue Gene/L, Concluding Remarks.
6. Computer Arithmetic
Introduction, Basic Techniques of Integer Arithmetic, Floating Point, Floating-Point Multiplication, Floating-
Point Addition, Division and Remainder, More on Floating-Point Arithmetic, Speeding Up Integer Addition,
Speeding Up Integer Multiplication and Division, Fallacies and Pitfalls

Text Book:
1. Hennessey and Patterson: “Computer Architecture A Quantitative Approach”, 4th Edition, Elsevier,
2007.

Reference Books:
1. Kai Hwang: Advanced Computer Architecture - Parallelism, Scalability, Programmability, 2nd Edition,
Tata McGraw Hill, 2010.

Advances in VLSI Design and Algorithms

Subject Code : 10SCE22 IA Marks : 50

No of Lecture Hrs/Week : 4 Exam hours : 3
Total No of Lecture Hours : 52 Exam Marks : 100

1. Introduction to Digital systems and VLSI: Why Design Integrated Circuits? Integrated Circuits
manufacturing; Integrated Circuit Design Techniques; IP-Based Design.
2. Fabrication and Devices: Introduction; Fabrication processes; Fabrication theory and practice; Reliability.
3. Sequential Machines: Introduction; Latches and Flip-flops; Sequential systems and clocking disciplines;
Performance analysis; Clock generators; Sequential systems design, Power optimization, Design validation,
Sequential testing.
4. Subsystem Design: Introduction; Combinational shifters; Adders; ALUs; Multipliers; High-density memory;
Image sensors; FPGAs; PLA; Buses and networks on chips; Data paths; Subsystems as IP.
5. Architecture Design: Introduction; Hardware description languages; Register Transfer design; Pipelining;
High-level synthesis; Architecture for low power; GALS systems; Architecture testing; IP components; Design
methodologies; Multiprocessor system-on-Chip design.
6. Simulations: General remarks; Gate-level modeling and simulations; Switch-level modeling and simulation.

Laboratory Work:
Mini Project: Design, develop, and implement a Simulation Package, in a language of your choice, to provide
Gate-Level modeling and Simulation.

TEXT BOOKS:
1. Wayne Wolf: “Modern VLSI design”, 4th Edition, PHI Learning, 2007.
2. Sabih H Gerez: “Algorithms for VLSI Design Automation”, Wiley India, 2007.

COMPUTER NETWORKS

Subject Code: 10SCE23 I.A. Marks : 50

Hours/Week : 04 Exam Hours: 03
Total Hours : 52 Exam Marks: 100

1. Review of Basic Concepts: Building a Network; Applications; Requirements; Network Architecture;

Implementing Network software; Performance; Physically connecting hosts; Hardware building blocks.
2. Packet Switching: Switching and forwarding; Bridges and LAN Switches; Cell Switching; Implementation
and Performance.
3. Internetworking: Simple internetworking (IP); Routing; Global Internet; Multicast; MPLS
4. End –to-End Protocols: Simple demultiplexer (UDP); Reliable byte stream (TCP); RPC; RTP.
5. Congestion Control and Resource Allocation: Issues in resource allocation; Queuing discipline; TCP
Congestion Control; Congestion-Avoidance mechanisms; Quality of Service.
6. Applications: Traditional applications; Web services; Multimedia applications; Overlay Networks.

Laboratory Work:

Using any Protocol Analyzer like Ethereal, perform the following experiments:
1. Capture the packets that are transmitted after clicking on the URL of the web site of your college.
Analyze the packets at the highest level and prepare a brief report of your analysis.
2. Analyze the data captured above at lower levels and demonstrate the layering of the protocols.
3. Capture the ARP packets and find the MAC addresses in the LAN in your laboratory.

Using either NS228/OPNET or any other suitable simulator, perform the following experiments:
1. Simulate a three nodes point – to – point network with duplex links between them. Set the queue size
and vary the bandwidth and find the number of packets dropped.
2. Simulate the transmission of ping messages over a network topology consisting of 6 nodes and find the
number of packets dropped due to congestion.
3. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for
different source / destination.
Implement the following in C/C++:
1. Write a program for distance vector algorithm to find suitable path for transmission.
2. Write a program for congestion control using leaky bucket algorithm.

TEXT BOOKS:
1. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th Edition,
Elsevier, 2007.

REFERENCE BOOKS:
1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw Hill, 2006.
2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.
3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key
Architectures, 2nd Edition Tata McGraw-Hill, 2004.

EMBEDDED COMPUTING SYSTEMS

Subject Code: 10SCE24 I.A. Marks : 50

Hours/Week : 04 Exam Hours: 03
Total Hours : 52 Exam Marks: 100

1. Introduction to Embedded Systems: Embedded systems; Processor embedded into a system; Embedded
hardware units and devices in a system; Embedded software in a system; Examples of embedded systems;
Embedded System-on-Chip (SoC) and use of VLSI circuit design technology; Complex systems design and
processors; Design process in embedded system. Formalization of system design; Design process and design
examples; Classification of embedded systems; Skills required for an embedded system designer.
2. Devices: I/O types and examples; Serial communication devices; Parallel device ports; Sophisticated
interfacing features in device ports. Wireless devices; Timer and counting devices; Watchdog timer; Real time
clock.
3. Communication Buses for Device Networks: Networked embedded systems; Serial bus communication
protocols; Parallel bus device protocols; Internet enabled systems; Wireless and mobile system protocols.
4. Device Drivers and Interrupts Service Mechanism: Device access without interrupts; ISR concept;
Interrupt sources; Interrupt servicing mechanism; Multiple interrupts; Context and the periods for
context-switching, interrupt latency and deadline; Classification of processors’ interrupt service mechanism
from context-saving angle; Direct memory access; Device drivers programming.
5. Program Modeling Concepts, Processes, Threads, and Tasks: Program models; DFG models; State
machine programming models for event controlled program flow; Modeling of multiprocessor systems.
Multiple processes in an application; Multiple threads in an application; Tasks and task states; Task and data;
Distinctions between functions, ISRs and tasks.
6. Real-time Operating systems: Operating System services; Process management; Timer functions; Event
functions; Memory management; Device, file and I/O sub-systems management; Interrupt routines in RTOS
environment and handling of interrupt source calls. Real-Time Operating Systems; Basic design using an RTOS;
RTOS task scheduling models, interrupt latency and response times of the tasks as performance metrics; OS
security issues.
7. Embedded Software Development, Tools: Introduction; Host and target machines; Linking and locating
software; Getting embedded software in to the target system; Issues in hardware software design and co-design;
Testing on host machine; Simulators; Laboratory tools.

TEXT BOOKS:
1. Rajkamal: Embedded Systems Architecture, Programming and Design, 2nd Edition, Tata McGraw Hill,
2008.

REFERENCE BOOKS:
1. Wayne Wolf: Computers as Components Principles of Embedded Computer System Design, 2nd
Edition, Elsevier, 2008.
2. Steve Heath: Embedded Systems Design, 2nd Edition, Elsevier, 2003.
3. Dr. K.V.K.K. Prasad: Embedded/Real-Time Systems: Concepts, Design and Programming – The
Ultimate Reference, Dreamtech Press / Wiley India, 2007.
4. Michael J.Point: Embedded C, Pearson, 2002.

ELECTIVE-II

WEB PROGRAMMING

Subject Code: 10SCE251 I.A. Marks : 50

Hours/Week: 04 Exam Hours: 03
Total Hours: 52 Exam Marks: 100

1. Fundamentals of Web: Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; Security;
the Web Programmers Toolbox
2. XHTML: Origins and evolution of HTML and XHTML; Basic syntax; Standard XHTML document
structure; Basic text markup mages; Hypertext Links; Lists; Tables; Forms; Frames; Syntactic differences
between HTML and XHTML.
3. CSS: Introduction; Levels of style sheets; Style specification formats; Selector forms; Property value forms;
Font properties; List properties; Color; Alignment of text; The Box model; Background images; The <span> and
<div> tags; Conflict resolution.
4. JavaScript: Overview of JavaScript; Object orientation and JavaScript; General syntactic characteristics;
Primitives, operations, and expressions; Screen output and keyboard input; Control statements; Object creation
and modification; Arrays; Functions; Constructor; Pattern matching using regular expressions; Errors in scripts;
Examples.
5. JavaScript and HTML Documents: The JavaScript execution environment; The Document Object Model;
Element access in JavaScript; Events and event handling; Handling events from the Body elements, Button
elements, Text box and Password elements; The DOM 2 event model; The navigator object; DOM tree traversal
and modification.
6. Dynamic Documents with JavaScript: Introduction to dynamic documents; Positioning elements; Moving
elements; Element visibility; Changing colors and fonts; Dynamic content; Stacking elements; Locating the
mouse cursor; Reacting to a mouse click; Slow movement of elements; Dragging and dropping elements.
7. XML: Introduction; Syntax; Document structure; Document Type definitions; Namespaces; XML schemas;
Displaying raw XML documents; Displaying XML documents with CSS; XSLT style sheets; XML processors;
Web Services.
8. Perl, CGI Programming: Origins and uses of Perl; Scalars and their operations; Assignment statements and
simple input and output; Control statements; Fundamentals of arrays; Hashes; References; Functions; Pattern
matching; File input and output; Examples. The Common Gateway Interface; CGI linkage; Query string format;
CGI.pm module; A survey example; Cookies.
Database access with Perl and MySQL
9. Ruby, Rails: Origins and uses of Ruby, Scalar types and their operations-, Simple input and output, Control
statements, Arrays, Hashes, Methods, Classes, Code blocks and iterators, Pattern matching.
Overview of Rails, Document requests, Processing forms, Rails applications with Databases, Layouts.

TEXT BOOKS:
1. Robert W. Sebesta: “Programming the World Wide Web”, 4th Edition, Pearson Education, 2008.

REFERENCE BOOKS:
1. M. Deitel, P.J. Deitel, A. B. Goldberg: “Internet & World Wide Web How to program”, 4th Edition,
Pearson Education, 2004.
2. Chris Bates: “Web Programming Building Internet Applications”, 3rd Edition, Wiley India, 2006.
3. Xue Bai et al: “The Web Warrior Guide to Web Programming”, Cengage Learning, 2003.

DATA WAREHOUSING AND DATA MINING

Subject Code: 10SCE252 I.A. Marks : 50

Hours/Week: 04 Exam Hours: 03
Total Hours: 52 Exam Marks: 100

1. Data Warehousing – Introduction: Operational Data Stores (ODS), Extraction Transformation Loading
(ETL), Data Warehouses Design Issues, Guidelines for Data Warehouse Implementation, Data Warehouse
Metadata.
2. Online Analytical Processing (OLAP): Introduction, Characteristics of OLAP systems, Multidimensional
view and Data cube, Data Cube Implementations, Data Cube operations, Implementation of OLAP and
overview on OLAP Softwares.
3. Data Mining: Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of
Similarity and Dissimilarity, Data Mining Applications
4. Association Analysis - Basic Concepts and Algorithms: Frequent Itemset Generation, Rule Generation,
Compact Representation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP
Growth Algorithm, Evaluation of Association Patterns
5. Classification: Basics, General approach to solve classification problem, Decision Trees, Rule Based
Classifiers, Nearest Neighbor Classifiers, Bayesian Classifiers, Estimating Predictive accuracy of classification
methods, Improving accuracy of clarification methods, Evaluation criteria for classification methods, Multiclass
Problem.
6. Clustering Techniques: Overview, Features of cluster analysis, Types of Data and Computing Distance,
Types of Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods,
Quality and Validity of Cluster Analysis
7. Web Mining: Introduction, Web content mining, Text Mining, Unstructured Text, Text clustering, Mining
Spatial and Temporal Databases.

Text Books:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Pearson Education,
2007.
2. G. K. Gupta: Introduction to Data Mining with Case Studies, 3rd Edition, PHI Learning, 2009.

Reference Books:
1. Arun K Pujari: Data Mining Techniques, 2nd Edition, Universities press, 2009.
2. Jiawei Han and Micheline Kamber: Data Mining - Concepts and Techniques, 2nd Edition, Morgan
Kaufmann Publisher, 2006.
3. Alex Berson and Stephen J. Smith: Data Warehousing, Data Mining, and OLAP Computing, Mc Graw
Hill Publisher, 1997.

Advances in Digital Image Processing

Subject Code : 10SCE253 IA Marks : 50
No of Lecture Hrs/Week : 4 Exam hours : 3
Total No of Lecture Hours : 52 Exam Marks : 100
1. Introduction: Origins of Digital Image Processing, examples, Fundamental Steps in Digital Image
Processing, Components of an Image Processing System, Image analysis and computer vision, spatial
feature extraction, transform features, Edge detection, gradient operators, compass operators, stochastic
gradients, line and spot detection.
2. Digital Image Fundamentals: Elements of Visual Perception, A Simple Image Formation Model, Basic
Concepts in Sampling and Quantization, Representing Digital Images, Zooming and Shrinking Digital
Images, Some Basic Relationships Between Pixels, Linear and Nonlinear Operations.
3. Image Enhancement in the Spatial Domain: Some Basic Gray Level Transformations, Histogram
Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing
Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods.
4. Image Enhancement in the Frequency Domain: Background, Image Enhancement in the Frequency
Domain, Introduction to the Fourier Transform and the Frequency, Domain, Smoothing Frequency-Domain
Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering.
5. Image Restoration: A Model of the Image degradation/Restoration process, Noise Models, Restoration in
the Presence of Noise Only–Spatial Filtering, Periodic Noise Reduction by Frequency Domain Filtering,
Linear, Position-Invariant Degradations , Estimating the Degradation Function, Inverse Filtering ,Minimum
Mean Square Error (Wiener) Filtering.
6. Color Fundamentals: Color Models, Pseudo color Image Processing, Basics of Full-Color Image
Processing, Color Transformations, Smoothing and Sharpening, Color Segmentation, Noise in Color
Images, Color Image Compression.
7. Image Transformation: Discrete Cosine Transforms, Walsh Hadmard Transforms, Wavelet Transforms
and Multiprocessing, Background, Multiresolution Expansions, Wavelet Transforms in one Dimension,
Wavelet Transforms in Two Dimensions, Wavelet Packets, an overview of Second Generation Wavelet
Transforms.
8. Image and Video Compression: Fundamentals, Image Compression Models, Lossless compression
Methods: Huffman coding, run length coding, LZ coding, Arithmetic coding, Lossy Compression: Gray
level Run length coding, Block truncation coding, vector quantization, Differential predictive coding,
Transform coding , Hybrid coding, Video Compression Techniques – Motion compensation, Search for
motion vectors, H.261, H.263, MPEG I, MPEG 2, MPEG 4, MPEG 7 .
9. Morphological Image Processing: Preliminaries, Dilation and Erosion, Opening and Closing, The Hit-or-
Miss Transformation, Some Basic Morphological Algorithms.
10. Image Segmentation and Object Recognition: Detection of Discontinuities, Edge Linking and Boundary
Detection, Thresholding, Region-Based Segmentation, Patterns and Pattern Classes, Recognition Based on
Decision-Theoretic Methods, Structural Methods.

TEXT BOOKS
1. Rafel C Gonzalez and Richard E. Woods: Digital Image Processing, 3rd Edition, Pearson Education,
2003
2. Scott.E.Umbaugh: Computer Vision and Image Processing, Prentice Hall, 1997

REFERENCES:

1. A. K. Jain: Fundamentals of Digital Image Processing, Pearson, 2004.

2. Z. Li and M.S. Drew: Fundamentals of Multimedia, Pearson, 2004.
3. S.Jayaraman, S.Esakkirajan, T.Veerakumar: Digital Image Procesing, TataMcGraw Hill, 2004.