5th Sem Global Electives

8/12/2019 5th Sem Global Electives

1/32

Semester: V : GLOBAL ELECTIVES

NANOMATERIALS, PROCESS AND APPLICATIONS

Course Code: 10BG501 CIE Marks: 100

Hrs/Week: L:T:P : 3:0:0 SEE Marks: 100

Credits: 03 SEE Duration: 03 HrsCourse Learning Objectives:

To have the basic knowledge of the nanomaterials and the processes To know about their applications

Unit I 07 HrsIntroduction to Nanomaterials: History of Nanotechnology, Scope & Applications.Introduction and overview of Quantum concepts. Structures and properties of Carbon

based, metal based and bionanomaterials: Fullerenes, Bucky Ball, Nanotubes, Graphene,Quantum Dots, Nano Shells, Dendrimers, Nanocarriers, Nanocrystals, Nanowires,

Nanomembranes, hybrid biological/inorganic, protein & DNA based nanostructures.Introduction & overview of 1

st, 2

ndand 3

rdgeneration biomaterials, Thin films, Diamond

like carbon (DLC).

Unit II 07 HrsCharacterization of Nanostructures: Spectroscopy: UV-Visible spectroscopy, FourierTransform infrared spectroscopy (FTIR); X-ray spectroscopy.

Electron microscopy: Scanning electron microscopy (SEM), Transmission electron

microscopy (TEM), Scanning probe microscopy: Atomic Force microscopy (AFM),Scanning tunnel microscopy (STM).

Unit III 07 Hrs

Nano Synthesis and Fabrication: Introduction & overview of Nanofabrication: Bottom

up-self assembly and Top down approaches using processes like Ball milling, Sol-gel

Process, Chemical Vapour deposition (CVD). Plasma or flame spraying synthesis, Ion-Bean sculpting, electrodeposition and various lithography techniques. Nanolithography &

Soft lithography

Unit IV 07 HrsNanosensors: Overview of nanosensors: Nanosensors in industry, medicine and defense.Market for nanosensors. Electromagnetic nanosensors: Electronic nose and electronic

tongue, Magnetic nanosensors. Mechanical nanosensors: Cantilever Nanosensors,Mechanics of CNTs, Biosensors: Biosensors in modern medicine. Micro & Nano-

Electromechanical systems - Magnetic, Chemical and Mechanical Transducers Sensing

and Actuators.Unit V 08 Hrs

Application of Nanotechnology: Medical Nano biotechnology in Diagnostics,therapeutics, drug delivery, Nano Surgery and Tissue Engineering. Molecular electronics,

Molecular switches Mechanical: Cutting tools, Machine components, Magnets, DLC coatedgrinding wheels. Electrical/Electronics: Solar cells, UV/IR Sensors, Batteries/Fuel cells,

Filters. Nano Safety Issues: Toxicology health effects caused by Nanoparticles.

Course outcomes:After going through this course the student will be able to:

The students will have the basic knowledge of nanomaterials Explore the methods of synthesis, fabrication and characterization of nanomaterials. Apply the basic knowledge in different fields of engineering for development of

devices.

Reference Books

1 R Booker and E. Boyse., Nanotechnology; Wiley dreamTech; edition 2005. ISBN:


2/32

9780764583681

2 Chapman and Hall; Nanotechnology Basic Science & Emerging Technologies; CRC; 2002;ISBN: 9781584883395

3 T.C Lim., Nanosensors; Taylor and Francis edition; 2010.ISBN: 9781439804361

4 J R Sandra and W W David; Nanobiotechnology Protocols; Humana Press; 1stedition; 2005;

ISBN: 9781588292766

Scheme of Continuous Internal Evaluation:

CIE consists of Three Tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive) out ofwhich best of two will be considered. In addition there will be one seminar on new topics / model

presentation etc. for 10 marks.

Scheme of Semester End Examination:

The question paper consists of Part A and Part B. Part A will be for 20 marks covering the complete

syllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B will

have internal choice and one of the two have to be answered compulsorily.


3/32

Semester: V

FUEL CELL TECHNOLOGY



Credits: 03 SEE Duration: 3 Hrs

Course Learning Objectives:

Classify and understand the fundamentals of fuel cells Study the performance characteristics of fuel cells Develop fuel cell for industrial applications

Unit I 06 HrsIntroduction: Fuel cell definition, historical developments, Fuel cell reactions, Fuels &

fuel properties, working principle of fuel cell, components of fuel cell, EMF of the cell and

general performance characteristics.

Unit II 07 HrsFuel Cell Types:alkaline fuel cell, , polymer electrolyte fuel cell, phosphoric acid fuel cell,molten carbonate fuel cell, solid oxide fuel cell, Geometries of solid oxide fuel cells: planar,

tubular, Types of solid oxide fuel cells: High temperature, intermediate temperature ,Singlechamber solid oxide fuel cells, Advantages and disadvantages of fuel cells.

Unit III 07 Hrs

Fuel Cell Reaction Kinetics - electrode kinetics, overvoltages, Tafel equation, charge

transfer reaction, exchange currents, electrocatalyses - design, activation kinetics, Fuel cellcharge and mass transport - flow field, transport in electrode and electrolyte.

Unit IV 08 Hrs

Fuel Cell Characterization: - in-situ and ex-situ characterization techniques, i-V curve,

frequency response analyses; Fuel cell modeling and system integration: - 1D model -

analytical solution and CFD models.

Unit V 08 Hrs

Applications of Fuel Cells, Fuel Cell Power Plants: Hydrogen production fromrenewable sources and storage; safety issues, cost expectation and life cycle analysis of fuelcells.

Course outcomes:

After going through this course the student will be able to:1. Know the performance of various types of fuel cell

2. Construct fuel cells for specific applications

Reference Books

1. Gregor Hoogers ; Fuel cell technology handbook ; CRC Press 2003;2007;ISBN:9780849308772

2. Sammes Nigel; Fuel cell technology ;Springer; 2006; ISBN: 97818523397463. David Linden ;Handbook of Batteries and Fuel cell; McGraw-Hill Book Company4. Hightemperature Solid Oxide Fuel Cells: Fundamentals; Design & Applications;

S.C.Singhal,Elsevier publications;2003;ISBN:1856173879






syllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions


4/32

