Department of Computer Science and Engineering

Master of Technology (Computer Science and Engineering)

FIRST SEMESTER

Sl. No

Subject Code Subjects Name

Hours / Week C

Exam Marks L T P S CIE SEE Total

1 PCS121C Advanced Algorithms 4 0 0 0 4 50 50 100

2 PCS122C Advances in Operating Systems

3 2 0 0 4 50 50 100

3 PCS123C Mathematical Foundations for Computer Science

4 0 0 0 4 50 50 100

4 PCSXXXE Elective-I 4 0 0 0 4 50 50 100 5 PCSXXXE Elective-II 4 0 0 0 4 50 50 100 6 PCSXXXE Elective-III 4 0 0 0 4 50 50 100 7 PCS124S Seminar 0 4 0 0 2 50 50 100

8 PCS120M Introduction to Computer Science*

4 0 0 0 0 50 50 100

Total 26 04 04 0 26 400 400 800 Legend: L: Lectture, T:Tutorial, P:Practical, S:Self study, C: Credits

PCS121C Advanced Algorithms 4 Credits

Contact Hours(L-T-P-S) : 4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Analysis and Design of algorithms

Course Outcomes:

• Explain the major graph algorithms and their analyses. Employ graphs to model

engineering problems, when appropriate, and analyze them.

• Explain the different ways to analyze randomized algorithms (expected running time,

probability of error). Recite algorithms that employ randomization. Explain the

difference between a randomized algorithm and an algorithm with probabilistic

inputs.

• Analyze randomized algorithms. Employ indicator random variables and linearity of

expectation to perform the analyses. Recite analyses of algorithms that employ this

method of analysis.

• Explain what amortized running time is and what it is good for. Describe the different

methods of amortized analysis (aggregate analysis, accounting, potential method).

Perform amortized analysis.

• Explain major string matching algorithms and compare efficiencies of different

algorithms.

• Gain a good understanding on a wide range of advanced algorithmic problems, their

relations and variants, and application to real-world problems.

UNIT-I

Amortized Analysis: Aggregate, Accounting and Potential Methods. Graph Algorithms:

Bellman - Ford Algorithm; Johnson’s Algorithm for sparse graphs; Flow networks and Ford-

Fulkerson method; Maximum bipartite matching. Polynomials and the FFT

:Representation of polynomials; the DFT and FFT; Efficient implementation of FFT

UNIT-II

Number -Theoretic Algorithms: Elementary notions; GCD; Modular Arithmetic; Solving

modular linear equations; The Chinese remainder theorem; Powers of an element; RSA

cryptosystem; Primality testing; Integer factorization. String-Matching Algorithms: Naïve

string Matching; Rabin - Karp algorithm; String matching with finite automata; Knuth-

Morris-Pratt algorithm Boyer – Moore algorithms.

UNIT-III

Probabilistic and Randomized Algorithms: Probabilistic Algorithms, randomizing

deterministic algorithms, Monte Carlo and Las Vegas Algorithms, Probabilistic numerical

algorithms, Probabilistic parallel algorithms. NP-Complete Problems: The classes P and NP,

Reducibility, NP- complete problems: Cook’s theorem, Sample NP-complete problems, the

class co-NP, The Classes NC and P-Complete.Approximation Algorithms: Bin Packing,

The Steiner tree problem, the facility location problem.

UNIT-IV

Introduction to parallel algorithms and architectur es: Approaches to the design of

parallel algorithms, Architectural constraints and design of parallel algorithms, Performance

measures of parallel algorithms, parallel sorting. Internet algorithms: Search Engines,

Ranking web pages, Hashing, Caching, content delivery and consistent hashing, Message

security algorithms.

Note: A list of assignments will be provided in the beginning of semester and evaluated for

20 Marks

TEXT BOOKS:

1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: “Introduction to Algorithms” ,

2nd Edition, Prentice-Hall of India, 2002.

2. Kenneth A. Berman and Jerome L. Paul: “Algorithms” , Cengage Learning, 2002.

REFERENCE BOOKS:

1. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: “Fundamentals of Computer

Algorithms” , 2nd Edition, University Press, 2007.

2. Alfred V. Aho,John E. Hopcroft, J.D.Ullman: “The Design and Analysis of

Computer Algorithms” , Addison-Wesley, 1974.

PCS122C Advances in Operating Systems 4 Credits

Contact Hours(L-T-P-S): 3-2-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Operating System. Course Outcomes:

• Master functions, structures and history of operating systems. • Master understanding of design issues associated with operating systems. • Master various process management concepts including scheduling, synchronization

,deadlocks • Be familiar with multithreading. • Master concepts of memory management including virtual memory. • Master system resources sharing among the users. • Master issues related to file system interface and implementation, disk management. • Be familiar with protection and security mechanisms. • Be familiar with various types of operating systems.

UNIT-I 12 Hrs

Operating System Overview; Operating System Objectives and Functions, The Evolution of

Operating Systems, Major Achievements, Developments Leading to Modern Operating

Systems, Microsoft Windows Overview, Traditional UNIX Systems, Modern UNIX Systems,

Linux. Process Description and Control; What is a Process? Process States, Process

Description, Execution of the Operating System, Security Issues, UNIX SVR4 Process

Management, Threads, SMP, and Microkernels; Processes and Threads, Symmetric

Multiprocessing (SMP), Microkernels, Windows Vista Thread and SMP Management, Linux

Process and Thread Managements.

UNIT-II

12 Hrs Concurrency: Mutual Exclusion and Synchronization; Principles of Concurrency, Mutual

Execution: Hardware Support, Samaphores, Monitors, Message Passing, Readers/Writers

Problem, Concurrency: Deadlock and Starvation; Principles of Deadlock, Deadlock

Prevention, Deadlock Avoidance, Deadlock Detection, An Integrated Deadlock Strategy,

Dining Philosophers Problems, Dining Philosophers Problems, Linux Kernel Concurrency

Mechanisms, Windows Vista Concurrency Mechanisms

UNIT-III 12 Hrs

Uniprocessor Scheduling; Types of Scheduling, Scheduling Algorithms, Traditional

UNIX Scheduling, Multiprocessor and Real-Time Scheduling; Multiprocessor Scheduling,

Real-Time Scheduling, Linux Scheduling, UNIX FreeBSD Scheduling, Windows Vista

Scheduling, Embedded Operating Systems; Embedded Systems, Characteristics of

Embedded Operating Systems, eCOS, TinyOS.

UNIT-IV

12 Hrs Computer Security Threats; Computer security concepts, Threats, Attacks, and Assets,

Intruders, Malicious software overview, Viruses, worms, and bots, Rootkits, Computer

Security Techniques; Authentication, Access Control, Intrusion Detection, Malware

Defense, Dealing with Buffer Overflow Attacks, Windows Vista Security. Distributed

Processing, Client/server and Clusters; Client/server Computing, Distributed Message

Passing, Remote Procedure, Clusters, Windows Vista Clusters Server, Sun Cluster.

Text Book: 1) William Stallings, “Operating Systems: Internals Design and Principles”, 6th edition,

Longman, 2009.

References: 1) Gary Nut, “Operating Systems”, Third Edition, Pearson Education. 2006.

PCS123C Mathematical Foundations for Computer Science 4 Credits

Contact Hours(L-T-P-S) : 4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50

