VL201

ADVANCED COMPUTER ARCHITECTURE

OVERVIEW

LTPC
3 0 0 3
5

Introduction and Review of basic computer architecture - Instruction and Instruction

Sequencing Addressing Modes - Quantitative techniques in computer design measuring and reporting performance - Flynns Classification of Computers (SISD,
MISD, MIMD) RISC CISC
INSTRUCTION LEVEL PARALLELISM

10

Basic concepts of Pipelining static pipeline dynamic pipeline - instruction pipeline

- data hazards -control hazards - structural hazards - techniques for handling hazards Pipeline optimization techniques.
DATA LEVEL PARALLELISM

Brief introduction of Array processor - detailed study of Interconnection Network Boolean cube, Mesh, omega, shuffle network - various concepts illustrated by
studying detailed SIMD algorithms, viz., Matrix multiplication.

THREAD LEVEL PARALLELISM

12

Multi-threading Multiprocessors - Centralized and Distributed Shared Memory

Architectures Cache Coherence Issues - Performance Issues Synchronization
Issues Models of Memory Consistency - Interconnection Networks Buses,
Crossbar and Multi-Stage Switches Multi-Core Processor Architectures - Large
Scale Multiprocessors - Warehouse-Scale Computers.

MEMORY HIERARCHY DESIGN

Basic Concepts - Issues in the Design of Memory Hierarchies - Fallacies and Pitfalls
in the Design of Memory Hierarchies - Optimizations of Cache Performance Memory Technology and Optimizations.
TOTAL : 45 PERIODS
REFERENCES:
1. John L. Hennessey and David A. Petterson: Computer Architecture - A
Quantitative Approach, Morgan Kaufmann / Elsevier, Fifth edition, 2012

2. Kai Hwang Advanced Computer Architecture - Parallelism, Scalability,

Programmability, Tata McGraw Hill, 2010.
3. Hwang & Briggs Advanced Computer Architecture and Parallel processing,
McGraw Hill.
4. Richard Y. Kain, Advanced Computer Architecture a Systems Design
Approach, PHI, 2011

CS901 ADVANCED DATABASE MANAGEMENT

RELATIONAL MODEL ISSUES

L T PC
3 0 0 3
9

ER Model - Normalization Query Processing Query Optimization - Transaction

Processing - Concurrency Control Recovery - Database Tuning.
DISTRIBUTED DATABASES

Parallel Databases Inter and Intra Query Parallelism Distributed Database

Features Distributed Database Architecture Fragmentation Distributed Query

Processing Distributed Transactions Processing Concurrency Control Recovery

Commit Protocols.
OBJECT ORIENTED DATABASES

Introduction to Object Oriented Data Bases - Approaches - Modeling and Design Persistence Query Languages - Transaction - Concurrency Multi Version Locks
Recovery POSTGRES JASMINE GEMSTONE - ODMG Model.
ADVANCED DATA MODELS

Mobile Databases: Location and Handoff Management - Effect of Mobility on Data

Management - Location Dependent Data Distribution - Mobile Transaction Models
-Concurrency Control - Transaction Commit Protocols- Multimedia DatabasesInformation Retrieval- Data Warehousing- Data Mining- Text Mining.
EMERGING TECHNOLOGIES

XML Databases: XML-Related Technologies-XML Schema- XML Query LanguagesStoring XML in Databases-XML and SQL- Native XML Databases- Web DatabasesGeographic Information Systems- Biological Data Management- Cloud Based
Databases: Data Storage Systems on the Cloud- Cloud Storage Architectures-Cloud
Data Models- Query Languages- Introduction to Big Data-Storage-Analysis.
TOTAL: 45 PERIODS
REFERENCES:
1. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems, Fifth
Edition,Pearson Education, 2006.
2. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, Database
System Concepts, Fifth Edition, Tata McGraw Hill, 2006.
3. C.J.Date, A.Kannan, S.Swamynathan, An Introduction to Database
Systems, Eighth Edition, Pearson Education, 2006.
4. Thomas Connolly and Carlolyn Begg, Database Systems, A Practical
Approach to Design, Implementation and Management, Third Edition,
Pearson Education.
5. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T.Snodgrass,
V.S.Subrahmanian, Roberto Zicari, Advanced Database Systems,
Morgan Kaufmann publishers, 2006.

6. Vijay Kumar, Mobile Database Systems, John Wiley & Sons, 2006.

CS402 PRINCIPLES OF PROGRAMMING LANGUAGES

LTPC
3 003

SYNTAX AND SEMANTICS

Evolution of Programming Languages Describing Syntax Context Free Grammars

Attribute Grammars Describing Semantics Lexical Analysis Parsing
Recursive Decent Bottom up Parsing
DATA, DATA TYPES AND BASIC STATEMENTS

Names Variables Binding Type Checking Scope Scope Rules Lifetime