(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B willhave internal choice and one of the two have to be answered compulsorily.


5/32

Semester: V

SOLID WASTE MANAGEMENT



Credits: 03 SEE Duration : 3 Hrs


To analyse the present methods of solid waste management system. To analyse the drawbacks in the present system. To identify different elements of solid waste management. To design and develop recycling options for biodegradable waste by composting. To identify hazardous waste, e-waste, plastic waste and bio medical waste and their

management systems.

To understand various waste management statutory rules to the present system.Unit I 08 Hrs

Introduction: Land Pollution. Present solid waste disposal methods. Merits and demerits of

open dumping, feeding to hogs, incineration, pyrolysis, composting, sanitary landfill. Scopeand importance of solid waste management. Definition and functional elements of solid

waste management.Sources: Sources of Solid waste, types of solid waste, composition of municipal solidwaste, generation rate, Problems.Collection and transportation of municipal solid waste: Collection of solid waste-services and systems, Solid waste management 2000 rules with amendments. Site visit to

collection system.

Unit II 08 HrsComposting Aerobic and anaerobic composting - process description, process

microbiology, Vermicomposting, Site visit to compost plant.

Sanitary landfilling : Definition, advantages and disadvantages, site selection, methods,

reaction occurring in landfill- Gas and Leachate movement, Control of gas and leachatemovement, Site visit to landfill site.

Unit III 06 Hrs

Hazardous waste management: Definitions, Identification of hazardous waste,

Classification of hazardous waste, onsite storage, collection, transfer and transport,processing, disposal, hazardous waste (management and handling) rules 2008 with

amendments. Site visit to hazardous landfill site .

Unit IV 06 Hrs

Bio medical waste management: Classification of bio medical waste, collection.,

transportation, disposal of bio medical waste, Bio medical waste management rules. sitevisit to hospital to see the collection and transportation system and visit to biomedical waste

incineration plant.

Unit V 06 Hrs

E-waste management: Definition, Components, Materials used in manufacturing

electronic goads, Recycling and recovery integrated approach. Site visit to e- wastetreatment plant.Plastic waste management: Manufacturing of plastic with norms. Plastic wastemanagement rules with amendments.


6/32

Course outcomes:

After going through this course the student will be able to:

Analyse the present solid waste management system. Identify drawbacks in the present system and provide recycling and disposal options Identify hazardous waste and to give management system Identify biomedical waste, categorize and give solution for collection and

transportation of waste

Identify e-waste , plastic waste and to give recovery and recycling optionsReference Books

1. Tchobanoglous, Integrated Solid Waste Management McGraw hill publication. Internationaledition 1993, ISBN 978-0070632370

2. R.E. Hester, Roy M Harrison, Electronic waste management, Cambridge, UK, RSC

Publication, 2009, ISBN 9780854041121

3. Municipal Solid waste (Management & Handling Rules) 2000. Ministry of Environment &

Forest Notification, New Delhi, 25thSept 2000 and amendments

4. The Plastic Manufacture, Sale and usage Rules2009. Ministry of Environment and Forest

Notification, New Delhi, amendment on February 4, 2011






syllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B willhave internal choice and one of the two have to be answered compulsorily.


7/32

Semester: V

IMAGE PROCESSING





Analyze basic concepts and methodologies of Digital Image processing Apply Image enhancement techniques in both spatial and frequency domain methods Analyze image enhancement and restoration techniques. Perform image restoration using

convolution, discrete linear operators and filters.

Construct image features, segmentation and texture from an image. Analyze the different techniques in image compression.

Unit I 07 Hrs

Digital Image FundamentalsWhat is Digital Image Processing? Fundamental Steps in Digital Image Processing,

Components of an Image Processing System, Elements of Visual Perception, Image Sensingand Acquisition, Image Sampling and Quantization, Some Basic Relationships between

Pixels, Linear and Nonlinear Operations.

Unit II 07 HrsImage EnhancementImage Enhancement in Spatial domain, Some Basic Gray Level Transformations, Histogram

Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering,

Smoothing Spatial Filters, Sharpening Spatial Filters, Image Enhancement in the FrequencyDomain, Smoothing Frequency-Domain Filters, Sharpening Frequency Domain Filters, and

Homomorphic Filtering.

Unit III 07 Hrs

Image Restoration

A Model of the Image Degradation/Restoration Process, Noise Models, Restoration in thePresence 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, Constrained LeastSquares Filtering, Geometric Mean Filter, Geometric Transformations.

Unit IV 07 Hrs

Image SegmentationDetection of discontinuities, Edge linking and boundary detection, Thresholding, RegionBased Segmentation.

Unit V 08 Hrs

Morphological image processingPreliminaries, Dilation and Erosion, Opening and Closing, the Hit-or-Miss Transformation,

Some Basic Morphological Algorithms

Image Compression

Fundamentals, Image compression models, Elements of information theory, Error free.


Ability to describe the processes and hardware of image acquisition. Ability to apply pre-processing operations in image enhancement. Ability to compare various image segmentation and feature extraction operations. Ability to implement basic algorithms for image and video compression.

Reference Books


8/32

1. Rafael C. Gonzalez, Richard E. Woods; Digital Image Processing; Pearson Education; 1st

Edition; 2001; ISBN: 10: 0201180758

2. Chanda, D. Dutta Majumdar, Digital Image Processing and Analysis, PHI, 2003, ISBN:8120316185


CIE consists of Three Tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive) out of

which best of two will be considered. In addition there will be one seminar on new topics / modelpresentation etc. for 10 marks.


The question paper consists of Part A and Part B. Part A will be for 20 marks covering the completesyllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions (descriptive,

analytical, problems or/and design) carrying 16 marks each. All five from Part B will have internalchoice and one of the two have to be answered compulsorily.


9/32

Semester: V

RENEWABLE ENERGY SOURCES





To provide opportunity for students to work as part of teams on multidisciplinaryprojects.

To provide students with a sound foundation in the scientific and engineeringfundamentals necessary to formulate, solve and analyze basic Non conventional

energy problems and prepare them for graduate studies.

The objective of the course is to familiarize the students with the basic concepts ofnonconventional energy sources and allied technological systems for energy

conversion.

Focus is on solar energy conversion, wind energy conversion and bio mass basedenergy conversion with their application perspective.

This course also serves the objective of imparting the importance of non-conventionalenergy conversion technologies in the present day energy crisis scenario

Unit I 07 Hrs

Solar energy: Energy consumption as a measure of prosperity, world energy

futures, brief discussion of conventional energy sources and their availability, non-

conventional energy sources. Advantages and limitations in application of Non-

conventional energy. Recent development in solar cell.Unit II 07 Hrs

Solar constants, Definitions relating to the solar energy Solar radiations and its

concepts solar colloctors, Flat plate and Focus type collectors, transitivity constants,

solar green house effect, Recent development in the field of solar radiation

collectors Unit III 08 Hrs

Wind energy: Basic principles of wind energy conversion, Nature of wind, power

in the wind, maximum power wind energy conversion, site selection consideration,