Pre-requisites: Linear Algebra, Graph Theory.

Course Outcomes:

• Compute probabilities by modeling sample spaces and applying rules of permutations and combinations, additive and multiplicative laws and conditional probability.

• Construct the probability distribution of a random variable, based on real-world situations.

• Compute probabilities based on practical situations using the binomial and normal distributions; use the normal distribution to test statistical hypotheses.

• Estimate their complexity, and to understand the theoretical results on which they are based.

• Prove elementary statements concerning the theory of systems of linear equations and Solve application problems of systems of linear equations.

• Prove elementary statements concerning the theory of matrices and determinants.

• Able to define and construct graph theoretical models and solutions to computing problem in various domains of computer science.

UNIT- I

Linear Algebraic and Transidental Equations: Fields; system of linear equations, and its

solution sets; elementary row operations and echelon forms; matrix operations; invertible

matrices, LU-factorization(Ref.2Chap.1).Linear Algebraic Equations: Gauss Elimination

LU Decomposition and Matrix Inversion ,Special Matrices and Gauss-Seidel

Vector Spaces: Vector spaces; subspaces; bases and dimension; Inner product space.

(Ref.1Chap.2) Orthogonal projections and Grand smith Orthogonalization process (Ref.2

Chap.3).

UNIT- II

Review of Probability theory,Bayes' Formula, Random Variables and Distributions,

Cumulative Distribution Function, Marginal Distributions, Conditional Distributions,

Binomial, Poisson, ,exponential and continuous Distributions, Functions of Random

Variables, Convolution, Functions of Random Variables: Sum, Product, Ratio, Maximum,

Change of Variables, Linear Transformations of Random Vectors, Expectation, Chebyshev's

Inequality, Properties of Expectation, Variance, Standard Deviation. Coding Theory, Binary

symmetric channel, Coding Process, decoding, error detection and correction codes.

UNIT- III

Graph Theory: Basic Concepts in Graph Theory: Paths and Cycles, Connectivity,

Homomorphisms and Isomorphisms of Graphs Digraph Connectivity. Fundamental

Properties of Graphs and Digraphs: Bipartite Grpahs, Eulerian Graphs, Hamiltonian

Cycles in Weighted Graphs, Eulerian and Hamiltonian Digraphs, Tournament Digraphs, On

the Adjacency Matrix of a Digraph, Acyclic Digraphs and Posets. Connectivity and Flow:

Edge Cuts, Edge Connectivity and Connectivity, Blocks in Separable Graphs, Flows in

Networks The Theorems of Menger. Plannar Graphs: Graph Coloring, Coloring

Enumerations and Chordal Graphs, Independence, Dominance and Matchings, Graph

Counting:

Text : Graph Theory :Modeling Applications and Algorithms. Geir Agnarsson Raymond

Greenlaw.

UNIT IV

Optimization: One-Dimensional Unconstrained Optimization, Multidimensional

Unconstrained Optimization, Constrained Optimization, Case Studies: Optimization, Curve

Fitting, Least-Squares Regression, Interpolation, Fourier Approximation, Case Studies:

Curve Fitting.

Text Books:

1. Gilbert Strang, "Linear Algebra and its Applications”, 3rd edition, Thomson Learning

Asia, 2003.

2. Kenneth Hoffman and Ray Kunze, "Linear Algebra," 2nd edition,Pearson Education

(Asia) Pte. Ltd/ Prentice Hall of India, 2004.

3. David C. Lay, “Linear Algebra and its Applications,” 3rd edition,Pearson Education

(Asia) Pte. Ltd, 2005.

4. Morris H. DeGroot Mark J. Schervish Probability and Statistics (4th Edition)

5. Applied Discrete Structures for Computer Science by A Doerr and K Levasser.

6. Steven C Chapra, Tufts University Raymond P Canale, Numerical Methods for Engineers,

6/e, University of Michigan, ISBN: 0073401064.

PCS002E COMPUTER GRAPHICS AND VISUALIZATION 4 Credits Contact Hours(L-T-P-S): 4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50

Pre-requisites: Computer Concepts and C Programming.

Course Outcomes:

• Know the architecture of graphics systems.

• Understand graphics algorithms for drawing 2D primitives.

• Explore the functions of 2D and 3D transformations.

• Know the details of 3D object representations.

• Explore the open GL API related to color, viewing, primitive.

• Explain the even driven input using open GL programming API.

• Illustrate viewing with a computer.

• Explore the lighting and shading models.

• Illustrate the shading model using case study on sphere model.

UNIT I 12 Hrs

Introduction: Application of computer graphics, Elements of pictures created in computer

graphics, graphics display devices, Basic raster graphics algorithms for drawing 2D

primitives: Midpoint line & circle drawing algorithm, scan-line polygon filling algorithm,

antialising, 2D geometric transformations: Basic transformations.

UNIT II

12 Hrs

2D transformation matrix representations and homogeneous coordinates, composite

transformations, window-to-view port coordinate transformation, clipping operations- Cohen

Sutherland line clipping, Sutherland-Hogeman polygon clipping, 3D object representations:

polygon surfaces, curved lines and surfaces, quadric surfaces, spline representations, Bezier

curves and surfaces, B-spline curves and surfaces.

UNIT III

12 Hrs

THE OPENGL: The OpenGL API; Primitives and attributes; Color; Viewing; Control

functions; The Gasket program; Polygons and recursion; The three-dimensional gasket;

Plotting implicit functions. INPUT AND INTERACTION: Interaction; Input devices; Clients

and servers; Display lists; Display lists and modeling; Programming event-driven input;

Menus; A simple CAD program; Building interactive models; Animating interactive

programs; Design of interactive programs; Logic operations.

UNIT IV

12 Hrs

VIEWING: Classical and computer viewing; Viewing with a computer; Positioning of the

camera; Simple projections; Projections in OpenGL; Hidden-surface removal; Interactive

mesh displays; Parallel-projection matrices; Perspective-projection matrices;

LIGHTING AND SHADING: Light and matter; Light sources; The Phong lighting model;

Computation of vectors; Polygonal shading; Approximation of a sphere by recursive

subdivisions; Light sources in OpenGL; Specification of materials in OpenGL; Shading of

the sphere model; Global illumination.

TEXT BOOKS:

1. Computer Graphics - OpenGL Version – Donald Hearn and Pauline Baker, 2nd Edition,

Pearson Education, 2003

2. Interactive Computer Graphics A Top-Down Approach with OpenGL -Edward Angel, 5th

Edition, Addison-Wesley, 2008.

REFERENCE BOOKS:

1. Computer Graphics – James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes,

Addison-wesley 1997.

2. Computer Graphics Using OpenGL – F.S. Hill,Jr. 2nd Edition, Pearson Education, 2001.

PCS003E DIGITAL IMAGE PROCESSING 4 Credits Contact Hours (L-T-P-S) :4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50

Pre-requisites: Basics of Computer.

Course Outcomes:

• Explain the fundamentals of digital images and their representations in spatial and

frequency domains

• Develop new algorithms to improve the quality of digital images by applying

enhancement and restoration techniques.

• Analyze the properties of discreet transforms and their importance role in digital

image processing.

• Identify various image enhancement techniques in spatial as well as frequency

domains.

• Identify various color models to represent color images and transformation among the

