Distributed Operating Systems Transparency InterProcess Communication -Client - Server Model – Remote Procedure Call - Group Communications - Threads - System Models - Process Synchronisation - Deadlocks - Solutions - Load Balancing - Distributed File Systems - Distributed Shared Memory Systems - Micro-Kernels.
UNIT IV FUNDAMENTAL DISTRIBUTED COMPUTING ASPECTS 9 Theoretical Foundations Logical Clocks Vector Clocks Global State Termination Correctness – Election Algorithms Termination Detection Fault Tolerance -Missing Token - Consensus Algorithms - Byzantine - Consensus - Interactive Consistency.
UNIT V MANAGING DISTRIBUTED DATA 9
Distributed Databases Distribution Transparency Distributed Database Design -Query Translation – -Query Optimisation - Concurrency Control - Object-Oriented Databases - Strategic Considerations - Applications of Object-oriented Databases.
TOTAL:45 Periods Learning Resources:
Text Books
1. Sape Mullender, Distributed Systems, Addison-Wesley, 1993.
2. Albert Fleishman, Distributed Systems - Software Design & Implementation, Springer-Verlag, 1994.
Reference Books
1. Mukesh Singal and Shivaratu N.G., Advanced Concepts in Operating Systems, McGraw Hill, Newyork,1994.
2. George Coulouris and Jean Dollimore, Distributed Systems - Concepts and Design, Addison-Wesley, 1988.
3. Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.
Online Resources
1. mucompssem8.blogspot.com/2012/03/distributed-computing-notes.htm 2. cs-www.cs.yale.edu/homes/aspnes/classes/465/notes.pdf
3. dcg.ethz.ch/lectures/podc_allstars/
4. web.eecs.umich.edu/~farnam/498/handout1c.pdf
5. www.cs.princeton.edu/courses/archive/spr01/cs461/lectures.html
UECSB44 INFORMATION AND CODING THEORY L T P C 3 0 0 3 Course Educational Objectives:
Students undergoing this course are exposed to
Understand the difference between “data” and “information” in a message.
Learn how to analyze and measure the information per symbol emitted from a source.
Learn how to analyze the information-carrying capacity of the communication channel.
Learn how to design source compression codes to improve the efficiency of information transmission.
Learn how to adapt and tailor known error control codes for use in particular applications.
Learn the basic theory needed for data encryptions.
Course Outcomes
Upon the successful completion of the course, learners will be able to CO
CO1 Understand the mathematical theory of linear channel codes
for error detection and correction K1
CO2 Evaluate the information rate of various information sources.K2 CO3 Implement cyclic block codes using feedback shift register
logic circuits. K2
CO4 Explain and analyse source coding, compression and error
control methods. K2
CO5 demonstrate and design simple convolutional codes. K3 Pre-requisite: Digital principles and system design
Course Content
UNIT I INFORMATION THEORY 9
Information – Entropy, Information rate, classification of codes, Kraft McMillan inequality, Source coding theorem, Shannon-Fano coding, Huffman coding, Extended Huffman coding - Joint and conditional entropies, Mutual information - Discrete memory less channels – BSC, BEC – Channel capacity, Shannon limit.
UNIT II SOURCE CODING: TEXT, AUDIO AND SPEECH 9 Text: Adaptive Huffman Coding, Arithmetic Coding, LZW algorithm – Audio:
Perceptual coding, Masking techniques, Psychoacoustic model, MEG Audio layers I,II,III, Dolby AC3 - Speech: Channel Vocoder, Linear Predictive Coding
193
UNIT III SOURCE CODING: IMAGE AND VIDEO 9 Image and Video Formats – GIF, TIFF, SIF, CIF, QCIF – Image compression:
READ, JPEG – Video Compression: Principles-I,B,P frames, Motion estimation, Motion compensation, H.261, MPEG standard
UNIT IV ERROR CONTROL CODING: BLOCK CODES 9
Definitions and Principles: Hamming weight, Hamming distance, Minimum distance decoding - Single parity codes, Hamming codes, Repetition codes - Linear block codes, Cyclic codes - Syndrome calculation, Encoder and decoder – CRC
UNIT V ERROR CONTROL CODING: CONVOLUTIONAL CODES 9 Convolutional codes – code tree, trellis, state diagram - Encoding – Decoding:
Sequential search and Viterbi algorithm – Principle of Turbo coding
TOTAL= 45 PERIODS Learning Resources
Text Books:
1. R Bose, “Information Theory, Coding and Crptography”, TMH 2007
2. Fred Halsall, “Multidedia Communications: Applications, Networks, Protocols and Standards”, Perason Education Asia, 2002
Reference Books
1. K Sayood, “Introduction to Data Compression” 3/e, Elsevier 2006
2. S Gravano, “Introduction to Error Control Codes”, Oxford University Press 2007 3. Amitabha Bhattacharya, “Digital Communication”, TMH 2006
Web References
1. www.haverford.edu/cmsc/slindell/Classes/235/235.htm
2. www.cl.cam.ac.uk/teaching/.../Info Theory /Info TheoryLectures .pdf 3. www.mth.msu.edu/~jhall/classes/code notes / coding - notes .html 4. u.cs.biu.ac.il/~lindell/89-662/coding_theory-lecture-notes.pdf
UECSB45 PARALLEL COMPUTING L T P C 3 0 0 3 Course Educational Objective
Students undergoing this course are expected to
To study the scalability and clustering issues and the technology necessary for them.
To understand the technologies enabling parallel computing.
To study the different types of interconnection networks.
To study the different parallel programming models.
To study the software support needed for shared memory programming.
Course Outcomes:
CO No s
Course Outcomes Level of learning
domain (Based on revised Bloom’s taxonomy)
CO1 Explain the different types of interconnection networks K2
CO2 Demonstrate the concepts Parallel Algorithms K3
CO3 Demonstrate the concepts of Shared memory Based parallel Computers
K3
CO4 Illustrate and Simulate Shared memory on networks. K3
CO5 Demonstrate different parallel programming models K3
Prerequisite
Butterfly networks-parallel Algorithm for arithmetic- Linear Algerbra-fourier Transforms-recurrence Evaluations and defence graph problem- Use of Graph embedded techniques to compare different Networks
UNIT III 9
195
Shared memory Based parallel Computers-algorithms for list ranking-maximal independent set
UNIT IV 9
Arithmetic Expression Evaluation-convex hull problems and others-message routing – simulation of shared memory on networks
UNIT V 9
Thompson grid Model for VLSI layouts for standard interconnection networks-Area universal networks.
TOTAL: 45 periods Text Books:
1.Kai Hwang and Zhi.Wei Up,” Scalable Parallel Computing “,Tata McGrawHill,New Delhi 2003
2.David E.Culler & Jaswinder Pal Singh,” Parallel Computing Architecture”
Reference Books:
1.Michael J.Quinn,”Parallel Programming in C with MPI & Open MP”, Tata McGrawHill,New Delhi
2003
2.Kai Hwang,”Advanced Computer Architecture”, Tata McGrawHill,New Delhi 2003 3.Parallel Programming: Techniques and Applications Using Networked Workstations and ParallelComputers, 2nd Edition, Prentice Hall
4.Parallel Computing on Heterogeneous Networks, by Alexey Lastovetsky, Wiley, 2003,
ISBN: 0-471-22982-2
5.The Sourcebook of Parallel Computing, by Jack Dongarra, Ian Foster, Geoffrey Fox, Ken Kennedy, Andy White, Linda Torczon, and William Gropp, Morgan Kaufmann, ISBN: 1-55860-871-0
Online References
1. www.clear.rice.edu/comp422/lecture-notes/index.html 2. cs.nju.edu.cn/~gchen/teaching/fpc/fpc99.html
3. brahms.emu.edu.tr/rza/chapter1.pdf 4. grid.hust.edu.cn/ppcourse/lecture.html
UEBAB01 TOTAL QUALITY MANAGEMENT L T P C 3 0 0 3 Pre-requisite: None
Course Educational Objectives:
Students undergoing this course are exposed to
understand the philosophy and core values of Total Quality Management (TQM);
Determine the voice of the customer and the impact of quality on economic performance and long-term business success of an organization;
Apply and evaluate best practices for the attainment of total quality.
Course Outcomes:
Upon the successful completion of the course, learners will be able to CO
philosophies and frameworks K2
CO2
Develop in-depth knowledge on various tools and
techniques of quality management K1
CO3
Learn the applications of quality tools and techniques in both
manufacturing and service industry K1
CO4 understand proven methodologies to enhance excellence of an organization, and determine the set of performance indicators that will align people with the objectives of the organization.
K3 Course Content
UNIT I INTRODUCTION TO QUALITY MANAGEMENT 9
Definitions – TOM framework, benefits, awareness and obstacles. Quality – vision, mission and policy statements. Customer Focus – customer perception of quality, Translating needs into requirements, customer retention. Dimensions of product and service quality. Cost of quality.
UNIT II PRINCIPLES AND PHILOSOPHIES OF QUALITY MANAGEMENT 9 Overview of the contributions of Deming, Juran Crosby, Masaaki Imai, Feigenbaum, Ishikawa, Taguchi, Shingeo and Walter Shewhart. Concepts of Quality circle, Japanese 5S principles and 8D methodology.
UNIT III STATISTICAL PROCESS CONTROL AND PROCESS CAPABILITY