basic concepts of WECS, Classification of WECS, advantages & disadvantages of

WECS. Application of wind energy. Environmental Aspects, Recent applications

and development. Problems on design and modeling of the wind system.Unit IV 07 Hrs

Geo-thermal energy: Estimates of Geothermal power, geothermal sources, Geo

pressured sources Geothermal exploration, Geothermal well drilling, Advantages

and Disadvantages of Geothermal energy over other energy forms, comparison of

flashed steam and Total flow concept. Recent applications of geothermal energy.

Operational and Environmental problems.

Unit V 07 Hrs

Energy from the oceans:Introduction Methods of OTEC power generation. Open

and Closed cycle OTEC, Site selection, Basic of tidal power, operation methods of

utilization of tidal power. Estimate of energy and power in simple single basin tidal

and double basin tidal system. Site requirements


10/32

Course outcomes:


Demonstrate an understanding of the scientific principles of methodology of Non-conventionalenergy.

Acquire working knowledge of different Renewable energy science-related topics. Ability to design relative model systems based upon different energy conditions and also

Specification of different environmental problems. Ability to apply design methodologies, including open and closed gasification system for all

feed materials in biomass gasification

Ability to analyze the system related concepts effectively in the wind energy designining. Students will be able to decide the appropriate procedures to ensure that the working model has

developed properly.

Reference Books

1 G.D.Rai, Non-Conventional sources of energy, Khanna Publishers, 4th edition, 2007. ISBN-

8174090738

2 Sukhatme, Solar Energy, 2n

edition, TMH, 2006. ISBN-0-07-^2453-1 76DD74.3 Renewable energy sources- Twiddle Elbs, 3

rdEdition, 2006, ISBN-10: 0419253203.

4 Solar energy hand book edited by William.C. Dikkinson ASISES, Network, ISBN-13: 978-

0865716216.



which best of two will be considered. In addition there will be one seminar on new topics / model



The question paper consists of Part A and Part B. Part A will be for 20 marks covering the completesyllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions

(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B will



11/32

Semester: VOPTIMIZATION TECHNIQUES

Course Code : 10BG508 CIE Marks : 100

Hrs/Week : L: T: P: 3:0:0 SEE Marks : 100

Credits : 03 SEE Duration : 3 Hrs

Course Learning Objectives: Develop mathematical formulation for linear programming and transportation problem Define Queuing system and their characteristics. Formulate a replacement policy in order to determine an age or period at which the replacement of

the given machinery/equipment is most economical, keeping in view all possible alternatives.

Construct the required activities in an efficient manner so as to complete it on or before a specifiedtime limit and at the minimum cost.

Develop mathematical model for interactive decision-making situations, where two or morecompetitors are involved under conditions of conflict and competition.

Unit - I 07 HrsIntroduction: OR Methodology, Definition of OR, Application of OR to Engineering and

Managerial problems, Features of OR models, Limitations of OR.

Linear Programming: Definition, Mathematical Formulation, Standard Form, Solution

Space, Types of solution Feasible, Basic Feasible, Optimal, Infeasible, Multiple Optimal,Degenerate, Redundancy, Solution through Graphical Method. Problems on Product Mix,

Blending, Marketing, Finance, Agriculture and Personnel.

Unit - II 07 Hrs

Simplex methods: Variants of Simplex Algorithm Uses of Artificial Variables, Duality,

Concept of Shadow Prices, Solution of LPP using Duality Concept, Dual simplex method.

Unit III 07 HrsTransportation Problem: Formulation of Transportation Model, Basic Feasible Solution

using North-West corner, Least Cost, Vogels Approximation Method, Optimality Methods,

Unbalanced Transportation Problem, Degeneracy in Transportation Problems, Variants inTransportation Problems,

Unit IV 07 HrsAssignment Problem: Formulation of the Assignment problem, solution method ofassignment problem-Hungarian Method, Variants in assignment problem, Travelling

Salesman Problem (TSP).Queuing Theory: Queuing system and their characteristics, The M/M/I Queuing system,Steady state performance analyzing of M/M/1 and M/M/C queuing models.

Unit V 09 Hrs

Game Theory: Introduction, Two person Zero Sum game, Pure strategies Games with

saddle point, Graphical Method, The rules of dominance, solution method of games without

saddle point Arithmetic method.Project Management Using Network Analysis: Network construction, determination of

critical path and duration, floats. PERT- Estimation of project duration, variance. CPM -

Elements of crashing, least cost project scheduling.

Outcome: After going through this course the student will be able to


12/32

Analyze the need of using operations research a quantitative approach for effective decisionmaking.

Express objective function and resource constraints in LP model in terms of decision variablesand parameters.

Recognize and formulate a transportation problem involving a large number of shipping routes. Derive replacement policy for items whose running cost increases with time and those whose

value of money either remains constant or the value of money changes with constant rate during

the period of time. Determine critical path and floats associated with non-critical activities and events along with

total project completion time.

Reference Books:

1. Taha H A, Operation Research An Introduction, PHI, 8thEdition, 2009, ISBN: 0130488089.2. Philips, Ravindran and Solberg - Principles of Operations Research Theory and Practice, PHI, 2n

Edition, ISBN :0471086088.

3. Hiller and Liberman, Introduction to Operation Research, Tata McGraw Hill 8t Edition, 2005,ISBN : 0073017795.

4. J K Sharma, Operations Research Theory and Application, Pearson Education Pvt Ltd, 2n Edition,ISBN: 0333-92394-4.

Scheme of Continuous Internal Evaluation (CIE):



Scheme of Semester End Examination (SEE):

The question paper consists of Part A and Part B. Part A will be for 20 marks covering the completesyllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions (descriptive,

analytical, problems or/and design) carrying 16 marks each. All five from Part B will have internal choiceand one of the two have to be answered compulsorily.


13/32

Semester: V

MODERN INSTRUMENTATION TECHNIQUES

Course Code: 10 BG510 CIE Marks: 100




1. To study the functional element and I/O Configurations of instruments to develop newinstruments

2. To analyze the characteristics of measurement data by means of static and dynamiccharacteristics of instruments.

3. To learn the techniques of statistical analysis of error in measurement4. To highlight upon the signal conditioning for certain instrumentation applications5. To know the features of smart sensors and GPIB Interface Techniques.

Unit I 07 Hrs

Technique of Designing New Instruments: Functional elements of instruments, Input-

Output configuration of instruments and Measurement Systems.

Unit II 07 Hrs

Characteristics of Instruments and Measurement Systems: Measurement system

performance, static and dynamic characteristics of instruments, Time Response of zero-order , I

st-order , 2

nd-order instruments to standard input signals and analysis, problems.

Unit III 07 Hrs

Analysis of Errors in Measurement: Classification of errors, Statistical Treatment of

Data, Probability Table, specifying measurement data, Confidence interval and confidencelevel, Rejection of data, Probable error of combination of components, Uncertainty

Analysis and Treatment of Single Sample Data.

Unit IV 07 HrsSpecial signal conditioning: Principles of analog signal conditioning, Differential &Instrumentation Amplifier, Charge Amplifier, Lock in Amplifier, Blumlein Bridge fortransducer capacitance measurement, Smart transducers and applications.

Unit V 07 Hrs

Interfacing Instruments to PC: Instruments Used in Computer Controlled Test System,Talking and Listening - the IEEE 488 Interface Bus, Smart sensors and IEEE1451standards.

Course outcomes:

After going through this course the student will be able to

1. Student will be cable of designing the features of a new instrument.2. Student will be able to predict the performance of an instrument to standard input

signal and generate the instrument output analytically.

3. Student will be able design special instrumentation devices & circuits.4. Student will be able to interface a transducer or a circuit to a PC by means of IEEE

488 bus technology.

Reference Books

1. Doeblin. E.O,Measurement systems application and design, McGraw InternationalEdition, 5thEdition, 2010, ISBN-0-07-243886-x.2. Sawhney A.K., A course in Electrical and Electronic Measurement and Instrumentation,

Dhanapat & Co , 28th Edition, 2010, TMH Publication, 2

nd edition, 2009,

ISBN-81-7700-016-0.

3. Arun k. Ghosh, Introduction to Measurements and Instrumentation, PHI, NewDelhi,2011. ISBN- 978-81-203-3858-6.

Cooper D & Helfrick A D, Modern electronic instrumentation and measuring techniques,PHI, 2007, ISBN-978-81-203-0752-6


14/32



presentation/Assignment etc. for 10 marks.



syllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions carrying 16marks each. All five from Part B will have internal choice and one of the two have to be answeredcompulsorily.


15/32

Semester: V

LINEAR ALGEBRA

Course Code: 10GB511 CIE Marks: 100




Model a system of linear equations; Use basic terminology of linear algebra in Euclidean spaces, including linear independence,

spanning, basis, rank, nullity, subspaces, and linear transformations;

Apply the abstract notions of vector spaces and inner product spaces; Calculate projections and orthogonality among Euclidean vectors, including the Gram-

Schmidt orthonormalization process and orthogonal matrices with least squares technique;

Understand the use of linear algebra in digital signal processing, digital communication,graph theory, statistics, economics, computer graphics and Markov models;

Unit I 08 Hrs

Vector Spaces

Vector Spaces and SubspacesProblems

Linear IndependenceBasis of a vector spaceDimension

The Four Fundamental Subspaces: Row Space, Null space,Column Space and Left-Null space

Unit II 07 Hrs

Linear TransformationsLinear Transformations

Geometric Meaning

Matrix RepresentationsChange of Basis

Kernel and Image of a Linear TransformationRotation, Projection & Reflection Transformations: 2 dimension only

Geometrical interpretations

Unit III 07 Hrs

Eigen Values And Eigen VectorsIntroduction

Algebraic and Geometric Multiplicity of Eigen valuesDiagonalizability of a Matrix

Geometric meaning of Eigen values and Eigen vectors

Applications of Eigen values in Communications and Image Processing

Unit IV 08 Hrs

Orthogonality

Orthogonal ProjectionsOrthogonal Bases

Orthogonal & Orthonormal MatricesGram-Schmidt OrthogonalizationQR FactorizationsLeast Squares Problem

Applications of orthogonality in Signals

Unit V 08 Hrs


16/32

Positive Definite MatricesMinima, Maxima and Saddle Points

Definite versus Indefinite. Higher DimensionsPositive Definiteness

Tests for Positive DefinitenessSingular Value Decomposition

Applications of SVD and principal component analysis

Course Outcomes:After completing this course the student will be able to:

Design mathematical models for various applications; Use the concept of vector space, linear transformations, Eigen vector and

orthogonality;

Interpret axiomatic structure of modern mathematics and learn to construct simpleproofs;

Apply his or her knowledge to applications of Linear Algebra in solving complexengineering problems;

Apply in coding and de-coding a secret information; Solve over-determined or under-determined system of equations which arise

naturally;

Constructing curves and surfaces through specified points useful in CAD;Reference Books1. Gilbert Strang; Linear Algebra and Its Applications; Cengage Learning India Edition; 4 th

Edition; 2006; ISBN: 81-315-0172-8.

2. David C Lay; Linear Algebra and Its Applications; Pearson Education; 3rdEdition; 2003; ISBN:978-81-7758-333-5.

3. Kenneth M Hoffman and Ray Kunze; Linear Algebra; Prentice Hall; 2nd Edition; 2006;ISBN:81-297-0213-4.

4. Schaums Outline Series, Linear Algebra; Tata-McGraw Hill; 3rdEdition; 2002; ISBN-13: 978-0-07-060502-2, ISBN-10: 0-07-060502-5.





The question paper consists of Part A and Part B. Part A will be for 20 marks covering the completesyllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B will



17/32

Semester: V

MECHATRONICSCourse code: 10BG512 CIE Marks: 100


Credits : 03 SEE Duration: 3Hrs

Course learning objectives:

Substantiate the need for interdisciplinary study in technology education. Understand the evolution and development of Mechatronics as a discipline. Define various types of transducers used in industrial automation, machine control systems, instrumentation

and equipments.

Understand the applications of microprocessors in various systems and to know the functions of each element. Describe the operation of mechanical, electrical pneumatic and hydraulic actuators. Identify main parts, hardware forms and internal architecture of PLC. Demonstrate the integration philosophy in view of Mechatronics technology.

Unit -I 06HrsIntroduction: Definition, Multidisciplinary Scenario, Evolution of Mechatronics, Design of

Mechatronics system, Objectives, advantages and disadvantages of Mechatronics.Transducers and sensors:Definition and classification of transducers, Difference between transducerand sensor, Definition and classification of sensors, Principle of working and applications of light

sensors, proximity switches and Hall effect sensors.Unit -II 06 Hrs

MICROPROCESSOR & MICROCONTROLLERS: Introduction, Microprocessor systems, Basicelements of control systems, Microcontrollers, Difference between Microprocessor and

Microcontrollers.MICROPROCESSOR ARCHITECTURE: Microprocessor architecture and terminology-CPU,memory and address, I/O and Peripheral devices, ALU, Instruction and Program, Assembler, Data,

Registers, Program Counter, Flags, Fetch cycle, write cycle, state, bus interrupts. Intels 8085AMicroprocessor.

Unit -III 06 Hrs

Programmable logic controller: Introduction to PLCs, basic structure, Principle of operation,

Programming and concept of ladder diagram, concept of latching & selection of a PLC

Integration:Introduction & background, Advanced actuators, Pneumatic actuators, Industrial Robot,

different parts of a Robot-Controller, Drive, Arm, End Effectors, Sensor & Functional requirements ofrobot.

Unit -IV 06 Hrs

Mechanical actuation systems: Mechanical systems, types of motion, Cams, Gear trains, Ratchet &Pawl, belt and chain drives, mechanical aspects of motor selection.

Electrical actuation systems: Electrical systems, Mechanical switches, Solenoids, Relays, DC/ACMotors, Principle of Stepper Motors & servomotors.

Unit -V 04 Hrs

Pneumatic and hydraulic actuation systems:Actuating systems, Pneumatic and hydraulic systems,

Classifications of Valves, Pressure relief valves, Pressure regulating/reducing valves, Pressure sequencevalve, Cylinders and rotary actuators.

DCV & FCV-Principle & construction details, types of sliding spool valve, solenoid operated, Symbolsof hydraulic elements, components of hydraulic system, functions of various units of hydraulic system.

Course Outcome:

After going through this course the student will be able to

Student will be able to understand and bridge the technical domain of mechanical and electronics. Understand the function and application of control systems. Will be able to design automation & control field. Can read, write, and develop a program in machine language. Understand how microprocessor is a part of day to day life making and its application.


18/32

Can start thinking beyond existing technology.Reference Books:1 Nitaigour Premchand Mahalik ;Mechatronics-Principles, Concepts and Applications ; Tata McGraw Hill ; 1

st

Edition ;2009;ISBN:9780070483743

2 W.Bolton ;Mechatronics -Electronic Control Systems in Mechanical and Electrical Engineering ; Pearson

Education;4th Edition ;2012;ISBN:97881317325333 Mechatronics by HMT Ltd.;Tata McGrawHill ;1

st Edition;2000;ISBN:9780074636435

4 Anthony Esposito ;Fluid Power; Pearson Education;6th Edition;2011;ISBN:9788177585803

Scheme of Continuous Internal Evaluation:CIE consists of Three Tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive) out of which besttwo will be considered. In addition there will be one seminar on new topics / model presentation etc. for 10 marks.