models.

• Analyze the techniques available in morphological image processing.

• Extract quantitative data from images and recognizing the object.

• Explore several image processing techniques to solve real world problems by

applying modern engineering tools.

UNIT I

Introduction (12 hrs)

What is digital image processing? Origins of Digital Image Processing, Fundamental Steps

in Digital Image Processing, Components of an Image Processing System 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

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.

UNIT II

Image Enhancement in the Frequency Domain: (12 hrs)

Background, Introduction to the Fourier Transform and the Frequency, Domain, Smoothing

Frequency-Domain Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering.

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.

UNIT III

Color Fundamentals: (12 hrs)

Color Models, Pseudocolor Image Processing, Basics of Full-Color Image Processing, Color

Transformations, Smoothing and Sharpening, Color Segmentation, Noise in Color Images.

Morphological Image Processing:

Preliminaries, Dilation and Erosion, Opening and Closing, The Hit-or-Miss Transformation,

Some Basic Morphological Algorithms

UNIT IV

Image Segmentation: (12 hrs)

Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region-

Based Segmentation.

Representation and Description: Representation, boundary descriptors, regional

descriptors, use of principal components and description.

Object Recognition: 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", PHI 2nd Edition

2005.

2. Scott.E.Umbaugh, "Computer Vision and Image Processing", Prentice Hall, 1997

PCS033E Compiler Design 4 Credits

Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Computer Concepts and C Programming. Course Outcomes:

• Master scanning and lexical analysis processes

• Understand the principles of parsing and application to real-world compilation

techniques

• Be familiar with intermediate code representations and generation.

• Be exposed to code optimization techniques.

• Fluency in describing the theory and practice of compilation.

• Understand the underlying concepts of design of compilers

UNIT – I

12 Hours INTRODUCTION, LEXICAL ANALYSIS: Language processors; The structure of a

Compilers; The evolution of programming languages; The science of building a compiler;

Applications of Compiler technology; Lexical analysis: The Role of Lexical Analyzer; Input

Buffering; Specifications of Tokens; Recognition of Tokens. SYNTAX ANALYSIS:

Introduction; Context-free Grammars; Writing a Grammar; Top-down Parsing. Bottom-up

Parsing; Introduction to LR Parsing: Simple LR.,Parser Generators.

UNIT – II 12 Hours

SYNTAX-DIRECTED TRANSLATION: Syntax-Directed definitions; Evaluation order for

SDDs; Applications of Syntax-directed translation; INTERMEDIATE CODE

GENERATION: Variants of syntax trees; Three-address code; Types and declarations;

Translation of expressions; Type checking;

UNIT – III

12 Hours INTERMEDIATE CODE GENERATION: Control flow; Back patching. RUN-TIME

ENVIRONMENTS: Storage Organization; Stack allocation of space. Access to non-local

data on the stack; Heap management; Introduction to garbage collection.

UNIT - IV

12 Hours CODE GENERATION: Issues in the design of Code Generator; The Target language;

Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic blocks; A

Simple Code Generator. INSTRUCTION-LEVEL PARALLELISM: Processor

Architectures; Code-Scheduling Constraints; Basic-Block Scheduling; Global Code

Scheduling; Software Pipelining.

TEXT BOOK:

1) Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman, 2007,Compilers-

Principles, Techniques and Tools –– 2nd Edition, Addison-Wesley. (chapter 1:1.1 -

1.5,chapter 3:3.1 to 3.4,Chapter 4:4.1-4.6.4,Chapter 5:5.1-5.4.4,Chapter 6:6.1 -6.5.2,6.7-

6.7.3,Chapter 7:7.1-7.5,Chapter 8:8.1-8.6)

REFERENCE BOOKS:

1) Charles N. Fischer, Richard J. leBlanc, Jr, 1991, Crafting a Compiler with C –, Pearson

Education.

2) Andrew W Apple, 1997,Modern Compiler Implementation in C –Cambridge

University Press.

3) Kenneth C Louden,1997, Compiler Construction Principles & Practice, Thomson

Education.

SECOND SEMESTER

Sl. No

Subject Code

Subjects Name Hours / Week

C Exam Marks

L T P S CIE SEE Total

1 PCS221C High Performance Computing and Programming

3 2 0 0 4 50 50 100

2 PCS222C Software Architecture 4 0 0 0 4 50 50 100

3 PCS223C Advanced Computer Networks

3 2 0 0 4 50 50 100

4 PCSXXXE Elective-IV 4 0 0 0 4 50 50 100 5 PCSXXXE Elective-V 4 0 0 0 4 50 50 100 6 PCSXXXE Elective-VI 4 0 0 0 4 50 50 100 7 PCS224T Term Paper 0 2 2 0 2 50 50 100

Total 22 0 06 0 26 350 350 700

PCS221C High Performance Computing and Programming 4 Credits

Contact Hours (L-T-P-S): 3-2-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Basics of Computer System. Course Outcomes:

• Analyze a given problem for possibilities of parallel computations.

• Select algorithms and hardware for the solution of high performance projects

• Program computers with shared and distributed memory architectures

• Use appropriate programming languages efficiently for scientific computations

• Run parallel programs on different hardware architectures and software environments

• Assess the performance and power efficiency of implementations

• Identify modern computing architectures for high performance computing with

architectural prospective.

UNIT I Introduction : Stored program computer architecture, General purpose cache based

microprocessor architecture, Performance metrics and benchmarks ,Transistors galore:

Moore’s low, Pipelining, Superscalarity, SIMD. Memory hierarchies:, Cache, Cache

mapping, Prefetch

Multicore processors, Multithreaded processors, Vector processors, Design principles,

Maximum performance estimates. Parallel Computers: Taxonomy of parallel computing

paradigms, Shared memory computers, Cache coherence UMA, ccNUMA, Distributed

memory computers, Hierarchical (hybrid) systems Interconnection Network ,Basic

performance characteristics of networks, Buses, Switched and fat tree networks, Mesh

networks, Hybrid Networks

UNIT II

Basic of parallelization: Parallelism, Data parallelism, Functional parallelism, Parallel

scalability Simple scalability laws, Parallel efficiency, Serial performance versus strong

scalability Refined performance models, Choosing the right scaling baseline, Case study,

Load imbalance

GPUs as Parallel Computers: Architecture of a Modern GPU, Why More Speed or

Parallelism, Parallel Programming Languages and Models, Overarching Goals Evolution of

Graphics Pipelines, the Era of Fixed-Function Graphics Pipelines, Evolution of

Programmable Real-Time Graphics, Unified Graphics and Computing Processors, GPGPU:

An Intermediate Step in GPU Computing Scalable GPUs.

UNIT III

A Brief Introduction To Opencl Background, Data Parallelism Model, Device

Architecture Kernel Functions , Device Management and Kernel Launch, Electrostatic

Potential Map in OpenCL Open CL device architecture, Basic open CL examples,

concurrency model, CPU/GPU implementation , Open CL profiling ,Case studies,

Introduction to Web CL Fundamental Limitations Facing Parallel Computing, Bandwidth

Limitations, Latency Limitations Latency Hiding/Tolerating Techniques and their

limitations.

UNIT IV

Power-Aware Computing and Communication, Power-aware Processing Techniques,Power

aware Memory Design, Power-aware Interconnect Design, Software Power Management