and Garbage Collection Primitive Data Types Strings Array Types Associative
Arrays Record Types Union Types Pointers and References Arithmetic
Expressions Overloaded Operators Type Conversions Relational and Boolean
Expressions Assignment Statements Mixed Mode Assignments Control
Structures Selection Iterations Branching Guarded Statements
SUBPROGRAMS AND IMPLEMENTATIONS

Subprograms Design Issues Local Referencing Parameter Passing Overloaded

Methods Generic Methods Design Issues for Functions Semantics of Call and
Return Implementing Simple Subprograms Stack and Dynamic Local Variables
Nested Subprograms Blocks Dynamic Scoping
OBJECT-ORIENTATION, CONCURRENCY AND EVENT HANDLING

Object-orientation design issues for OOP languages implementation of objectoriented constructs concurrency semaphores monitors message passing
threads statement level concurrency exception handling even handling
FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES

Introduction to Lambda Calculus Fundamentals of Functional Programming

Languages Programming with Scheme Programming with ML Introduction to
Logic and Logic Programming Programming with Prolog Multi-Paradigm
Languages
TOTAL : 45 PERIODS
REFERENCES:
1. Robert W. Sebesta, Concepts of Programming Languages, Tenth Edition,
Addison Wesley, 2012.
2. Michael L. Scott, Programming Language Pragmatics, Third Edition,
Morgan Kaufmann, 2009.
3. R. Kent Dybvig, The Scheme programming language, Fourth Edition, MIT
Press, 2009.
4. Jeffrey D. Ullman, Elements of ML programming, Second Edition, Prentice
Hall, 1998.
5. Richard A. O'Keefe, The craft of Prolog, MIT Press, 2009.
6. W. F. Clocksin and C. S. Mellish, Programming in Prolog: Using the ISO
Standard, Fifth Edition, Springer, 2003.

CS962 GRAPH THEORY AND ALGORITHMS

L T P C
3 0 0 3

INTRODUCTION

Graphs - Isomorphism Subgraphs Degree Operations on Graphs Degree

Sequences - Walks Trails - Paths Connected Graphs - Circuits Trees - Properties
of Trees Cotrees and Fundamental Circuits - Cut Sets - Fundamental Cut Sets and
Cut Vertices Directed and Weighted Graphs - Planar and Dual Graphs - Metric
Representation of Graphs
TREES AND SPECIAL GRAPHS

Tree Characterizations - Number of Trees - Minimum Spanning Trees Bipartite

Graphs - Line Graphs - Chordal Graphs - Eulerian Graphs - Characterization Fleurys Algorithm - Chinese-Postman-Problem - Hamilton graphs
MATCHINGS AND COLORINGS

Basic Equations - Matchings in Bipartite Graphs - Perfect Matchings - Greedy and

Approximation Algorithms - Vertex Colorings - Chromatic Number and Cliques -

Greedy Coloring Algorithm - Coloring of Chordal Graphs - Brooks Theorem - Edge

Colorings - Gupta-Vizing Theorem, Class-1 Graphs and Class-2 Graphs - Equitable
Edge-Coloring

PLANAR AND DIRECTED GRAPHS

Basic Concepts - Eulers Formula - Polyhedrons and Planar Graphs - Charactrizations

Planarity Testing - 5-Color-Theorem - Directed graphs - Out-Degree, In-Degree
Connectivity Orientation - Eulerian Directed Graphs - Hamilton Directed Graphs Applications of graphs

GRAPH ALGORITHMS

Graph Searching - Minimum Spanning Trees Kruskals Algorithm Algorithm

Prims

- Shortest Path Algorithms - Dijkstra's Algorithm - Bellman-Ford

Algorithm Single-Source Shortest Paths - All- Pairs Shortest Paths Floyd-Warshall

Algorithm - Johnson's Algorithm for Sparse Graphs - General Framework for Solving
Path Problems in Directed Graphs - Maximum Flow - Flow networks - FordFulkerson Method - Maximum Bipartite Matching - Preflow-Push Algorithms - Liftto-Front Algorithm - Multithreaded Algorithms
TOTAL: 45 PERIODS

REFERENCES:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,

Introduction to Algorithms, 3rd Edition, Prentice Hall of India, 2009.
2. N. Deo, Graph Theory with Applications to Engineering and Computer
Science, Prentice Hall of India, 2004.
3. D. B. West, Introduction to Graph Theory, 2nd Edition, Prentice Hall of
India, 2007.

4. R. Diestel, Advanced Graph Theory, Springer Verlag Heidelberg, New York,

2005.
5. John Adrian Bondy and U.S.R. Murty, Graph Theory, Springer, 2008.
6. John Adrian Bondy and U.S.R. Murty, Graph Theory With Applications,
Elsevier Science Ltd / North-Holland, June 1976.