Scheme of Semester End Examination:The question paper consists of Part A and Part B. Part A will be for 20 marks covering the complete syllabus and

is compulsory. Part B will be for 80 marks and shall consist of five questions (descriptive, analytical, problemsor/and design) carrying 16 marks each. All five from Part B will have internal choice and one of the two have to be

answered compulsorily.


19/32

Semester: V

TELECOMMUNICATION SYSTEMS

Course Code: 10BG514 CIE Marks:100

Hrs / Week: L:T:P:3:0:0 SEE Marks:100

Credits : 3 SEE : 03 Hrs


At the end of the course the student will be able to:

Define the components of a communication system and their functions Analyze different telecommunication services, systems and principles. Identify wired and wireless communication systems. List the requirements for a communication system.

UNIT- I 07 Hrs

Introduction to Electronic Communication:The Significance of Human Communication, Communication Systems, Types of ElectronicCommunication, The Electromagnetic Spectrum, Bandwidth. Gain, Attenuation and Decibels

representation. Super heterodyne receiver.

UNIT- II 07 Hrs

Modulation Schemes:

Analog Modulation: AM, FM & PM - Brief review.

Digital Communication:

PCM, FSK, PSK, QAM, Telephone Modems, Cable Modems and Digital Subscriber Lines.Digital Codes:Line Codes

Wideband Modulation:Spread spectrum, FHSS, DSSS.

UNIT- III 07 Hrs

Multiplexing and Multiple Access Techniques:FDD, TDD, Frequency Division Multiplexing and Multiple Access, Time DivisionMultiplexing and Multiple Access, Code division Multiple Access. Cellular Telephone

systems: Cellular concepts, Frequency allocation, Digital Cell Phone Systems.

GSM Technology (2G):

GSM Services, Reference Architecture.

UNIT- IV 07 Hrs

Telecommunication Systems:Facsimile, Paging Systems, Internet Telephony.

Introduction to Networking:Network fundamentals (WAN, MAN, LAN, PAN), Network topologies and definitions.

Wired Broadband Modem: ADSL Modem.

UNIT- V 07 Hrs

Optical Communication:Optical Principles, Optical Communication Systems, Fiber-Optic Cables, Optical

Transmitters and Receivers, Wavelength-Division Multiplexing, Passive Optical Networks.

Wireless Technologies:

Wireless LAN, PANs and Bluetooth, ZigBee and Mesh Wireless Networks, WiMAX andWireless Metropolitan-Area Networks.

Course outcomes: After going through this course the student will be able to:

Explain the functions and role of different parts of electronic communication systems. Define the performance measures of various modulation and multiple access schemes. Describe the operations of facsimile, paging, internet, telephony and various cellular radio

systems.

Describe the functions of different sections of optical communication systems. Describe the features, benefits, applications and operation of wireless technologies such as Wi-Fi,


20/32

Bluetooth, ZigBee and WiMAX systems.

Reference Books

1 Louis E. Frenzel, Principles of Electronic Communication Systems, Tata McGraw Hill ThirdEdition 2008,ISBN: 0070648115.

2 Roy Blake, Electronic Communication Systems, Thomson/Delamar, second edition, 2002,ISBN:0-7668-2684-8

3 Anu A. Gokhale Introduction to Telecommunications, Cengage Learning, 2nd

Edition 2008,ISBN-10:1-4018-5648-9.

4 Kaveh Pahlavan, Prashant Krishnamurthy, Principles of Wireless Networks, Pearson Education,

2008,ISBN: 0-471-10607-0.Scheme of Continuous Internal Evaluation:

CIE consists of three tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive) out of whichthe best two will be considered. In addition there will be one seminar on new topics/ model presentation

etc. for 10 marks


The question paper consists of Part-A and Part-B. Part A is for 20 marks covering the complete syllabus

and is compulsory. Part B is for 80 marks, with 5 questions carrying 16 marks each.

In Part B, the examiner has to set TWO questions from each unit, out of which student has to answerONE question.


21/32

Semester: V

UNIX SYSTEM PROGRAMMING

Course Code: 10CSA571 CIE Marks: 100



Course Learning Objectives: Explain Unix internal-kernel structures Design & Develop Unix Commands & Applications using Unix system APIs Analyze the Problem & Apply the relevant IPC techniques in Unix system programming. Adopting Signals as IPC for efficient low level and high level application development on Unix