High Performance architecture examples IBM CELL BE, Nvidia Tesla GPU, Intel Larrabee

Microarchitecture and Intel Nehalem microarchitecture Advanced Topics in computing.

(a) Petascale Computing

(b) Optics in Parallel Computing

(c) Quantum Computers

(d) Recent developments in Nanotechnology and its impact on HPC

Note: A list of assignments will be provided in the beginning of semester and evaluated for

20 Marks

Text Books: 1) Introduction to High Performance Computing for Scientists and Engineers by Georg

Hager Gerhard Wellein.

2) Programming Massively Parallel Processors: A Hands-on Approach by David Kirk and

Wen-mei Hwu

3) Heterogeneous Computing with Open CL by Benedict R. Gaster

Reference Books: 1) “Advanced Computer Architecture: Parallelism, Scalability, Programmability”, by Kai

Hwang, McGraw Hill 1993.

2) “Parallel Computer Architecture: A hardware/Software Approach”, by David Culler

Jaswinder Pal Singh, Morgan Kaufmann, 1999

3) “Scalable Parallel Computing”, by Kai Hwang, McGraw Hill 1998.

4) “Principles and Practices on Interconnection Networks”, by William James Dally and

Brian Towles, Morgan Kauffman 2004.

5) GPU Gems 3 --- by Hubert Nguyen (Chapter 29 to Chapter 41)

6) Introduction to Parallel Computing, Ananth Grama, Anshul Gupta, George Karypis, and

Vipin Kumar, 2nd edition, Addison-Welsey, © 2003.

7) Petascale Computing: Algorithms and Applications, David A. Bader (Ed.), Chapman &

Hall/CRC Computational Science Series, © 2007.

PCS222C SOFTWARE ARCHITECTURES 4 Credits

Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Basics of Computer System.

Course Outcomes:

• Aware of the key elements of software architecture Argue the importance and role of

software architecture in large scale software systems

• Design and motivate software architecture for large scale software systems

• Be familiar with a variety of architectural styles and how they may be combined in a

single system

• Have a working knowledge of software architecture design for a non-trivial system

• Understand how software architecture aids different stages of the software lifecycle

• Generate architectural alternatives for a problem and select among them

• Use well-understood paradigms for designing new systems

• Identify and assess the quality attributes of a system at the architectural level

• Discuss and evaluate the current trends and technologies such as model-driven and

service-oriented architectures

• Demonstrate an appreciation for the architectural concerns and approach for families of products.

UNIT-I

Review of Basic Concepts: What is a pattern? What makes a pattern? Pattern Categories;

Relationships between patterns; Pattern description; Patterns and software architecture; What

software architecture is and what it is not; Other points of view; Architectural patterns,

reference models and reference architectures; Importance of software architecture;

Architectural structures and views. Designing the Architecture: Architecture in the life

cycle; Designing the architecture; Forming the team structure; Creating a skeletal system.

UNIT-II

Reconstructing Software Architectures: Introduction informal extraction. Database

construction; View fusion; Reconstruction; Examples. Software Product Lines:

Introduction; what makes software product lines work? Scoping; Architectures for product

lines; what makes software product lines difficult?

UNIT-III

Building Systems from Off-the-Shelf Components: Impact of components on architecture;

Architectural mismatch; Component-based design as search; ASEILM example. Some

Design Patterns: Introduction; Management: Command processor, View handler;

Communication: Forwarder-Receiver, Client-Dispatcher-Receiver, Publisher-Subscriber.

UNIT-IV

Pattern Systems: What is a Pattern System? Pattern classification; Pattern selection; Pattern

systems as implementation guidelines; The evolution of pattern systems. Case Studies: Key

Word In Context; Instrumentation Software; Mobile Robotics; Cruise Control; The World

Wide Web: A case study in interoperability; J2ee / EJB: A case study in industry-standard

computing infrastructure.

TEXT BOOKS:

1. Len Bass, Paul Clements, Rick Kazman: Software Architecture in Practice, 2nd Edition,

Pearson Education, 2003.

2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal:

Pattern- Oriented Software Architecture, A System of Patterns, Volume 1, John Wiley and

Sons, 2007.

3. Mary Shaw and David Garlan: Software Architecture-Perspectives on an Emerging

Discipline, PHI Learning, 2007.

REFERENCE BOOKS:

1. E. Gamma, R. Helm, R. Johnson, J. Vlissides: Design Patterns-Elements of Reusable

Object- Oriented Software, Pearson Education, 1995.

2. Web site for Patterns: http://www.hillside.net/patterns/

PCS223C ADVANCED COMPUTER NETWORKS 4 Credits

Contact Hours (L-T-P-S):3-2-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Computer Networks. Course Outcomes:

• Know the details of encoding, error detection, and reliable transmission in direct link

networks.

• Explain the functioning of switching and forwarding of packets in ATM and packet

switching network.

• Explore the routing algorithms in internet work.

• Identify the functions of end to end protocols: TCP, UDP.

• Know the details of congestion control and resource allocation in network.

• Explore the end to end data representation and compression

• Explore the function of applications layer protocols.

• Identify the wireless networks, link level design and channel access.

• Explore the optical networks LAN, links, optical cross connects.

Unit – I 12 Hours

Review of Basic Concepts: (Self Study)

Direct link networks : Hardware Building Blocks-nodes, links; Encoding, Framing (Self

Study), Error Detection- Two-Dimensional Parity, Internet checksum Algorithm, cyclic

Redundancy Check; reliable Transmission- Stop-and-Wait, Sliding Window, Concurrent

Logical Channels; Ethernet (802.3), Rings (802.5, FDDI) – Token Ring Media Access

Control, Token Ring Maintenance, FDDI (Self Study), Wireless.

Packet Switching: Switching and forwarding – Datagrams, Virtual Circuit Switching,

Source Routing; Bridges and LAN Switches – Learning Bridges, Spanning Tree Algorithm,

Broadcast and Multicast, Limitations of Bridges; cell switching (ATM) – Cells, Segmentation

and Reassembly, Virtual Paths, Physical Layers for ATM, Implementation and Performance.

Unit – II

12 Hours

Internetworking: Simple internetworking (IP) – What is an Internetwork?, Service Model,

Global Address, Datagram Forwarding in IP, Address Translation(ARP), Host

Configuration(DHCP), Error Reporting(ICMP), Virtual Networks and Tunnels; Routing –

Network as a Graph, Distance Vector(RIP), Link State(OSPF), Metrics, Routing for Mobile

Hosts, Global Internet – Subnetting, Classless Routing(CIDR), Interdomain Routing(BGP),

Routing Areas, IP Version 6(IPv6), Multiprotocol Label Switching - Destination-Based

Forwarding, Explicit Routing, Virtual Private Networks and Tunnels.

End-to-End Protocols: Simple Demultiplexer (UDP); Reliable byte stream (TCP) – End-to-

End Issues, Segment Format, Connection Establishment and Termination, Sliding Window

Revisited, Triggering Transmission, Adaptive Retransmission, Record Boundaries, TCP

Extensions, Alternative Design Choices, Remote Procedure Call – RPC Fundamentals, RPC

Implementaions (SunRPC, DCE)

Unit – III

12 Hours

Congestion Control and Resource Allocation: Issues in resource allocation – Network

Model, Taxonomy, Evaluation Criteria; Queuing discipline – FIFO, Fair Queuing; TCP

Congestion Control – Additive Increase/Multiplicative Decrease, Slow Start, Fast Retransmit

and Fast Recovery; Congestion – Avoidance mechanisms – DECbit, Random Early Detection

(RED), Source-Based Congestion Control, Quality of Service – Application Requirements,

Integrated Services (RSVP), Differentiated Services, Equation-Based Congestion Control.

End – to – End Data: Presentation Formatting – Taxonomy, Examples (XDR, ASN.1,

NDR), Markup Languages (XML), Data Compression – Lossless Compression Algorithms,

Image Compression (JPEG), Video Compression (MPEG), Transmitting MPEG over a

Network, Audio Compression (MP3)

Applications: Traditional applications – Electronic Mail (SMTP, MIME, IMAP), World

Wide Web (HTTP), Name Service (DNS), Network management (SNMP); Web services –

Custom application Protocols (WSDL, SOAP), A Generic application Protocol (REST) (Self

Study), Multimedia Applications – Session Control and Call control, Resource Allocation for

Multimedia Applications, Overlay Networks – Routing Overlays, Peer-to-Peer Networks,

Content Distribution Networks.

Unit – IV

12 Hours

Wireless networks: Introduction; The wireless channel; Link Level Design; Channel access;

Network design; Wireless Networks Today; Future Systems and Standards.

Optical Networks: Optical Links; WDM systems; Optical Cross-Connects; Optical LANs;

Optical Paths and Networks.

TEXT BOOKS:

1. Larry L. Peterson and Bruce S. David: Computer Networks – A Systems Approach,

4th Edition, Elsevier, 2007.

2. J. Walrand and P. Varaya, “High Performance Communication Networks”,

Harcourt Asia (Morgan Kaufmann), 2000

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.

PCS009E CRYPTOGRAPHY AND NETWORK SECURITY 4 Credits

Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Computer Networks. Course Outcomes:

• State the principles and practices of cryptography and network security.

• Understand, analyze and use various cryptographic techniques.

• Understand the practical applications (such as in email, IP and the web) that have

been implemented and are in use to provide network security.

• Apply correct cryptographic and authentication techniques to provide required

security services to their applications.

UNIT-I 12 Hrs

Symmetric Ciphers: Overview: Services, Mechanisms and Attacks, The OSI Security

Architecture, A Model of Network Security. Classical Encryption Techniques: Symmetric

Cipher Model, Substitution Techniques, Transposition Techniques, Rotor Machines,

Steganography. Block Cipher and the Data Encryption Standard: Simplified DES, Block

Cipher Principles.

UNIT-II

12 Hrs

The Data Encryption Standard, The Strength of DES, Differential and Linear Cryptanalysis.

Symmetric Ciphers: Triple DES, Blowfish. Confidentiality Using Conventional Encryption:

Placement of Encryption Function, Traffic Confidentiality, Key Distribution, Random

Number Generation.

Public-Key Encryption, Digital signatures and Authentication Protocols:Number Theory:

Prime Numbers, Format’s and Euler's Theorems, Testing for Primality. Public-Key

Cryptography and RSA: Principles of Public Key Cryptosystems, The RSA Algorithm, Key

Management, Diffie Hellman Key Exchange.

UNIT-III

12 Hrs

Message Authentication: Authentication Requirements, Authentication Functions, Message

Authentication Codes, MDS Message Digest Algorithm. Digital Signatures and

Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature

Standard.

Network Security: Authentication Applications: Kerberos, XS09 Directory Authentication

Service. Electronic Mail Security: Pretty Good Privacy.

UNIT-IV

12 Hrs

IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulation

Security Payload. Web Security: Web Security Requirements, Secure Sockets Layer and

Transport Layer Security, Secure Electronic Transaction.

Text book

William Stallings, Cryptography and Network Security.

PCS023E STORAGE AREA NETWORKS 4 Credits Contact Hours (L-T-P-S) :4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Computer Networks. Course Outcomes:

• Know the architecture of basic components in storage area networks.

• Explain the functioning of the protocols used in disk subsystem.

• Explore the functions of storage network components.

• Identify the fiber communication in storage networks.

• Know the details of network attached storage.

• Explore the file system in storage area networks.

• Illustrate virtualization in storage networks.

• Identify the hardware devices and software in storage area networks.

• Explore management and security issues.

UNIT-I

12 Hrs

Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT

Architecture and its advantages. Case study: Replacing a server with Storage Networks The

Data Storage and Data Access problem; The Battle for size and access.Intelligent Disk

Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O

Channels; JBOD, Storage virtualization using RAID and different RAID levels; Caching:

Acceleration of Hard Disk Access; Intelligent disk subsystems, Availability of disk

subsystems.

UNIT-II

12 Hrs

I/O Techniques:The Physical I/O path from the CPU to the Storage System; SCSI; Fibre

Channel Protocol Stack: FC0,FC1,FC2,FC3,FC4, Fibre Channel SAN: Point-to-ponit

topology, Fabric topology, Arbitrated loop, Hardware components, InetrSANs, IP Storage.

File System and NAS:Local File Systems; Network file Systems and file servers; Shared

Disk file systems; Comparison of fibre Channel and NAS.

UNIT-III

12 Hrs

Storage Virtualization: Definition of Storage virtualization ; Implementation

Considerations; Storage virtualization on Block or file level; Storage virtualization on various

levels of the storage Network; Symmetric and Asymmetric storage virtualization in the

Network. SAN Architecture and Hardware devices:Overview, Creating a Network for

storage; SAN Hardware devices; The fibre channel switch; Host Bus Adaptors; Putting the

storage in SAN; Fabric operation from a Hardware perspective.

UNIT-IV

12 Hrs

Software Components of SAN: The switch’s Operating system; Device Drivers; Supporting

the switch’s components; Configuration options for SANs. Management: Planning Business

Continuity; Managing availability; Managing Serviceability; Capacity planning; Security

considerations.

TEXT BOOKS:

1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: “Storage Networks Explained”,

Wiley India, 2007

2. Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-

Hill, 2003.

REFERENCE BOOKS:

1. Richard Barker and Paul Massiglia: “Storage Area NetworkEssentials A

CompleteGuide to understanding and Implementing SANs”, John Wiley India,

2002.

PCS029E REAL TIME SYSTEMS 4 Credits Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Basics of Computer, Operating System. Course Outcomes:

• Model real-time systems using formal models of timed behavior.

• State properties of timed system behavior.

• Explain various principles underlying automated verification.

• Use tools to assist verification of real-time properties.

• Understand selected verification techniques and know their advantages and

limitations.

• To use different abstraction levels during real-time systems development.

• Analyze scheduling aspects of real-time systems.

• Implement real-time programs on real-time operating systems.

UNIT –I

12 Hrs Basic Real-Time Concepts: Basic Computer Architecture-Bus Transfer Mechanism, Input

and Output, Memory, CPU Operation; Some Terminology- Software Concepts, System

Concepts, Real-Time Definitions, Events and Determinism, Synchronous and Asynchronous

Events, Determinism, Time-Loading; Real-Time Design Issues; Example Real-Time

Systems; Brief History-Software, Hardware. Language Issues : Language

features:parameter passing,recursion,dynamic allocation,typing,exception handling,abstract