systems

Unit I 08 Hrs

IntroductionUNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards,

Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPSStandard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs, The UNIXand POSIX Development Environment, API Common Characteristics

UNIX Files and General file APIs

File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes,Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel

Support for Files, Relationship of C Stream Pointers and File Descriptors, DirectoryFiles, Hard and Symbolic Links. General file APIs.

Unit II 09 HrsUNIX other File Type APIsand UNIXprocesses

General File APIs, File and Record Locking, Directory File APIs, Device File APIs,FIFO File APIs, Symbolic Link File APIs, UNIX Kernel Support for Processes. The

Environment of a UNIX Process: Introduction, main function, Process Termination,Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared

Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions,

getrlimit, setrlimit Functions.

Unit III 08 Hrs

Process Control

Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions,Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files,

system Function, Process Accounting, User Identification, Process Times, I/O Redirection.

Unit IV 09 Hrs

Process Relationships and Signals

Process Relationships : Introduction, Terminal Logins, Network Logins, Process

Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, JobControl.

Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The

SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions,kill, alarm, Interval Timers.

Unit V 10 HrsDaemon Processes and Interprocess CommunicationDaemon Processes: Introduction, Daemon Characteristics, Coding Rules.Interprocesscommunication : Overview of IPC Methods, Pipes, popen, pclose Functions, FIFOs,

Message Queues, Semaphores. Shared Memory and Client-Server Model.


22/32

Course outcomes:


Familiarize with UNIX kernel structures and system calls, enabling the students towrite applications to manipulate system resources such as files , processes and systeminformation.

Make effective use of system APIs related to files and processes in general, to developbasic and advanced UNIX commands and applications.

Enable students to develop programs which create associate and control multipleprocesses, which is the prerequisite for more advanced client server and networkbased applications.

Become familiar with basic IPC issues and techniques in UNIX programming.Reference Books

1. Terrence Chan; UNIX System Programming Using C++; Prentice Hall India, 1997 , 1st

edition ISBN - 978-81-203-1468-9

2. W. Richard Stevens; Advanced Programming in the UNIX Environment; PearsonEducation; 2

ndEdition; 2005, ISBN - 81-317-0005-4

3. Marc J. Rochkind: Advanced UNIX Programming; Pearson Education; 2nd

Edition; 2005,

ISBN 0-13-011818-4

4. Maurice J Bach: The Design of the UNIX Operating System, Pearson Education, 1st

education ; 1987, ISBN 0-13-201799-7Scheme of Continuous Internal Evaluation:








23/32

Semester: V

GAME THEORY




Course Learning Objectives: To comprehend the basics of strategic gaming and mixed strategic equilibrium To enable students to develop skills on extensive gaming strategies design Graphics Pipelines and

program on real-time graphics.

To analyze and discuss various gaming models like Prisoners and Stackelbergs.Unit I 08 Hrs

Introduction, Strategic Games:What is game theory? The theory of rational choice; Interacting decision makers.Strategic

games; Examples: The prisoners dilemma, Bach or Stravinsky, Matching pennies; Nash

equilibrium; Examples of Nash equilibrium; Bestresponse functions; Dominated actions;Equilibrium in a single population: symmetric games and symmetric equilibria.

Unit II 09 Hrs

Mixed Strategy Equilibrium:

Introduction; Strategic games in which players may randomize; Mixed strategy Nashequilibrium; Dominated actions; Pure equilibria when randomization is allowed,

Illustration: Expert Diagnosis; Equilibrium in a single population, Illustration: Reporting acrime; The formation of players beliefs; Extensions; Representing preferences by expected

payoffs.

Unit III 08 Hrs

Extensive Games:Extensive games with perfect information; Strategies and outcomes; Nash equilibrium;

Subgame perfect equilibrium; Finding subgame perfect equilibria of finite horizon games:Backward induction. Illustrations: The ultimatum game, Stackelbergs model of duopoly,

Buying votes.

Unit IV 10 Hrs

Bayesian Games, Extensive Games with Imperfect Information:Motivational examples; General definitions; Two examples concerning information;Illustrations: Cournots duopoly game with imperfect information, Providing a public good,

Auctions; Auctions with an arbitrary distribution of valuations. Extensive games withimperfect information; Strategies. Strictly Competitive Games, Evolutionary Equilibrium:

Strictly competitive games and maximization; Case Study.

Unit V 09 Hrs

Iterated Games:

Repeated games: The main idea; Preferences; Repeated games; Finitely and infinitelyrepeated Prisoners dilemma; Strategies in an infinitely repeated Prisoners dilemma; Some

Nash equilibria of an infinitely repeated Prisoners dilemma, Nash equilibrium payoffs of

an infinitely repeated Prisoners dilemma. Coalitional Games and Bargaining: Coalitionalgames, Case Study.


Understand the basics of strategic gaming and mixed strategic equilibrium. Develop skills on extensive gaming strategies design Graphics Pipelines & program on

real-time graphics.

Have familiarity with Bayesian, Stackelbergs , Prisoners and many other models ofgaming .

Reference Books


24/32

1. Martin Osborne; An Introduction to Game Theory; Oxford University Press, Indian Edition,2009, ISBN 0195128958

2. Roger B. Myerson; Game Theory: Analysis of Conflict; Harvard University Press, 2008, ISBN 978-0674341166

3. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research: Concepts andCases; Tata McGraw Hill ; 9

thEdition; 2010, ISBN 0073376299

4. Joel Watson Strategy: An Introduction to Game Theory; W.W. Norton

& Company ; 2nd Edition, 2007, ISBN - 9780393929348





The question paper consists of Part A and Part B. Part A will be for 20 marks covering the completesyllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B will



25/32

Semester: V

OBJECT ORIENTED ANALYSIS AND DESIGN




Course Learning Objectives: Describe Object Oriented Analysis and Design concepts and apply them to solve problems using

Unified Modeling Language.

Explain how to capture a system's requirements with use cases and understanding requirements,analysis and design workflow

Outline techniques for finding classes from an initial set of system requirements Specify object interaction in the UML and to identify associations and inheritance between

classes

Analyze and design the role of key mechanisms Develop high quality software using techniques, processes and artifacts that mitigate risks. Develop skills to determine which OOAD techniques should be applied for a given problem

Unit I 06 Hrs

Introduction

An overview of object oriented systems development. Why an object orientation? Overviewof the Unified Approach. Object basics: Introduction, An object-oriented philosophy.

Objects, Classes, Attributes: Object behavior and methods. Encapsulation and Informationhiding, Class hierarchy, Polymorphism, Object relationships and associations, Aggregations

and object containment, Case study- Payroll program, advanced topics. Object-oriented

systems development life cycle: Introduction. The software development process, Buildinghigh-quality software, Object oriented systems development - A use-case driven approach,

reusability.

Unit II 06 Hrs

Methodology, Modeling and UML.

Object oriented methodologies, Introduction: Survey of some of the object orientedmethodologies, Rumbaughs Object modeling technique, The Booch methodology. The

Jacobson Methodologies, The unified approach. Unified modeling language: Introduction,Static and Dynamic models, Why modeling, Introduction to the unified modeling language,

UML diagrams, UML class diagram, Use-case diagram. UML dynamic modeling, Modelmanagement - Packages and model organizations, UML extensibility, UML meta-model.

Unit III 10 Hrs

Object Oriented Analysis.

Object oriented analysis, Process-identifying use cases: Introduction, Business objectanalysis Understanding the business layer, Use-case driven object-oriented analysis - The

unified approach, Business process modeling, Use-case model. Development effectivedocumentation, Case study - ViaNet bank ATM. Object analysis-classification:

Introduction, Classifications theory, Approaches for identifying classes. Noun phraseapproach, Common class patterns approach, Use-case driven approach-identifying classes

and their behaviors through Sequence/collaboration modeling, Classes, Responsibilities and

collaborators, Naming classes, Identifying object relationships, Attributes and methods -Introduction, Associations, Super-sub class relationships, A-part-of relationships-aggregation.

Case study:Class responsibility: Identifying attributes and methods, Class responsibility - Defining

attributes by analyzing use cases and other UML diagrams, Defining attributes for ViaNet

bank objects. Object responsibility - Methods and messages, Defining methods for ViaNetbank objects.

Unit IV 10 Hrs


26/32

Object-Oriented DesignThe object-oriented design process and design axioms: Introduction, The object-oriented

design process, Object oriented design axioms, corollaries. Designing classes - The process.Class visibility - Designing well-defined public, private and protected protocols.

Designing classes: Refining attributes, Refining attributes for the ViaNet bank projects.Designing methods and protocols, Designing methods for the ViaNet bank objects,

Packages and managing classes.

Unit V 12 HrsObject-Oriented Design

Designing classes - The process. Class visibility - Designing well-defined public, Private

and protected protocols. Refining attributes, Refining attributes for the ViaNet bank

projects, Designing methods and protocols, Designing methods for the ViaNet bank objects,Packages and managing classes.

Access LayerAccess layer-object storage and object interoperability: Introduction, Object store and

persistence - Database management systems, Organization access control, Distributed

databases and client-server computing, Distributed objects computing, Object-oriented

database management systems, Object-relational systems, Multi database systems.

Course outcomes:


apply object-oriented concepts to new complex problems. capture requirements through the utilization of Use Cases utilize the UML diagrams that best fit the problem definition implement the software based on the design establish a software development methodology for any given problemReference Books

1. Ali Bahrami; Object oriented systems development; McGraw-Hill; 2nd

Edition;1999. ISBN -0-

256-25348-X

2. Rebecca Wirfs; Designing Object-oriented software; Prentice-Hall India; 2nd

Edition;1990. ISBN

0136298257

3. Grady Booch; Unified Modeling Language User guide; Addison-Wesley; 2nd

Edition;1999.

ISBN 978-81-317-1582-64. Gamma. E ; Design patterns: Elements of reusable Object oriented software; Addison-Wesley;

2nd

Edition;1995. ISBN 978-81-317-0007-5









27/32

Semester: V

ADVANCED ALGORITHMS




Course Learning Objectives:The objective of this course is to encourage students to learn how to

Design and implement new' algorithms in the real world. Map practical problems to algorithmic problems. Read and understand algorithms published in journals. Develop writing skills to present own algorithms Collaborate and work together with other people to design new algorithms.

Unit I

Analysis techniques:

Recursion tree method for solving recurrences ,Master theorem and proof, Amortized

analysis, Aggregate, Accounting, and Potential methods.

05 Hrs

String Matching Algorithms:Nave algorithm, Rabin-Karp algorithm, String matching with finite automata, Knuth-

Morris-Pratt algorithm.

04 Hrs

Unit II

Graph AlgorithmsBellman-Ford Algorithm, Shortest paths in a DAG, Johnsons Algorithm for sparse graphs.

03 Hrs

Advanced Data structuresRed-Black tree, Fibonacci heaps , Splay trees, Binomial Queues , skip lists .

06 Hrs

Unit III

NP Completeness

Polynomial time, Polynomial-time verification, NP-completeness and Reducibility, NP-completeness proofs, and NP-complete problems.

09 Hrs

Unit IV

Approximation Algorithms

The vertex-cover problem, The traveling-salesman problem, The set-covering problem

04 Hrs

Computational Geometry I: Convex hulls

Finding Convex hulls: Insertion hull, Gift Wrapping, Graham's Scan, Merge Hull (II: 8.5)04 Hrs

Unit V

Computational Geometry II: Plane sweeps and Divide and ConquerFinding the intersection of line segments (II:7.1), Contour of Union of Rectangles (II: 7.3),

Decomposing Polygons into Monotone Pieces (II: 7.4), Computing the intersection of halfplanes (II: 8.2)

04 Hrs

Computational Geometry III: Triangulations and Voronoi diagrams

Triangulating Monotone Polygons (II: 5.8), Finding Delaunay triangulations (II: 6.6),

Finding Voronoi regions (II: 8.4), Polygon Triangulation (II: 8.7) (III:4.5)

05 Hrs

Recent trends : Topics to be selected by the faculty handling the Course Code and given as

assignments to the students (Assignment for 10 marks).Course outcomes:After going through this course the student will be able to:

Be able to make effective use of mathematical techniques to construct robustalgorithms.

Be able to make a critical judgment on the choices of algorithms for modern computersystems.

Have a critical awareness of current problems and research issues in the field ofcomplexity theory and abstract discrete algorithms.

Have the ability to read research literature in the field of discrete algorithms.


28/32

Have the ability to look at research resources and later identify and formulate newresearch problems

Have the ability to critically analyze advances within the field of algorithms.

Reference Books

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein; Introduction toAlgorithms; Columbia University 3

rd Edition; 2009. ISBN 978-0-262-03384-8

2. Michael Laszlo; Computational Geometry and Computer Graphics in C++; Pearson Education ;

1stEdition ; 1996. ISBN 978-0-132-90842-9

3. Mark Allen Weiss; Data Structures and Algorithm Analysis in C++; Addison-Wesley; 3rd

Edition; 2007. ISBN 978-0-321-44146-