data typing,modularity.Real- Time Specification And Design Techniques: Natural

Languages; Mathematical Specification; Flowcharts; Structure Charts; Pseudocode and

Programming Design Languages; Finite State Automata; Data Flow Diagrarns- DeMarco's

Rules, Hatley and Pribhai's Extensions; Petri Nets; Warnier-Orr Notation- Indexed Loop;

Statecharts- Depth, Orthogonality, Broadcast Communication; Sanity in Using Graphical

Techniques.

UNIT –II 12 Hrs

Real- Time Kernels: Polled Loop System- Polled Loop with Interrupts; Phase/State- Driven

Code; Coroutines; Interrupt-Driven Systems- Context Switching, Round-Robin Systems,

Preemptive Priority Systems, Major and Minor Cycles, Hybrid Systems;

Foreground/Background Systems- Background Processing, Initialization, Real- Time

operation; Full-Featured Real Time Operating Systems- Task- Control Block Model; Build or

Buy? POSIT. Intertask Communication And Synchronization: Buffering Data- Time-

Relative Buffering, Ring Buffers; Mailboxes Mailbox Implementation, Other Operations on

Mailboxes, Queues; Critical Regions; Semaphores- Mailboxes and Semaphores, Counting

Semaphores, Problems with Semaphores, The Test- and- Set Instruction; Event Flags and

Signals; Deadlock- Avoidance, Detect and Recover. Real-Time Memory Management:

Process Stack Management- Task-Control Block Model, Managing the Stack, Run-Time

Ring Buffer, Maximum Stack Size, Multiple Stack Arrangements, Task-Control Block

Model;

UNIT –III

12 Hrs Real-Time Memory Management :contd :Dynamic Allocation-Swapping, Overlays, MFT,

MVT, Demand Paging, Working Sets, Real Time Garbage Collection, Contiguous File

Systems; Static Schemes. System Performance Analysis And Optimization: Response-

Time Calculation- Polled Loops, Coroutines / Phase- Driven Code, Interrupt Systems;

Interrupt Latency- Propagation Delay, Macroinstruction Execution Times, Interrupts

Disabled, Preemption, Low Priority Interrupts High; Time-Loading and Its Measurement

Using a Logic Analyzer, Instruction Counting, Pictorial Representation, Instruction

Execution Time Simulators, Deterministic Performance; Scheduling Is NP-Complete;

Reducing Response Times and Time Loading- Compute at Slowest Cycle, Scaled Arithmetic,

Binary Angular Measurement, Look-Up Tables, Basic Optimization Theory, Other

Optimization Techniques, Combination Effects, Speculative Execution; Analysis of Memory

Requirements- Memory-Mapped I/O and DMA Memory, Program Area, RAM Area, Stack

Area, Memory Management Schemes; Reducing Memory-Loading- Variable Selection,

Reuse Variables, Memory Fragmentation, Self-Modifying Code; I/O Performance.

QUEUING MODELS: Probability Functions- Continuous; Discrete; Basic Buffer Size

Calculation- Handling Bursts of Data, Variable Buffer Size Calculation; Classical Queuing

Theory- The M/M/1 Queue, Service and Production Rates, More Buffer Calculations,

Response- Time Modeling, Other Queuing Models; Little's Law; Erlang's Formula.

UNIT –IV 12 Hrs

Reliability, Testing, And Fault Tolerance

"Faults, Failures, Bugs and Effects; Reliability- Formal Definition, Calculating System

Reliability; Testing- Unit Level Testing, System Level Testing, Statistically Based Testing,

Cleanroom Testing, Stress Testing; Fault Tolerance- General Problems Handling, N-Version

Programming, Built-In-Test Software, CPU Testing, Memory Testing, Spurious and Missed

Interrupts, Dealing with Bit Failures.

Hardware /Software Integration

Goals of Real-Time System Integration- System Unification, System Validation; Tools-

Millimeters, Oscilloscope, Logic Analyzer, In-Circuit Emulator, Software Simulators,

Hardware Prototypes/ Simulators, Debuggers; Methodology- Establishing a Baseline,

Backoff Method, Patching; The Software Heisenberg Uncertainty Principle- Real-World

Analogies, The Software Heisenberg Uncertainty Principle, Testing of Software, Time- and

Memory-Loading, Other Implications.

REAL-TIME APPLICATIONS

Real-Time Systems as Complex Systems; The First Real-Time Application; Real-Time

Databases; Real-Time Image Processing- Virtual Reality, Multimedia; Real-Time UNIX;

Building Real-Time Applications with Real-Time Programming Languages.

TEXT BOOK:

1) Phillip A. Laplante,' Real- Time Systems Design and Analysis- An Engineer's Handbook,' PHI Publications, Second Edition, 2000 (Chapters 1,3,5; 6,7,8,9,10,11,13,14)

PCS224T Term Paper 2 Credits Contact Hours (L-T-P-S):0-2-2-0 CIE marks : 50

SEE marks : 50

Pre-requisites: Basics of CS Course Outcomes:

• To understand the domain of computing and research.

• To understand the issues and challenges in corresponding domain.

• Capability to analyze the existing solutions

• Explore new innovative solutions

• To improve communication and presentation abilities

• To enhance the technical writing skills.

A term paper is a research paper written by students over an academic term or semester

which accounts for a large amount of a grade and makes up much of the course. Term papers

are generally intended to describe an event or concept or argue a point. There is much overlap

between the terms "research paper" and "term paper". The phrase "term paper" was originally

used to describe a paper (usually a research based paper) that was due at the end of the "term"

- either a semester or quarter, depending on which unit of measure a school used. However,

the term has fallen out of favor. Common usage has "term paper" and "research paper" as

interchangeable, but this is not completely accurate. Not all term papers involve academic

research, and not all research papers are term papers.

THIRD SEMESTER

Sl. No

Subject Code Subjects Name

Hours / Week C

Exam Marks L T P S CIE SEE Total

1 PCS321C Soft Computing & Intelligent Systems

4 0 0 0 4 50 50 100

2 PCS322C Database Technologies 4 0 0 0 4 50 50 100

3 PCS323C Effective Teaching Learning Practices

2 2 2 4 4 50 50 100

4 PCS324M Industrial Workshop (Mandatory)

0 4 4 4 0 50 - 50

5 PCSXXXE Elective-VI 4 0 0 0 4 50 50 100

6 PCS325P Project Phase I 0 8 8 4 8 50 50 100 Total 14 12 16 12 24 300 250 550

PCS321C Soft Computing and Intelligent System 4 Credits Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisite: Basics of Computer Science

Course Outcome:

• Identify and describe soft computing techniques and their roles in building intelligent

machines

• Recognize the feasibility of applying a soft computing methodology for a particular

problem.

• Apply fuzzy logic and reasoning to handle uncertainty and solve engineering

problems.

• Apply neural networks to pattern classification and regression problems.

• Effectively use existing software tools to solve real problems using a soft computing

approach.

• Evaluate and compare solutions by various soft computing approaches for a given

problem.

UNIT I

12 Hours Introduction to intelligent systems and soft computing:

Introduction, Intelligent systems, Knowledge-based systems, Knowledge representation and

processing, soft computing, Problems. Fundamentals of fuzzy logic systems: Introduction