4. Mark deBerg Otfried Cheong , Marc Van Kreveld, Mark overmars; Computational Geometry:Algorithms and Applications; Springer; 3rd edition; 2008. ISBN 978-3-540-77973-5



which best of two will be considered. In addition there will be one seminar on new topics / model







29/32

Semester: V

DISTRIBUTED OPERATING SYSTEM




Course Learning Objectives: To understand andexamine the fundamental principles of distributed systems. Present the principles underlying the functioning of distributed systems. Create an awareness of the major technical challenges in distributed systems design and

implementation

To study distributed systems in a broader sense. Emphasis will be placed on Message passing,Remote procedure calls, Distributed shared memory, Process migration and Synchronization.

To study various Distributed Deadlock, Scheduling and Load balancing Algorithms. Expose students to past and current issues in the field of distributed systems.

Unit I

Fundamentals

What is Distributed Computing Systems?, Distributed Computing System Models, What isDistributed Operating System?, Issues in Designing a Distributed Operating System,

Introduction to Distributed Computing Environment(DCE).

06 Hrs

Message PassingDesirable Issues of s Good Message Passing, Issues in IPC by Message Passing,

Synchronization, Buffering, Multi datagram Messages, Encoding and Decoding of MessageData, Process Addressing, Failure Handling, Group Communication.

06 Hrs

Unit II

Remote Procedure CallsThe RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation,

RPC Messages, Marshaling Arguments and Results, Server Management, Parameter -

Passing Semantics, Call semantics, Communication Protocols for RPCs, ComplicatedRPCs, Client-Server Binding, Exception Handling, Security.

10 Hrs

Unit III

Distributed Shared MemoryGeneral Architecture of DSM Systems, Design and Implementation Issues of DSM,

Granularity, Structure of Shared Memory Space, Consistency Models, ReplacementStrategy, Thrashing.

05 Hrs

Unit IV

SynchronizationClock Synchronization , logical clocks , physical clock ,clock synchronization algorithms,

Mutual exclusion , A centralized algorithm ,A distributed algorithm ,a token ring

algorithm, comparison of the three algorithms Election algorithms , The Bully algorithm,,ring algorithm, Dead locks in distributed systems , Distributed deadlock detection ,

distributed deadlock prevention.

10 Hrs

Unit V

Resource ManagementDesirable Features of a Good Global Scheduling Algorithm, Task Assignment Approach,

Load Balancing Approach, Load Sharing Approach.

03 Hrs

Process ManagementProcess Migration, Threads ,Introduction, usage, design issues for thread packages, anexample for thread package, Processor allocation , Allocation Models , design issues

Implementation issues, Scheduling in distributed systems, System models the workstation

model the processor pool model- the hybrid model

04 Hrs


30/32

Course outcomes:


Explains what a distributed system is , why you would design a system as a distributedsystem and what the desired properties of such systems are?

List the principles underlying the functioning of distributed systems , describe theproblems and challenges associated with these principles and evaluate theeffectiveness and shortcomings of their solutions.

Understanding the concept of message passing , RPC, Clock synchronization, programmigration and distributed shared memory.

Design a distributed systems that fulfills requirements with regards to key distributedsystems properties.

Build distributed system software using basic OS mechanisms as well as higher levelmiddleware and languages.

Construct theoretical models and implement them on a computer Express own reflections and attributes in regard to the area of research.Reference Books

1. Pradeep. K. Sinha; Distributed Operating System: Concepts and Design; Prentice-Hall of IndiaPvt.Ltd; 1st Edition, 2009. ISBN 9788-120313804

2. Andrew S. Tanenbaum; Distributed Operating System; Pearson Education, 6th Edition, 2009.

ISBN 978-01321990873. G. Coulouris, J.Dollimore& T. Kindberg; Distributed Systems Concepts and Design, Pearson

Education; 5th Edition; 2011. ISBN 978-0132143011

4. Andrew S. Tanenbaum; Maarten Van Steen; Distributed Systems Principles and Paradigms;Pearson Education;2

nd Edition; 2007. ISBN 9780132392273









31/32

Semester: V

SIGNALS AND SYSTEMS




Course Learning Objectives: The Course Code provides the basic characteristics of signal and a given system. It also explains the mathematical model of the systems. Representation of signals in Time /Frequency /Z-domain and transform from one domain to other. Analyze the stability and realizability of a system. Obtain the response of the systems for different inputs and initial conditions. Use of Z-transform to study the behavior of systems

Unit I 09 Hrs

Introduction:

Definitions of a signal and a system; Classification of signals; Basic operations on signals;Elementary signals.

Systems, Time-domain representations 1:Systems viewed as interconnections of operations; Properties of systems; Convolution;

Impulse response representation; Properties of impulse response representation.Unit II 09 Hrs

Time domain representation 2:

Differential and difference equation representations; Block diagram representations.

Fourier Representation 1:Fourier representation: Introduction; Fourier representations for four signal classes;

Orthogonality of complex sinusoidal signals.

Unit III 09 Hrs

Fourier Representation -2:DTFS representations; Continuous-time Fourier-series representations; DTFT and FT

representations; Fourier transform representations for periodic signals; Properties of

Fourier representations.

Unit IV 08 HrsApplication of Fourier representations 1 :

Frequency response of LTI systems; Solution of differential and difference equationsusing system function.

Applications of Fourier Representations 2,

Sampling of continuous time signals and signal reconstruction.

Unit V 09 Hrs

Z-Transforms :

Introduction to Z-transform; Properties of ROC; Properties of Z-transforms; Inversion ofZ-transforms Transforms analysis of LTI systems; Transfer function; Stability and

causality; Unilateral Z transforms and its application to solve difference equations

Course outcomes:


Explain the Design the implement filter banks and M-channel QMF bank. Design an adaptive filter based on LMS/RLS algorithm for different applications. Analyze the various concepts of Image Processing such as filtering, histogram,

compression etc.

Analyze various applications such as audio applications, CD system, mobile telephony,set top box.

Reference Books

1. Simon Haykin and Barry Van Veen; Signals and Systems; Wiley India; 2n

Edition, , 2007.


32/32

ISBN 9788126512652

2. Alan V. Oppenheim, Alan S. Willsky and S. Hamid Nawab; Signals and Systems; Prentice-Hall

of India Pvt.Ltd ,2nd

Edition; 1997, Indian reprint 2009, ISBN - 9780138147570

3. Ganesh Rao D and Satish Tunga; Signals and Systems - A Simplified Approach; SanguineTechnical Publishers, 2003-04.


CIE consists of Three Tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive) out ofwhich best of two will be considered. In addition there will be one seminar on new topics / modelpresentation etc. for 10 marks.





Documents

5th Sem Global Electives