,Background , Fuzzy sets, Fuzzy logic operations , Generalized fuzzy operations, Generalized

fuzzy complement , Implication (if-then),Some definitions , Fuzziness and fuzzy resolution ,

Fuzzy relations, Composition and inference , Considerations of fuzzy decision-making,

Problems.

UNIT II

12 Hours

Fuzzy logic control: Introduction, Background, Basics of fuzzy control, Fuzzy control

architectures, Properties of fuzzy control, Robustness and stability, Problems. Fundamentals

of artificial neural networks: Introduction, Learning and acquisition of knowledge, Features

of artificial neural networks, Fundamentals of connectionist modeling, Problems.

UNIT III

12 Hours

Major classes of neural networks: Introduction ,The multilayer perceptron , Radial basis

function networks, Kohonen's self-organizing network , The Hopfield network , Industrial

and commercial applications of ANN , Problems , Introduction to Support vector machines,

Problems.

Neuro-fuzzy systems: Introduction, Background, Architectures of neuro-fuzzy systems,

Construction of neuro-fuzzy systems, Problems.

UNIT IV

12 Hours

Soft computing for smart machine design: Introduction, Controller tuning, Supervisory

control system, Problems. Tools of soft computing in real-world applications: Case study:

Soft computing tools for solving a class of facilities layout planning problem, Mobile position

estimation using an RBF network in CDMA cellular systems, Learning-based resource

optimization in ATM networks.

Text Book:

2) Fakhreddine O.Karray, Clarence De Silva, “Soft Computing and Intelligent Systems

Design Theory, Tools and Application”, Pearson Education.

3) Vojislav Kecman, “ Learning and Soft Computing: Support Vector Machines, Neural

Networks, and Fuzzy Logic Models”, Pearson Education (Asia) Pte. Ltd. 2004.

Reference Book(s):

1) Naresh sinha, Madan Gupta “Soft computing and Intelligent Systems- theory and

application”,

2) Addison Wesley.

3) Timothy J.Ross, "Fuzzy Logic with Engineering Applications", McGraw-Hill, 1997.

PCS322C DATABASE TECHNOLOGY 4 Credits

Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisite: Database Management System

Course Outcome:

• Define and explain relational model concepts, constraints and schemas

• Describe update operations, transactions and constraint violations

• List and distinguish the types of database system architectures

• Describe the database system architectures

• Know the need for parallel databases

• Define I/O parallelism

• List and describe types of partitioning techniques

• Define and explain Interquery and Intraquery parallelism.

• Describe Intraoperation and Interoperation parallelism.

• Define and explain query optimization.

• Identify and Explain concepts of object-oriented databases.

• Describe object database standards, languages and design.

• Define distributed databases.

• List and explain the types of distributed databases.

• Identify and describe the concepts of distributed databases.

• Define a data warehouse and data mining.

• Describe the architecture and implementation of data warehouse.

• Explain the concepts of data warehousing and mining via. Classification, clustering

and association rules.

• Identify enhanced data models and their applications.

• List and Explain recent advanced database applications.

UNIT – I 12 Hrs

Review of Relational Data Model and Relational Database Constraints: Relational model

concepts; Relational model constraints and relational database schemas; Update operations,

transactions and dealing with constraint violations. Database-System Architectures:

Centralized and Client-Server Architecture; Server System Architectures; Parallel Databases;

Distributed Systems; Network Types. Parallel Databases: Introduction; I/O Parallelism,

Interquery Parallelism; Intraquery Parallelism; Intraoperation Parallelism; Interoperation

Parallelism; Query Optimization.

UNIT – II

12 Hrs Concepts of Object Databases: Overview of Object-Oriented Concepts; Objects, identity,

Object Structure and Type Constructors; Encapsulation of operations, methods, and

persistence; Type and class hierarchies, and inheritance; complex objects. Object Database

Standards, Languages and Design: Overview of Object model of ODMG; Object definition

Language ODL; Object Query Language OQL; Conceptual design of Object database.

UNIT – III

12 Hrs Distributed Databases: Homogeneous and heterogeneous Databases; Distributed Data

storage; Distributed transactions; Commit Protocols; Concurrency Control in Distributed

Databases; Availability; Distributed Query Processing; Heterogeneous Distributed Databases.

Data Warehousing and Mining: Decision-Support Systems; Data Warehousing; Data

Mining; Classification; Association Rules; Other Types of Associations; Clustering; Other

Forms of Data Mining.

UNIT – IV 12 Hrs

Enhanced Data Models for Some Advanced Applications: Active database concepts and

triggers; Temporal, Spatial, and Deductive Databases – Basic concepts. More Recent

Applications: Mobile databases; Multimedia databases, Geographical information system

and Genome database management. The concept of big data.

Text Books:

1) Rameez Elmashri, Shamakant B Navathe, ‘Fundamentals of Database Systems’, Fifth Edition, Pearson Education. (5.1-5.3 (except 5.2.5 & 5.3.4); 20.1-20.5; 21.1- 21.5(except21.4); 24.1-24.4(except 24.3.2 & 24.4.5-24.4.8); 30.1-30.4(except 30.2.3).

2) Abraham Silberschatz, Henry. F. Korth and S.Sudharsan, “Database System

Concepts”, Sixth Edition, Tata McGraw Hill, 2011. (17.1- 17.5; 18.1-18.7; 19.1-19.8 (except 19.4.3, 19.6.3-19.6.6); 20.1- 20.8 (except 20.4.2 – 20.4.4).

REFERENCE BOOKS:

1) Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd

Edition, McGraw-Hill, 2003.

2) Connolly and Begg: Database Systems, 4th Edition, Pearson Publications, 2009.

PCS323C Effective Teaching-Learning Practices 2 Credits

Contact Hours (L-T-P-S):0-2-2-4 CIE marks : 50 Total hours : 24 SEE marks : 50 Pre-requisite: Presentation Skills

Course Outcome:

• Design/Plan Instruction

• Create/Maintain Learning

• Climates

• Implement/Manage Instructions

• Assesses and Communicates Learning Results

• Reflects/EvaluatesTeaching/Learning skills

• Engage in Professional Development

• To organize Knowledge of Content

UNIT I

6 Hrs

Scientific Basis of art of Teaching, andragogy Analysis of Adult learning, Cognitive and Social Learning Theory, Profile of Adult learning. Content Analysis: Categories of Content, facts concepts and theory of content analysis. Preparation of Content map on context. Instructional Objectives and Phases of teaching.

UNIT II

6 Hrs Instructional Planning, Writing Instructional objectives, preparing instructional resources. Types of Objectives : program, course, and classroom objectives. Establishing specific objectives. Planning by level of Instructions. Blooms Taxonomy.

UNIT III

6 Hrs Skills of Teaching : Introduction, Purpose of Introduction. Ways of Introducing a topic. Motivation. Role of motivation, in learning. Skill of explanation, Types of explanation and their requirements. Skill of questioning in class. Reasons of questioning in the class. Teaching in concept of generalization, with illustration of example, types of examples, sequencing of examples

UNIT IV 6 Hrs

Presentation skills, various methods of teaching, Ausubels advanced organization strategy, Bruner’s concept of attainment strategy. Academic standards and student assessment and evaluation : Standards, evaluate student learning , criteria for selecting tests Standardized and non standardized tests strengths and limitation, ABET Standard: For engineering teachers Reference. TEXT BOOK:

1. Strategies for Effective Teaching, Allan C. Ornstein, McGrawHill REFERENCE BOOKS:

1) A Taxonomy for Learning Teaching and Assessing, Lorin W. Anderson and David R. Krathwohl, Pearson Education

2) Andrew W Apple, 1997,Modern Compiler Implementation in C –Cambridge Theory - 2 Credits Practical (Delivery + Material preparation) - 2 Credits Allotment of topics/subject/delivery sessions:

• A student is associated with a subject teacher. • The subject teacher will assign 8 sessions (1 per week) • The teacher will assess the teaching material (including handouts) prior to the delivery. • The teacher will evaluate his delivery for every session and keep records. • The teacher will submit internal evaluation report at the end of semester Conduction of CIE: • Two CIE’s based on theory (30 Marks) • Internal evaluation of teachers (20 Marks 15 CIE Presentation + 5 Marks assignments)

Conduction of SEE: • Theory (50% of Marks) Examination for 100 Marks to be reduced to 25 Marks. • Presentation + report submission (50% of Marks) 50 Marks to be reduced to 25 Marks.

PCS007E DISTRIBUTED SYSTEMS 4 Credits Contact Hours (L-T-P-S) :4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisite: Database Management System

Course Outcome:

• Define distributed systems (DS) and list the examples of DS such as Internet, intranet,

mobile and ubiquitous computing and need of resource sharing in the web.

• Describe and analyze the challenges of DS, architectures in DS, Internet protocols,

and inter-process communication.

• Describe how the distributed objects will communicate and how the remote method

invocation takes place in distributed objects.

• Describe the support of operating system for communication through processes and

threads and list the security techniques used for safe operation of distributed

communication.

• Explain the working of distributed file servers and distributed shared memory.

• Explain transactions, concurrency control techniques like locking, optimistic

concurrency control etc.

• Describe distributed transactions.

UNIT I 12 Hrs

Characterization of Distributed Systems and System Models: Introduction, Examples of

distributed systems, Resource sharing and the Web, Challenges, Architectural models,

Fundamental models. Networking and Internetworking: Types of Networks, Networks

principles, Internet protocols, Network case Studies (Ethernet, wireless LAN and ATM).

Interprocess Communication: Introduction, The API for the Internet protocols, External data

representation and marshalling, Client-Server communication, Group communication

UNIT II 12 Hrs

Distributed Objects and Remote Invocation : Communication between distributed objects,

Remote procedure call, events and notifications, JAVA RMI case study. Operating System

Support and Security: The Operating system layer, protection, processes and threads,

communication and invocation , operating system architecture, overview of security

techniques, cryptographic algorithms, digital signatures, cryptography pragmatics, case

studies: Needham-Schroeder, Kerberos, SSL and Millicent.

UNIT III 12 Hrs

Distributed File Systems : File service architecture, Sun Network file system, Andrew file

system, Recent advances. Transactions and Concurrency Control : Transactions, nested

transactions, locks, optimistic concurrency control, timestamp ordering, comparison of

methods for concurrency control.

UNIT IV

12 Hrs Distributed Transactions :Flat and nested distributed transactions, atomic commit protocols,

concurrency control in distributed transactions, distributed deadlocks, transaction recovery.

Distributed Shared Memory:Design and Implementation issues, sequential consistency and

Ivy, Release consistency and Munin, other consistency models

CASE Studies: COBRA , Mach

TEXT BOOK: 1. George Coulouris, Jean Dollimore, Tim Kindberg: “Distributed Systems, Concept and

Design” , 3rd edition, Pearson Education, 2005.

Reference:

1. Andrew S. Tanenbaum & Marten van Steen, Distributed Systems – Principles and

Paradigms, PHI, 2002.

PCS324M Industrial Workshop Mandatory

Contact Hours (L-T-P-S): 0-4-4-0 CIE marks : 50 SEE marks : 50

Course Outcome:

• Industrial domain experts in computing technologies are invited to deliver

industrial processes and practices and also awareness of hands on skills.

This mode helps students to

• Build ability to apply the knowledge of science and technology, to real world

problems.

• Build an ability to design and develop solutions to industrial problems.

• Identify and formulate the engineering problems.

• Insists an ability to use the techniques, skills, and modern engineering tools

necessary for engineering practice. Thus the tutorial components enhance the

design and implementation aspects of the graduates, contributes to attainment

of programme outcomes.

Every student has to attend a training conducted by the department in collaboration with

industrial experts. CIE will be conducted during the training program. Every student has to

submit a report on training. SEE involves Presentation to Departmental evaluation

committee.

PCS325P Project Phase I

08 Credits

Contact Hours (L-T-P-S): 0-8-8-4 CIE marks : 50 SEE marks : 50

Course Outcomes:

• Facilitates the students to explore their knowledge

• Strengthens their fundamentals and build an ability to identify, formulate, and

solve engineering problems, ability to design and conduct experiments, as well

as to analyze and interpret data,

• Apply the engineering concepts to the real world problems and develop

quality software to meet the societal needs.

• Encourage the students to take up innovative research projects and work for

the solution.

The Phase I include:

1) Deciding the broad area for project work.

2) Sufficient literature Survey (Minimum of 10-15 literatures includes Research papers,

technical reports, white papers, manuals and survey reports.

3) Identification of Issues and defining problem.

4) A report containing summary of survey made covering issues and problem definition

with print outs of all literature documents.

5) Presentation on survey made.

Scheme of Evaluation for Project Phase I

CIE Evaluation

By Guide for Report writing : 50 Marks

SEE Evaluation

Report Evaluation (Survey of minimum of 25 papers of relevant research area) : 25

Marks

Seminar (Presentation) : 25 Marks

TOTAL : 100 Marks

IV SEMESTER

Sl. No

Subject Code

Subjects Name Hours / Week

C Exam Marks

L T P S CIE SEE Total 1 PCS421P Project Phase II 0 12 24 12 24 50 50 100

Total 0 12 24 12 24 50 50 100

CS421P Project Phase II 08 Credits Contact Hours (L-T-P-S): 0-12-24-12 CIE marks : 50 SEE marks : 50

Pre-requisites: Knowledge on project domain and technology. Course Outcomes:

• Facilitates the students to explore their knowledge

• Strengthens their fundamentals and build an ability to identify, formulate, and

solve engineering problems, ability to design and conduct experiments, as well

as to analyze and interpret data,

• Apply the engineering concepts to the real world problems and develop

quality software to meet the societal needs.

• Encourage the students to take up innovative research projects and work for

the solution.

Guidelines for Project Phase II and Scheme of Evaluation

CIE: 50 Marks

Project progress Presentation I 10 Marks Project progress Presentation II 10 Marks Project progress Presentation III 10 Marks Project Presentation IV 10 Marks Report Writing 10 Marks TOTAL 50 Marks

SEE out of 100 Marks: Report Evaluation and Viva voce Examination by three examiners

1. Internal examiner 2. External Examiner 3. HOD/Nominee

70 Marks for Report Evaluation (Average of Marks given by three examiners)

30 Marks for Viva Voce examination (Joint evaluation by three exanimers)

Total 100 Marks.

Final Marks= CIE Marks out of 50+ 50% of SEE (50% of out of 100)