M.Tech in Structural Engineering

M.Tech in Structural Engineering

Sl.

No.

Sub Code

Subject Title

Teaching

Department

Teaching hours per week Maximum Marks

allotted

Examination

Credits

Lecture

Tutorial/

Seminar/ Assignment

Practical

/ Project

CIE

SEE

Total

1 20CSE11 Computational Structural Mechanics

4 - - 50 50 100 3

2 20CSE12 Advanced Design of RC Structures 4 - - 50 50 100 3

3 20CSE13 Mechanics of Deformable Bodies 4 - - 50 50 100 3

4 20CSE14 Structural Dynamics 4 - - 50 50 100 3

5 20CSE15X ELECTIVE – I 4 - - 50 50 100 3

6 20CSE16X ELECTIVE – II 4 - - 50 50 100 3

7 20CSEL17 Structural Engineering Laboratory

- - 3 50 50 100 2

8 20CSES18 Technical Seminar* - 4 - 50 - 50 2

9 20CSEM19 Minor project/ Industry visit/

Field work

- - 6 50 - 50 2

Total 450 350 800 24

*Technical Seminar: Seminar on Advanced topics from refereed journals by each student.

ELECTIVE - I ELECTIVE - II

Sl. No Subject Code Subject title

1 20CSE151 Advanced Design of Pre-stressed Concrete Structures

2 20CSE152 Special Concrete

3 20CSE153 Design of Pre-cast and Composite Structures

4 20CSE154 Reliability Analysis of Structures


1 20CSE161 Optimization Techniques

2 20CSE162 Composites and Smart materials

3 20CSE163 Advanced Structural Mechanics

4 20CSE164 Earth and Earth Retaining Structures

Syllabus for 2020-21 Batch PG (CSE) Semester: I

Course Title: COMPUTATIONAL STRUCTURAL MECHANICS

Course Code: 20CSE11 CIE + Assignment + Group Activity + Seminar + SEE Marks

= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03

Hours: 52 Hrs. (L:T:P:S:4:0:0:0) SEE Duration: 3 Hrs.

Course Learning Objectives:

1 To make students to learn principles of Structural Analysis,

2 To implement these principles through different methods and to analyze various types of structures.

3 To evaluate the force and displacement parameters of the structures by Flexibility and Stiffness matrix methods.

UNIT – I

FUNDAMENTAL CONCEPTS:

Static and Kinematic indeterminacy, Concepts of stiffness and flexibility. Energy concepts. Principle of minimum potential energy and minimum complementary energy. Development of

element flexibility and element stiffness matrices for truss, beam and grid elements.

12 Hrs

UNIT – II

ANALYSIS USING FLEXIBILITY METHOD:

Force-transformation matrix using Flexibility method, Development of global flexibility matrix for

continuous beams, plane trusses and rigid plane frames(having not more than six coordinates–

6x6 flexibility matrix) Analysis of continuous beams, plane trusses and rigid plane frames by

flexibility method (having not more than 3coordinates– 3x3 flexibility matrix)

10 Hrs

UNIT – III

ANALYSIS USING STIFFNESS METHOD:

Displacement-transformation matrix using Stiffness Method, Development of global stiffness

matrix for continuous beams, plane trusses and rigid plane frames (having not more than six co-

ordinates –6x6 stiffness matrix) Analysis of continuous beams, plane trusses and rigid plane frames by stiffness method(having not more than 3coordinates– 3x3 stiffness matrix)

10 Hrs

UNIT – IV

EFFECTS OF TEMPERATURE CHANGE AND LACK OF FIT: Related numerical problems by flexibility and stiffness method as in Chapters 2 and 3.

10 Hrs

UNIT – V (Blended Learning)

SOLUTION TECHNIQUES:

Solution techniques including numerical problems for simultaneous equation, Gauss elimination

and Cholesky method. Bandwidth consideration.

10 Hrs

Course Outcomes: The students will be able to

1 Apply the concepts of flexibility and stiffness matrices.

2 Apply knowledge of local and global coordinate system to develop displacement transformation matrices.

3 Solve Civil Engineering problems with respect to various storage schemes.

Question paper pattern:

• The question paper will have ten full questions carrying equal marks. • Each full question will be for 20 marks.

• There will be two full questions (with a maximum of four sub - questions) from each unit.

• Each full question will have sub - question covering all the topics under a unit. • The students will have to answer five full questions, selecting one full question from each unit.

Text Books:

1 Weaver W and Gere J H, “Matrix Analysis of Framed Structures”, CBS publications, New Delhi.

2 Rajasekaran S, “Computational Structural Mechanics”, PHI, New Delhi.

3 Madhujit Mukhopadhay and Abdul Hamid Sheikh, “Matrix and Finite Element Analysis of Structures”, Ane Books Pvt. Ltd.

Reference Books:

1 H C Martin, “Introduction to Matrix Methods in Structural Analysis”, International textbook company, McGraw Hill.

2 A K Jain, “Advanced Structural Analysis”, Nemchand Publications, Roorkee.

3 Manikaselvam, “Elements of Matrix Analysis and Stability of Structures”, Khanna Publishers, NewDelhi.

CO-PO Mapping

CO/PO PO1 PO2 PO3 PO4 PO5 PO6

CO1

CO2

CO3

Syllabus for 2020-21 Batch PG (CSE)

Semester: I

Course Title: ADVANCED DESIGN OF RCC STRUCTURES


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To learn principles of Structural Design.

2 To design different types of structures and to detail the structures.

3 To evaluate performance of the structures.

UNIT – I

Yield line method of design of slabs. Design of flat Slabs. 12 Hrs

UNIT – II

Design of grid floors, Design of Chimneys. 10 Hrs

UNIT – III

Design of continuous beams with redistribution of moments. 10 Hrs

UNIT – IV

Design of silos and bunkers. 10 Hrs


Art of detailing earthquake resistant structures. Expansion and contraction joints. 10 Hrs


1 Achieve Knowledge of design and development of problem solving skills.

2 Summarize the principles of Structural Design and detailing.

3 Understands the structural performance.




• Each full question will have sub - question covering all the topics under a unit.

• The students will have to answer five full questions, selecting one full question from each unit.

Text Books:

1 P.C. Varghese, "Advanced Reinforced Concrete Design”, Prentice-Hall of India, New Delhi, 2005.

2 Dr. B.C.Punmia, Ashok Kumar Jain and Arun Kumar Jain, “Comprehensive RCC Design”

3 A Park and Paulay, “Reinforced and Prestressed Concrete”

Reference Books:

1 Pillai and Menon “Reinforced Concrete Design" McGraw Hill.

2 Bungey and Mosley “Reinforced concrete. Palgrave – Macmillan

3 Lin TY and Burns N H, “Reinforced Concrete Design".

4 Kong KF and Evans T H “Design of Prestressed Concrete Structures”.

CO-PO Mapping


CO1

CO2

CO3


Semester: I

Course Title: MECHANICS OF DEFORMABLE BODIES

Course Code: 20CSE13 CIE + Assignment + Group Activity + Seminar + SEE Marks = 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To make students to learn principles of Analysis of Stress and Strain.

2 To predict the stress- strain behaviour of continuum.

3 To evaluate the stress and strain parameters and their interrelations of the continuum.

UNIT – I

Theory of Elasticity:

Introduction: Definition of stress and strain and strain at a point, components of stress and

strain at appoint of Cartesian and polar co-ordinates. Constitutive relations, equilibrium equations, compatibility equations and boundary conditions in 2-D and 3-D cases.

12 Hrs

UNIT – II

Transformation of stress and strain at a point, Principal stresses and principal strains,

invariants of stress and strain, hydrostatic and deviatric stress, spherical and deviatoric strains, max. Shear strain.

10 Hrs

UNIT – III

Plane stress and plane strain:

Airy’s stress function approach to 2-D problems of elasticity, simple problems of bending of

beams. Solution of axi-symmetric problems, stress concentration due to the presence of a

circular hole in plates.

10 Hrs

UNIT – IV

Elementary problems of elasticity in three dimensions, stretching of a prismatic bar by its own

weight, twist of circular shafts, torsion of non-circular sections, membrane analogy, Propagation of waves in solid media. Applications of finite difference equations in elasticity.

10 Hrs


Theory of Plasticity:

Stress – strain diagram in simple tension, perfectly elastic, Rigid – Perfectly plastic, Linear

work – hardening, Elastic Perfectly plastic, Elastic Linear work hardening materials, Failure

theories, yield conditions, stress – space representation of yield criteria through Westergard

stress space, Tresca and Von-Mises criteria of yielding.

10 Hrs


1 Apply the basic theory of elasticity in two and three dimensional state of stress.

2 Analyze the behavior of solids of different shapes/forms, under different loads and boundary conditions.

3 Evaluate the stresses, strains, and establish governing equations in two and three dimensional problems.

4 Apply the plasticity theory, failure theories and their significance in the design of members.





Text Books:

1 S P Timoshenko and J N Goodier, “Theory of Elasticity”, McGraw-Hill International Edition, 1970

2 S Valliappan, “Continuum Mechanics - Fundamentals”, Oxford &IBH Pub. Co. Ltd., 1981

3 L S Srinath, “Advanced Mechanics of Solids”, Tata - McGraw-Hill Pub., New Delhi, 2003.

4 P.G. Seetharamu and L Govindaraju “Applied Elasticity Interline Publishing 2005.

Reference Books:

1 G. W. Housner and T. Vreeland, Jr., “The Analysis of Stress and Deformation”, California Institute of Tech.CA, 2012.

2 Abdel-Rahman Ragab and Salah EldininBayoumi, “Engineering Solid Mechanics: Fundamentals and Applications”,CRC Press, 1998.

3 A. C. Ugural and Saul K.Fenster, “Advanced Strength and Applied Elasticity”, PrenticeHall, 2003.

CO-PO Mapping


CO1

CO2

CO3

CO4


Semester: I

Course Title: STRUCTURAL DYNAMICS




1 To learn principles of Structural Dynamics.

2 To implement these principles through different methods and to apply the same for free and forced vibration of structures.

3 To evaluate the dynamic characteristics of the structures.

UNIT – I

Introduction:

Introduction to Dynamic problems in Civil Engineering, Concept of degrees of freedom,

D’Alembert’s principle, principle of virtual displacement and energy, principles Dynamics of

Single-degree-of-freedom systems: Mathematical models of Single-degree-of-freedom

systems system, Free vibration response of damped and undamped systems. Methods of

evaluation of damping.

12 Hrs

UNIT – II

Response of Single-degree-of-freedom systems to harmonic loading (rotation unbalance,

reciprocating unbalance) including support motion, vibration isolation, transmissibility,

Numerical methods applied to Single-degree-of-freedom systems - Duhamel integral, principle of vibration-measuring instruments – seismometer and accelerometer.

10 Hrs

UNIT – III

Dynamics of Multi-degree freedom systems:

Mathematical models of multi-degree-of-freedom systems, Shear building concept, free

vibration of undamped multi-degree-of-freedom systems - Natural frequencies and mode shapes

– orthogonality property of modes.

10 Hrs

UNIT – IV

Response of Shear buildings for harmonic loading without damping using normal mode

approach. Response of Shear buildings for forced vibration for harmonic loading with damping using normal mode approach, condition of damping uncoupling.

10 Hrs


Approximate methods:

Rayleigh’s method Dunkarley’s method, Stodola’s method. Dynamics of Continuous systems:

Free longitudinal vibration of bars, flexural vibration of beams with different end conditions,

Stiffness matrix, mass matrix (lumped and consistent); equations of motion for the discretized

beam in matrix form.

10 Hrs


1 Analyse multi-storey frames and draw mode shapes of vibrations.

2 Develop the equation of motion of undamped and under damped multi degree of freedom systems subjected to free and forced vibration.






Text Books:

1 Structural dynamics: Vibrations and systems, 1st edition, madhujit mukophadyay, publisher: ANE Books ISBN: 9788180520907, 8180520900, 2008.

2 Structural dynamics: Theory and computation, Mario Paz, 2nd edition, CBS publisher, 2004.

3 Dynamics of structure. R.W.clough and J.Penzien, 2nd revised edition, McGraw-Hill education 1993.

4 Thompson “Dynamics of Structures”.

Reference Books:

1 Theory of Vibration with applications, William Thomson, 4th edition, CRC Press, 1996

2 Structural Dynamics- Anil Chopra: PHI Publishers.

3 Timoshenko, S., “Vibration Problems in Engineering”, VanNostrand Co.,

CO-PO Mapping


CO1

CO2

CO3


Semester: I

Course Title: ADVANCED DESIGN OF PRE-STRESSED CONCRETE STRUCTURES


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To understand the behaviour of pre-stressed elements.

2 To analyse and design of pre-stressed concrete elements.

UNIT – I

LOSSES OF PRESTRESS :

Loss of prestress in pre-tensioned and post- tensioned members due to various causes like

elastic shortening of concrete, shrinkage of concrete, creep of concrete, relaxation of steel,

slip in anchorage, bending of member and frictional loss – Analysis of sections for flexure.

12 Hrs

UNIT – II

DESIGN OF SECTION FOR FLEXURE:

Allowable stresses, Elastic design of simple beams having rectangular and I-section for

flexure, kern lines, cable profile and cable layout.

Design of Sections for Shear: Shear and Principal stresses, Improving shear resistance

by different prestressing techniques- horizontal, sloping and vertical prestressing,

Analysis of rectangular and I–beam, Design of shear reinforcement, Indian code

provisions..

10 Hrs

UNIT – III (Blended Learning)

DEFLECTIONS OF PRESTRESSED CONCRETE BEAMS:

Short term deflections of uncracked members, Prediction of long-term deflections, load–

deflection curve for a PSC beam, IS code requirements for maximum deflections.

10 Hrs

UNIT – IV

TRANSFER OF PRESTRESS IN PRETENSIONED MEMBERS :

Transmission of prestressing force by bond, Transmission length, Flexural bond stresses, IS

code provisions, Anchorage zone stresses in post tensioned members, stress distribution in

End block, Anchorage zone reinforcements.

10 Hrs

UNIT – V

STATICALLY INDETERMINATE STRUCTURES:

Advantages and disadvantages of continuous PSC beams, Primary and secondary moments, P

and C lines, Linear transformation, concordant and non-concordant cable profiles, Analysis of

continuous beams.

10 Hrs



2 Analyse, Design and detail PSC elements.

3 Understand the concept of Pre stressed and Post tensioned concrete.





Text Books:

1 Design of Prestressed concrete structures - Lin T.Y. and H. Burns - John Wiley & Sons, 1982.

2 Prestressed Concrete - N. Krishna Raju - Tata McGraw Hill, 3rd edition, 1995.

3 Prestressed Concrete Structures- P. Dayaratnam - Oxford & IBH, 5th Edition, 1991.

4 S. Ramamrutham, “Prestressed concrete”, Dhanpat Rai & Sons, Delhi.

5 IS: 1343-2012.

Reference Books:

1 G.S. Pandit and S.P. Gupta, Prestressed Concrete - CBS Publishers, 1993.

2 Praveen Nagarjun, Prestressed Concrete Design, Pearson Publishers.

3 Dr.S.N.Sinha & Dr.S.K.Roy, Fundamentals of Prestressed Concrete, S. Chand Publishers.

CO-PO Mapping


CO1

CO2

CO3


Semester: I

Course Title: SPECIAL CONCRETE

Course Code:20CSE152 CIE + Assignment + Group Activity + Seminar + SEE Marks

= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To learn principles of Concrete mix design.

2 To differentiate between different types of concrete.

3 To characterize the High Performance concrete.

UNIT – I

Components of modern concrete and developments in the process and constituent materials :

Role of constituents, Development in cements and cement replacement materials, pozzolona, fly

ash, silica fume, rice husk ash, recycled aggregates, chemical admixtures. Mix proportioning of

Concrete: Principles and methods.

12 Hrs

UNIT – II

Light Weight concrete:

Introduction, classification, properties, strength and durability, mix proportioning and problems.

High density concrete: Radiation shielding ability of concrete, materials for high density concrete,

mix proportioning, properties in fresh and hardened state, placement methods.

10 Hrs

UNIT – III

Ferro cement:

Ferrocement materials, mechanical properties, cracking of ferrocement, strength and behaviour in

tension, compression and flexure, Design of ferrocement in tension, ferrocement constructions,

durability, and applications.

10 Hrs

UNIT – IV

Fibre reinforced concrete:

Fibre materials, mix proportioning, distribution and orientation, interfacial bond, properties in fresh

state, strength and behavior in tension, compression and flexure of steel fibre reinforced concrete,

mechanical properties, crack arrest and toughening mechanism, applications.

10 Hrs


High Performance concrete:

Constituents, mix proportioning, properties in fresh and hardened states, applications and

limitations. Ready Mixed Concrete, Self-Compacting Concrete, Reactive powder concrete, and

bacterial concrete (Self-healing Concrete).

10 Hrs



2 Understand the principles of Concrete mix design.

3 Summarize the different types of concrete and its materials used.





Text Books:

1 Neville A.M, “Properties of Concrete” Pearson Education Asis, 2000

2 P. Kumar Mehta, Paul J.N.Monterio, CONCRETE, “Microstructure, Properties and Materials”- Tata McGraw Hill.

3 A.R.Santhakumar, (2007) “Concrete Technology”-Oxford University Press, New Delhi, 2007

4 M.S. Shetty “Concrete Technology”

5 IS: 10262-2009, IS: 456- 2000

Reference Books:

1 Gambhir “Concrete Technology” TMH.

2 Rudnai.G. “Light Wiehgt concrete”- Akademiaikiado, Budapest, 1963.

3 Rixom.R. and Mailvaganam.N., “Chemical admixtures in concrete”- E and FN, Spon London 1999

4 Aitcin P.C. “High performance concrete”-E and FN, Spon London 1998

CO-PO Mapping


CO1

CO2

CO3


Semester: I

Course Title: DESIGN OF PRECAST AND COMPOSITE STRUCTURES


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To Learn the concepts and techniques of precast construction.

2 To select or design precast elements suitable for project specific requirements.

3 To design precast systems to ensure integrity and safety of the structure and to avoid progressive collapse.

4 To design composite floors and beam elements.

UNIT – I

CONCEPTS , COMPONENTS, STRUCTURAL SYSTEMS AND DESIGN OF

PRECAST CONCRETE FLOORS:

Need and types of precast construction, Modular coordination, Precast elements- Floor,

Beams, Columns and walls. Structural Systems and connections.

DESIGN OF PRECAST CONCRETE FLOORS:

Theoretical and Design Examples of Hollow core slabs. Precast Concrete Planks, floor with

composite toppings with and without props.

12 Hrs

UNIT – II

DESIGN OF PRECAST REINFORCED AND PRESTRESSED CONCRETE BEAMS:

Theoretical and Design Examples of ITB – Full section precast, Semi Precast, propped and

uncropped conditions. Design of RC Nibs

10 Hrs

UNIT – III

DESIGN OF PRECAST CONCRETE COLUMNS AND WALLS:

Design of braced and unbraced columns with corbels subjected to pattern and full loading.

Design of Corbels, Design of RC walls subjected to Vertical, Horizontal loads and moments,

Design of vertical ties and horizontal joints.

10 Hrs

UNIT – IV (Blended Learning)

DESIGN OF PRECAST CONNECTIONS AND STRUCTURAL INTEGRITY:

Beam bearing, Beam half Joint, Steel Inserts, Socket Connection, Structural integrity,

Avoidance of progressive collapse, Design of Structural Ties.

10 Hrs

UNIT – V

DESIGN OF STEEL CONCRETE COMPOSITE FLOORS AND BEAMS

COMPOSITE FLOORS:

Profiled Sheeting with concrete topping, Design method, Bending and Shear Resistance of

Composite Slabs, Serviceability Criteria, Design Example

COMPOSITE BEAMS:

Elastic Behaviour, Ultimate Load behavior of Composite beams, Stresses and deflection in

service and vibration, Design Example of Simply Supported beams.

10 Hrs



2 Explore the concept of precast construction.

3 Learn the principles and Design of Precast and Composite Structures.



• There will be two full questions (with a maximum of four sub - questions) from each unit. • Each full question will have sub - question covering all the topics under a unit.

Text Books:

1 R.P.Johnson: Composite Structure of Steel and Concrete (Volume 1), Blackwell Scientific

Publication (Second Edition), U.K., 1994.

2 S.Ramachandramurthy,Desihn & Construction of Precast Structures, Dipti Press OPC Private Limited – Chennai.

3 R.P.Johnson, Composite structures of Steel & Concrete,Blackwell Publishers.

Reference Books:

1 Hubert Bachmann, Alfred Steinle, Design of Precast Concrete Structures,Ernst & John Publications.

2 David Sheppard – “Plant cast, Precast and Prestressed concrete – McGraw Hill; 1989.

3 NBC – 2005 ( Part I to Part VII) BIS Publications, New Delhi, IS 15916- 2011,IS 11447,IS6061 – I and III

4 Hass A.M. – Precast Concrete – Design and applications Applied Science, 1983.

5 IS: 11384, Code of Practice for Composite Construction in Structural Steel and Concrete.

CO-PO Mapping


CO1

CO2

CO3



Semester: I

Course Title: RELIABILITY ANALYSIS OF STRUCTURES

Course Code: 20CSE154 CIE + Assignment + Group Activity + Seminar + SEE Marks = 30 + 10 + 5 + 5 + 100

Credits: 03



1 To learn principles of reliability.

2 To implement the Probability Concepts for the Reliability Analysis.

3 To evaluate different methods of reliability analysis.

UNIT – I

Preliminary Data Analysis:

Graphical representation- Histogram, frequency polygon, Measures of central tendency- grouped

and ungrouped data, measures of dispersion and measures of asymmetry. Curve fitting

and Correlation: Fitting a straight line, curve of the form y = ab x, and parabola, Coefficient of

correlation

8 Hrs

UNIT – II

Probability Concepts:

Random events-Sample space and events, Venn diagram and event space, Measures of

probability- interpretation, probability axioms, addition rule, multiplication rule, conditional

probability, probability tree diagram, statistical independence, total probability theorem and

Baye’s theorem.

9 Hrs

UNIT – III

Random variables:

Probability mass function, probability density function, Mathematical expectation, Chebyshev’s

theorem. Probability distributions: Discrete distributions- Binomial and poison distributions, Continuous distributions- Normal, Log normal distributions.

7 Hrs

UNIT – IV

Reliability Analysis:

Measures of reliability-factor of safety, safety margin, reliability index, performance function

and limiting state. Reliability Methods-First Order Second Moment Method (FOSM), Point

Estimate Method (PEM), and Advanced First Order Second Moment Method (Hasofer-Lind’s

method)

8 Hrs


System reliability:

Influence of correlation coefficient, redundant and non-redundant systems-series, parallel and

combined systems, Uncertainty in reliability assessments- Confidence limits, Bayesian revision

of reliability. Simulation Techniques:

Monte Carlo simulation- Statistical experiments, sample size and accuracy, Generation of

random numbers- random numbers with standard uniform distribution, continuous random

variables, discrete random variables.

7 Hrs



2 Understand the principles of reliability.

3 Summarize the Probability distributions.


• The question paper will have ten full questions carrying equal marks.

• Each full question will be for 20 marks. • There will be two full questions (with a maximum of four sub - questions) from each unit.

Text Books:

1 Ranganathan, R. (1999). “Structural Reliability Analysis and design”- Jaico publishing house,

Mumbai, India.

2 Ang, A. H. S., and Tang, W. H. (1984). “Probability concepts in engineering planning and design”- Volume –I, John Wiley and sons, Inc, New York.

3 Ang, A. H. S., and Tang, W. H. (1984). “Probability concepts in engineering planning and design”- Volume –II, John Wiley and sons, Inc, New York.

4 Milton, E. Harr (1987). “Reliability based design in civil engineering”- McGraw Hill book Co.

Reference Books:

1 Nathabdndu, T., Kottegoda, and Renzo Rosso (1998). Statistics, “Probability and reliability for

Civil and Environmental Engineers”- Mc Graw Hill international edition, Singapore.

2 Achintya Haldar and Sankaran Mahadevan (2000). “Probability, Reliability and Statistical methods in Engineering design”- John Wiley and Sons. Inc.

3 Thoft-christensen, P., and Baker, M., J., (1982), “Structural reliability theory and its applications”- Springer-Verlag, Berlin, NewYork.

4 Thoft-christensen, P., and Murotsu, Y. (1986). “Application of structural systems reliability theory”- Springer-Verlag, Berlin, NewYork

5 Srinath, “Reliability analysis of structures”.

CO-PO Mapping


CO1

CO2

CO3



Semester: I

Course Title: OPTIMIZATION TECHNIQUES


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To make students learn principles of optimization.

2 To implement the optimization concepts for the structural engineering problems.

3 To evaluate different methods of optimization.

UNIT – I

Introduction:

Introduction to optimization, engineering applications of optimization, Formulation of structural

optimization problems as programming problems.

Optimization Techniques:

Classical optimization techniques, single variable optimization, multivariable optimization with

no constraints, unconstrained minimization techniques and algorithms constrained optimization

solutions by penalty function techniques, Lagrange multipliers techniques and feasibility

techniques.

12 Hrs

UNIT – II

Linear Programming:

Linear programming, standard form of linear programming, geometry of linear programming

problems, solution of a system of linear simultaneous equations, pivotal production of general

systems of equations, simplex algorithms, revised simpler methods, duality in linear programming.

10 Hrs

UNIT – III

Non-linear programming:

Non-linear programming, one dimensional minimization methods, elimination methods, Fibonacci

method, golden section method, interpolation methods, quadratic and cubic methods,

Unconstrained optimization methods, direct search methods, random search methods, descent

methods.

10 Hrs

UNIT – IV

Constrained optimization: Techniques such as direct methods, the complex methods, cutting plane method, exterior penalty

function methods for structural engineering problems. Formulation and solution of structural

optimization problems by different techniques.

10 Hrs

UNIT – V

Geometric programming:

Geometric programming, conversion of NLP as a sequence of LP/ Geometric programming.

Dynamic programming: Dynamic programming conversion of NLP as a sequence of LP/ Dynamic programming.

10 Hrs


1 Understand the principles of optimization and its techniques.

2 Summarize the Linear, Non-linear and Geometric Programming,

3 Ability to apply the knowledge of different programming models for structural optimisation.



Text Books:

1 Singiresu S. Rao,(2010), “Engineering Optimization (Theory and Practice)” 3rd Edition, New Age International (P) Ltd.

2 Rao S.S.,(1983), “Engineering Optimization-Theory and Applications”, New Age International Publishers

3 Bhavikatti S.S.- “Structural optimization using sequential linear programming”- Vikas publishing house

4 Richard Bronson, “Operation Research”- Schaum’s Outline Series

Reference Books:

1 Jack R. Benjamin & C. Allin Cornell., (2014), “Probability, Statistics and Decision for Engineers”,

McGrawHill.

2 Spunt, “Optimum Structural Design”- Prentice Hall

3 Kirsch U., (1981) “Optimum Structural Design”, McGraw Hill

CO-PO Mapping


CO1

CO2

CO3

• Each full question will be for 20 marks. • There will be two full questions (with a maximum of four sub - questions) from each unit.

• Each full question will have sub - question covering all the topics under a unit.



Semester: I

Course Title: COMPOSITES AND SMART MATERIALS


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 To make students to learn principles of Composite materials.

2 To characterize smart materials.

3 To identify and understand the actuators and sensors.

UNIT – I

Introduction: Introduction to Composite materials, classifications and applications. Anisotropic

elasticity – unidirectional and anisotropic lamina, thermo–mechanical properties, micro- mechanical analysis, characterization tests.

12 Hrs

UNIT – II

Classical composite lamination theory, cross and angle – play lamina, symmetric, anti-symmetric

and general symmetric laminates, mechanical coupling. Analysis of simple laminated structural

elements ply-stress and strain, lamina failure theories

First fly failure, vibration and buckling analysis. Sandwich structure face and core materials,

secondary failure modes environmental effects, manufacturing of composites.

10 Hrs

UNIT – III

Introduction to smart materials and structures – piezoelectric materials – coupled electromechanical constitutive relations – depoling and coercive field – field – strain relation – hysterics – creep –

strain rate effects – manufacturing.

10 Hrs

UNIT – IV

Actuators and sensors: single and dual actuators – pure extension, pure bending – bending

extension relations – uniform strain beam model – symmetric induced strain actuators – bond shearing force – Bernoulli Euler (BE) beam model – embedded actuators.

10 Hrs

UNIT – V

Asymmetric induced strain actuators in uniform strain and Euler – Bernoulli models. Uniform strain

model – energy principle formulation – BE model – single and dual surface bonded actuators

– Extension – bending and torsion model. Introductions to control systems: Open loop and close

loop transfer functions – stability criteria – deflection control of beam like structures – using

piezoelectric sensors and actuators – shape memory alloys.

10 Hrs

Course Outcomes:

1 Classify Composite materials and smart materials with its applications in structural elements.

2 Understand the behaviour of Actuators and sensors.

3 Apply the knowledge of control systems in structural elements.





Text Books:

1 Mechanics of Composite Materials and Structures by M. Mukhopadhya- Universities Press 2009

2 Robart M.Jones, “Mechanical of Composite Materials”- McGraw Hill Publishing Co.

3 Bhagwan D Agarvalm and Lawrence J Brutman, “Analysis and Performance of Fiber Composites”- John Willy and Sons.

Reference Books:

1 Crawley, E and de Luis, J., “Use of Piezoelectric actuators as elements of intelligent structures”- AIAA Journal, Vol.25, No.10, Oct 1987, PP 1373-1385

2 Crawley, E and Anderson, E., “Detailed models of Piezoceramic actuation of beams” - Proc.

of the 30th AIAA/ASME/ASME/ASCE/AHS/ASC – Structural dynamics and material conference, AIAA, Washington DC, 1989

CO-PO Mapping


CO1

CO2

CO3


Semester: I

Course Title: ADVANCED STRUCTURAL MECHANICS


Hours: 52Hrs (L:T:P:S:4:0:0:0) SEE Duration: 3 Hrs.


1 To make students to acquaint with the principles of structural mechanics to solve Civil / Structural Engineering problems.

2 To make students to acquaint with the principles of Plastic analysis of structures.

3 To make students to acquaint with the lateral load analysis.

UNIT – I

Influence Line Diagram for Indeterminate Structures (ILD):

Muller Breslau principle for determinate and indeterminate structures, Influence lines for bending

moment and shear forces in continuous beams.

12 Hrs

UNIT – II

Kani’s Rotation Contribution method for unsymmetrical frames:

Kani’s method for the analysis of symmetric and asymmetric frames. 10 Hrs

UNIT – III

Plastic Analysis of Structures: Basic principles and advantages. plastic moment, plastic hinge, shape factors and computation

of shape factors for different cross sectional shapes, Plastic collapse, mechanism conditions,

types of mechanisms, combined/composite mechanisms, theorems, applications to the analysis

of simple and continuous beams

10 Hrs

UNIT – IV

Plastic Analysis of Frames and Gable Structures and Plastic Design:

Combined / Composite mechanisms and plastic analysis of frames, Instantaneous centre of

rotation, minimum weight design, plastic design of beams and frames.

10 Hrs

UNIT – V

Analysis of Building Frames for Vertical and Lateral Loads

Analysis of frames subjected to horizontal/lateral loads: portal method, cantilever method, and

factor method, Substitute frame method of analysis/two cycle moment distribution for vertical

loads.

10 Hrs


1 Understand the principles of influence lines for calculation of moments and forces.

2 Perform analysis of frames by Kani’s method.

3 Perform Plastic analysis and design of structures.

4 Analyze the structures subjected to different types of vertical and lateral loadings.





Text Books:

1 Reddy C.S, Basic Structural Analysis, Tata McGraw Hill Publishing Co. Ltd., New Delhi, 1997.

2 Steven C. Chapra and Raymond P. Canale, Numerical Methods for Engineers, Tata McGraw Hill Edition, New Delhi, Third Edition, 2000, ISBN 0-07-042139-0.

3 N. Krishnaraju and K.U. Muthu, Numerical Methods for Engineering Problems, MACMILLAN India Ltd., 1992, SBN 033390-973-9.

Reference Books:

1 Wang C.K, Intermediate Structural Analysis, McGraw Hill Publishing Co., USA, 1983.

2 Pandit G.S and Gupta S.P, Structural Analysis, Tata McGraw Hill, New Delhi, 2001.

3 Rajasekaran S and Sankarasubramanian G, Computational Structural Mechanics, Prentice Hall of India, New Delhi, 2001.

CO-PO Mapping


CO1

CO2

CO3

CO4


Semester: I

Course Title: EARTH AND EARTH RETAINING STRUCTURES


= 30 + 10 + 5 + 5 + 50 = 100 Credits: 03



1 Broadly familiar with the importance of geotechnical engineering problems related field.

2 Understand the types of lateral earth pressure and its use in the design of retaining structures.

3 Check the stability of earthen slopes, retaining walls, sheet piles and braced cuts.

4 Estimation of seepage quantity through earthen dams and sheet piles.

UNIT – I

STABILITY OF EARTH SLOPES:

Types of slopes, causes and type of failure of slopes. Factor of safety, Stability analysis of Infinite

slopes by limiting equillbrium condition, Stability analysis of finite slopes by Swedish slip circle

method, Method of slices, Fellineous method, Taylor’s stability number. Stability of slopes under

steady seepage, sudden drawdown and during construction.

8 Hrs

UNIT – II (Blended Learning)

SEEPAGE ANALYSIS:

Laplace equation, Flow nets – characteristics and applications, Flow nets for sheet piles and below

dam. Phreatic line – A. Casagrande’s method – with and without filter, Flow through dams, Design

of dam filters.

9 Hrs

UNIT – III

LATERAL EARTH PRESSURE:

Types of earth pressure (Active, Passive and at-rest earth pressure). Rankine’s and Coulomb’s Earth

pressure theories – Assumptions and limitations. Rankine’s theory of applications (Dry, moist,

submerged, partially submerged, uniform surcharge, layered cohesionless, cohesive and cohesive – friction backfill).

7 Hrs

UNIT – IV

RETAINING WALLS:

Types of retaining walls, Failure of retaining walls by sliding, overturning and bearing. Stability

and principles of the design of retaining walls – Gravity retaining walls, cantilever retaining walls,

counterfort retaining walls, modes of failure of retaining walls, drainage of the backfill.

8 Hrs

UNIT – V

BULK HEADS:

Cantilever sheet pile walls and Anchored cantilever sheet pile walls in cohesion less soils and in

clay.

BRACED CUTS: Lateral earth pressure on sheeting and Design of various components of bracings.

7 Hrs


1 Estimate the factor of safety against failure of slopes and to compute lateral pressure distribution behind earth retaining structures.

2 Estimate the quantity of seepage through earth retaining structures.

3 Analyse and design the various components and check the safety of retaining wall, sheet pile and braced cut.



• Each full question will be for 20 marks.

• There will be two full questions (with a maximum of four sub - questions) from each unit. • Each full question will have sub - question covering all the topics under a unit.

Text Books:

1 Soil Mechanics and Foundation Engineering, Punmia B C, Laxmi Publications Co., New Delhi.

2 Basic and Applied Soil Mechanics - Gopal Ranjan and Rao A.S.R. (2000), New Age International (P) Ltd., New Delhi.

3 Geotechnical Engineering - Braja, M. Das (2002), Fifth Edition, Thomson Business Information India (P) Ltd., India

4 Principles of Soil Mechanics and Foundation Engineering- Murthy V.N.S. (1996), 4th Edition, UBS Publishers and Distributors, New Delhi.

Reference Books:

1 Bowles J E, Foundation analysis and design, McGraw- Hill Publications

2 Shashi K. Gulathi & Manoj Datta, Geotechnical Engineering, Tata McGraw Hill Publications

3 T.W. Lambe and R.V. Whitman, Soil Mechanics, John Wiley & Sons.

CO-PO Mapping


CO1

CO2

CO3



Semester: I

Course Title: STRUCTURAL ENGINEERING LABOROTARY

Course Code: 20CSEL17 CIE + Record + SEE Marks = 20 + 30 + 50 = 100 Credits: 02



1 To make students to learn principles of design of experiments.

2 To investigate the performance of structural elements.

3 To evaluate the different testing methods and equipment’s.

UNIT – I

Testing of beams for deflection, flexure and shear 12 Hrs

UNIT – II

Experiments on Concrete, including Mix design 9 Hrs

UNIT – III

Experiments on vibration of multi storey frame models for Natural frequency and modes. 9 Hrs

UNIT – IV (Blended Learning)

Use of Nondestructive testing (NDT) equipments – Rebound hammer, Ultra sonic pulse velocity meter and Profometer.

9 Hrs


1 Achieve Knowledge of design and development of experimenting skills.

3 Design and develop analytical skills.

4 Summarize the testing methods and equipments.

Note:

Two questions are to be set from each Unit of 20 marks each and Answer at least one question from

each unit.

References:

NPTL.Com, IISc, Code Books. IS: 456-2000, IS: 10262-2009

CO-PO Mapping


CO1

CO2

CO3

Syllabus for 2020-21 Batch PG (CSE) Semester: I

Course Title: TECHNICAL SEMINAR

Course Code: 20CSES18

CIE = 50 Marks Credits: 02

Hours: 28 Hrs. (L:T:P:S:0:2:0:0)


1 To enhance the self-learning capacity of students.

2 Enable them to make a comprehensive approach to new and upcoming areas of technology.

3 Impart training to students to face audience and present their ideas and thus creating in them self- esteem and courage.

Reading Materials:

1 Journal Publication.

2 Conference / Seminar Proceedings.

3 Handbooks / Research Digests/Codebooks.


1 Identify and chose appropriate topic of relevance.

2 Assimilate literature on technical articles of specified topic and develop comprehension.

3 Write technical report.

4 Design and develop presentation on a given technical topic.

CO-PO Mapping


CO1

CO2

CO3

CO4

Individual students are required to choose a topic on their field of interest in Structural Engineering

domain preferably from outside the regular curriculum, and give seminar for about 45 minutes before a

committee consisting of at least three faculty members (preferably specialized in Structural Engineering)

shall assess the presentation of the seminar and award marks to the students based on merits of topic of

presentation. Each student shall submit two seminar reported in a specified format design by the

department. One copy shall be returned to the student after certifying by the chairman of the assessing

committee and remaining one will be kept in the departmental library. Internal continuous assessment

marks are awarded based on the relevance topic, presentation skill, quality of the report write up and

participation and Simulations.

SCHEME OF TEACHING AND EXAMINATION I SEMESTER (Autonomous) 2020-21, 2021-22

M. Tech in Machine Design

I SEMESTER

Sl.

No. Sub Code Subject Title

Teaching

Department


allotted Examination

Credits Lecture

Tutorial/

Seminar/

Assignment

Practical

/

Project

CIE SEE Total

1 20xxx11 MAT 4 - - 50 50 100 3

2 20MMD12 Advanced

Mechanics of

Solids

MECH 4 - - 50 50 100 3

3 20MMD13 Finite Element

Method

MECH 4 - - 50 50 100 3

4 20MMD14 Advanced Design

of Mechanisms MECH 4 - - 50 50 100 3

5 20MMD15X ELECTIVE – I MECH 4 - - 50 50 100 3

6 20MMD16X ELECTIVE – II MECH 4 - - 50 50 100 3

7 20MMDL17 Computer Aided

Engineering

Design Work Tool

Laboratory

MECH - - 3 50 50 100 2

8 20MMDS18 Technical

Seminar

MECH - 4 - 50 - 50 2

9 20MMDM19 Industry visit

MECH - - 6 50 - 50 2

Total 450 350 800 24


ELECTIVE - I

Sl .No Subject Code Subject title

1 20MMD151 Experimental Methods

2 20MMD152 Mechatronics System Design

3 20MMD153 Design For Additive Manufacturing

4 20MMD154 Material Handling

Equipment Design

ELECTIVE - II


1 20MMD161 Composite Materials & Technology

2 20MMD162 Techanical Acoustics

3 201MMD63 Design Optimization

4 20MMD164 Product Design for Quality

ADMISSION YEAR : 2020-21 ACADEMIC YEAR:

2020-21 SEMESTER : FIRST COURSE TITLE:ADVANCED MECHANICS OF SOLIDS

Sub Code: 20MMD12 No of Credits : L-T-P-SS 3:0:0:0=3

No. of Lecture hours/week :04

Exam Duration:3 hours CIE Marks: 50 Exam Marks :50

COURSE OBJECTIVES:

1. To study the basic concept of stress, stress distribution, elastic constants when the material is subjected to

loading within the elastic limits.

2. Study the stress distribution in plane, polar and cylindrical coordinate system. 3. Analyze the material or component subjected to torsion of circular and non-circular shafts (elliptical,

triangular bars)

4. Study the thermo-elastic properties of the material at elevated temperatures.

# CONTENTS Hrs

UNIT-1 Introduction to general theory of elasticity: assumptions and applications of linear

elasticity. Analysis of stress, stress tensors. State of stress at a point, principal stresses in

two dimensions, Cauchy's stress principle, direction cosines, stress components on an

arbitrary plane with stress transformation. Principal stresses in three dimensions, stress

invariants, Equilibrium equations, octahedral stresses, Mohr's stress circle, construction of

Mohr’s Circle for two and three dimensional stress systems, equilibrium equations in polar

coordinates for three-dimensional state of stresses.

11

UNIT-2 Introduction to analysis of strain, types of strain, strain tensors, strain transformation.

Principal strains, strain invariants, octahedral strains, Mohr's Circle for Strain, equations of

Compatibility for Strain, strain rosettes. Stress-strain relations, the Generalised Hooke's

law, compatibility conditions, the transformation from Strain components to stress

components. Strain energy in an elastic body, St.Venant's principle, uniqueness theorem.

11

UNIT-3 Theories of Failure and Energy Methods: Introduction, Theories of Failure, Use of

Factor of Safety in Design, Mohr’s theory of Failure, Ideally Plastic Solid, Stress space and

Strain space, General nature of Yield locus, Yield Surfaces of Tresca and Von Mises,

Stress- Strain relation (Plastic Flow), Prandtl Reuss theory, Saint venant – Von mises

equations.

Principle of Superposition, Reciprocal Relation, Maxwell-Betti-Rayleigh Reciprocal

theorem, First theorem of Castigliano, Expressions for Strain Energy, Statically

indeterminate structures, Theorem of Virtual Work, Second theorem of Castigliano, Maxwell – Mohr integrals.

10

UNIT-4 Bending of Beams: Introduction, Straight beams and Asymmetrical Bending, Euler –

Bernoulli hypothesis, Shear centre or Centre of Flexure, Shear stresses in thin walled open

sections, Bending of curved beams, Deflection of thick curved bars.

10

UNIT-5 Torsion: Introduction, Torsion of general prismatic bars – Solid sections, Torsion of

Circular and Elliptical bars, Torsion of equivalent triangular bar, Torsion of rectangular

bars, Membrane analogy, Torsion of thin walled tubes, Torsion of thin walled multiple cell

closed sections, Multiple connected sections, Centre of twist and flexure centre

10

TEXT BOOKS: 1. Advanced Mechanics of solids, L. S. Srinath, Tata Mc. Graw Hill, 2003.

2. Theory of Elasticity, S. P. Timoshenko and J. N Gordier, Mc.Graw Hill International, 3rd edition, 1972.

REFERENCES BOOKS:

1. Theory of Elasticity, Dr. Sadhu Singh, Khanna Publications, 1988

2. Elasticity, Theory, Applications & Numericals, Martin H Sadd, Elsevier. 2005.

3. Applied Elasticity, Seetharamu & Govindaraju, Interline Publishing.

4. Applied Elasticity, C.T. WANG Sc. D. Mc. Graw Hill Book Co.1953.

COURSE OUTCOMES: After the completion of this course, student will be able to:

CO1 Apply basic concepts in continuum mechanics of solids viz. Stress and strain tensors,

equilibrium, compatibility and constitutive equations and methods of solution to elasticity problems.

CO2 Evaluate stresses and displacements in simple solids such as pressurized cylinders, shrink

fitted cylinders, rotating disc and shaft, plate with hole and non-circular shafts and thin tubes

under torsion.

CO3 Examine bodies subjected to three dimensional stresses for the onset of failure based on failure

Criteria.

CO4 Analyze deflections in beams subjected to different types of loads for elastic, elastoplastic and plastic conditions.

CO5 Evaluate stresses in bars subjected to torsion for elastic, elasto plastic and plastic conditions.

MAPPING OF COs WITH POs

COs/POs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 1 1 1 1

CO2 1 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1

QUESTION PAPER PATTERN (SEE)

Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5

1. Two full questions (each of 20 Marks) are to be set from each unit.

2. Student shall answer five full questions selecting one full question from each unit.


2020-21 SEMESTER : FIRST COURSE TITLE: FINITE ELEMENT METHOD




Pre-requisites Mom, Design of Machine Elements.

COURSE OBJECTIVES:

1. To present the Finite element method (FEM) as a numerical method for engineering analysis of

continuum and structures.

2. To present Finite element formulation using variation and weighted residual approaches.

3. To present Finite elements for the analysis of bars & trusses, beams & frames, plane stress & plane

strain problems and 3-D solids, for thermal and dynamics problems.

4. Learn to model complex geometry problems and technique of solutions.

# CONTENTS Hrs

UNIT-1 Introduction to Finite Element Method: basic steps in finite element method to solve

mechanical engineering problems (solid, fluid and heat transfer). Functional approach

and Galerkin approach. Displacement approach: admissible functions. Convergence

criteria: conforming and nonconforming elements, C0, C1 and Cn continuity elements.

Basic equations, element characteristic equations, assembly procedure, boundary and

constraint conditions.

11

UNIT-2 Solid Mechanics: One-dimensional finite element formulations and analysibars- uniform, varying and stepped cross section. Basic (Linear) and higher order elements formulations for axial, torsional and temperature loads with problems.

Beams- basic (linear) element formulation-for uniform, varying and stepped cross section- for different loading and boundary conditions, numericals.

Trusses, Plane frames and Space frame – basic (Linear) elements formulations for different boundary conditions -axial, bending, torsional, and temperature loads, numericals.

11

UNIT-3 Two dimensional finite element formulations for solid mechanics problems:

triangular membrane (tria 3, tria 6, tria 10) element, fournoded quadrilateral membrane

(quad 4, quad 8) element formulations for in-plane loading with simple

problems.Triangular and quadrilateral axi-symmetric basic and higher order elements

formulation for axi-symmetric loading with simple numericals.

Three dimensional finite element formulations for solid mechanics problems: finite element formulation of tetrahedral element (tet 4, tet 10), hexahedral element (hexa 8, hexa 20), for different loading conditions. Serendipity and Lagrange family elements.

10

UNIT-4 Finite element formulations for structural mechanics problems: Basics of plates and shell theories: classical thin plate theory, shear deformation theory and thick plate

theory. Finite element formulations for triangular and quadrilateral plate elements. Finite element formulation of flat, curved, cylindrical and conical shell elements.

10

UNIT-5 Dynamic analysis: finite element formulation for point/lumped mass and distributed masses system, finite element formulation of one dimensional dynamic analysis: bar, truss, frame and beam element. Finite element formulation of two dimensional dynamic analysis: triangular membrane and axi-symmetric element, quadrilateral membrane and axi-symmetric element. Evaluation of eigen values and eigen vectors applicable to bars, shaft, beams, plane and space frame.

10

TEXT BOOKS:

1. T. R. Chandrupatla and A. D. Belegundu, Introduction to Finite Elements in Engineering, Prentice Hall, 3rd Ed, 2002.

2. Lakshminarayana H. V., Finite Elements Analysis– Procedures in Engineering, Universities Press, 2004.

REFERENCE BOOKS:

1. Rao S. S, Finite Elements Method in Engineering- 4th Edition, Elsevier, 2006

2. P.Seshu, Textbook of Finite Element Analysis, PHI, 2004. 3. J.N.Reddy, Introduction to Finite Element Method, mcgraw -Hill, 2006.

4. Bathe K. J, Finite Element Procedures, Prentice-Hall, 2006.

5. Cook R. D., Finite Element Modeling for Stress Analysis, Wiley, 1995.


CO1 Understand the concepts of Variation methods and Weighted residual methods.

CO2 Identify the application and characteristics of FEA elements such as bars, beams, plane and isoparimetric elements, and 3D element.

CO3 Develop element characteristic equations and generate global stiffness equations.

CO4 Apply suitable boundary conditions to a global structural equation, and reduce it to a

solvable form.

CO5 Identify how the finite element method expands beyond the structural domain, for problems involving dynamics and heat transfer.



CO1 1 1 1 1

CO2 1 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1

High-3 Medium-2 Low-1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE: ADVANCED DESIGN OF MECHANISM





COURSE OBJECTIVES:

1. To provide a theoretical and practical foundation for analysis and design of articulated mechanical

systems for desired applications.

2. Develop skills to analyze the displacement, velocity, and acceleration of mechanisms.

3. Improve understanding of the synthesis of mechanisms for given tasks.

4. To include dynamics for considerations in the design of mechanisms engineering applications.

# CONTENTS Hrs.

UNIT-1 Geometry of Motion: Introduction, analysis and synthesis, Mechanism terminology,

planar, spherical and spatial mechanisms, mobility, Grashoffs law, Equivalent

mechanisms, Unique mechanisms, Kinematic analysis of plane mechanisms:

Development of different mechanisms and its inversions like four bar chain

mechanism, slider crank mechanism, double slider cranks, mechanism.

11

UNIT-2 Generalized Principles of Dynamics: Fundamental laws of motion, Generalized

coordinates, Configuration space, Constraints, Virtual work, Principle of Virtual

Work, Energy and Momentum, Work and kinetic energy, Equilibrium and stability,

Kinetic energy of a system, Angular momentum, Generalized momentum. Lagrange's

Equation: Lagrange's equation from D'Alembert's principles, Examples, Hamilton’s

equations, Hamilton’s principle, Lagrange's, equation from Hamilton’s principle,

Derivation of Hamilton’s equations, Examples.

11

UNIT-3 Analytical Methods of Dimensional Synthesis: Synthesis of Linkages: Type,

number, and dimensional synthesis, Function generation, Path generation and Body

guidance, Precision positions, Structural error, Chebychev spacing, Two position

synthesis of slider crank mechanisms, Crank-rocker mechanisms with optimum

transmission angle Motion Generation: Poles and relative poles, Location of poles

and relative poles, polode, Curvature, Inflection circle

10

UNIT-4 Graphical Methods of Dimensional Synthesis: Two position synthesis of crank and

rocker mechanisms, Three position synthesis, Four position synthesis (point precision

reduction) Overlay method, Coupler curve synthesis, Cognate linkages. Ana1ytical

Methods of 32 Dimensional Synthesis: Freudenstein's equation for four bar

mechanism and slider crank mechanism, Examples, Bloch's method of synthesis, Analytical synthesis using complex algebra.

10

UNIT-5 Spatial Mechanisms: Introduction, Position analysis problem, Velocity and acceleration analysis, Eulerian angles.

10

TEXT BOOKS: 1. K.J.Waldron&G.L.Kinzel , “Kinematics, Dynamics and Design of Machinery”, Wiley India, 2007.

2. Greenwood, “Classical Dynamics”, Prentice Hall of India, 1988.

REFERENCES BOOKS: 1. J E Shigley, “Theory of Machines and Mechanism” -McGraw-Hill, 1995

2. A.G.Ambekar , “Mechanism and Machine Theory”, PHI, 2007.

3. Ghosh and Mallick , “Theory of Mechanism and Mechanism”, East West press 2007.

4. David H. Myszka , “Machines and Mechanisms”, Pearson Education, 2005.


CO1 The knowledge of dynamics considerations in mechanism design is essential to use commercial multi body dynamics software in mechanical engineering design.

CO2 Carry out mobility analysis of mechanism and perform velocity and acceleration of complex planer mechanism.

CO3 Synthesize mechanisms for function generation and path generation.

CO4 Analyze the Dynamics of Mechanical systems using D’Alemberts. ,Lagrange’s, and Hamiltons Principles.

CO5 Demonstrate the skills to use software to analyze mechanisms, synthesis of linkages.



CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1



Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5



ADMISSION YEAR: 2020-21 ACADEMIC YEAR:

2020-21 SEMESTER: FIRST COURSE TITLE:EXPERIMENTAL METHODS





COURSE OBJECTIVES:

1. To introduce the concepts of dynamic measurements and analysis of experimental data. 2. To expose them to the techniques of Data Acquisition, Signal conditioning and processing.

3. To introduce students to different aspects of measuring deformation, strains, and stresses for developing a mechanistic understanding of both the material and the structure behavior.

# CONTENTS Hrs

UNIT-1 Introduction: Definition of terms, calibration, standards, dimensions and units,

generalized measurement system, Basic concepts in dynamic measurements, system

response, distortion, impedance matching, experiment planning. Analysis of

Experimental Data: Cause and types of experimental errors, error analysis. Statistical

analysis of experimental data- Probability distribution, gaussian, normal distribution.

Chi-square test, Method of least square, correlation coefficient, multivariable

regression, standard deviation of mean, graphical analysis and curve fitting, general consideration in data analysis.

11

UNIT-2 Data Acquisition and Processing: General data acquisition system, signal

conditioning revisited, data transmission, Analog-to-Digital and Digital-to- Analog

conversion, Basic components (storage and display) of data acquisition system.

Computer program as a substitute for wired logic. Force, Torque and Strain

Measurement: Mass balance measurement, Elastic Element for force measurement,

torque measurement. Strain Gages -Strain sensitivity of gage metals, Gage

construction, Gage sensitivity and gage factor, Performance characteristics,

Environmental effects Strain, gage circuits, Potentiometer, Wheat Stone's bridges,

Constant current circuits. Strain Analysis Methods-Two element and three element,

rectangular and delta rosettes, Correction for transverse strains effects, stress gage

- plane shear gage, Stress intensity factor gage.

11

UNIT-3 Stress Analysis: Two Dimensional Photo elasticity - Nature of light, - wave theory

of light,- optical interference - Polariscopes stress optic law - effect of stressed model

in plane and circular Polariscopes, IsoclinicsIso chromatics fringe order

determination - Fringe multiplication techniques - Calibration Photoelastic model

materials. Separation methods shear difference method, Analytical separation

methods, Model to prototype scaling.

10

UNIT-4 Three Dimensional Photo elasticity: Stress freezing method, General slice,

Effective stresses, Stresses separation, Shear deference method, Oblique incidence

method Secondary principals stresses, Scattered light photo elasticity, Principals,

Polari scope and stress data analyses.

10

UNIT-5 Coating Methods:

Photo elastic Coating Method-Birefringence coating techniques Sensitivity

Reinforcing and thickness effects - data reduction - Stress separation techniques

Photo elastic strain gauges.

Brittle Coatings Method: Brittle coating technique Principles data analysis -

coating materials, Coating techniques. Moire Technique - Geometrical approach, Displacement approach- sensitivity of

10

Moire data data reduction, In plane and out plane Moire methods, Moire

photography, Moire grid production. Holography: Introduction, Equation for plane

waves and spherical waves, Intensity, Coherence, Spherical radiator as an object

(record process), Hurter, Driffeld curves, Reconstruction process,

Holograpicinterferomerty, Realtime. and double exposure methods, Displacement measurement, Isopachics.

TEXT BOOKS: 1. Holman,“Experimental Methods for Engineers” 7th Edition, Tata McGraw-Hill Companies, Inc, New

York, 2007.

2. R. S. Sirohi, H. C. Radha Krishna, “Mechanical measurements” New Age International Pvt. Ltd., New

Delhi, 2004 .

3. Experimental Stress Analysis - Srinath, Lingaiah, Raghavan, Gargesa, Ramachandra and Pant, Tata

McGraw Hill, 1984.

4. Instrumentation, Measurement And Analysis -Nakra&Chaudhry, B C Nakra K KChaudhry, Tata

McGraw-Hill Companies, Inc, New York, Seventh Edition, 2006.

REFERENCES BOOKS: 1. Measurement Systems Application and Design - Doeblin E. A., 4th (S.I.) Edition, McGraw Hill, New

York. 1989 .

2. Design and Analysis of Experiments - Montgomery D.C., John Wiley & Sons, 1997.

3. Experimental Stress Analysis-Dally and Riley, McGraw Hill, 1991.

4. Experimental Stress Analysis-Sadhu Singh, Khanna publisher, 1990. 5. PhotoelasticityVol I and Vol II

- M.M.Frocht,. John Wiley and sons, 1969. 6. Strain Gauge Primer - Perry and Lissner, McGraw Hill,

1962.


CO1 Undertake experimental investigations to verify predictions by other methods.

CO2 To acquire skills for experimental investigations an accompanying laboratory course is desirable.

CO3 To analyze fringe patterns, calibration studies.

CO4 Analysis and evaluations of polariscope.

CO5 Study and evaluation techniques of coating technology.



CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1



Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE : MECHATRONICS SYSTEMS DESIGN

Sub Code: 20MMD152 No of Credits : L-T-P-SS 3:0:0:0 =3

No. of lecture hours/week : 04

Exam Duration : 3 hours CIE Marks: 50 Exam Marks : 50

COURSE OBJECTIVES:

1. To educate the student regarding integration of mechanical, electronic, electrical and computer systems

in the design of CNC machine tools, Robots etc.

2. To provide students with an understanding of the Mechatronic Design Process, actuators, Sensors,

transducers, Signal Conditioning, MEMS and Microsystems and also the Advanced Applications in

Mechatronics

# CONTENTS Hrs

UNIT-1

INTRODUCTION: Definition and Introduction to Mechatronic Systems. Modeling

&Simulation of Physical systems Overview of Mechatronic Products and their functioning, measurement systems. Control Systems, simple Controllers.

11

UNIT-2 STUDY OF SENSORS AND TRANSDUCERS: Pneumatic and Hydraulic Systems,

Mechanical Actuation System, Electrical Actual Systems, Real time interfacing and

Hardware components for Mechatronics.

11

UNIT-3 ELECTRICAL ACTUATION SYSTEMS: Electrical systems, Mechanical switches,

Solid state switches, solenoids, DC & AC motors, Stepper motors. System Models: Mathematical models:- mechanical system building blocks, electrical

system building blocks, thermal system building blocks, electromechanical systems, hydro-mechanical systems, pneumatic systems.

10

UNIT-4 SIGNAL CONDITIONING: Signal conditioning, the operational amplifier, Protection,

Filtering, Wheatstone Bridge, Digital signals , Multiplexers, Data Acquisition, Introduction

to digital system processing, pulse-modulation.

MEMS AND MICROSYSTEMS: Introduction, Working Principle, Materials for MEMS

and Microsystems, Micro System fabrication process, Overview of Micro Manufacturing,

Micro system Design, and Micro system Packaging.

10

UNIT-5 DATA PRESENTATION SYSTEMS: Basic System Models, System Models, Dynamic

Response of system.

ADVANCED APPLICATIONS IN MECHATRONICS: Fault Finding, Design,

Arrangements and Practical Case Studies, Design for manufacturing, User-friendly design

10

TEXT BOOKS: 1. W. Bolton, “Mechatronics” - Addison Wesley Longman Publication, 1999

2. HSU “MEMS and Microsystems design and manufacture”- Tata McGraw-Hill Education, 2002

REFERENCE BOOKS: 1. Kamm,“Understanding Electro-Mechanical Engineering an Introduction to Mechatronics”- IEEE Press,

1 edition ,1996

2. Shetty and Kolk, “Mechatronics System Design”- Cenga ge Learning, 2010

3. Mahalik ,“Mechatronics”- Tata McGraw-Hill Education, 2003

4. HMT “Mechatronics”- Tata McGraw-Hill Education, 199 8

5. Michel .B. Histand& David. Alciatore, “Introduction to Mechatronics & Measurement Systems”–. Mc

Graw Hill, 2002.

COURSE OUTCOME: After the completion of this course, student will be able to:

CO1 Appreciate multi-disciplinary nature of modern engineering systems.

CO2 Model and analyze mechanical and electrical systems and their connection.

CO3 Be able to integrate mechanical, electronics, control and computer engineering in the design of mechatronics systems.

CO4 Address issues of design, fabrication, and packaging issues of Microsystems.

CO5 Design of system models in application of advanced mechatronics system.



CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1



Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE: DESIGN FOR ADDITIVE MANUFACTURING




COURSE OBJECTIVES:

1. To acquaint the learner on fundamentals of additive manufacturing/rapid prototyping, reverse engineering techniques and its applications.

2. To familiarize students with different processes in rapid prototyping systems.

3. To teach students about mechanical properties and geometric issues relating to specific rapid prototyping applications.

# CONTENTS Hrs

UNIT-1

Introduction: Need for the compression in product development, history of RP systems,

Survey of applications, Growth of RP industry, and classification of RP systems.

Stereo Lithography Systems: Principle, Process parameter, Process details, Data

preparation, data files and machine details, Application.

11

UNIT-2 Selective Laser Sintering and Fusion Deposition Modeling: Type of machine, Principle

of operation, process parameters, Data preparation for SLS, Applications, Principle of

Fusion deposition modeling, Process parameter, Path generation, Applications.

11

UNIT-3 Solid Ground Curing: Principle of operation, Machine details, Applications.

Laminated Object Manufacturing: Principle of operation, LOM materials. Process details, application.

10

UNIT-4 Rapid Tooling: Indirect Rapid tooling -Silicone rubber tooling – Aluminum filled epoxy

tooling Spray metal tooling, Cast kirksite, 3Q keltool, Direct Rapid Tooling Direct. AIM,

Quick cast process, Copper polyamide, Rapid Tool, DMILS, Prometal, Sand casting tooling,

Laminate tooling soft Tooling vs. hard tooling.

10

UNIT-5 RP Process Optimization: factors influencing accuracy. Data preparation errors, Part

building errors, Error in finishing, influence of build orientation.

10

REFERENCES BOOKS:

1. Stereo lithography and other RP & M Technologies -Paul F. Jacobs- SME, NY1996

2. Rapid Manufacturing - Flham D.T &Dinjoy S.S - Verlog London2001.

3. Rapid automated - Lament wood - Indus press NewYork

4. Wohler's Report 2000 - Terry Wohlers - Wohler's Association -2000


CO1 Describe product development, conceptual design and classify rapid prototyping systems; explain stereo lithography process and applications

CO2 Explain direct metal laser sintering, LOM and fusion deposition modeling processes.

CO3 Demonstrate solid ground curing principle and process.

CO4 Discuss LENS, BPM processes, point out the application of RP system in medical field

define virtual prototyping and identify simulation components. CO5 Understand the RP Process Optimizations.



CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE: MATERIAL HANDLING EQUIPMENT DESIGN




COURSE OBJECTIVES:

1. To develop competency for system visualization and design.

2. To enable student select materials and to design internal engine components.

3. To acquaint student to optimum design and use optimization methods to design mechanical

components.

4. To enable and evaluate design material handling systems

# CONTENTS Hrs

UNIT-1 Elements of Material Handling System: Importance, Terminology, Objectives and benefits of better Material Handling; Principles and features of Material Handling System; Classification of Material Handling Equipment’s, Interrelationships between material handling and plant layout, physical facilities and other organizational functions.

11

UNIT-2 Selection of Material Handling Equipment’s: Factors affecting for selection; Material Handling Equation; Choices of Material Handling Equipment; General analysis Procedures; Basic Analytical techniques; The unit load concept; Selection of suitable types of systems for applications ; Activity cost data and economic analysis for design of components of Material Handling Systems; functions and parameters affecting service; packing and storage of materials.

11

UNIT-3 Design of Mechanical Handling Equipment’s: Design of Hoists: Drives for hoisting, components, and hoisting mechanisms; rail traveling components and mechanisms; hoisting gear operation during transient motion; selecting the motor rating and determining breaking torque for hoisting mechanisms.

Design of Cranes: Hand-propelled and electrically driven E.O.T. overheat Traveling cranes; Traveling mechanisms of cantilever and monorail cranes; design

considerations for structures of rotary cranes with fixed radius ; fixed post and overhead traveling cranes; Stability of stationary rotary and traveling rotary cranes.

10

UNIT-4 Study of systems and Equipment’s used for Material Storage: Objectives of

storage; Bulk material handling; Gravity flow of solids through slides and chutes;

Storage in bins and hoppers; Belt conveyors; Bucket-elevators; Screw conveyors; Vibratory Conveyors; Cabin conveyors; Mobile racks etc.

10

UNIT-5 Material Handling / Warehouse Automation and Safety considerations:

Storage and warehouse planning and design: computerized warehouse planning;

Need, Factors and Indicators for consideration in warehouse automation; which

function, When and How to automate; Levels and Means of Mechanizations. Safety and design; Safety regulations and discipline.

10

TEXT BOOKS:

1. Materials Handling Equipment – N. Rudenko , Envee Publishers, New Delhi

2. Materials Handling Equipment – M.P. Alexandrov. Mie publications, Moscow

REFERENCE BOOKS:

1. Aspects of Material handling – Arora

2. Introduction to Material Handling- Ray

3. Plant Layout and Material Handling- Chowdary R B


CO1 Explain about the different types of material handling, advantages and disadvantages. It also suggests the selection procedure for the material handling along with its specifications.

CO2 Need for Material handling also explained with different techniques like

Automated Material handling Design Program, Computerized material handling Planning

will be dealt.

CO3 Demonstrate ability to successfully complete Fork Lift Certification to safely and effectively operate in the manufacturing environment.

CO4 The Material handling is explained with models, selection procedure of material handling is depending on different function oriented systems. This also related with plant layout by which the minimization of the handling charges will come down.

CO5 The ergonomics related to material handling equipment about design and miscellaneous equipment’s.



CO1 1 1 1 1 1 1

CO2 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE : COMPOSITE MATERIALS & TECHONOLOGY


No. of lecture hours/week :04

Exam Duration:3 hours CIE Marks:50 Exam Marks :50

COURSE OBJECTIVES:

1. To study the basics of Composite materials.

2. To acquaint mechanics of lamina.

3. To study the micro and macro analysis of the lamina.

4. To gain knowledge of different techniques involved in production of composites.

# CONTENTS Hrs

UNIT-1 INTRODUCTION TO COMPOSITE MATERIALS: Definition, Classification,

Types of matrices material and reinforcements, Characteristics &selection, Fiber

composites, laminated composites, Particulate composites, Pre-pegs, and sandwich

construction.

Metal Matrix Composites: Reinforcement materials, Types, Characteristics and

selection, Base metals, Selection, Applications

11

UNIT-2 MACRO MECHANICS OF A LAMINA: Hooke's law for different types of

materials, Number of elastic constants, Derivation of nine independent constants for

orthotropic material, Two - dimensional relationship of compliance and stiffness

matrix. Hooke's law for two-dimensional angle lamina, engineering constants -

Numerical problems. Invariant properties. Stress-Strain relations for lamina of arbitrary orientation, Numerical problems.

11

UNIT-3 MICRO MECHANICAL ANALYSIS OF A LAMINA: Introduction, Evaluation of the four elastic moduli, Rule of mixture, Numerical problems.

Experimental Characterization of Lamina- Elastic Moduli and Strengths

Failure Criteria: Failure criteria for an elementary composite layer or Ply,

Maximum Stress and Strain Criteria, Approximate strength criteria, Inter-laminar

Strength, Tsa-Hill theory, Tsai, Wu tensor theory, Numerical problem, practical recommendations

10

UNIT-4 MACRO MECHANICAL ANALYSIS OF LAMINATE: Introduction, code, Kirchoff hypothesis, Classical Lamination Theory, A, B, and D matrices (Detailed

derivation), Special cases of laminates, Numerical problems. Shear Deformation

Theory, A, B, D and E matrices (Detailed derivation)

Analysis of Composite Structures: Optimization of Laminates, composite

laminates of uniform strength, application of optimal composite structures,

composite pressure vessels, spinning composite disks, composite lattice structures

10

UNIT-5 MANUFACTURING AND TESTING: Layup and curing - open and closed mould

processing, Hand lay-up techniques, Bag moulding and filament winding.

Pultrusion, Pulforming, Thermoforming, Injection moulding, Cutting, Machining,

joining and repair. NDT tests – Purpose, Types of defects, NDT method - Ultrasonic

inspection, Radiography, Acoustic emission and Acoustic ultrasonic method.

Applications: Aircrafts, missiles, Space hardware, automobile, Electrical and

Electronics, Marine, Recreational and sports equipment-future potential of

composites. .

10

TEXT BOOKS: 1. Autar K. Kaw, Mechanics of Composite materials, CRC Press, 2nd Ed, 2005.

2. Madhijit Mukhopadhay, Mechanics of Composite Materials & Structures, Universities Press, 2004.

REFERENCE BOOKS:

1. J. N. Reddy,Mechanics of Laminated Composite Plates & Shells, CRD Press, 2nd Ed, 2004.

2. Mein Schwartz, Composite Materials handbook, McGraw Hill, 1984.

3. Rober M. Jones,Mechanics of Composite Materials, Taylor & Francis, 1998.

4. Michael W,Hyer,Stress analysis of fiber Reinforced Composite Materials, Mc-Graw Hill International,

2009.

COURSE OUTCOME: At the completion of this course, students will be able to:

CO1 Identify the role of matrices and reinforcements used in practical composite structures.

CO2 Analyze problems on macro mechanical behavior of lamina.

CO3 Analyze problems on micro and assess the strength of laminated composite and predict its failure for given static loading conditions.

CO4 Understand various method involved in synthesis of composites and to optimize laminates.

CO5 Develop understanding of different methods of manufacturing and testing of composites



CO1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE: TECHANICAL ACOUSTICS




COURSE OBJECTIVES:

1. To acquaint students the fundamentals of acoustics related to generation, transmission and control techniques.

2. To provide basic knowledge and understanding of noise and vibration control necessary for professional practice as a noise control engineer.

3. To expose them to acoustic instrumentation and techniques of sound measurement.

4. To understand Noise reduction and control techniques in Machinery, auditorium, and HVAC systems

# CONTENTS Hrs

UNIT-1 Introduction to Acoustics: Basics of acoustics - speed of sound, wavelength, frequency,

and wave number, acoustic pressure and particle velocity, acoustic intensity and acoustic

energy density, spherical wave, directivity factor and directivity index,

levels and the decibel, combination of sound sources, octave bands, weighted sound

levels.

11

UNIT-2 Acoustics Evaluation Techniques: Room Acoustics, Reverberation time, Acoustic

materials, Absorption and Absorption Coefficient, Evaluation techniques. Sound and

vibration analyzer (SVAN) Sound sources and Propagation – Plane and spherical waves,

near and far field, free and reverberant field - Anechoic and Reverberant chambers.

11

UNIT-3 Noise and physiological effects: Noise and physiological effects , Acoustic criteria, the

human ear, hearing loss, industrial noise criteria, speech interference level, noise criteria

for interior spaces , Loudness, hearing, hearing loss, hearing protectors, Mechanism -

Weighted Networks -Noise standards for traffic - Community noise - Aircraft -

Environmental noise, Articulation index, and Machinery acoustics.

10

UNIT-4 Acoustic Instrumentation: Sound level and intensity meters - Octave analyzers, octave

band filters, acoustic analysers, dosimeter, measurement of sound power, sound power

measurement in a reverberant room, sound power measurement in an anechoic chamber,

sound power survey measurements, measurement of the directivity factor, calibration,

noise measurement procedures.

Sound power estimation - Instruments for building acoustics -Speech Interference - Sound systems and Auditorium acoustics.

10

UNIT-5 Noise control techniques: At source and transmission path-Barriers and Enclosures-

HVAC system noise, Machinery acoustics and levels- Near field monitoring and

diagnostics - Active noise control techniques. Noise control in rooms, sound absorption.

10

TEXT BOOKS:

1. J.D. Irwin and E.R.Graf, (2001), Industrial Noise and Vibration control, Prentice Hall Inc.

REFERENCE BOOKS:

1. Bies and Colin. H. Hanson, (2001): Engg. Noise Control, E &FN SPON.

2. Noise Control Hand Book of Principles and Practices, David M.Lipsdomls Van Nostrand Reinhold Company.

3. Acoustic and Noise Control, (2000), B.J. Smith, R.J.Peters, Stephanie Owen.

4. Harris, C.K.–Handbook of Noise Control.

5. Petrusowicz and Longmore –Noise and Vibration control for industrialists.

6. Thumann and Miller- Secrets of Noise control.


CO1 Select appropriate noise control techniques for the solution of practical noise problems and

evaluate their performance.

CO2 Understand how to use pressure wave expressions to describe sound transmission in different media.

CO3 Analyze complex noise environments and predict sound levels in desired locations.

CO4 Evaluate acoustic enclosures, barriers and walls for effective noise control.

CO5 Become familiar with sound measurement instrumentation.



CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE : DESIGN OPTIMIZATION



Exam Duration : 3 hours CIE Marks: 50 Exam Marks : 50

Pre-requisites Research methodology, Composite material, Basic mathematics.

COURSE OBJECTIVES:

1. To induce the students to the basics of Design optimization. 2. To acquaint Optimum Design Problem Formulation.

3. To analyze sensitivity analysis, Linear and Non Linear Approximations and Optimization Disciplines.

4. To explore and distinguish knowledge of different Manufacturability in Optimization Problems and Design Interpretation.

# CONTENTS Hrs

UNIT-1 Engineering Design Practice: Evolution of Design Technology, Introduction

to Design and the Design Process, Design versus Analysis, Role of Computers

in Design Cycle, Impact of CAE on Design, Numerical Modeling with FEA and Correlation with Physical Tests.

11

UNIT-2 Optimum Design Problem Formulation: Types of Optimization Problems,

The Mathematics of Optimization, Design Variables and Design Constraints,

Feasible and Infeasible Designs, Equality and Inequality Constraints, Discrete

and Continuous Optimization, Linear and Non Linear Optimization.

Optimization Theory – Fundamental Concepts, Global and Local Minimum,

Gradient Vector and Hessian Matrix, Concept of Necessary and Sufficient

Conditions, Constrained and Unconstrained Problems, Lagrange Multipliers and Kuhn Tucker Conditions

11

UNIT-3 Sensitivity Analysis, Linear And Non Linear Approximations:

Gradient Based Optimization Methods – Dual and Direct. Optimization Disciplines: Conceptual Design Optimization and Design Fine

Tuning, Combined Optimization, Optimization of Multiple Static and Dynamic Loads, Transient Simulations, Equivalent Static Load Methods

10

UNIT-4 Manufacturability In Optimization Problems: Design For Manufacturing,

Manufacturing Methods and Rules, Applying Manufacturing Constraints to

Optimization Problems.

Design Interpretation: Unbound Problems, Over Constrained Problems,

Problems with No of Multiple Solutions, Active and Inactive Constraints,

Constraint Violations and Constraint Screening, Design Move Limits, Local and Global Optimum.

10

UNIT-5 Dynamic Programming: Introduction, Multistage decision processes,

Principle of optimality, Computational Procedure in dynamic programming,

Initial value problem, Examples.

Applications of Optimization in Engineering Design: Automotive,

Aerospace and General Industry Applications, Optimization of Metallic and

Composite Structures, Minimization and Maximization Problems, MDO and MOO.

10

NOTE: the students are advised to prepare the report in the form of assignment to understand the subject

and its relevance in the industry

TEXT BOOKS: 1. S.S.Rao, Engineering Optimization: Theory and Practice, John Wiley, 2009

2. JasbirArora, Introduction to Optimum Design, McGraw Hill, 2011.

REFERENCE BOOKS: 1. Optimisation and Probability in System Engg - Ram,Van Nostrand.

2. Optimization methods -K.V.Mital and C. Mohan,New age International Publishers, 1999.

3. Optimization methods for Engg. Design - R.L Fox, Addison – Wesley, 1971.

COURSE OUTCOME: At the completion of this course, students will be able to:

CO1 It provides the student with knowledge required to optimize an existing design with single or multiple objective functions.

CO2 Skills acquired through commercial optimization programs

CO3 Acquire the knowledge of engineering system design

CO4 Apply the concept of manufacturing constraint and design interpretation to optimization problems

CO5 Understand the concept of dynamic programming and apply the concept of optimization in engineering design



CO1 1 1 1 1

CO2 1 1 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE: PRODUCT DESIGN FOR QUALITY




COURSE OBJECTIVES:

1. Apply the principles of product design to modify existing engineering systems or to develop new

artifacts.

2. Design a system taking into consideration the concepts of ease of production, maintenance, handling, installation etc.

3. Translate the concepts of economics in design, optimization of design and human factors approach

to product design.

# CONTENTS Hrs

UNIT-1 Design for quality: Taguchi’s Approach to Quality, On-line and Off-line Quality

Control, Quality Loss Function, System Design, Parameter Design, Design for

Environment, Human factor design, Design for casting and forging , Causes of

Variation.

11

UNIT-2 Quality Function Deployment –Introduction, QFD team, benefits, voice of customer,

organisation of information, house of quality, QFD process Design of Experiments: Basic methods- Two factorial experiments-Extended method reduced tests and fractional experiments, orthogonality, base design method, higher dimensional fractional factorial design

11

UNIT-3 Failure Mode Effect Analysis: Refining geometry and layout, Failure tree analysis, Defects and failure modes Techniques of failure analysis, Filed inspection of failure, Macroscopic and Microscopic examination, Additional tests, Analysis of data and report of failure.

10

UNIT-4 Statistical Consideration in Product Design and Development Frequency distributions and Histograms- Run charts –stem and leaf plots- Pareto diagrams-Cause and Effect

diagrams-Box plots- Probability distribution- Statistical Process control–Scatter diagrams –Multivariable charts

10

UNIT-5 Six Sigma – Overview, Basics and history of the approach for six sigma, Methodology and focus, the application of Six Sigma in production and in-service industries, Relationship of Six Sigma and Lean Management, linking Six Sigma project goals with organizational strategy

10

REFERENCE BOOKS:

1. Total quality Management Kevin Otto & Kristin Wood, Product Design Techniques in

Reverse

2. Engineering and New Product Development, Pearson Education (LPE), 2001. ISBN10:

0130212717 3. Product Design and Development, Karl T. Ulrich, Steven D. Eppinger, TATA McGraw -

HILL - 3rd Edition, 2003. ISBN:13: 978-0073404776

4. The Management and control of Quality, James R. Evens, William M Lindsay,6th

edition- South-Western Publishers ISBN: 0314062157

5. Engineering Design, George E Dieter, 3rd Edition, McGraw hill International Edition,

ISBN: 0-07- 116204-6


CO1 Apply a system based approach for quality management

CO2 Identify the importance of various principles of quality in product or service

CO3 Use statistical tools in product development

CO4 Apply basic risk analysis and experiment design techniques into practical cases

CO5 Demonstrate knowledge about Six sigma, Design of Experiments

MAPPING OF COs WITH POs COs/POs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1


Q. No. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10

UNIT 1 2 3 4 5




2020-21 SEMESTER : FIRST COURSE TITLE : COMPUTER AIDED ENGINEERING DEIGN WORK TOOL -LAB

Sub Code: 20MMDL17 No of Credits : L-T-P-SS 0:0:3:0 =2


Exam Duration : 3 hours CIE Marks: 50 SEE Marks : 50

COURSE OBJECTIVES:

1. The objective of this lab is to acquaintance students with knowledge in the interface of 3-D software

and to make students efficient to produce CAED designs.

2. By the end of course one should also be able to understand what a machine drawing is and will also be

able to produce machine drawings.

3. To gain knowledge about all symbols used in production drawings and how they are inserted in

production drawings using design software’s.

PART –A

COMPUTER AIDED ENGINEERING DESIGN- CAED BASICS

Hours

1 Introduction about CAED and different workbenches in it. 4

2 Interface, Sketch Tools, View Tool bar, Profile Tool bar, Operation Tool bar, Tools , Constrain tool bar, Transformation Tool bar, User Selection Filter,.

4

3 Sketch Based Features, Dress up Features, Transformation

Features, Reference Elements, Measure, Thickness, Boolean

Operations.

4

4 Walls, Cutting and Stamping, Bending, Rolled Walls 4

5 Visualizations Surface, Operations, 4

6 Wireframe, Replication. Standards Product Structure Tools, Constrains

4

PART –B

DESIGN AND DEVELOPMENT OF A PRODUCT USING CAD

WORK TOOL

Hours

1 Introduction to Geometric Dimensioning and Tolerance, Weld

Symbols, GD&T Symbols, Types of Tolerances, Types of

views, Roughness Symbols

4

2 Views, Annotations, Sheet Background. 4

3 Design of any two types of Aircraft structures 4

4 Design of fuselage with internal components 4

5 Design of Nose cone structures 4

6 Design of Main landing gear and nose landing gear 6

TEXT BOOKS:

1. 3D Modelling and practices , Engineering , Prof P. Krishnakumar

2. Introduction to CATIA V5 Release 19, Book by Kirstie Plantenberg

3. CATIA V5 Design Fundamentals Jaecheol Koh

REFERENCE BOOKS: 1. CATIA V5 Workbook Release 19, Book by Richard Cozzens


CO1 Understand the concepts and various tools used in design module.

CO2 Understand the design of typical structural components

CO3 Understand the techniques and standards of designing a component in CAD Software

CO4 Understand the design of three view diagram of a typical aircraft.

CO5 Analyze and evaluate CAD models



CO1 1 1 1 1

CO2 1 1 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1

CONTINOUS INTERNAL EVALUATION (CIE)

Evaluation of lab manual 30 Marks

Internal evaluation 10 Marks

Viva-voce

10 Marks

Total 50 Marks

SEMESTER END EXAMINATION (SEE)

Sl.

No.

Particulars Max.

Marks

Break Up of Max. Marks

Write Up

MODELLING ANALYSIS

1 PART -A

15 05 05 05

2 PART-B

25 05 10 10

3 Viva Voce 10 -- -- --

TOTAL MARKS 50 10 25 15

Two Full Questions to be set.

Students shall be to be answered two full Questions.

Each question(Experiments contains different Marks and it is clearly mentioned in the above table)

Changing of Experiments is not allowed from any unit

Viva Voce is compulsory


2020-21 SEMESTER : FIRST COURSE TITLE: TECHANICAL SEMINAR

Sub Code: 20MMDS18 No of Credits : L-T-P-SS 0:0:2:0=02

No. of Lecture hours/week :

Exam Duration:------- CIE Marks: 50 SEE Marks :--------

COURSE OBJECTIVES:

1. Exposure of students to a variety of research projects and activities in order to enrich their academic

experience.

2. An opportunity for students to develop skills in presentation and discussion of research topics in a

public forum.

3. To identify good journals and journal papers; study the papers and understand, analyze, interpret and

explain the contents of the paper.

GUIDELINES

1. Each student, under the guidance of a Faculty, is required to

Choose, preferably through peer reviewed journals, a recent topic of his/her interest relevant to

the Course of Specialization.

Carryout literature survey, organize the Course topics in a systematic order.

Prepare the report with own sentences.

Type the matter to acquaint with the use of Micro-soft equation and drawing tools or any

such facilities.

Present the seminar topic orally and/or through power point slides.

Answer the queries and involve in debate/discussion.

Submit two copies of the typed report with a list of references.

2. All students should attend the seminars of other students of their specialization.

SCHEME FOR CONTINUOUS INTERNAL EVALUATION (CIE)

Each presentation shall be evaluated for 50 marks. Average marks obtained for three best

presentations will be the student’s CIE marks.

Marks distribution

Seminar Report: 20 marks

Presentation skill:20 marks

Question and Answer:10 marks


CO1 To identify good journals and journal papers

CO2 study the papers and understand, analyze, interpret and explain the contents of the paper

CO3 understand the shortcomings and plus points of published papers

CO4 To develop overall skills for technical communication and help technical decision making.

CO5 To understand the latest research in their field of study



CO1 1 1 1 1

CO2 1 1 1

CO3 1 1 1 1

CO4 1 1 1 1

CO5 1 1 1 1



2020-21 SEMESTER : FIRST COURSE TITLE: INDUSTRY VISIT

Sub Code: 20MMDM19 No of Credits : L-T-P-SS

0:0:0:2=02

No. of Lecture hours/week : ---

-----

Exam Duration:--------- CIE Marks: 50 SEE Marks :---------

COURSE OBJECTIVES:

1. An opportunity to get exposure to the real workstations, plants, machines and systems. 2. to understand the end-to-end process at all levels

3. to understand the company policies in terms of production, quality, and service management.

4. Expert briefing about the functioning of machines and systems.

GUIDELINES

1. Iindustrial visit shall be arranged according to the academic requirements and as per the norms of the

college.

2. HOD must certify that the tour is required for the students or is related to their curriculum. 3. The visiting companies shall be relevant and suitable ones to the specialization and academic

requirements.

4. Industrial visit shall fall within the stipulated period set by the college. 5. The stipulated period shall be informed to the Faculty in-charge and Students through HOD well in

advance to enable go through a diligent process including communicating to the potential companies

and obtaining permission to visit.

6. The entire plan including permission letter from the visiting companies, permission letter, route map,

list of students with their contact no. (Preferably mobile phone), list of faculty with their contact details,

undertaking letter from student and parent and permit shall be available in the file and be checked by

HOD.

7. The bus shall carry a banner exhibiting the college name and Industrial Visit.

8. Students must carry security ID cards with details of their parents or local guardians and their contact

numbers.

9. Participating students must be given an undertaking that they will abide by the rules and guidelines throughout the tour.

SCHEME FOR CONTINUOUS INTERNAL EVALUATION (CIE)

CIE marks for the Industrial visit report (30 marks), seminar (10 marks) and viva voce (10 marks) shall be

awarded (based on the quality of report and presentation skill, participation in the question and answer

session by the student) by the committee constituted for the purpose by the Head of the Department, The

committee shall consist of three faculty from the department.


CO1 Students’ exposure to industrial environments and experiences is undeniably one way for students to appreciate their theoretical learning to a more practical learning.

CO2 Acquaint Students with Interesting Facts and Newer Technologies.

CO3 Using the case study approach within the visit brings out critical thinking among students.

CO4 Practical application of instruments handled during course curriculum.

CO5 Students Aware with Industry Practices.



CO1 1 1 1 1 1 1

CO2 1 1 1 1

CO3 1 1 1 1 1

CO4 1 1 1 1 1

CO5 1 1 1 1


SCHEME OF TEACHING AND EXAMINATION (Autonomous) 2020-21

M.Tech. in POWER ELECTRONICS (EPE)

I semester

Sl.

No. Sub Code Subject Title

Teachi

ng

Depart

ment


allotted

Examina

tion

Credits Lectu

re

Tutorial

/

Seminar

/

Assignm

ent

Practica

l

/

Project

CIE SEE Total

1. 20EPE11 Applied Mathematics Maths

. 3 - - 50 50 100 3

2. 20EPE12 Power Semiconductor

Devices and

Components

EEE 3 - - 50 50 100 3

3. 20EPE13 Solid State Power

Converters EEE 3 - - 50 50 100 3

4. 20EPE14 Modeling and Simulation

of Power Electronics

Systems

EEE 3 - - 50 50 100 3

5. 20EPE15X Elective – I EEE 3 - - 50 50 100 3

6. 20EPE16X Elective – II EEE 3 - - 50 50 100 3

7. 20EPEL17 Power Electronics

Laboratory – I EEE - - 3 50 50 100 2

8. 20EPES18 Technical Seminar* - - - 50 - 50 2

9. 20EPEM19 Minor Project /

Industrial Visit /Field

Work

- - 6 50 - 50 2

Total 18 - 9 450 350 800 24 *Technical Seminar: Seminar on Advanced topics from refereed journals by each student.

Professional Elective I Professional Elective II

Sl .No Name of the Subject Subject Code Sl .No Name of the Subject Subject Code

1 Embedded Systems 20EPE151 1 PWM converters and applications 20EPE161

2 Advanced Control Systems 20EPE152 2 MPPT in Solar Systems 20EPE162

3 Integration of Renewable Energy 20EPE153 3 Electric Vehicle Technology 20EPE163

# Name Signature # Name Signature

1 Dr. Jayaramaiah GV 11 Mr. Dilip Yadav

2 Dr. Suryanarayana doolla 12 Dr. Jyoti P Koujalagi

3 Dr. Satish L 13 Dr. Shankarlingappa.C.B

4 Dr. Pradip Kumar Dixit 14 Dr. Eranna, Asso. Prof.

5 Dr. Puttaswamy PS 15 Mr. Dayananda T.B,

6 Dr. Sumathi, RNSIT 16 Dr. Govindaraju H.V,

7 Mr. Ramachandra, 17 Dr. Vasudevamurthy S,

8 Mr. Arun Kumar 18 Ms. Nalini S

9 Mr. Guruswamy 19 Ms. Arpitha Raju

10 Mr. Srinivas BT

Subject title : APPLIED MATHAMATICS

Subject Code: 20EPE11 No. of Credits : 3:0:0:0 No. of lecture hours/week : 3

Exam Duration : 3 hours CIE : 50 SEE : 50 Total No. of lecture hours: 39

Course objective:In this course, students learn

1. The objectives of this course is to acquaint the students with principles of advanced mathematics through

linear algebra, transform methods for differential equations, calculus of variations and linear and non-linear

programming, that serve as an essential tool for applications of electrical engineering sciences..

Unit

No. Syllabus content

No. of

hours

1

Numerical Methods: Solution of algebraic and transcendental equations- iterative methods based

on second degree equation – Muller method (no derivation), Chebyshev method. Fixed point

iteration method (first order), acceleration of convergence- 2 - Aitken’s method. System of non-

linear equations – Newton-Raphson method. Complex roots by Bairstow’s method.

08

2

Numerical Solution of Partial Differential Equations: Classification of second order equations,

parabolic equations-solution of one dimensional heat equation, explicit method, Crank-Nicolson

method. Hyperbolic equations- solution of one dimensional wave equation and two-dimensional

Laplace equation by explicit method.

08

3

Linear Algebra I: Vector spaces, linear dependent, independence, basis and dimension,

elementary properties, examples.

Linear Transformations: Definition, properties, range and null space, rank and nullity.

08

4

Linear Algebra-II Computation of Eigen values and Eigen vectors of real symmetric matrices-

Jacobian and Given’s method. Orthogonal vectors.

Interpolation: Hermite interpolation, spline interpolation.

07

5

Basic Graph Theory: Finite and infinite graphs, degree of vertex, walk, trial, circuits and cycles

in a graph. Sub graphs, connected and disconnected graphs, components, Euler and Hamiltonian

graphs, characterization of Eulerian graphs, Application to RLC circuit for node analysis and loop

analysis with independent sources.

08

Course outcome: At the end of the course, students will be able to

CO 1: Employ numerical techniques in order to achieve more accurate values in the computation

of roots of algebraic and non-linear equations.

CO2: Utilize analytical and numerical schemes to solve partial differential equations applicable to

engineering problems.

CO3: Understand vector spaces, basis, linear transformations and the process of obtaining matrix

of linear transformations arising in magnification and rotation of images

CO4: Apply standard iterative methods to compute eigen values and solve ordinary differential

equations.

CO5: Employ linear and non-linear programming techniques in simulation of network systems and

optimization of electrical circuits.

TEXT BOOKS:

1. Linear Algebra and its Applications - David C.Lay et al, Pearson, 5th Edition,2015

2. Numerical methods in Engineering and Science (with C, C++ & MATLAB)- B.S.Grewal, Khanna

Publishers, 2014

3. Graph Theory with Applications to Engineering and Computer Science- NarsinghDeo, PHI, 2012

REFERENCE BOOKS: 1. Numerical Methods for Scientific and Engineering Computation - M. K. Jain et al , New Age International

, 9th Edition, 2014

2. Higher Engineering Mathematics - B.S. Grewal, Khanna Publishers, 43rdEdition,2015

3. Linear Algebra- K.Hoffmanet al, PHI, 2011

Subject Title : POWER SEMICONDUCTOR DEVICES AND COMPONENTS

Sub.Code:20EPE12 No. of Credits:03=03:0:0 ( L - T – P) No. of Lecture Hours/Week : 03

Exam Duration:03 Hrs CIE+Asmt+SS+GA+SEE=30+10+5+5+50=100 Total No.of Contact Hours:39


1 To analyse the working of basics power semiconductor devices

2 To analyse the working of power BJT and power MOSFET

3 To analyse the working of Thyristors, GTO and IGBT

4 To identify the types of protection circuits and their applications

5 To design the magnetic components based on the applications

Unit

No Syllabus Contents

No.of

Hours

Blooms

Taxnomy

level.

1

Basic Semiconductor Physics: Introduction, conduction processes in

semiconductors pn junctions, charge control description of pn-junction

operation, avalanche breakdown.

Power Diodes: Introduction, Basic structure and I-V characteristics,

breakdown voltage considerations, on – state losses, switching characteristics,

schottky diodes.

TEXT 1 and TEXT 2. Reference Book 1

08 L1,L2,L3.

2

Bipolar Junction Transistors: Introduction, vertical power transistor structures,

I-V characteristics, physics of BJT operation, switching characteristics,

breakdown voltages, second breakdown, on-state losses and safe operating

areas.

Power MOSFETs: Introduction, Basic structure, I-V characteristics, physics

of device operation, switching characteristics, operating limitations and safe

operating areas.


09 L1,L2,L3.

3

Thyristors: Introduction, basic structure, I-V characteristics, physics of device

operation, switching characteristics, methods of improving di/dt and dv/dt

ratings.

Gate Turn-Off Thyristors: Introduction, basic structure and I-V characteristics,

physics of turn-off operation, GTO switching characteristics, over current

protection of GTOs.

Insulated Gate Bipolar Transistors: Introduction, basic structure, I-V

characteristics, physics of device operation, latch up in IGBTs, switching

characteristics, device limits and SOAs.


08 L1,L2,L3.

4

Emerging Devices and Circuits: Introduction, power junction field effect

transistors, field-controlled thyristor, JFET-based devices versus other power

devices, MOS-controlled thyristors, power integrated circuits, new

semiconductor materials for power devices.

Snubber Circuits: Function and types of snubber circuits, diode snubbers,

snubber circuits for thyristors, need for snubbers with transistors, turn-off

snubber, overvoltage snubber, turn-on snubber, snubbers for bridge circuit

configurations, GTO snubber considerations.

07 L1,L2,L3,L4

Unit


No.of

Hours

Blooms

Taxnomy

level.


5

Component Temperature Control and Heat Sinks: Control of semiconductor

device temperatures, heat transfer by conduction, heat sinks, heat transfer by

radiation and convection.

Design of Magnetic Components: magnetic materials and cores, copper

windings, thermal considerations, analysis of a specific inductor design,

inductor design procedures, analysis of a specific transformer design, eddy

currents, transformer leakage inductance, transformer design procedure,

comparison of transformer and inductor sizes.


07 L1,L2,L3,L4

Note 1: Unit 1 to 5 will have internal choice

Note2: a) Two assignments are evaluated for 10 marks: Assignment -1 Two assignments are

evaluated for 5 marks: Assignment -1 from Units 1 and 2. Assignment -2 from Units

3, 4 and 5

b) Group Activity for 5 Marks has to be evaluated through PPT Presentation/ Subject

Quiz/Project and 5 marks for subject seminar

Note:3 Out of 5 Units, Unit 5 is a Webinar unit conducted through Google Classroom/Zoom/Cisco

Webex etc and will be delivered by subject faculty

Course Outcomes:

CO1 Understand the working of various power semiconductor devices

CO2 Understand the working and applications of BJT and Power MOSFET

CO3 Understand the working and applications of Thyristors, GTO and IGBT

CO4 Modeling and simulation of devices along with protection system

CO5 Design the magnetic components based on the applications

Course Outcomes Mapping with Programme Outcomes.

Sl.No Course Outcome Level of Blooms Taxonomy No. of hours of teaching

Programme Outcome

1 2 3 4 5 6 7 8 9 10 11

1. CO1: 2 08 3 1 2 2 2 2

2. CO2. 2 09 3 3 1 2 2 2 2

3. CO3: 2 08 3 3 1 2 2 2 2

4. CO4: 4 07 3 3 1 2 2 2 2

5. CO5: 5 07 3 3 1 2 2 2 2

Average CO 3 3 1 2 2 2 2

Course Outcome PSO1 PSO2

PSO3

CO1 2 2

CO2 1 2 2

CO3 2 2

CO4 2 2

CO5 2 2

Average CO 1 2 2

Text Books.

1 Ned Mohan, “Power Electronics Converters, Applications, and Design”, Third Edition, Wiley

Publisher, 2014

2 Muhammad H. Rashid , “Power Electronics: Circuits, Devices & Applications”, 4th edition, Pearson

publisher, 2014

Reference Text Books.

1 Daniel W Hart, “Power Electronics”, 2nd edition, McGraw Hill publisher, 2013

Web Links.

1 https://books.google.co.in/books/about/Fundamentals_of_Power_Semiconductor_Devi.html?id=UiqrU

WrYZXkC&redir_esc=y

2 https://www.freebookcentre.net/Electronics/Power-Semiconductors-Books.html

https://books.google.co.in/books/about/Fundamentals_of_Power_Semiconductor_Devi.html?id=UiqrUWrYZXkC&redir_esc=y

https://books.google.co.in/books/about/Fundamentals_of_Power_Semiconductor_Devi.html?id=UiqrUWrYZXkC&redir_esc=y

https://www.freebookcentre.net/Electronics/Power-Semiconductors-Books.html

Subject Title : Solid State Power Converters


Exam Duration:03 Hrs CIE+Asmt+SS+SEE=30+10+05+05+50=100 Total No.of Contact Hours:39


1 To explain operating principle of various converters.

2 To control various inverters

3 To analyze and distinguish different types of inverters

4 To design different inverters and converters

5 To solve problems on different inverters

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

Line Commutated Converters:Phase control, single phase semi-

converter & fully controlled converter, three phasesemi controlled &

fully controlled converter, dual converters, effect of source

inductance, single phase series converters, design of converter

circuits.

TEXT 1 and TEXT 2.

8 L1,L2,

L3,L4

2

Inverters: Principle of operation, performance parameters, single

phase bridge inverters and three phase inverters. Current source

inverter, comparison between VSI & CSI, series resonant

inverters.TEXT 1 and TEXT3

7 L1,L2,L3,L4

3

Voltage Control of Inverters: Single/multiple, pulse/SPWM/

modified SPWM methods, voltagecontrol of three phase inverter,

SPWM/third harmonic PWM, harmonic reduction.

TEXT 1 and TEXT 2.

8 L1,L2,L3

4

Multilevel Inverters: Introduction, types, diode clamped multi-level

inverters, features & applications. Capacitor clamped multilevel

inverter, cascaded H-bridge multilevel inverter.

TEXT 1 and TEXT 2

8 L1,L2,L3

5

DC-DC Converters: Principle of operation, analysis of step-down

and step-up converters, Introduction to derived converters;

transformer models, design of DC-DC Converters.

TEXT 1 and Reference 1

8 L1,L2,L3,L4


Note 2: Two assignments are evaluated for 5 marks: Assignment -1 from Units 1 and 2.

Assignment -2 from Units 3, 4 and 5 and group activity for 5 marks and Seminar

for 10 Marks

Note:3 Out of 5 Units, Unit 1 is a Webinar unit conducted through Google

Classroom/Zoom/Cisco Webex etc and will be delivered by subject faculty.

Course Outcomes:

CO1 To explain operating principle of various converters.

CO2 To perform controlling of various inverters

CO3 To Analyze and distinguish different types of converters.

CO4 To design different inverters and converters.

CO5 To Solve problems on different converters.


Sl.No Course Outcome Level of Blooms Taxonomy No. of hours of teaching Programme Outcome

1 2 3 4 5 6 7 8 9 10 11

1. CO1: L1,L2 8 3 1

1

2. CO2. L1,L2,L4 7 1 3 1

3. CO3: L2,L4 8 1 3 1

4. CO4: L2,L4 8 1 1 3 1

5. CO5: L2,L4 8 1 3

Average CO 2 2 2 1

Course

Outcome

PSO1 PSO2

PSO3

CO1 3

CO2 2 2

CO3 2 2

CO4 2 2

CO5 2 2

Average CO 2 2

Text Books.

1 Ned Mohan, Tore M. Undeland, William P. Robbins“Power Electronics Converters, Applications, and Design”, Third

Edition, Wiley India Pvt. Ltd, 2011

2 Rashid M.H, “Power Electronics – Circuits Devices and Applications”, 3rd Edition, Pearson, 2011.

Fang Lin Luo, Hong Ye, “Advanced DC/AC converters- Applications to Renewable Energy”, 1st Edition, CRC2013.


1 D K Bose“Modern Power Electronics & AC Drives”, 1st edition, 2012

Web Links.

1 B. G. Fernandes” A course on Power Electronics” http://nptel.ac.in/courses/108101038/

2

Ramnarayan/Prof. L. Umanand “A course on Switched Mode Power Conversion”) http://nptel.ac.in/courses/108108036

3

K. Gopakumar “A course on Industrial Drives – Power Electronics” http://nptel.ac.in/courses/108108077

http://nptel.ac.in/courses/108101038/

http://nptel.ac.in/courses/108108036


Subject Title : MODELING AND SIMULATIONOF POWER ELECTRONICSSYSTEMS




1 Types of modeling applicable of power electronics

2 Types and need for control system

3 Control system design for converters

4 To analyze a system and to make use of the information to improve the performance

5 To analyse a system numerically

Unit


No.of

Hours

Blooms

Taxnomy level.

1

Computer Simulation of Power Electronic Converters and Systems:

introduction, challenges in computer simulation, simulation process,

mechanics of simulation, solution techniques for time-domain analysis,

widely used, circuit-oriented simulators, equation solvers.

Modeling of Systems: input-output relations, differential equations and

linearization, state space representation, transfer function representation,

block diagrams, circuit averaging, bond graphs, space vector modelling


10 L1,L2,L3.

2

Control System Essentials: control system basics, control principles, state -

space method, bode diagram method, root locus method, state space method.


07 L1,L2,L3.

3

Digital Controller Design: controller design techniques, PID controller, full

state feedback, regulator design by pole placement, estimation design,

tracker: controller design, controlling voltage, controlling current, control of

induction motor.


07 L1,L2,L3.

4

Optimal and Robust Controller Design: least squares principle, quadratic

forms, minimum energy principle, least square solution, weighted least

squares, recursive least squares, optimal control: linear quadratic, induction

motor example, robust controller design.


07 L1,L2,L3,L4

5

Discrete Computation Essentials: numeric formats, tracking the base point

in the fixed point system, normalization and scaling, arithmetic algorithms.


08 L1,L2,L3,L4


Note2: a) Two assignments are evaluated for 10 marks: Assignment -1 Two assignments are

evaluated for 5 marks: Assignment -1 from Units 1 and 2. Assignment -2 from Units

3, 4 and 5

b) Group Activity for 5 Marks has to be evaluated through PPT Presentation/ Subject


Note:3 Out of 5 Units, Unit3is a Webinar unit conducted through Google Classroom/Zoom/Cisco

Webex etc and will be delivered by subject faculty

Course Outcomes:

CO1 Understand the types of modeling applicable of power electronics

CO2 Understand the types and need for control systems

CO3 Design the control system for converters

CO4 Modeling and simulation of devices along with protection system

CO5 Verify a system analytically



1 2 3 4 5 6 7 8 9 10 11

1. CO1: 2 10 3

1 2 2 2

2. CO2. 2 07 1 3 1 2 2 2 3

3. CO3: 4 07 1 3 1 2 2 2 3

4. CO4: 4 07 1 3 1 2

2 2 3

5. CO5: 4 08 1 3 1 2 2 2 3

Average CO 1 3 1 2 2 2 3

Course

Outcome

PSO1 PSO2

PSO3

CO1 1 2

CO2 2 2

CO3 1 2 2

CO4 2 2 2

CO5 2 2 2

Average CO 2 2 2

Text Books.

1 Ned Mohan, “Power Electronics Converters, Applications, and Design”, Third Edition, Wiley

Publisher, 2014

2 L. Umanand, “Power Electronics Essentials and Applications”, 1stedition, Pearson publisher, 2014


1 M. Godoy Simoes, Felix A. Farret, “Modeling Power Electronics and Interfacing Energy Conversion

Systems”, 1stedition, Wiley publisher, 2016

Web Links.

1 https://vtechworks.lib.vt.edu/handle/10919/31026

2 https://ieeexplore.ieee.org/document/931486

https://vtechworks.lib.vt.edu/handle/10919/31026

https://ieeexplore.ieee.org/document/931486

Subject Title : Embedded Systems Sub.Code:20EPE151 No. of Credits:03=0:0:0 ( L - T – P) No. of Lecture Hours/Week : 03



1 Describe the functional blocks of a typical embedded system.

2 Describe the fundamental issues involved in hardware, software co-designs, embedded hardware and

firmware, design and development approaches.

3 Embedded system architecture and memory organization.

4 The interprocess communication, modeling, devices and communication buses.

5 Explain the fundamentals of real time operating systems and latest trends in ES domain and use it to

the present need.

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

Introduction to Embedded Systems: embedded systems, processor

embedded into a system, embedded hardware units and devices in a system,

embedded software in a system, examples of embedded systems, embedded

systems – on –chip (soc) and use of VLSI circuit design technology, design

process and design examples, Communication Interfaces, classification of

embedded systems, skill required for an embedded system designer.

-Write a program to toggle all the led to port and with some time delay using

ARM7.


07 L1,L2

2

Processor Architecture and Memory Organisation: introduction to

advanced architecture, processor and memory organization, performance

metrics, memory – types, memory – maps and addresses, processor selection,

memory selection, Memory Management of External Memory, Board

Memory and performance Basic Steps involved in PCB design.

-Write a program to interface 4*4 matrix keypad with ARM7.


08 L1,L2,L3.

3

Devices and Communication Buses, Interrupt Services: IO types and

examples, serial communication devices, parallel device ports, sophisticated

interfacing features in device ports, wireless devices, timer and counting

devices, watchdog timer, real time clock

Device Drivers and Interrupts Service Mechanisms: Programmed – I/O

busy – wait approach without interrupt service mechanism, ISR concept,

interrupt sources, interrupt servicing mechanism, direct memory access.

-Write a program to verify Timer operation in different modes


08 L1,L2,L3.

4

Program Modeling Concepts: Program models, DFG models, state machine

programming models for event – controlled program flow.

Interprocess Communication and Synchronization of Processes, Threads

and Tasks: multiple processes in an application, multiple threads in an

application, tasks, task status, task and data, clear – cut dissention between

functions, ISRS and tasks by their characteristics, concept of semaphores.

-Write a program to interface Stepper motor with ARM7


08 L1,L2,L3,L4

Unit


No.of

Hours

Blooms

Taxnomy

level.

5

Real-Time Operating Systems: OS services, process management, timer

functions, event functions, memory management, device, file and, real – time

operating systems, basic design using an RTOS, RTOS task scheduling

models, interrupt latency and response of the task as performance metrics,

Task Synchronization, Multiprocessing and Multitasking. OS security issues.

- Write a program for interfacing of DC motor with ARM7


08 L1,L2,L3,L4


Note2: Two assignments are evaluated for 10 marks: Assignment -1 Two assignments are evaluated

for 5 marks: Assignment -1 from Units 1 and 2. Assignment -2 from Units 3, 4 and 5

Group Activity for 5 Marks has to be evaluated through PPT Presentation/ Subject


Note:3 Out of 5 Units, Unit 2 is a Webinar unit and will be delivered by subject faculty.

Course Outcomes:

CO1 Understand the concept of embedded system.

CO2 Analyse the embedded system architecture and memory organization.

CO3 Describe the differences between the general computing system and the embedded system, also

recognize the classification of embedded systems.

CO4 Analyse Device Drivers and Interrupts Service Mechanisms

CO5 Design real time embedded systems using the concepts of RTOS and Analyse various real time

applications of embedded system design.



1 2 3 4 5 6 7 8 9 10 11

1. CO1 1 07 2 3 2 3 2

2. CO2 4 08 3 3 3 3 3 2 1 2 2

3. CO3 2 08 3 3 2 3 2 1 3 1

4. CO4 4 08 3 3 2 3 2 2 2 1 2 3

5. CO5 5 08 3 3 2 3 3 3 2 2 2

Average CO 3 3 2 3 3 3 2 1 2 2


PSO3

CO1 2 2 1

CO2 1 2 CO3 3 1 1 CO4 3 1 1 CO5 3 2 Average CO 2 2 1

Text Books.

1 Raj Kamal, “Embedded Systems: Architecture, Programming and Design”, Second Edition, McGraw

Hill, 2014

2 Frank Vahid/Tony Givargis, “A Unified Hardware/Software Introduction, Wiley student edition

2002.


1 Michael J. Pont, “Embedded C”, 2nd Edition, Pearson Education, 2008

2 Nigel Gardner, “The Microchip PIC in CCS C”, 2nd Revision Edition, Ccs Inc, 2002

3 Embedded Software Premier. Simon David, Addison Wessly 2000

Web Links.

1 Motorola and Intel Manuals

2 www.nptel.com

Subject Title : ADVANCED CONTROL SYSTEMS Sub.Code:20EPE152 No. of Credits:03=03:0:0 ( L - T – P) No. of Lecture Hours/Week : 03

Exam Duration:03 Hrs CIE+Asmt+GA+SEE=40+5+5+50=100

Total No.of Contact Hours:39


1 To explain the concepts of basic and digital control system for the real time analysis and design of

control systems

2 The Modeling of Digital Control Systems.

3 To explain and apply concepts of state variables analysis..

4 The Optimization of the control parameters using different optimization techniques.

5 To study and analyze nonlinear systems.

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

Digital Control: Control System Terminology, Need of Digital control,

Configurations of the Basic Digital Control Scheme, Principle of Signal

Conversion, Basic Discrete – Time Signals, Time Domain Models for

Discrete – Time Systems, The z – Transform, Transfer Function Models,

Frequency Response, Stability on the z – Plane and Jury Stability Criterion,

Sample and Hold Systems, Sampled Spectra and Aliasing, Reconstruction

of Analog Signals, Practical Aspects of the choice of Sampling Rate,

Principle of Discretization.

TEXT 1 and TEXT 2. Reference Book

08 L1,L2,L3,L4

2

Models of Digital Control Devices and Systems: Introduction, z–Domain

Description of Sampled Continuous – time Plants, z – Domain Description

of Samples with Dead – Time, Implementation of Digital Controllers,

Tunable PID Controllers, Digital Temperature and Position Control

Systems, Stepping Motors and their Control.


08 L1,L2,L3,L4

3

State Variable Analysis of Digital Control Systems: Introduction, State

Description of Digital Processors, State Description of Sampled continuous

– Time Plants, State Description of Systems with Dead Time, Solution of

State Difference Equations, Controllability and Observability,

Multivariable Systems.


06 L1,L2,L3,L4

4

Quadratic Optimal Control: Introduction, The Concept of Lyapunov

Stability, Lyapunov Functions for Linear Systems, Parameter Optimization

and Optimal Control Problems, Quadratic Performance Index, Control

Configurations, Optimal State Regulator, Optimal Digital Control Systems,

Constrained State Feedback Control.


08 L1,L2,L3,L4

5

Nonlinear System Analysis: Introduction, Common nonlinear System

Behaviours, Common nonlinearities in Control Systems, Describing

Function Fundamentals, Describing Function of Common nonlinearities,

09 L1,L2,L3,L4

Unit


No.of

Hours

Blooms

Taxnomy

level.

Stability Analysis by the Describing Function Method, Concept of Phase

Plane Analysis, Construction of Phase Portraits, System Analysis on the

Phase Plane, Simple Variable Structure Systems, Lyapunov Stability

Definitions, Lyapunov Stability Theorems, Lyapunov Functions for

Nonlinear Systems



Note2: Two assignments are evaluated for 5 marks: Assignment -1 from Units 1 and 2. Assignment -

2 from Units 3, 4 and 5

Group Activity for 5 Marks has to be evaluated through PPT Presentation/ Subject Quiz/

Project/Seminar.

Note:3 Out of 5 Units, Unit 5 is a Webinar unit conducted through Google Classroom/Zoom/Cisco

WebEx etc. and will be delivered by subject faculty.

Course Outcomes:

CO1 Analyze the Digital Control Systems.

CO2 Understand the modelling of Digital Control devices and systems.

CO3 Understand the fundamentals of state variables, linear and nonlinear systems.

CO4 Optimize the control parameters using different optimization techniques.

CO5 Understand and analyse the nonlinear systems


Sl.No Course

Outcome Level of Blooms

Taxonomy

No. of hours of

teaching

Programme Outcome

1 2 3 4 5 6 7 8 9 10 11

1. CO1:. 4 10 3 3 3

2 2 2 2

2. CO2. 2 10 3 3 3

2

2 2 2

3. CO3: 2 12 3 3 3

2

2 2 2

4. CO4: 4 12 3 3 3

2

2 2 2

5. CO5: 4 8 3 3 3

2

2 2 2

Average CO 3 3 3

2

2 2 2

Course Outcomes Mapping with Programme System Outcomes.

Course

Outcome

PSO1 PSO2

PSO3

CO1 3 3 1

CO2 3 3 1

CO3 3 3 1

CO4 3 3 1

CO5 3 3 1

Average CO 3 3 1

Text Books.

1 M Gopal, “Digital Control and State Variable Methods (Conventional and Intelligent Control

Systems)”, 3rd Edition, McGraw Hill, 2008

2 Katsuhiko Ogata, “Modern Control Engineering”, 5th Edition, Prentice Hall India, 1997


1 Benjamin C Kuo, “Digital Control Systems”, 2ndedition, Oxford University Press, 2007

2 Katsuhiko Ogata, “State Space Analysis of Control Systems”, 5th edition PHI, 1997

Web Links.

1 https://www.researchgate.net/publication/331258428_Advanced_Control_Systems_Engineering_Tutoria

l_One

2 https://nptel.ac.in/courses/108/103/108103007/

3 https://www.electronics-tutorial.net/control-systems/

4 http://www.ent.mrt.ac.lk/~rohan/teaching/EN5001/Reading/DORFCH1.pdf

5 https://ecetutorials.com/control-systems/

Subject Title : INTEGRATION OF RENEWABLE ENERGY Sub.Code:20EPE153

No. of Credits:03=03:0:0 ( L - T – P) No. of Lecture Hours/Week : 03


Course Learning Objectives: 1 Understand the stand alone and grid connected renewable energy systems.

2 Analyze to design power converters for renewable energy applications.

3 Study and comprehend the various operating modes of wind generators and solar energy systems.

4 Learn to integrategrid with renewable energy systems

5 Understand the principle of tracking maximum power in renewable energy systems.

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

Introduction: Environmental aspects of electric energy

conversion: impacts of renewable energy generation on

environment (Cost-GHG Emission) - qualitative study of

different renewable energy resources ocean, biomass, hydrogen

energy systems: operating principles and characteristics of:

solar PV fuel cells.

TEXT 1 and TEXT 2

8 L1,L2

2

Electrical Machines for Renewable Energy Conversion: Review

of reference theory fundamentals-principle of operation and

analysis: IG, PMSG, SCIG and DFIG.

TEXT 1 and TEXT 2

7 L3,L4

3

Power Converters: Solar: Block diagram of solar photo voltaic

system: line commutated converters (inversion mode) - Boost

and buck-boost converters- selection of inverter.

Wind: Three phase AC voltage controllers- AC-DC-AC

converters: uncontrolled rectifiers, PWM Inverter.

TEXT 1 and TEXT2

9 L2, L3

4

Analysis of Wind and PV Systems: Stand alone operation of

fixed and variable speed wind energy conversion systems and

solar system-Grid connection Issues -Grid integrated PMSG

and SCIG Based WECS-Grid Integrated solar system.


8 L2,L3,L4

5

Hybrid Renewable Energy Systems: Need for hybrid systems-

range and type of hybrid systems- case studies of wind-PV

maximum power point tracking (MPPT).


8 L2,L3,L4


Note2: Two assignments are evaluated for10marks: Assignment -1 from Units 1 and

2. Assignment -2 from Units 3, 4 and 5.

b) Group Activity for 5 Marks has to be evaluated through PPT

Presentation/ Subject Quiz/Project/Seminar.

c) Subject Seminar for 5 Marks

Note:3 Out of 5 Units, Unit4 is a Webinar unit conducted through Google

Classroom/ Zoom/Cisco-Web ex.., and will be delivered by subject faculty.

Course Outcomes:

CO1 Understand the environmental impacts of conventional electric energy conversion systems and

Identify different renewable energy systems.

CO2 Analyze different electrical machines for renewable energy operation.

CO3 Justify different Power converters for renewable energy applications.

CO4 Discuss grid integration of renewable systems.

CO5 Describe the hybrid systems to track maximum power.


Sl.No Course

Outcome Level of Blooms

Taxonomy No. of hours

of teaching

Programme Outcome

1 2 3 4 5 6 7 8 9 10 11 12

1. CO1 2 10 3 1 2 2 2 2

2. CO2 2 10 3 3 1 2 2 2 2 3. CO3 2 12 3 3 1 2 2 2 2

4. CO4 4 12 3 3 1 2 2 2 2

5. CO5 5 8 3 3 1 2 2 2 2

Average COs 3 3 1 2 2 2 2

Course Outcomes Mapping with Programme Outcomes. Course

Outcome

PSO1 PSO2 PSO3

CO1 2 2 3

CO2 2 2 2

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3

Average

COs 3 3 3

Text Books.

1 B.H.Khan,Non-conventional Energy sources, Tata McGraw-hill Publishing Company,2nd Edition,

2009, New Delhi.

2 Rai. G.D., Khanna ,Solar energy utilization, publisher, 1993

3 S.N. Bhadra, D. Kastha, & S. Banerjee, Wind Electrical Systems, Oxford University Press, 2009


1 Gray, L. Johnson, Wind energy system, , Prentice hall inc., 1995. .

2 Rai. G.D, Non conventional energy sources, Khanna publishers, 1993.

3 Rashid .M. H, Power electronics Hand book, . Academic press, 2001.

Web Links.

1 Prof. L Umanand , IISc Bangalore , “Design and Simulation of Power conversion using open source

tools”| http://nptel.ac.in / noc / courses/108

2 Prof. L Umanand, IISc Bangalore , “PV module in SPICE” - Videos | View - ENGGtalks,

https://www.youtube.com/watch?v=Z2C28OXu4xA

3 Abhijt Kshirsagar, IIT, Dharwad , “Simulation toolkit using gEDA and ngSPICE for Digital Controller

Design Course.” https://sites.google.com / umn.edu/ akshirsa

4. M B Patil, IIT, Bombay, “Sequal App for classroom Teaching.”

https;//www.ee.iitb.ac.in / ~sequel / sequel_app.html

Subject Title : PWM CONVERTERS AND APPLICATIONS




1 AC/DC and DC/AC Power Conversion

2 Different PWM Techniques

3 Computation of switching Losses

4 Dynamic Modeling of PWM converters

5 Different compensation techniques

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

AC/DC and DC/AC Power Conversion: Overview of applications

of voltage source converters.


08 L1,L2,L3.

2

PWM Techniques: Pulse modulation techniques for I – phase

bridges, bus clamping PWM, space vector based PWM, advanced

PWM techniques.


08 L1,L2,L3.

3

Loss Calculations: Practical devices in converters, calculation of

switching and conduction losses, compensation for dead time and

DC voltage regulation.


08 L1,L2,L3.

4

Modelling: Dynamic model of PWM converters; constant V/F

induction motor drives; estimation of current ripple and torque

ripple in inverter fed drives.


08 L1,L2,L3,L4

5

Converters with Compensation: Line-side converters with power

factor compensation, reactive power compensation, harmonic

current compensation


07 L1,L2,L3


Note2: a) Two assignments are evaluated for 10 marks: Assignment -1 Two

assignments are evaluated for 5 marks: Assignment -1 from Units 1 and 2.

Assignment -2 from Units 3, 4 and 5

b) Group Activity for 5 Marks has to be evaluated through PPT Presentation/

Subject Quiz/Project and 5 marks for subject seminar


Classroom/Zoom/Cisco Webex etc and will be delivered by subject faculty

Course Outcomes:

CO1 Explain the applications of AC/DC and DC/AC Power Conversion

CO2 Analyse different PWM Techniques

CO3 Compute switching and conduction losses

CO4 Implement dynamic modeling of PWM converters

CO5 Discuss different compensation techniques



1 2 3 4 5 6 7 8 9 10 11

1. CO1: 2 08 2 1 2 2 2

2. CO2. 2 08 3 3 1 2 2 2 2

3. CO3: 2 08 3 2 1 2 2 2

4. CO4: 3 08 3 3 1 2 2 2 2

5. CO5: 2 07 3 3 1 2 2 2 2

Average CO 3 3 1 2 2 1 2 2

Course

Outcome

PSO1 PSO2

PSO3

CO1 2 2

CO2 2 2

CO3 2 2 2

CO4 3 2 2

CO5 2 2

Average CO 1 2 2

Text Books.

1 Mohan, Undeland and Robbins, “Power Electronics: Converter, Applications and Design”, Third

Edition, Wiley Publisher, 2011

2 Erickson RW, “Fundamentals of Power Electronics”, 1st edition, Chapman Hall, 1997


1 Joseph Vithyathil, “Power Electronics- Principles and Applications”, 1st edition, TMH, 2011

Web Links.

1 https://onlinelibrary.wiley.com/doi/book/10.1002/9781118886953

2 https://books.google.co.in/books/about/Power_Electronic_Converters.html?id=5vTtWUOn60AC&redir_

esc=y

https://books.google.co.in/books/about/Power_Electronic_Converters.html?id=5vTtWUOn60AC&redir_esc=y

https://books.google.co.in/books/about/Power_Electronic_Converters.html?id=5vTtWUOn60AC&redir_esc=y

Subject Title : MPPT IN SOLAR SYSTEMS




1 To explain the PV cell, its characteristics and its models, equivalent circuits and circuit parameter

calculations. 2 To explain different methods of tracking maximum power point and effect of noise on MPPT and

reduction of noise 3 To explain distributed Maximum Power Point Tracking of PV arrays and its DC analysis

4 To explain distributed Maximum Power Point Tracking of PV arrays and its AC analysis

5 To explain the design of high energy efficiency power converters for PV MPPT.

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

PV Modelling: From the Photovoltaic Cell to the Field, The

Electrical Characteristic of a PV Module, The Double-Diode and

Single-Diode Models, From Data Sheet Values to Model Parameters,

Example: PV Module Equivalent Circuit Parameters Calculation,

The Lambert W Function for Modelling a PV Field, Example.

Maximum Power Point Tracking: The Dynamic Optimization

Problem, Fractional Open-Circuit Voltage and Short-Circuit Current,

Soft Computing Methods, The Perturb and Observe Approach

TEXT 1 and TEXT 2. Reference Book1

08 L1,L2,L3.

2

Maximum Power Point Tracking (continued): Improvements of the

P&O Algorithm, Evolution of the Perturbative Method, PV MPPT

via Output Parameters, MPPT Efficiency.

MPPT Efficiency: Noise Sources and Methods for Reducing their

Effects: Low-Frequency Disturbances in Single-Phase Applications,

Instability of the Current-Based MPPT Algorithms, Sliding Mode in

PV System, Analysis of the MPPT Performances in a Noisy

Environment, Numerical Example.


08 L1,L2,L3.

3

Distributed Maximum Power Point Tracking of Photovoltaic Arrays:

Limitations of Standard MPPT, A New Approach: Distributed

MPPT, DC Analysis of a PV Array with DMPPT, Optimal Operating

Range of the DC Inverter Input Voltage.


08 L1,L2,L3.

4

Distributed Maximum Power Point Tracking of Photovoltaic Arrays

(continued): AC Analysis of a PV Array with DMPPT TEXT 1 and

TEXT 2. Reference Book1

07 L1,L2,L3.

5

Design of High-Energy-Efficiency Power Converters for PV MPPT

Applications: Introduction, Power, Energy, Efficiency,

EnergyHarvesting in PV Plant Using DMPPT Power Converters,

Losses in Power Converters, Losses in the Synchronous FET

Switching Cells, Conduction Losses, Switching Losses


08 L1,L2,L3.


Unit


No.of

Hours

Blooms

Taxnomy

level.

Note2: a) Two assignments are evaluated for 10 marks: Assignment -1 Two

assignments are evaluated for 5 marks: Assignment -1 from Units 1 and

2. Assignment -2 from Units 3, 4 and 5

b) Group Activity for 5 Marks has to be evaluated through PPT Presentation/

Subject Quiz/Project and 5 marks for subject seminar


Classroom/Zoom/Cisco Webex etc and will be delivered by subject faculty

Course Outcomes:

CO1 Understand the characteristics of a PV cell and its models, equivalent circuits and circuit parameter

calculations. CO2 Understand the different methods of tracking maximum power point and distributed MPPT.

CO3 Identify the sources of noise, effect of noise on MPPT and reduction of noise

CO4 Analyse the differences between AC and DC analysis of PV array with DMPPT

CO5 Understand the use of high energy efficiency power converters for PV MPPT application.



1 2 3 4 5 6 7 8 9 10 11

1. CO1: 2 08 1 1 2 1 1

2. CO2. 2 08 2 2 1 3 2 2 2

3. CO3: 3 08 3 3 1 2 2 2

4. CO4: 4 07 1 2 1 2 2 2 2

5. CO5: 3 08 3 3 1 2 2 2

Average CO 2 2 1 2 2 2 1

Course

Outcome

PSO1 PSO2

PSO3

CO1 1 3 3

CO2 1 3 3

CO3 1 3 2

CO4 1 3 2

CO5 1 3 2

Average CO 1 3 2

Text Books.

1 Nicola Femia et al, “Power electronics and Control Techniques for Maximum energy harvesting in

Photovoltaic systems”, first Edition, IEEE press and John Wiley & Sons CRC Press, 2013

2 Kamal Kant Sharma, Satya Nand Vishwakarma, Gaziz Manzoor, “Hybrid PSD-GSA Based MPPT

Algorithm for Photovoltaic System Understanding FACTS: Concepts and Technology of Flexible AC

Transmission Systems”, 1st edition, Published by Independently , 2019


1 Kamal Kant Sharma, “Hyrid PSD-GSA Based MPPT Algorithm for Photovoltaic Systems”, 1st

edition, Published by Independently, 2015

Web Links.

1 https://www.intechopen.com/books/recent-developments-in-photovoltaic-materials-and-

devices/improved-performance-of-a-photovoltaic-panel-by-mppt-algorithms

2 https://www.researchgate.net/publication/317723124_Designing_and_implementation_of_maximum_po

wer_point_trackingMPPT_solar_charge_controller

Subject Title : ELECTRIC VEHICLE TECHNOLOGY




1 Advantages of EVs.

2 Various drive trains

3 Characteristics of various types of batteries.

4 Concept of hybrid electric vehicles

5 Emerging technology of EV’s

Unit


No.of

Hours

Blooms

Taxnomy

level.

1

Introduction to electric vehicles (EVs): EV advantages and impacts.

EV regulations and standardization.

Electric vehicle (EV) design options: EV con figurations: fixed vs.

variable gearing, single- vs. multiple-motor drive, in-wheel drives.

EV parameters, driving cycles and performance specifications.

Choice of system voltage levels: electrical safety and protection.

TEXT 1 and TEXT 2. Reference 1

8 L1,L2,

L3,L4

2

Vehicle dynamics and motor drives: Road load: vehicle kinetics;

effect of velocity, acceleration and grade. EV drive train and

components. EV motor drive systems: DC drives, induction motor

drives, switched reluctance motor drives, control strategies.

TEXT 1 and TEXT 2. Reference 1

8 L1,L2,L3,L4

3

Batteries: Battery parameters, types and characteristics of EV

batteries. Charging schemes. Open-circuit voltage and ampere-

hour estimation. Battery load levelling

8 L1,L2,L3

4

Emerging EV technologies: Hybrid electric vehicles (HEVs):

types, operating modes, torque coordination and control,

generator/motor requirements. TEXT 1 and TEXT 2. Reference 1

9 L1,L2,L3

5

Fuel cell electric vehicles (FEVs): Fuel cell characteristics,

hydrogen storage systems, ultra- capacitors. TEXT 1 and TEXT 2.

Reference 1

6 L2,L3,L4


Note2: Two assignments are evaluated for10marks: Assignment -1 from Units 1 and 2.

Assignment -2 from Units 3, 4 and 5 and group activity for 5 marks and Seminar

for 5 Marks

Note:3 Out of 5 Units, Unit 1is a Webinar unit conducted through Google

Classroom/Zoom/Cisco Webex etc and will be delivered by subject faculty.

Course Outcomes:

CO1 Describe the configuration of a typical electric vehicle

CO2 Differentiate among different drive trains

CO3 Understand the limitations and advantages of various battery chemistries.

CO4 Develop strategies for charging various types of batteries.

CO5 Describe the various drive trains of hybrid electric vehicles.



1 2 3 4 5 6 7 8 9 10 11

1. CO1: L1,L2 8 1 3 1

2. CO2. L1,L2 8 1 3 1

3. CO3: L1,L2 8 3 1 1

4. CO4: L2,L3 9 3 1 1

5. CO5: L2,L3 6 1 3 1

Average CO 2 3 1 1


PSO3

CO1 2 2

CO2 2 2

CO3 3

CO4 2 2

CO5 2 2

Average CO 2 2

Text Books.

1 C.C. Chan and K.T. Chau“Modern Electric Vehicle Technology”,1st edition Oxford University Press, London, 2001

2 Iqbal Husain “Electric and Hybrid Vehicles”1stedition New York: CRC Press, 2016.


1. M. Ehsani, Y. Gao, S.E. Gay and A. Emadi,Modern Electric, Hybrid Electric, and Fuel Cell Vehicles:

Fundamentals, Theory and Design,1st edition New York: CRC Press, 2004

Web Links.

2. Prof. Amit Jain“Electrical Vehicle part 1” http://nptel.ac.in/courses

Subject Title : POWER ELECTRONICS LABORATORY-I

Sub.Code:20EPEL17 No. of Credits:2=0:0:2( L - T – P) No. of Lecture Hours/Week :03

Exam Duration:3 Hrs CIE +SEE=50+50=100 Total No.of Contact Hours:30


1 To conduct experiments on various converters and devices.

2 To analyse various parameters of converters.

3 To compute the performance of various converters.

4 To understand the working of controlled converters.

5 To compare dynamic characteristics of switching devices.

Expt

.No Experiments

No.of

Hours

Blooms

Taxnomy

level.

1 Analysis of static and dynamic characteristic of MOSFET and IGBT 3 L2,L4

2 Performance of single phase fully controlled and semi-controlled

converter for RL load for continuous current mode. 3 L1,L2,L3.

3 Performance of single phase fully controlled and semi-controlled

converter for RL load for discontinuous current mode. 3 L1, L2, L3

4 Study of effect of source inductance on the performance of single

phase fully controlled converter. 3 L1, L2, L3

5 Performance analysis of three phase fully controlled and semi-

controlled converter for RL load for continuous current mode. 3

L2, L3,

L4

6 Performance analysis of three phase fully controlled and semi-

controlled converter for RL load for discontinuous current mode. 3 L2, L3, L4

7. Performance analysis of single phase bridge inverter for RL load and

voltage control by single pulse width modulation. 3

L2, L3, L4

8. Performance analysis of two quadrant chopper. 3

L2, L3,

L4

9 Diode clamped multilevel inverter. 3 L1, L2, L3

10 ZVS operation of a synchronous buck converter. 3 L1, L2, L3

11 *Simulation of converters using NgSpice open source.

Note 1: Laboratory report should be submitted to the subject faculty every week and evaluation will be done on the

same week only. * Experiment is for additional skill not for exam.

Course Outcomes:

CO1 To conduct experiments on various converters and devices.

CO2 To compare dynamic characteristics of switching devices.

CO3 To compute the performance of various converter.

CO4 To understand the working of controlled converters.

CO5 To analyse various parameters of converters.

Course outcomes Mapping with programme outcomes


1 2 3 4 5 6 7 8 9 10 11

1. CO1: L1,L2 06 3 1 1 1

2. CO2: L2,L3 06 3 1 1 1

3. CO3: L2,L3 06 3 1 1

4. CO4: L1,L2 06 3 1

5. CO5: L2,L4 06 1 3

Average CO 2 3 2 1 1

Course

Outcome

PSO1 PSO2

PSO3

CO1 2 2

CO2 2 2

CO3 2 2

CO4 3

CO5 2 2

Average CO 2 2

References Text Books.

1 Ned Mohan, Tore M. Undeland, William P. Robbins“Power Electronics Converters, Applications, and Design”, Third

Edition, Wiley India Pvt. Ltd, 2011

2 Rashid M.H, “Power Electronics – Circuits Devices and Applications”, 3rd Edition, Pearson, 2011.

D K Bose“Modern Power Electronics & AC Drives”, 1st edition, 2012

Web Links.

1 B. G. Fernandes” A course on Power Electronics” http://nptel.ac.in/courses/108101038/

2. K. Gopakumar “A course on Industrial Drives – Power Electronics” http://nptel.ac.in/courses/108108077

Dr. Ambedkar Institute of Technology

(An Autonomous Institute affiliated to VTU, Accredited by NAAC with ‘A’ grade)

Department of Electronics and Communication Engineering




M. Tech in VLSI Design and Embedded Systems

I Semester

Sl.

No

.

Sub

Code

Subject

Title

Teachin

g

Departm

e nt

Teaching hours per

week

Maximum Marks

allotted

Exam

ina

tio

n

Cr

edi

ts

Lect

ure

Tut

oria

l/

Sem

inar

/ Assignment

Practic

al

/

Projec

t

CIE

SE

E

Total

1 20LVS11 Mathematics MA

T

4 - - 50 50 100 3

2 20LVS12 Digital VLSI design ECE 4 - - 50 50 100 3

3 20LVS13 Advanced Embedded

Systems

ECE 4 - - 50 50 100 3

4 20LVS14 VLSI Design

Verification and Testing

ECE 4 - - 50 50 100 3

5 20LVS15

X

ELECTIVE – I ECE 4 - - 50 50 100 3

6 20LVS16

X

ELECTIVE – II ECE 4 - - 50 50 100 3

7 20LVSL1

7

VLSI Design and Embedded Systems Lab-I

ECE - - 3 50 50 100 2

8 20LVSS1

8

Technical Seminar* ECE - 4 - 50 - 50 2

9 20LVSM

19

Minor project/ Industry visit/ Field work

ECE - - 6 50 - 50 2

Total

450 350 800 24


ELECTIVE – I ELECTIVE – II

Sl .No

Subject Code Subject title

1 20LVS161 System Verilog programming

2 20LVS162 Digital system Design using verilog

3 20LVS163 Programming Languages for Embedded Systems

4 20LVS163 Embedded System Design with FPGA

bject Title: ADVANCED ENGINEERING MATHEMATICS

Subject Code: 20LVS11 No. of Credits: 03=4:0:0(LTP) No. of lecture hours per week: 04

Exam Duration:3 Hrs CIE +(Assignment+Seminar) +

SEE = 40+10+50 =100

Total No. of lecture hours: 52

Course Objective: This course will enable the students:

Sl .No

Subject Code Subject title

1 20LVS151 Pattern Recognition and Machine Learning

2 20LVS152 Static Timing Analysis

3 20LVS153 Digital IC Design

4 20LVS154 SOC Design

1. To provide to the students a good understanding of the concepts and methods in linear

algebra like vector spaces, orthogonalization and QR decompositions

2. To provide a deep insight into the concepts of probability

3. To study random variables, probability distributions and density functions

4. To study the engineering applications of random variables

UNI

T

No.

Syllabus Content No. of

Hours

Blooms

Taxono

my Level

1 Linear Algebra I:

Introduction to vector spaces and sub-spaces, definitions, illustrative

examples and simple problems. Linearly independent and dependent

vectors-definition and problems. Basis vectors, dimension of a vector

space. Linear transformations-definition, properties and problems. Rank-

Nullity theorem (without proof). Matrix form of linear transformations-

Illustrative examples.

10

L1,L2,

L3

2 Linear Algebra II:

Computation of Eigen values and Eigen vectors of real symmetric

matrices- Given’s method. Orthogonal vectors and orthogonal bases.

Gram-Schmidt orthogonalization process. QR decomposition, singular

value decomposition, least square approximations.

10

L1,L2,

L3,

3 Random variables, Distributions and Density functions:

Recapitulation of probability theory and random variables. The

cumulative distribution function, probability density function, Gaussian

random variable, Uniform random variable, exponential random

variable, Laplace random variable, Gamma random variable, Erlang

random variable.

10

L1,L2,

L3, L4

4 Operations on a single random variable:

Expected value (EV), EV of random variable, EV of functions of random

variables, Moments, Central moments, conditional expected values,

characteristic functions, probability generating functions, moment

generating functions, Engineering Applications: Scalar Quantization,

Entropy and Source coding.

11

L1,L2,

L3

BOS Chairman Dean(Academics) Principal

5 Pairs of Random Variables:

Joint Cumulative distribution functions, Joint probability density

functions, Joint probability mass functions, Expected values involving

pairs of random variables, independent random variables, complex

random variables, Engineering Applications: Mutual Information,

Channel capacity and channel coding.

11

L1,L2,

L3, L4

Note: Each Unit will have internal choice.

COURSE OUTCOMES

CO1: Solve a variety of problems including engineering application problems using linear

algebra

CO2: Connect linear algebra to other fields both within and without mathematics

CO3: Develop abstract and critical reasoning by studying logical proofs and the axiomatic

methods as applied to linear algebra

CO4:

Course outcome and program outcome mapping

TEXT BOOKS:

1. David C. Lay, Linear Algebra and its Applications, Pearson Education (Asia) Pvt.

Ltd.

2. Scott L. Miller and Donald Childers, Probability and Random Processes, Academic

Press

REFERENCE BOOKS/WEBLINKS:

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. A Papoullis and S U Pillai, "Probability, Random Variables and Stochastic

Processes”, McGraw Hill, 2002

4. Peyton Z Peebles, "Probability, Random Variables and Random Signal Principles",

TMH, 4th Edition, 2007.

Follow complex logical arguments and develop modest logical

arguments CO5: Demonstrate skills in understanding the mathematical

knowledge

CO1: PO1, PO2

CO2: PO1, PO2

CO3: PO1, PO3

CO4: PO1, PO4

CO5: PO1, PO3


Subject Title: DIGITAL VLSI DESIGN

Subject Code: 20LVS12 No. of Credits:3=4:0:0(LTP) No. of lecture hours/week : 04

Exam Duration :03 Hours CIE +(Assignment + Seminar)+ SEE =

30+(10+ 10)+50=100 Total No. of Contact Hours :52

Course Learning Objectives: This course will enable the students to-

1 Understand the MOSFET structures (fabrication processes) and operations.

2 Understand MOS and CMOS inverters.

3 Learn different types of combinational MOS logic circuits.

4 Understand the concepts of sequential MOS and BICMOS logic circuits.

5 Understand the basics of dynamic logic circuits and design of high speed CMOS digital circuits.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1 MOS Transistor: The Metal Oxide Semiconductor (MOS) Structure, The

MOS System under External Bias, Structure and Operation of MOS Transistor,

MOSFET Current-Voltage Characteristics, MOSFET Scaling and Small-

Geometry Effects.

Modelling of MOS Transistor using SPICE:

Basic Concepts, The LEVEL 1 Model Equations, The LEVEL 2 Model

Equations ,The LEVEL 3 Model Equations, Capacitance Models, Comparison

of the SPICE MOSFET Models, Typical SPICE Model Parameters (from

appendix) [TEXT 1]

12

L1,L2,L3

2

MOS Inverters-Static Characteristics: Introduction, Resistive-Load Inverter,

Inverters with n Type MOSFET Load. MOS Inverters-Static Characteristics:

CMOS Inverter. MOS Inverters: Switching Characteristics and Interconnect

Effects: Introduction, Delay-Time Definition, Calculation of Delay Times,

Inverter Design with Delay Constraints, Estimation of Interconnect Parasitic,

Calculation of Interconnect Delay, Switching Power Dissipation of CMOS

Inverters. [TEXT 1]

10

L1,L2, L3

3

COMBINATIONAL MOS LOGIC CIRCUITS: Introduction MOS Logic

Circuits with Depletion nMOS Loads, CMOS Logic Circuits, Complex Logic

Circuits, CMOS Transmission Gates (Pass Gates). [TEXT 1]

10

L1,L2,L3

4

SEQUENTIAL MOS LOGIC CIRCUITS: Introduction, Contents Behaviour

of Bistable Elements, The SR Latch Circuit, Clocked Latch and Flip-Flop

Circuits, CMOS D-Latch and Edge-Triggered Flip-Flop Schmitt Trigger

Circuit(Ref Appendix of the chapter). [TEXT 1]

Bi-CMOS Logic Circuits: Introduction, Bipolar Junction Transistor (BJT):

Structure and Operation, Dynamic Behaviour of BJTs. Basic BiCMOS Circuits:

Static Behaviour, Switching Delay in BiCMOS Logic Circuits, BiCMOS

Applications. [TEXT 1]

12

L1,L2

DYNAMIC LOGIC CIRCUITS: Introduction, Basic Principles of Pass L1,L2,L3,


UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

5 Transistor Circuits, Voltage Bootstrapping, Synchronous Dynamic Circuit

Techniques, Dynamic CMOS Circuit Techniques, High Performance

Dynamic CMOS Circuits. [TEXT 1]

08 L4


COURSE OUTCOMES: After studying this course, students will be able to-

CO1 Design/Model the MOS transistors using small signal equivalent circuits/Pspice

parameters.

CO2 Evaluate the performance of digital CMOS and MOS circuits.

CO3 Analyse the MOS inverters characteristics and MOS logic circuits.

CO4 Apply the BICMOS technology knowledge to design high speed VLSI circuits/ CMOS logic circuits.

CO5 Describe the MOS transistors fabrication process.


CO1 PO2, PO3, PO4, PO5, PO12

CO2 PO2, PO3, PO4, PO5, PO6, PO12

CO3 PO1, PO2, PO3, PO4, PO5, PO6, PO12


CO5 PO1, PO2, PO3, PO4, PO5, PO6, PO8, PO12

TEXT BOOK

1. Sung Mo Kang &Yusuf Leblebici, “CMOS Digital Integrated Circuits: Analysis and

Design”, McGraw-Hill (Third Edition), 2005.

REFERENCE BOOKS/WEBLINKS

1. Neil Weste and K. Eshragian, “Principles of CMOS VLSI Design: A System

Perspective”, 2nd edition, Pearson Education (Asia) Pte. Ltd., 2000.

2. Wayne, Wolf, “Modern VLSI design: System on Silicon” Pearson Education”,

Second Edition, 2008.

3. Douglas A Pucknell & Kamran Eshragian , “Basic VLSI Design” PHI 3rd Edition

(original Edition – 1994).

4. www.ntpel.com

http://www.ntpel.com/


Subject Title: ADVANCED EMBEDDED SYSTEMS

Subject Code: 20LVS13 No. of Credits:3=4:0:0(LTP) No. of lecture hours/week :04




1 Explain the need for Embedded systems.

2 Understand the basic hardware components and their selection method based on the characteristics and Quality attributes of an Embedded system.

3 Describe the fundamental issues of ARM processors.

4 Explain the architectural features of ARM CORTEX M Processors.

5 Get exposure to Multi-core architectures of Embedded systems.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1 Embedded System: Embedded vs General computing system,

application and purpose of Embedded System, Core of an Embedded

System, Memory, Sensors, Actuators, LED, Optocoupler, keyboard,

Communication Interface, Embedded firmware, Other system

components, PCB and Passive components, Characteristics and Quality

Attributes of Embedded Systems.

(Selected Topics from Ch -1, 2, 3 of TEXT 1 )

11

L1,L2,

L3,

2 ARM Embedded Systems: The RISC Design Philosophy, The ARM

Design Philosophy, Embedded System Hardware, Embedded System

Software.

ARM Processor Fundamentals: Registers, Current Program Status

Register, Pipeline, Exceptions, Interrupts, and the Vector Table, Core

Extensions, Architecture Revisions, ARM Processor Families. (TEXT5)

10

L1,L2, L3,

3 ARM Cortex-M3/M4 Processors: ARM Cortex-M processors,

Architecture, Instruction Set, ARM Cortex-M3/M4 Processors based

MCU (LPC1768 microcontroller). (TEXT 2)

11

L1,L2, L3

4 Embedded System Design and Development: System design and

development, life-cycle models- the waterfall model, the V cycle model,

the spiral model and rapid prototyping incremental, problem solving –

five steps to design, the design process, identifying the requirements,

formulating the requirements specifications, the system design

specification, system specifications vs system requirements. (TEXT 4 )

10

L1,L2,

L3, L4

5 Multi-Core Architectures for Embedded Systems: Introduction,

Architectural Considerations, Interconnection Networks, Software

Optimizations, Case Studies: General Purpose Multiprocessor DSP,

Multiprocessor DSP for Mobile Applications, Multi-Core DSP Platforms.

10

L1,L2, L3, L4


UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

(Selected Topics from Ch – 1 of TEXT 3)



CO1 Identify the basic building blocks, characteristics and quality attributes of Embedded

systems.

CO2 Use Multi-core architectures in Embedded system design and debugging.

CO3 Analyze the complete life cycle of Embedded system design and development.

CO4 Design simple Embedded systems.

CO5 Compare and select ARM processor core based SoC with several features/peripherals based on requirements of Embedded applications.







TEXT BOOKS:

1. Introduction to Embedded Systems, Shibu K V, Tata McGraw Hill Education,

2009.

2. Joseph Yiu, “The Definitive Guide to the ARM Cortex-M3 and Cotrx-M4

Processors”, Newnes, (Elsevier), 2014.

3. Georgios Kornaros, “Multi-Core Embedded Systems” © 2010 by Taylor and Francis Group.

4. James K Peckol, “Embedded Systems – A Contemporary Design Tool”, John

Wiley, 2008.

5. Sloss Andrew N, Symes Dominic, Wright Chris, “ARM System Developer's Guide:

Designing and Optimizing”, Morgan Kaufman Publication.



1. “Multicore Programming”, Increased Performance through Software Multi–

threading by Shameem Akhter and Jason Roberts, Intel Press, 2006.

2. Embedded Systems- Architecture, Programming and Design, Raj Kamal, Tata

McGraw-Hill, 2008.

3. nptel.ac.in/courses.


Subject Title: VLSI DESIGN VERIFICATION AND TESTING




Course Learning Objectives

1 Learn the basics of testing and verification and the role of testing and verification in VLSI

design.

2 Able to identify the types of faults and apply the appropriate fault model to detect them.

3 Study of various fault diagnosing techniques and test generation methods.

4 Study of verification tools and simulators.

5 Able to understand the levels of verification and applying the verifying strategies at various

levels of VLSI design.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1 Introduction to Testing: Introduction, Testing Philosophy, Role of Testing,

Digital and Analog VLSI Testing, VLSI Technology Trends affecting Testing.

Fault Modelling: Defects errors and faults, Functional versus Structural

testing, Levels of fault models, Single stuck-at fault-Fault equivalence,

Equivalence of Single Stuck-at Faults, Fault collapsing, Fault dominance and

Check point theorem.

Logic and Fault simulation: Simulation for design verification, simulation

for test evaluation, Modelling Circuits for simulation, Algorithms for true

value simulation: compiled code simulation, Event driven Simulation,

Algorithms for Fault simulation: Serial, Parallel, Deductive, Concurrent fault

simulation, Roth’s TEST-DETECT algorithm, Differential fault simulation.

[TEXT 2]

12

L1,L2,L3,L4

2

Test Generation for Combinational logic circuits: Fault Diagnosis of

Digital Systems, Test Generation Techniques for Combinational Logic

Circuits, Detection of Multiple Faults in Combinational Logic Circuits.

Test generation for Sequential circuits: Testing of sequential circuits as

Iterative combinational circuits, state table verification, random testing,

transition count testing, signature analysis.

[TEXT 1]

10

L2,L3,L4

3

Design of Testable Sequential Circuits: What is testability, Controllability

and Observability, Design of testable combinational logic Circuits, testable

design of sequential circuits, The Scan-Path Technique for Testable Sequential

Circuits, Level-Sensitive Scan Design, Random Access Scan Technique, Built-

in Test, Design for autonomous self-test, designing testability into logic

boards.

[TEXT 1]

10

L2,L3,L4

4

What is verification: What is a test bench, The importance of verification,

Reconvergence model, what is being verified: Formal verification,

Equivalence checking, Model checking, Functional verification, test bench

generation, Functional verification approaches: Black-Box verification,

10

L1,L2,L3


UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

White-box verification, Grey-box verification, Testing versus verification:

Scan-based testing, design for verification.

Verification Tools: Linting tools: Limitations of linting tools, linting verilog

source code, linting VHDL source code, Code reviews, Simulators: Stimulus

and response, Event based simulation, cycle based simulation, Co-simulators,

[TEXT3]

5

The Verification Plan: The role of verification plan: specifying the

verification plan, defining the first success, Levels of verification: unit level

verification, reusable components verification, ASIC and FPGA verification,

system level verification, board level verification, Verification strategies:

verifying strategies, verifying the response, Random verification, From

specifications to features: Component-level features, system-level features,

error types to look for, From features to testcases: prioritize, group into

testcases, design for verification, from testcases to testbenches: verifying

testbenches. [TEXT3]

10

L2,L3,L4


COURSE OUTCOMES: After completing the course students will be able to-

CO1 Understand the need for testing and verification process and the place of testing and

verification in VLSI design flow with clear distinction between them.

CO2 Generate fault lists for digital circuits, apply fault models and compress the tests for

efficiency.

CO3 Exemplify the combinational and sequential circuit test generation methods for better fault

coverage and efficiency of testing.

CO4 Recognize the significance of testable design and design self-test techniques for improving

testability.

CO5 Identify the formal and functional verification approaches, verification tools and simulators

used to verify the digital design.

CO6 Describe the verification plan, levels of verification and verification strategies.








TEXT BOOK

1. P K Lala,” Fault Tolerant & Fault Testable Hardware Design”, B S publications, 2014.


2. M L Bushnell and V D Agrawal, “Essentials of Electronic Testing for Digital, Memory and

Mixed Signal VLSI Circuits”, First Edition, Kluwar Academic Publishers, New York, 2002.

3. Janick Bergeron, “Writing Test Benches: Functional Verification of HDL Models” , Second

Edition, Kluwar Academic Publishers, 2003.


1. Abramovici M, Breuer M A and Friedman A D, “Digital Systems Testing and Testable Design”,

Wiley, 1994.

2. P K Lala, “Digital Circuit Testing and Testability” , First Edition, Academic Press, 1997.

3. Bhasker J, Chadha and Rakesh, “Static Timing Analysis for Nanometer Designs-A Practical

Approach” , First Edition, Springer Publications, 2009.

4. Wang, Wu and Wen, “VLSI Test Principles and Architectures”, Morgan Kaufmann, 2006.

5. Neil Weste and K. Eshragian, “Principles of CMOS VLSI Design: A System Perspective,” 2nd

edition, Pearson Education (Asia) Pte. Ltd., 2000.

6. https://nptel.ac.in/courses/106103116


ELECTIVE – I Group Subjects:

Subject Title: PATTERN RECOGNITION and MACHINE LEARNING





1 Learn main and modern concepts for model selection and parameter estimation in recognition.

2 Solve decision making and statistical learning problems.

3 Special emphasis will be given to regression, classification, regularization, feature selection and density estimation in supervised mode of learning.

UNIT

No

Syllabus Contents No of

Hours

Blooms

Taxonomy

Level 1 Introduction: Probability Theory, Model Selection, The Curse of

Dimensionality, Decision Theory, Information Theory Distributions:

Binary and Multinomial Variables, The Gaussian Distribution, The

Exponential Family, Nonparametric Methods. [TEXT1]

10

L1,L2

2

Supervised Learning Linear Regression Models: Linear Basis

Function Models, The Bias-Variance Decomposition, Bayesian Linear

Regression, Bayesian Model Comparison Classification & Linear

Discriminant Analysis: Discriminant Functions, Probabilistic

Generative Models, Probabilistic Discriminative Mode [TEXT1]

12

L1,L2,L3

3

Supervised Learning Kernels: Dual Representations, Constructing

Kernels, Radial Basis Function Network, Gaussian Processes Support

Vector Machines: Maximum Margin Classifiers, Relevance Vector

Machines Neural Networks: Feed-forward Network, Network

Training, Error Backpropagation [TEXT1]

09

L1,L2,L3

4

Unsupervised Learning: Mixture Models: K-means Clustering,

Mixtures of Gaussians, Maximum likelihood, EM for Gaussian

mixtures, Alternative View of EM. Dimensionality Reduction: Principal

Component Analysis, Factor/Component Analysis, Probabilistic PCA,

Kernel PCA, Nonlinear Latent Variable Models.

[TEXT2]

12

L1,L2,L3

5

Probabilistic Graphical Models: Bayesian Networks, Conditional

Independence, Markov Random Fields, Inference in Graphical Models,

Markov Model, Hidden Markov Models.

[TEXT1]

09

L1,L2,L3



COURSE OUTCOMES:

CO1 Identify areas where Pattern Recognition and Machine Learning can offer a solution.

CO2 Describe the strength and limitations of some techniques used in computational

Machine Learning for classification, regression and density estimation problems.

CO3 Describe and model data.

CO4 Solve problems in Regression and Classification.

CO5 Apply the probabilistic graphical models for solving complex problems.








TEXT BOOK

1. Pattern Recognition and Machine Learning. Christopher Bishop. Springer, 2006.


Subject Title: Static Timing Analysis (STA)


Exam Duration :03 Hours CIE +(Assignment+Seminar)+ SEE =

30+(10+10)+50=100 Total No. of Contact Hours :52


1. Understand timing analyses at various process, environment and interconnect corners.

2. Apply the learnt concepts of STA to evaluate the delay of the circuits.

3. Understand and analyze the signal integrity issues for the IC.

4. Generate the timing analysis report using EDA tool.

5. Understand verification and analyze the generated report to identify issues for the

violation

6. Learn different techniques to meet timing in an IC design.

7. Set up the timing analysis environment and perform the timing analysis for various cases.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1

Introduction: Nanometer Designs, What is Static Timing Analysis? Why

Static Timing Analysis?, Crosstalk and Noise, Design Flow, CMOS

Digital Designs, FPGA Designs, Asynchronous Designs, STA at

Different Design Phases, Limitations of Static Timing Analysis, Power

Considerations, Reliability Considerations,

STA Concepts: CMOS Logic Design, Basic MOS Structure, CMOS

Logic Gate, Standard Cells, Modeling of CMOS Cells, Switching

Waveform, Propagation Delay, Slew of a Waveform, Skew between

Signals, Timing Arcs and Unateness, Min and Max Timing Paths, Clock Domains, Operating Conditions .

10

L1,L2,

L3,

2

Standard Cell Library: Pin Capacitance, Timing Modeling, Timing

Models - Combinational Cells, Timing Models - Sequential Cells, State-

Dependent Models, Interface Timing Model for a Black Box, Advanced

Timing Modeling, Power Dissipation Modeling, Other Attributes in Cell

Library, Characterization and Operating Conditions.

10

L1,L2,

L3, L4

3

Interconnect Parasitics: RLC for Interconnect, Wireload Models,

Representing Coupling Capacitances, Hierarchical Methodology,

Reducing Parasitics for Critical Nets.

Delay Calculation: Overview, Cell Delay using Effective Capacitance,

Interconnect Delay, Slew Merging, Different Slew Thresholds, Different

Voltage Domains, Path Delay Calculation, Slack Calculation.

10

L1,L2,

L3, L4

4

Configuring the STA Environment: What is the STA Environment?

Specifying Clocks, Generated Clocks, Constraining Input Paths,

Constraining Output Paths, Timing Path Groups, Modeling of

External Attributes, Design Rule Checks, Virtual Clocks, Refining the Timing Analysis, Point-to-Point Specification,

10

L1,L2,

L3, L4


Path Segmentation.

5

Timing Verification: Setup Timing Check, Hold Timing Check,

Multicycle Paths, Crossing Clock Domains, False Paths, Half- Cycle

Paths, Removal Timing Check, Recovery Timing Check, Timing across

Clock Domains, Examples: Slow to Fast Clock Domains, Fast to Slow

Clock Domains, Half-cycle Path - Case 1, Half-cycle Path - Case 2, Fast

to Slow Clock Domain, Slow to Fast Clock Domain, Multiple Clocks.

12

L1,L2,

L3, L4


COURSE OUTCOMES

CO1 Evaluate the delay of any given digital circuits.

CO2 Prepare the resources to perform the static timing analysis using EDA

tool CO3 Prepare timing constraints for the design based on the specification.

CO4 Generate the timing analysis report using EDA tool for different checks.

CO5 Perform verification and analyze the generated report to identify critical issues and bottleneck for the violation and suggest the techniques to make the design to meet

timing.







TEXT BOOK: 1. J. Bhasker, R Chadha,., “Static Timing Analysis for Nanometer Designs: A Practical

Approach”, Springer, 2009.


1. Sridhar Gangadharan, Sanjay Churiwala, “Constraining Designs for Synthesis and

Timing Analysis – A Practical Guide to Synopsis Design Constraints (SDC)”, Springer,

2013.

2. Naresh Maheshwari and Sachin Sapatnekar, "Timing Analysis and Optimization of sequential Circuits", Springer Science and Business Media, 1999.


Subject Title: DIGITAL IC DESIGN





1. Learn circuit-oriented approach towards digital design

2. Illustrate the impact of interconnect wiring on the functionality and performance of a

digital gate.

3. Infer different approaches to digital timing and clocking circuits

4. Understand the impact of clock skew on the behaviour of digital synchronous circuits

5. Explain the role of peripheral circuitry such as the decoders, sense amplifiers, drivers

and control circuitry in the design of reliable and fast memories

UNIT

No


Hours

Blooms

Taxonomy

Level

1 Implementation Strategies For Digital ICS: Introduction, From

Custom to Semicustom and Structured Array Design Approaches,

Custom Circuit Design, Cell-Based Design Methodology, Standard Cell,

Compiled Cells, Macrocells, Megacells and Intellectual Property, Semi-

Custom Design Flow, Array-Based Implementation Approaches, Pre-

diffused (or Mask-Programmable) Arrays, Pre-wired Arrays,

Perspective-The Implementation Platform of the Future.

12

L1,L2,

L3,

2

Coping With Interconnect: Introduction, Capacitive Parasitics,

Capacitance and Reliability-Cross Talk, Capacitance and Performance in

CMOS, Resistive Parasitics, Resistance and Reliability-Ohmic Voltage

Drop, Electromigration, Resistance and Performance-RC Delay,

Inductive Parasitics, Inductance and Reliability-Voltage Drop,

Inductance and Performance-Transmission Line Effects, Advanced

Interconnect Techniques, Reduced-Swing Circuits, Current-Mode

Transmission Techniques, Perspective: Networks-on-a-Chip.

10

L1,L2,

L3

3

Timing Issues In Digital Circuits: Introduction, Timing Classification

of Digital Systems, Synchronous Interconnect, Mesochronous

interconnect, Plesiochronous Interconnect, Asynchronous Interconnect,

Synchronous Design — An In-depth Perspective, Synchronous Timing

Basics, Sources of Skew and Jitter, Clock-Distribution Techniques,

Latch-Based Clocking, SelfTimed Circuit Design, Self-Timed Logic -

An Asynchronous Technique, Completion-Signal Generation, Self-

Timed Signaling, Practical Examples of Self-Timed Logic,

Synchronizers and Arbiters, Synchronizers-Concept and

Implementation, Arbiters, Clock Synthesis and Synchronization Using

10

L1,L2,

L3, L4


UNIT

No


Hours

Blooms

Taxonomy

Level

a Phase-Locked Loop, Basic Concept, Building Blocks of a PLL.

4

Designing Memory and Array Structures: Introduction, Memory

Classification, Memory Architectures and Building Blocks, The Memory

Core, Read-Only Memories, Non-volatile Read-Write Memories, Read-

Write Memories (RAM), Contents-Addressable or Associative Memory

(CAM), Memory Peripheral Circuitry, The Address Decoders, Sense

Amplifiers, Voltage References, Drivers/Buffers, Timing and Control.

10

L1,L2,

L3, L4

5

Designing Memory and Array Structures: Memory Reliability and

Yield, Signal-to-Noise Ratio, Memory yield, Power Dissipation in

Memories, Sources of Power Dissipation in Memories, Partitioning of

the memory, Addressing the Active Power Dissipation, Data retention

dissipation, Case Studies in Memory Design: The Programmable Logic

Array (PLA), A 4 Mbit SRAM, A 1 Gbit NAND Flash Memory,

Perspective: Semiconductor Memory Trends and Evolutions.

10

L1,L2,

L3, L4



CO1 Apply design automation for complex circuits using the different implementation

Methodologies.

CO2 Identify the approaches to minimize the impact of interconnect parasitic on

performance, power dissipation and circuit reliability.

CO3 Implement the ordering of the switching events to meet the desired timing constraints using synchronous, clocked approach.

CO4 Infer the reliability of the memory.

CO5 Solve application specific integrated circuit problems.

CO6 Design effective arithmetic building blocks









TEXT BOOK

1. Jan M Rabey, Anantha Chandrakasan, BorivojeNikolic, ―Digital Integrated Circuits-

A Design Perspective‖, PHI, 2nd Edition


1. M. Smith, ―Application Specific Integrated circuits‖, Addison Wesley, 1997

2. H. Veendrick, ―MOS IC‘s: From Basics to ASICs, Wiley-VCH, 1992.

3. Anantha P. Chandrakasan , Robert W. Brodersen, ―Low Power Digital CMOS

Design‖, Kluwer Academic Publisher, 1995.


Subject Title: SOC DESIGN





1 Get complete basics related to SoC architecture and different approaches related to

SoC Design.

2 Able to select an appropriated robust processor for SoC Design

3 Able to select an appropriate memory for SoC Design.

4 Design and customize SoC

5 Realize real time case studies

UNIT

No


Hours

Blooms

Taxonomy

Level

1 Introduction to the System Approach: System Architecture,

Components of the system, Hardware & Software, Processor

Architectures, Memory and Addressing, System level interconnection,

An approach for SOC Design, System Architecture and Complexity,

Product Economics and Implications for SoC, Dealing with Design

Complexity.

10

L1,L2,

L3,

2

Processors: Introduction, Processor Selection for SoC, Basic concepts

in Processor Architecture, Basic concepts in Processor Micro

Architecture, Basic elements in Instruction handling. Buffers:

minimizing Pipeline Delays, Branches, More Robust Processors, Vector

Processors and Vector Instructions extensions, VLIW Processors,

Superscalar Processors.

10

L1,L2,

L3, L4

3

Memory Design for SoC: Overview of SOC external memory, Internal

Memory, Size, Scratchpads and Cache memory, Cache Organization,

Cache data, Write Policies, Strategies for line replacement at miss time,

Types of Cache, Split – I, and D – Caches, Multilevel Caches, Virtual to

real translation, SoC Memory System, Board-based (Off-Die) Memory

Systems, Simple DRAM and the Memory Array, Models of Simple

Processor – memory interaction.

10

L1,L2,

L3, L4

4

Interconnect Customization and Configuration: Inter Connect

Architectures, Bus: Basic Architectures, SoC Standard Buses , Analytic

Bus Models, Using the Bus model, Effects of Bus transactions and

contention time.

SoC Customization: An overview, Customizing Instruction Processor,

Reconfiguration Technologies,

Mapping design onto Reconfigurable devices, Instance Specific design,

Customizable Soft Processor, Reconfiguration – overhead

12

L1,L2,

L3, L4


UNIT

No


Hours

Blooms

Taxonomy

Level analysis and trade-off analysis on reconfigurable Parallelism.

5

Application Studies / Case Studies:

SoC Design approach, AES algorithms, Design and evaluation,

Application Study: 3-D Graphics Processors, Application Study: Image

compression – JPEG compression, Application Study: Video

Compression.

10

L1,L2,

L3, L4


COURSE OUTCOMES:

CO1 Understand the overview of SOC Design

CO2 Analyse the performance of Processors and Memory Architectures of SOC

CO3 Customize, Configure and Reconfigure the SoC for better performance

CO4 Analyse the performance of SOCs in different applications

CO5 Develop SOC for an application by designing its different sub-blocks


CO1 PO1, PO2, PO3

CO2 PO2, PO3

CO3 PO4, PO7

CO4 PO3, PO5, PO7

CO5 PO4, PO6, PO7, PO8

TEXT BOOK

1. Michael J. Flynn and Wayne Luk, “Computer System Design System-on-Chip”,

Wiley India Pvt. Ltd.


1. Ricardo Reis, “Design of System on a Chip: Devices and Components”, 1st Edition,

2004, Springer

2. Jason Andrews, “Co-Verification of Hardware and Software for ARM System on

Chip Design (Embedded Technology)”, Newnes, BK and CDROM.

3. Prakash Rashinkar, Peter Paterson and Leena Singh L, “System on Chip Verification

– Methodologies and Techniques”, 2001, Kluwer Academic Publishers

4. https://www.slideshare.net/ruliandi/system-on-chip-soc-44502780.

https://www.slideshare.net/ruliandi/system-on-chip-soc-44502780


ELECTIVE II Group Subjects:

Subject Title: SYSTEM VERILOG PROGRAMMING




Course Learning Objectives.

This course will enable the students to:

1. Understand digital system verification using object oriented methods

2. Learn the System Verilog language for digital system verification.

3. Create/build test benches for the basic design/methodology.

4. Use constrained random tests for verification

5. Understand concepts of functional coverage

UNIT

No


Hours

Blooms

Taxonomy

Level

1 Verification Guidelines: The verification process, basic test bench

functionality, directed testing, methodology basics, constrained random

stimulus, randomization, functional coverage, test bench components.

Data Types: Built in Data types, fixed and dynamic arrays, Queues,

associative arrays, linked lists, array methods, choosing a storage type,

creating new types with type def, creating user defined structures, type

conversion, Enumerated types, constants and strings, Expression width.

12

L1,L2,

L3,

2

Procedural Statements and Routines: Procedural statements, Tasks,

Functions and void functions, Task and function overview, Routine

arguments, returning from a routine, Local data storage, time values.

Converting the test bench and design: Separating the test bench and

design, The interface construct, Stimulus timing, Interface driving and

sampling, System Verilog assertions.

10

L1,L2,

L3

3

Randomization: Introduction, Randomization in System Verilog,

Constraint details, Solution probabilities, Valid constraints, In-line

constraints, Random number functions, Common randomization

problems, Iterative and array constraints, Random control. and

Synchronization Using a Phase-Locked Loop, Basic Concept, Building

Blocks of a PLL.

10

L1,L2,

L3, L4

4

Threads and Interprocess Communication: Working with threads,

Disabling threads, Interprocess communication, Events, semaphores,

Mailboxes, Building a test bench with threads and Interprocess

10

L1,L2,

L3, L4


UNIT

No


Hours

Blooms

Taxonomy

Level Communication.

5

Functional Coverage: Coverage types, Coverage strategies, Simple

coverage example, Anatomy of Cover group and Triggering a Cover

group, Data sampling, Cross coverage, Generic Cover groups, Coverage

options, Analyzing coverage data, measuring coverage statistics during

simulation.

10

L1,L2,

L3, L4



CO1 Develop test benches for moderately complex digital circuits

CO2 Use System Verilog language to implement digital systems

CO3 Appreciate functional coverage

CO4 Apply constrained random tests benches using System Verilog

CO5 Analyze a verification case and apply System Verilog to verify the design

CO6 VLSI Verification software’s effectively to implement and verify digital systems


CO1 PO1,PO2

CO2 PO2,PO3,PO4

CO3 PO2,PO3,PO4,PO5

CO4 PO7,PO8

CO5 PO3,PO4 CO6

PO3,PO4,PO5

TEXT BOOK

1. Chris Spear, ‘System Verilog for Verification – A guide to learning the Test bench

language features‘, Springer Publications, 2nd Edition, 2010.


1. Stuart Sutherland, Simon Davidmann, Peter Flake, ―System Verilog for Design A

guide to using system verilog for Hardware design and modelling, Springer

Publications, 2nd Edition, 2006.


Subject Title: DIGITAL SYSTEM DESIGN USING VERILOG

Subject Code:20LVS162 No. of Credits:3=4:0:0(LTP) No. of lecture hours/week : 04




1 Understand digital system design methodologies.

2 Understand usage of Verilog in digital system design.

3 Understand and Evaluation of Memories.

4 Understand the processors, I/O devices, and memory circuits.

5 Understand ASIC design, Accelerator and design methodology flow.

UNIT No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1 Introduction and Methodology: Digital Systems and Embedded

Systems, Binary representation and Circuit Elements, Real-World

Circuits, Models, Design Methodology.

Combinational Basics: Boolean Functions and Boolean Algebra,

Binary Coding, Combinational Components and Circuits, Verification of

Combinational Circuits. [TEXT 1]

10

L1,L2,L3

2

Number Basics: Unsigned and Signed Integers, Fixed and Floating-

point Numbers

Sequential Basics: Storage elements, Counters, Sequential Datapaths

and Control, Clocked Synchronous Timing Methodology. [TEXT 1]

10

L1,L2

,L3

3

Memories: Concepts, Memory Types, Error Detection and Correction.

Implementation Fabrics: ICs, PLDs, Packaging and Circuit Boards, Interconnection and Signal Integrity.[TEXT 1]

12

L1,L2,

L3,L4

4

Processor Basics: Embedded Computer Organization, Instruction and

Data, Interfacing with memory.

I/O interfacing: I/O devices, I/O controllers, Parallel Buses, Serial Transmission, I/O software. [TEXT 1]

10

L1,L2,

L3,L4

5

Accelerators: Concepts, case study, Verification of accelerators.

Design Methodology: Design flow, Design optimization, Design for test. [TEXT 1]

10

L2,L3,

L4,L5.


COURSE OUTCOMES:

CO1 Understand and Design of digital circuits using Verilog.

CO2 Develop arithmetic building blocks for ALU.

CO3 Analyze the performance of memory circuits using Verilog.


CO4 Synthesis of the ASIC design process.

CO5 Design of I/P and O/P blocks for digital systems.

CO6 Evaluate different ASIC design methodologies.








TEXT BOOK:

1. Peter J. Ashenden, “Digital Design: An Embedded systems Approach Using

VERILOG”, First Edition, Elsevier, 2010.

REFERENCE BOOKS /WEBLINKS:

1. ByeongKil Lee, Charles H Roth, and LizyKurian John, “Digital Systems Design

Using Verilog”, First Edition, Boston, MA: Cengage Learning,, 2016.

2. J. Bhaskar, “A Verilog HDL Primer”, Third Edition, Star Galaxi Publishing, 1998.


Subject Title: PROGRAMMING LANGUAGES FOR EMBEDDED SOFTWARE





This course will enable the students to:

Write an embedded C application of moderate complexity.

Develop and analyse algorithms in C++.

Differentiate interpreted languages from compiled languages.

Understanding of various scripting languages.

Development of firmware for embedded system.

UNIT

No


Hours

Blooms

Taxonomy

Level

1 Embedded ‘C’ Programming - Bitwise operations, Dynamic memory allocation, OS services - Linked stack and queue, Sparse matrices,

Binary tree - Interrupt handling in C, Code optimization issues - Writing

LCD drives, LED drivers, Drivers for serial port communication -

Embedded Software Development Cycle and Methods (Waterfall,

Agile)

10

L1,L2,L3.

2

Object Oriented Programming - Introduction to procedural, modular,

object-oriented and generic programming techniques, Limitations of

procedural programming, objects, classes, data members, methods, data

encapsulation, data abstraction and information hiding, inheritance,

polymorphism, CPP Programming: ‘cin’, ‘cout’, formatting and I/O

manipulators, new and delete operators, Defining a class, data members

and methods, ‘this’ pointer,

12

L1,L2,L3.

3

Constructors, destructors, friend function, dynamic memory

allocation, Overloading and Inheritance: Need of operator

overloading, overloading the assignment, overloading using friends,

type conversions, single inheritance, base and derived classes, friend

classes, types of inheritance, hybrid inheritance, multiple inheritance,

virtual base class, polymorphism, virtual functions

10

L1,L2,L3.

4

Templates: Function template and class template, member function

templates and template arguments, Exception Handling: syntax for

exception handling code: try-catch- throw, Multiple Exceptions.

10

L1,L2,L3

5

Scripting Languages Overview of Scripting Languages – PERL,

CGI, VB Script, Java Script. PERL: Operators, Statements Pattern

Matching etc. Data Structures, Modules, Objects, Tied Variables, Inter

10

L1,L2,L3


UNIT

No


Hours

Blooms

Taxonomy

Level process Communication Threads, Compilation & Line Interfacing.


COURSE OUTCOMES:

CO1 Develop embedded C application of moderate complexity.

CO2 Develop and analyse algorithms in C++

CO3 Choose between the compiled and interpreted language.

CO4 Apply to choose best scripting language

CO5 Design firmware for embedded systems.


CO1 PO3, PO4

CO2 PO3, PO4

CO3 PO3, PO4,

CO4 PO3, PO4

CO5 PO3, PO4

TEXT BOOK/ REFERENCE BOOKS/WEBLINKS

1. Michael J. Pont , “Embedded C”, Pearson Education, 2nd Edition, 2008

2 Michael Berman, “Data structures via C++”, Oxford University Press, 2002

3. Randal L. Schwartz, “Learning Perl”, O’Reilly Publications, 6th Edition 2011

4 Robert Sedgewick, “Algorithms in C++”, Addison Wesley Publishing Company, 1999

5 Abraham Silberschatz, Peter B, Greg Gagne, “Operating System Concepts”, John

Willey & Sons, 2005.


Subject Title: Embedded System Design with FPGA


Exam Duration :03 Hours CIE +(Assignment+Seminar)+ SEE =

30+(10+10)+50=100 Total No. of Contact Hours :52


1 Explain the computer hardware and software.

2 Describe the concept of Field Programmable gate arrays.

3 Explain the Embedded system design tools and design prototyping.

4 Describe the various concept of design of utility hardware cores.

5 Explain the concepts of Embedded design steps.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

1 Computer Hardware And Software: Computer System, Computer Software,

Machine Language, Assembly Language, High-Level Language, C

Programming Language, Instruction Set Architecture, SMPL-CPU Design,

CPU Specification, Single-Cycle Implementation, Multi-Cycle Implementation,

SAYEH Design and Test, Details of Processor Functionality, SAYEH Datapath,

SAYEH Verilog Description, SAYEH Top-Level Testbench / Assembler, SAYEH Hardware Realization.

10 L1,L2, L3,

2 Field Programmable Devices: Read Only Memory, Basic ROM Structure,

NOR Implementation, Distributed Gates, Array Programmability, Memory

View, ROM Variations, Programmable Logic Arrays, PAL Logic Structure,

Product Term Expansion, Three-State Outputs, Registered Outputs,

Commercial Parts, Complex Programmable Logic Devices, Altera's MAX

7000S CPLD, Field Programmable gate arrays, Altera's FLEX 10K FPGA, Altera's cyclone FPGA.

10 L1,L2, L3,

3 Tools For Design And Prototyping: Hardware Design Flow, Datapath of

Serial Adder, Serial Adder Controller, HDL Simulation and Synthesis, Pre-

Synthesis Simulation, Module Synthesis, Post-Synthesis Simulation, Mixed-

Level Design with Quartus II, Project Specification, Block Diagram Design File,

Creating and Inserting Design Components, Wiring Design Component, Design

Compilation, Design Simulation, Synthesis Results, Design Prototyping, UP3

Board Specification, DE2 Board Specification, Programming DE2 Cyclone II.

10 L1,L2, L3

4 Design Of Utility Hardware Cores: Library Management, Basic IO Device

Handling, Debouncer, Single Stepper, Utilizing UPS Basic IO, Utilizing DE2

Basic IO, Frequency Dividers, Seven Segment Displays, SSD Driver, Testing

DE2 SSD Driver, LCD Display Adapter, Writing into LCD, LCD Initialization,

Display Driver with Initialization, Testing the LCD Driver (UPS), Testing the

LCD Driver (DE2), Keyboard Interface Logic, Serial Data Communication,

Power-On Routine, Codes and Commands, Keyboard Interface Design, VGA

Interface Logic, VGA Driver Operation, Monitor Synchronization Hardware,

Character Display, VGA Driver for Text Data, VGA Driver Prototyping (UPS),

VGA Driver Prototyping (DE2).

Design With Embedded Processors: Embedded Design Steps, Processor

Selection, Processor Interfacing, Developing Software, Filter Design, Filter

Concepts, FIR Filter Hardware Implementation, FIR Embedded Implementation, Building the FIR Filter, Design of a Microcontroller, System

11 L1,L2,

L3, L4


UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

Platform, Microcontroller Architecture.

5 Design Of An Embedded System: Designing an Embedded System, Nios II

Processor, Configurability Features of Nios II, Processor Architecture,

Instruction Set,Nios II Alternative Cores, Avalon Switch Fabric, Avalon

Specification, Address Decoding Logic, Data-path Multiplexing, Wait-state

Insertion, Pipelining, Endian Conversion, Native Address Alignment and

Dynamic Bus Sizing, Arbitration for Multi-Master Systems, Burst Management,

Clock Domain Crossing, Interrupt Controller, Reset Distribution, SOPC Builder

Overview, Architecture of SOPC Builder Systems, Functions of SOPC Builder,

IDE Integrated Development Environment, IDE Project Manager, Source Code

Editor, C/C++ Compiler, Debugger , Flash Programmer, An Embedded System

Design: Calculator, System Specification, Calculating Engine, Calculator IO

interface, Design of Calculating Engine,

Building Calculator Software, Calculator Program, Completing the Calculator

System.

11 L1,L2,

L3, L4

Note: Each Unit will have internal choice COURSE

OUTCOMES

CO1 Describe the concept of Machine Language, Assembly Language, High-LeveI

Language.

CO2 Analyze the concept of SAYEH Top-Level Testbench / Assembler.

CO3

CO4

CO5

Describe the structure of PLA and PAL arrays.

Discuss the concept of Altera’s MAX 7000S CPLD.

Evaluate the HDL Simulation and Synthesis.







TEXT BOOKS:

1. Embedded Core Design with FPGAs, 1e, Zainalabedin Navabi, McGrawHill 2008.

REFERENCE BOOKS:

1. Embedded Systems Design with FPGAs, Athanas, Peter, Pnevmatikatos, Dionisios,

Sklavos, Nicolas, Springer, 2013.


Subject Title: VLSI DESIGN AND EMBEDDED SYSTEM LAB -I

Subject Code: 20LVSL17 No. of Credits: 2=0:0:2(LTP) No. of lecture hours/week :03

Exam Duration :03 Hours CIE + SEE = 50+50=100 Total No. of Contact Hours :36

Course Learning Objectives This course will enable the students to:

1. Learn Verilog Code Programming for the design of digital circuits

2. Use FPGA/CPLD board and Logic Analyzer or Chipscope to verify the results.

3. Learn physical design for the digital circuits

4. Learn Assembly language programming for different applications using

5. ARM- Cortex M3 Kit and Keil uVision- 4 tool.

6. Learn C language programming for different applications using ARM Cortex

M3 Kit and Keil uVision-4 tool.

UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

PART A: VLSI FRONT END DESIGN PROGRAMS

1 Write a Verilog code for the following 8 bit adder circuits and

implement using chip-scope techniques.

1. Carry Ripple Adder

2. Carry Look Ahead adder

3. Carry Skip Adder

4. BCD Adder & Subtractor

3 L1,L2,L3

L4

2 Write a Verilog code for the following 8 bit multiplier circuits and

implement using chip-scope techniques.

1. Array Multiplication (Signed and Unsigned) 2. Booth Multiplication (Radix-4)

3 L1,L2,L3

L4

3 Write a Verilog code for the following 8/4 circuits and implement using chip-scope techniques.

1. Magnitude Comparator

2. LFSR

3. Parity Generator 4. Universal Shift Register

3 L1,L2,L3 L4

4 Write Verilog Code for 3-bit Arbitary Counter to generate 0,1,2,3,6,5,7 and repeats.

3 L1,L2,L3 L4

5 Design a Mealy and Moore Sequence Detector using Verilog to detect

Sequence.

3 L1,L2,L3

L4

6 Design a FIFO and LIFO buffers in Verilog and Verify its Operation. 3 L1,L2,L3 L4

7 Design a coin operated public Telephone unit using Mealy FSM

model with specified operations.

3 L1,L2,L3

L4

PART-B: ARM Cortex M3 Programs

1 Write an Assembly language program to link multiple object files and 3 L1,L2,L3


UNIT

No

Syllabus Contents

No of

Hours

Blooms

Taxonomy

Level

link them together. L4

2 Write Embedded C program to read on-chip ADC value and display it

on terminal of LPC 1768.

3 L1,L2,L3,L4

3 Write Embedded C program to interface LED and Relay to LPC 1768

MCU.

3 L1,L2,L3

L4

4 Write Embedded C Program to interface RTC to LPC1768. 3 L1,L2,L3,L4

5 Write Embedded C program to design a Stopwatch using interrupts. 3 L1,L2,L3 L4

COURSE OUTCOMES:

CO1 Design digital circuits for specific applications.

CO2 Verify the digital circuits using chip scope techniques.

CO3 Develop a Verilog code based on states machines.

CO4 Analyze the architecture of ARM Cortex-M3.

CO5 Create different assembly and Embedded C programs.

CO6 Design and testing programs for different embedded applications using LPC1768.








TEXT BOOK

1. J. Bhaskar, “A Verilog HDL Primer”, Third Edition, Star Galaxi Publishing, 1998.

2. Samir Palanithkar, “Verilog HDL”, Second Edition, 2012.


1. Joseph Yiu, “The Definitive Guide to the ARM CORTEX-M3”, Second Edition, Newnes,

2008.


(An Autonomous Institute affiliated to VTU, Accredited by NAAC with ‘A’ grade) Department of Telecommunication Engineering

SCHEME OF TEACHING AND EXAMINATION (Autonomous) 2020-21, 2021-22

M. Tech in Digital Communication and Networking

Choice Based Credit System (CBCS) and Outcome Based Education (OBE)

I semester

Sl.

N

o.

Cour

se

Sub

Code

Subject

Title

Teachin

g

Depart

ment

Teaching hours per week Examination

Lect

ure

Tutorial/

Seminar/

Assignm

ent/ Skill

Develop

ment

Activity

Practi

cal

/

Proje

ct

Durat

ion in

hours

Marks

Cred

its CI

E

SE

E

Tot

al

1 PCC 20

LDN

11

Advanced

Engineerin

g

Mathemat

ics

MAT 2 2 - 3 50 50 10

0 3

2 PCC 20

LDN

12

Advanced

Digital

Communic

ation

TE 2 2 - 3 50 50 10

0 3

3 PCC 20

LDN

13

Antenna

Design and

Synthesis

TE 2 2 - 3 50 50 10

0

3

4 PCC 20

LDN

14

Advanced

Computer

Networks

TE 2 2 - 3 50 50 10

0

3

5 PEC 20

LDN

15X

ELECTIVE –

I

TE 2 2 - 3 50 50 10

0

3

6 PEC 20

LDN

16X

ELECTIVE –

II

TE 2 2 - 3 50 50 10

0

3

7 PCC 20

LDN

L17

Advanced

Communic

ation Lab

TE - - 3 3 50 50 10

0 2

8 PCC 20

LDN

S18

Technical

Seminar*

TE - 2 - - 50 - 50 2

9 PCC 20

LDN

M19

Minor

project/

Industry

visit/

Field work

TE - - 3 - 50 - 50 2

Total 45

0

35

0

80

0

24



Sl .No Subject Code Subject title

1 20 LDN 151 Optical Communication and

Networking

2 20 LDN 152 Wireless Sensor Networks

3 20 LDN 153 Advanced Embedded System

Design

4 20 LDN 154 Probability and Random

Process

Sl. No Subject

Code

Name of the Subject

1 20 LDN 161 Wireless and Mobile

Networks

2 20 LDN 162 Modeling and Analysis

3 20 LDN 163 Advances in Image

Processing

4 20 LDN 164 Network Routing

Algorithms

SUBJECT TITLE: ADVANCED ENGINEERING MATHEMATICS

Subject Code: 20LDN11 No. of Credits:3=2:2:0(L:T:P) No. of lecture hours per week: 4

Exam Duration: 3 Hours CIE + SEE = 50+50 =100

Total No. of lecture hours: 52

Course Objective:

1. To provide to the students a good understanding of the concepts and methods in linear

algebra like vector spaces, orthogonalization and QR decompositions

2.To provide a deep insight into the concepts of probability

3. To study random variables, probability distributions and density functions

4. To study the engineering applications of random variables

UNIT

No.

Syllabus Content

No. of

Hours

Teaching

1 Linear Algebra I:

Introduction to vector spaces and sub-spaces, definitions, illustrative

examples and simple problems. Linearly independent and dependent vectors-

definition and problems. Basis vectors, dimension of a vector space. Linear

transformations-definition, properties and problems.

10

2 Linear Algebra II:

Computation of Eigen values and Eigen vectors of real symmetric matrices-

Given’s method. Orthogonal vectors and orthogonal bases. Gram-Schmidt

orthogonalization process. QR decomposition, singular value decomposition,

least square approximations.

10

3 Random variables, Distributions and Density functions:

Recapitulation of probability theory and random variables. The cumulative

distribution function, probability density function, Gaussian random variable,

Uniform random variable, exponential random variable, Laplace random

variable.

10

4 Operations on a single random variable:

Expected value (EV), EV of random variable, EV of functions of random

variables, conditional expected values, characteristic functions, probability

generating functions, Engineering Applications: Scalar Quantization,

Entropy and Source coding.

11

5 Pairs of Random Variables:

Joint Cumulative distribution functions, Joint probability density functions,

Joint probability mass functions, independent random variables, Engineering

Applications: Mutual Information, Channel capacity and channel coding.

(Blended Learning)

11

Note 1: All Units will have internal choice.

Note 2: CIE consists of 3 components

(i) CIE 1, 2 and CIE-makeup(written tests) are conducted for 30 marks

(ii) Three assignments are evaluated for 10 marks

(iii) Group activity for 5 marks

(iv) Subject Seminar for 5 marks

Course Outcomes:

After successful completion of the course, the students will be able to:

CO1: Solve a variety of problems including engineering application problems using linear

algebra.

CO2: Connect linear algebra to other fields both within and without mathematics.

CO3: Develop abstract and critical reasoning by studying logical proofs and the axiomatic

methods as applied to linear algebra.

CO4: Follow complex logical arguments and develop modest logical arguments.

CO5: Demonstrate skills in understanding the mathematical knowledge.

CO’s Mapping with PO’s

COs Mapping with POs

CO1 PO1, PO2

CO2 PO1, PO2

CO3 PO1, PO3

CO4 PO1, PO4

CO5 PO1, PO3

TEXT BOOKS:

1. David C. Lay, Linear Algebra and its Applications, Pearson Education (Asia) Pvt. Ltd.

2. Scott L. Miller and Donald Childers, Probability and Random Processes, Academic

Press


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. A Papoullis and S U Pillai, "Probability, Random Variables and Stochastic Processes”,

McGraw Hill, 2002



Course objectives:

1. To learn digital modulation techniques, power spectra and ISI

2. To study convolutional coding and decoding for channel coding

3. To understand Communication through band limited linear filter channels and synchronisation

4. To study Spread spectrum digital communication

5. To learn fading multipath channels in digital communication







Sub Title : ADVANCED DIGITAL COMMUNICATION

Sub code:20LDN12 No. of Credits:3=2:2:0(L:T:P) No. of lecture hours per week: 4

Exam Duration: 3

Hours

CIE + SEE = 50+50 =100

Total No. of Contact Hours: 52

UNIT

No

Syllabus Content

No. of

Teaching

Hours

1 Digital modulation techniques: Digital modulation formats, Coherent

binary modulation techniques, Coherent quadrature – modulation

techniques, Non-coherent binary modulation techniques, Comparison of

binary and quaternary modulation techniques, M-ray modulation techniques,

Power spectra, Bandwidth efficiency, M-array modulation formats viewed

in the light of the channel capacity theorem, Effect of inter symbol

interference, Bit verses symbol error probabilities, Synchronization,

Applications.

10

2 Coding techniques: Convolutional encoding, Convolutional encoder

representation, Formulation of the convolutional decoding problem,

Properties of convolutional codes: Distance property of convolutional codes,

Systematic and nonsystematic convolutional codes, Performance Bounds for

convolutional codes, Coding gain, Other convolutional decoding algorithms,

Sequential decoding, Feedback decoding, Turbo codes.

10

3 Communication through band limited linear filter channels: Optimum

receiver for channel with ISI and AWGN, Linear equalization, Decision -

feedback equalization, Reduced complexity ML detectors, Iterative

equalization and decoding - Turbo equalization.

Adaptive equalization: Adaptive linear equalizer, adaptive decision

feedback equalizer, Adaptive equalization of Trellis - coded signals,

Recursive least square algorithms for adaptive equalization, Self recovering

(blind) equalization.

12

4 Spread spectrum signals for digital communication: Model of spread

spectrum digital communication system, Direct sequence spread spectrum

signals, Frequency hopped spread spectrum signals, CDMA, Time hopping

SS, Synchronization of SS systems.(Blended Learning)

10

5 Digital communication through fading multipath channels:

Characterization of fading multipath channels, the effect of signal

characteristics on the choice of a channel model, Frequency nonselective,

Slowly fading channel, Diversity techniques for fading multipath channels,

Digital signals over a frequency selective, Slowly fading channel, Coded

wave forms for fading channels, Multiple antenna systems.

10

Course Outcomes:

CO1. Student will be able to identify/ write about Digital modulation techniques, channels and

channel coding.

CO2. Student will be able to explain/ distinguish digital communication methods.

CO3. Student will be able to apply the knowledge to illustrate the concepts/ solve the

problems.

CO4. Student will be able to analyze digital communication systems by mathematical

derivation and investigations.

CO5. Student will be able to evaluate/ develop/ design communication systems.







TEXT BOOK:

1. John G. Proakis and Masoud Salehi, “Digital Communications”, Tata McGraw-Hill,

5th Edition, 2014.

2. Simon Haykin, “Digital Communications”, John Wiley India Pvt., Ltd, 2008.

REFERENCE BOOKS:

1. K. Sam Shanmugam, “Digital and Analog Communication Systems”, John Wiley

India Pvt. Ltd., 2012.

2. Simon Haykin, “An introduction to Analog and Digital Communication”, John Wiley

India Pvt. Ltd., 2006.

3. Bernard Sklar, “Digital Communications”, Pearson education, 2009.

Sub Title : ANTENNA DESIGN AND SYNTHESIS

Sub Code: 20LDN13 No. of Credits:3=2:2:0(L:T:P) No. of lecture hours per week:

4

Exam Duration: 3

Hours

CIE + SEE = 50+50 =100

Total No. of Contact Hours:

52

Course Objectives: This course will enable students to:

1. Introduce and discuss the different parameters and various terminologies.

2. To understand, Analyze Resonant antennas and broadband antennas .

3. Apply the concepts of arrays and Analyse different synthesis methods

4. To Define, analyze and Evaluate the concept of parabolic aperture antennas

5. To Analyze and Evaluate different method of moments.

Unit

No

Syllabus Content

No. of

Teaching

Hours

1 Antenna Fundamentals and Definitions: Radiation mechanism - over

view, Electromagnetic Fundamentals, Solution of Maxwell’s Equations for

Radiation Problems, Ideal Dipole, Radiation Patterns, Directivity and Gain,

Antenna Impedance, Radiation Efficiency.

10

2 Resonant Antennas: Dipole antennas, Yagi - Uda Antennas, Micro strip

Antenna.

Broad band Antennas: Traveling - wave antennas, Helical antennas,

Biconical antennas, sleeve antennas, and Principles of frequency -

independent Antennas, spiral antennas and Log - Periodic Antennas.

10

3 Arrays: Array factor for linear arrays, uniformly excited, equally spaced

Linear arrays, pattern multiplication, non- uniformly excited -equally spaced

linear arrays, multidimensional arrays, phased arrays, feeding

techniques.(Problems).

Antenna Synthesis: Formulation of the synthesis problem, synthesis

principles, line sources shaped beam synthesis, linear array shaped beam

synthesis — Fourier Series, Woodward — Lawson sampling method,

comparison of shaped beam synthesis methods, low side lobe narrow main

beam synthesis methods Dolph Chebyshev linear array, Taylor line source

method.

12

4 Aperture Antennas: Techniques for evaluating Gain, reflector antennas -

Parabolic reflector antenna principles, Axi -symmetric parabolic reflector

antenna, offset parabolic reflectors, dual reflector antennas, Gain calculations

for reflector antennas, feed antennas for reflectors, field representations,

matching the feed to the reflector, General Feed Model.(Blended Learning)

10

5 Method of Moments: Introduction to method of Moments, Pocklington’s

integral equation, integral equations and Kirchoff’s Networking Equations,

Source Modeling, Weighted residuals formulations and computational

consideration.

CEM for Antennas: Calculation of antenna and scatter characteristics.

Computational EM: FDTD methods, Geometrical optics, Wedge diffraction

theory, Ray fixed coordinate system, Uniform theory of wedge diffraction.

10







Course Outcomes : After studying this course, students will be able to

CO1. Define and classify the fundamental parameters of antennas.

CO2. Design various Resonant and broad band antennas.

CO3. Illustrate various types of array antennas and synthesize antenna problems using

mathematical models.

CO4. Analyze different antenna reflectors and their parameters

CO5. Able to analyze and apply the different algorithms MoM, FDTD etc.,

TEXT BOOKS:

1. Warren L Stutzman and Gary A Thiele, “Antenna Theory and Design”, 2nd edition, Wiley

India Pvt Ltd., 2012.

2. C A Balanis, “Antenna Theory: Analysis and Design”, Wiley India Pvt Ltd, 3rd edition,

2009.

REFERENCE BOOKS:

1. Ahmad S Khan, Ronald J Marhefka and John D Kraus, “Antennas and Wave

Propagation”, 4th Edition, McGraw-Hill Education, 2014.

2. Sachidananda et al, "Antennas and Propagation", Pearson Education, 2007.

3. J R James, P S Hall and C Wool “Microstrip Antennas: Theory and Design”, Peter

Peregrinns UK.

Cos Mapping with POs

CO1 PO1,PO2,PO3,PO4,PO8




CO5 PO1,PO2,PO3,PO4,PO7,PO8

https://www.flipkart.com/author/ahmad-s-khan

https://www.flipkart.com/author/ronald-j-marhefka

https://www.flipkart.com/author/john-d-kraus

Sub Title : ADVANCED COMPUTER NETWORKS

SubCode: 20LDN14 No. of Credits:3=2:2:0(L:T:P) No. of lecture hours per week:

4

Exam Duration : 3

hours

CIE + SEE = 50+50 =100

Total No. of Contact Hours :

52

Course Objectives : 1. To study the various Telephone networks, multiplexing techniques and Access systems.

2. To study the different LANs.

3. To understand concepts of Scheduling schemes and ATM network protocols and their addressing

routing.

4. To study of various network protocols and traffic management models.

5. To analyze problems in various modelling methods in networks and different routing algorithms

UNIT

No

Syllabus Content

No of Hours

1 Introduction: Computer network, Telephone networks, Networking

principles (Text1), Protocol layering (Text2). Multiplexing - FDM,

TDM, SM (Text1). Multiple access: Introduction, Choices and

constraints, base technologies, centralized and distributed access

schemes (Text2)

10

2 Local Area networks: Ethernet - Physical layer, MAC, LLC, LAN

Interconnection, Token ring- Physical layer, MAC, LLC,

FDDI(Text1). Switching - Circuit switching, Packet switching,

Multicasting(Text2).

10

3 Scheduling: Performance bounds, Best effort connections, Naming

and addressing, (Text2),

ATM Networks- Features, signaling and routing, header and

adaptation layers, ATM addressing, Signaling and Routing, (Text1),

SONET/SDH, Protocol Stack, Virtual circuits, SSCOP, AAL

(Text 2)

12

4 Internet Protocol: IP, TCP, UDP, HTTP (Text1). Traffic management: Introduction, framework for traffic

management, traffic models, traffic classes, traffic scheduling (Text2).

10

5 Control of Networks: QoS, Static and dynamic routing, Markov

chains, Queuing models, Bellman Ford and Dijkstra's algorithm

(Text 1).

Congestion and flow control:

Window and rate congestion control, Large deviations of a queue and

network (Text1), Open and closed loop flow control(Text2). (Blended

Learning)

10







Course Outcomes :

CO1: Student will be able to Study various telephone networks, multiplexing techniques

and Access systems.

CO2. Student will be able to Study different LANs and Scheduling schemes.

CO3. Student will be able to Able to understand ATM network protocols and their

addressing routing.

CO4. Student will be able to Study of various network protocols and traffic management

models.

CO5. Student will be able to Analyze problems in various modeling methods in networks

and different routing algorithms


CO1 PO1, PO2,PO4,PO5,PO6




CO5 PO1, PO2,PO4,PO5,PO6,PO8

TEXT BOOKS:

1. J Walrand and P Varaya, "High Performance Communication Networks", Harcourt Asia

(Morgan Kaufmann), 2000.

2. S Keshav, “An Engineering approach to Computer Networking”, Pearson Education, 1997.


1. A Leon-Garcia, and I Widjaja, "Communication Network: Fundamental Concepts and Key

Architectures", Tata McGraw-Hill, 2000.

2. J F Kurose, and K W Ross, "Computer Networking: A top down approach featuring the

Internet", Pearson Education, 2001.

Course Objectives : This course will enable students to:

1. Understand and remember the fundamental principles and evolution of optical

communication.

2. Understand and discuss the concepts of components and modulation and Demodulation

required for optical networks.

3. Analyze and understand the power multiplexing methods required in network scenarios.

4. Remember and analyze the routing techniques in wavelength routing networks.

5. Organize and interpret different types of control and Managements in optical networks.

UNIT

No.

Syllabus Content

No. of

Hours

Teaching

1 INTRODUCTION TO OPTICAL NETWORKS:

Telecommunication networks, First generation optical networks,

Multiplexing techniques, Second generation optical networks, System

and network evolution. Non linear effects SPM, CPM, four wave

mixing, Solitons.

08

2 Components: Couplers, isolators and Circulators, Multiplexes and

filters, Gratings, Optical amplifiers.

Modulation - Demodulation: Formats, Ideal receivers, Practical

detection receivers, Optical preamplifiers, Noise considerations, Bit

error rates, Coherent detection.

12

3 Transmission system engineering: System model, Power penalty,

Transmitter, Receiver, Different optical amplifiers, Dispersion.

Optical Networks: Client layers of optical layer, SONET/SDH,

Multiplexing, layers, Frame structure, ATM functions, Adaptation

layers, Quality of Service (QoS) and flow control, ESCON, HIPPL.

10

4 Wavelength routing networks: Optical layer, Node design, Network

design and operation, routing and wavelength assignment architectural

variations.

WDM network elements: Optical line terminal, Optical line amplifiers,

Optical cross connectors, WDM network design, Cost trade-offs, LTD

and RWA problems, Routing and wavelength assignment, Wavelength

conversion, Statistical dimensioning model.

12

5 Control and management: Network management functions,

management framework, Information model, management protocols,

Layers within optical layer performance and fault management, Impact

of transparency, BER measurement, Optical trace, Alarm management,

Configuration management. (Blended Learning)

10




Sub Title: OPTICAL COMMUNICATION AND NETWORKING

Sub Code: 20LDN151 No. of Credits:3=2:2:0(L:T:P) No. of lecture hours per week: 4

Exam Duration:3

Hours

CIE + SEE = 50+50 =100 Total No. of Contact Hours : 52




Course Outcomes : After studying this course, students will be able to

CO1. Decide which technologies are best suited to the demands of network.

CO2. Assess right to deploy new technology.

CO3. Problem solving skills and critical thinking in the discipline of optical networks.

CO4. New employment opportunities in the technological sector in association with industries.

CO5. Understand different management functions in optical communications.

TEXT BOOK:

1. Kumar Sivarajan and Rajiv Ramaswamy, “Optical networks: A practical perspective”,

Morgan Kauffman, 1998.

2. Rajiv Ramswami and K. N. Sivarajan, "Optical Networks", Third edition, Morgon

Kauffman Publishers, 2009. REFERENCE BOOKS:

1. Biswajit Mukherjee, “Optical Communication Networks” TMG 1998.

2. Ulysees Black, “Optical Networks”, Pearson Education, 2007.

3. John M. Senior, "Optical Fiber Communication", Pearson Edition, 2000.

4. Gerd Kaiser, "Optical fiber Communication Systems", John Wiley, New York, 1997.

5. P. E. Green, "Optical Networks", Prentice Hall, 1994.


CO1 PO1,PO2,PO4

CO2 PO1,PO2,PO4,PO5

CO3 PO1,PO2,PO4,PO8



Course Objectives:

1. To learn the technologies and challenges of Wireless Sensor Networks.

2. To study the architecture of node and networks.

3. To understand various protocols of Wireless Sensor Networks.

4. To learn the topology control and positioning of nodes.

5. To get familiarized with different platforms and tools needed for Wireless Sensor

Networks.

UNIT No. Syllabus Content

No. of

Hours

Teaching

1

OVERVIEW OF WIRELESS SENSOR NETWORKS

Challenges for Wireless Sensor Networks, Enabling Technologies For

Wireless Sensor Networks, Mobile Ad-Hoc Networks, 4G LTE and

applications.

08

2

ARCHITECTURES

Single-Node Architecture - Hardware Components, Energy

Consumption of Sensor Nodes, Operating Systems and Execution

Environments, Network Architecture - Sensor Network Scenarios,

Optimization Goals and Figures of Merit, Gateway Concepts.

12

3

NETWORKING SENSORS

Physical Layer and Transceiver Design Considerations, MAC Protocols

for Wireless Sensor Networks, Low Duty Cycle Protocols And Wakeup

Concepts - S-MAC, B- MAC, IEEE 802.15.4 standard and Zigbee,

Dissemination protocol for large sensor network. The Mediation Device

Protocol, Wakeup Radio Concepts, Address and Name Management,

Assignment of MAC Addresses, Routing Protocols- Energy-Efficient

Routing, Geographic Routing.

12

4 INFRASTRUCTURE ESTABLISHMENT

Topology Control, Clustering, Time Synchronization, Localization and

Positioning, Sensor Tasking and Control. 10

5

SENSOR NETWORK PLATFORMS AND TOOLS

Sensor Node Hardware – Berkeley Motes, Programming Challenges,

Node-level software platforms, Node-level Simulators, State-centric

programming. (Blended Learning)

10







Sub Title: WIRELESS SENSOR NETWORKS

Sub Code: 20LDN152 No. of

Credits:3=2:2:0(L:T:P)

No. of lecture hours per week: 4

Exam Duration: 3

Hours

CIE + SEE = 50+50 =100


52

Course Outcomes :

CO1. Learnt the technologies and challenges of Wireless Sensor Networks.

CO2. Understood the architecture of sensor node and networks.

CO3. Understood various protocols of Wireless Sensor Networks.

CO4. Learnt the topology control and positioning of nodes.

CO5. Studied the different platforms and tools for Wireless Sensor Networks.


CO1 PO1, PO2, PO5

CO2 PO1, PO2, PO4

CO3 PO1, PO2, PO5

CO4 PO1, PO2


TEXT BOOKS:

1. Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor

Networks” John Wiley, 2005.

2. Feng Zhao and Leonidas J. Guibas, “Wireless Sensor Networks- An Information

Processing Approach", Elsevier, 2007.

3. Raghavendra, Cauligi S, Sivalingam, Krishna M, Zanti Taiev. “Wireless Sensor

Networks”, Spinger 1st Edition 2004.

REFERENCE BOOKS:

1. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.

2. Kazem Sohraby, Daniel Minoli, and Taieb Znati, “Wireless Sensor Networks

Technology, Protocols and applications”, Wiley Publications, 2013.

3. K Akkaya and M. Younis, “A survey of routing protocols in wireless sensor networks”, Elsevier Ad Hoc Network Journal, Vol. 3, no. 3, pp. 325—349.

4. N P Mahalik, “Sensor Networks and Configuration- Fundamentals , standards , platforms and applications”, Spinger verlag, 2007.

Course Objectives :

1. To expose the students to the fundamentals of embedded system design.

2. To study in Hardware Software Co-Design.

3. To design and develop embedded hardware and firmware.

4. To study the Cortex M3 Programming, Exceptions Programming, Advanced Programming

Features.

5. To impart knowledge on ARM Cortex-M3 to enable students to acquire more awareness

on real time embedded applications.


No. of

Hours

Teaching

1 Typical Embedded System: Core of the Embedded System, Memory,

Sensors and Actuators, Communication Interface, Embedded Firmware,

Other System Components. Characteristics and Quality Attributes of

Embedded Systems: Hardware Software Co-Design and Program

Modeling: Fundamental Issues in Hardware Software Co-Design,

Computational Models in Embedded Design, Introduction to Unified

Modeling Language, Hardware Software Trade-offs

10

2 Embedded Hardware Design and Development :EDA Tools, How to

Use EDA Tool, Schematic Design – Place wire, Bus , port, junction,

creating part numbers, Design Rules check, Bill of materials, Netlist

creation , PCB Layout Design – Building blocks, Component placement,

PCB track routing.

12

3 ARM -32 bit Microcontroller family. Architecture of ARM Cortex M3

–General Purpose Registers, Stack Pointer, Link Register, Program

Counter, Special Register,. Nested Vector Interrupt Controller. Interrupt

behavior of ARM Cortex M3. Exceptions Programming. Advanced

Programming Features. Memory Protection. Debug Architecture.

10

4 Embedded Firmware Design and Development: Embedded Firmware

Design Approaches, Embedded Firmware Development Languages Real-

Time Operating System (RTOS) based Embedded System Design: Operating System Basics, Types of OS, Tasks, Process and Threads,

Multiprocessing and Multitasking, Task Scheduling, Threads, Processes

and Scheduling: Putting them altogether, Task Communication, Task

Synchronization, Device Drivers, How to Choose an RTOS

10

5 The Embedded System Development Environment: The Integrated

Development Environment (IDE), Types of Files Generated on Cross

compilation, Disassembler/ELDompiler, Simulators, Emulators and

Debugging, Target Hardware Debugging, Boundary Scan. studies.

(Blended Learning)

10

Sub Title: ADVANCED EMBEDDED SYSTEM DESIGN


Exam Duration: 3

Hours

CIE + SEE = 50+50 =100 Total No. of Contact Hours : 52







Course Outcomes :

1. Able to understand the fundamental concepts of embedded system.

2. Able to design suitable embedded systems for real world applications.

3. Indulging ARM Cortex-M3 concepts in real time scenarios.

4. Able to understand Embedded firmware design approaches.

5. Able to understand Integrated development environment.


CO1 PO4, PO5, PO6


CO3 PO, PO6, PO7, PO8

CO4 PO4, PO5, PO6


Text Books / References:

1. Shibu K V, “Introduction to Embedded Systems”, Tata McGraw Hill Education Private

Limited, 2009

2. “Cortex M3 Technical Reference Manual,” by ARM.

3. James K Peckol, “Embedded Systems – A contemporary Design Tool”, John Weily, 2008.

Course Objectives :

1. To become familiar with basic probability theory.

2. To learn random variables and random processes.

3. To analyze the characteristics of random variables and random process.

4. To apply random variables and random process to communication systems and networks.

5. To learn properties of probability, random variables, and random process.

UNIT

No.

Syllabus Content

No. of

Hours

Teaching

1 Introduction to Probability Theory: Experiments, Sample space, Events,

Axioms, Assigning probabilities, Joint and conditional, Baye's theorem, Independence, Discrete random variables, Random variables, Distributions, Density functions: CDF, PDF, Gaussian random variable, Uniform, Exponential, Laplace, Gamma, Erlang, Chi-square, Rayleigh, Rician and Cauchy types of random variables.

10

2 Operation on a Single Random Variable: Expected value, EV of random

variables, EV of functions of random variables, Central moments, Conditional Expected values.

10

3 Characteristics Functions: Probability generating functions,

Moment generating function, Engineering applications, Scalar

quantization, Entropy and source coding. 10

4 Pairs of Random Variables: Joint PDF, Joint probability mass

functions, Conditional distribution, Density and mass functions, EV

involving pairs of random variables, Independent random variables,

Complex random variables. Multiple random variables: Joint and

conditional PMF, CDF, PDF, EV involving multiple random variables,

Gaussian random variable in multiple dimension, Linear prediction.

12

5 Random Process: Definition and characterization, Mathematical tools

for studying random processes, Stationery and Ergodic random processes,

Properties of ACF. Example Processes: Markov processes, Gaussian

processes, Poisson processes, Computer networks, Telephone networks.

(Blended Learning)

10




Sub Title: PROBABILITY AND RANDOM PROCESS

Sub Code: 20LDN154 No. of

Credits:3=2:2:0(L:T:P)

No. of lecture hours per week: 4

Exam Duration: 3 Hours CIE + SEE = 50+50 =100 Total No. of Contact Hours : 52




Course Outcomes :

CO1. Student will be able to understand the basics definitions of probability and related terms.

CO2. Student will be able to understand the different random variables and various operations

on it.

CO3. Student will be able to work on various pairs of random variables and its application in real

world.

CO4. Student will be able to analyze the different multiple random variables and their

engineering applications.

CO5. Student will be able to understand the random process and few examples

TEXT BOOKS:

1. S L Miller and D C Childers, "Probability and Random Processes: Application to

Signal Processing and Communication", Academic press/Elsevier, 2004.

REFERENCE BOOKS:

1. A Papoullis and S U Pillai, "Probability, Random Variables and Stochastic Processes”,

McGraw Hill, 2002



3. H Stark and Woods, "Probability, Random Processes and Application", PHI, 2001.







Course Objectives :

1. To study fundamentals of Wireless communication networks, their issues and standards.

2. To study WBAN technology, its architecture, design issues, protocols and applications

3. To study WPAN technology, its architecture, design issues, protocols, components and

applications.

4. To study WLAN components, design requirements, WMAN architecture, protocols and

applications.

5. To study WWANs, cellular networks, Satellite Network, Applications, ad-hoc networks, Sensor

network.

UNIT

No.

Syllabus Content

No. of

Hours

Teaching

1 Review of fundamentals of wireless communication and Networks:

Wireless communication channel specifications, Wireless

communication systems, Wireless networks, Switching technology,

Communication problems, Wireless network issues and standards.

10

2 Wireless body area networks: Properties, Network architectures,

Components, Design issues, Network Protocols, WBAN technologies

and WBAN applications.

10

3 Wireless personal area networks: Network Architectures, WPAN

Components, Requirements of WPAN devices, WPAN Technologies

and protocols, WPAN applications, Bluetooth and Zigbee.

8

4 Wireless LANs: Network components, design requirements,

Architectures, IEEE-802.11x, WLAN protocols, 802.11p and

applications. WMANs, IEEE-802.16: Architectures, Components,

WiMax mobility support, Protocols, Broadband networks and

applications.

12

5 WWANs, cellular networks, Satellite Network, Applications. Wireless

ad-hoc networks: Mobile ad-hoc networks, Sensor network, Mesh

networks, VANETs, Research issues in Wireless networks. (Blended

Learning)

12







Course Outcomes :

CO1: Have complete knowledge fundamentals of wireless communication and Networks and

their applications.

CO2: Identify the different wireless networks like WBAN, WMAN, WLAN, WMAN,

Sub Title: WIRELESS AND MOBILE NETWORKS


Exam Duration : 3

hours

CIE + SEE = 50+50 =100

Total No. of Contact Hours : 52

WMAN and understand their architecture and their components.

CO3: Understand and interpret the protocols and standards in different Wireless

communication and networks.

CO4: Analyze the various design issues in WMAN, WLAN, WMAN, WMAN.

CO5: Determine the applications of Wireless communication networks, Adhoc networks and

Sensor Networks.


CO1 PO2, PO5

CO2 PO2, PO4,PO5

CO3 PO5

CO4 PO2,PO8

CO5 PO5

TEXT BOOK:

1. S S Manvi, and M. S. Kakkasageri, "Wireless and Mobile network concepts and Protocols",

Wiley India Pvt Ltd, 2010.

REFERENCE BOOKS: 1. P Kaveh, Krishnamurthy, "Principles of Wireless network: A unified approach", PHI, 2006.

2. Iti Saha Mitra, "Wireless communication and network: 3G and Beyond", McGraw Hill,

2009.

3. Ivan Stojmenovic, "Handbook of Wireless networks and Mobile Computing", Wiley, 2009.

4. P Nicopolitidis, M. S. Obaidat, et al, "Wireless Networks", Wiley, 2009.

5. Yi-Bing Lin, Imrich Chlamtac, "Wireless and Mobile Network Architectures", Wiley, 2009.

6. Mullet, "Introduction to Wireless Telecommunication Systems and Networks", Cengage,

2009.

Course Objectives : This course will enable students to:

1. Understand the process of simulation and modeling 2. Learn simulation of deterministic and probabilistic models, with a focus of statistical data analysis and simulation data.

Sub Title : MODELING AND ANALYSIS


Exam Duration : 3

hours

CIE + SEE = 50+50 =100 Total No. of Contact Hours: 52

UNIT

No.

Syllabus Content

No. of

Teaching

Hours

1 Random Number Generators: Linear congruential Generators, Other kinds, Testing number generators, Generating the Random Variates: General approaches, Generating continuous random variates, Generating discrete random variates, Generating random vectors, and correlated random variants, Generating arrival processes (7.2, 7.3, 7.4, 8.2, 8.3, 8.4, 8.5, 8.6 of Text). (1.1, 1.2, 1.3, 1.4, 1.4.1, 1.4.2, 1.4.3, 1.5, 1.5.1, 1.5.2, 1.6, 1.7, 1.8, 1.9 of Text)

10

2 Review of Basic Probability and Statistics Random Variables and their properties, Simulation Output Data and Stochastic Processes, Estimation of Means, Variances and Correlations, Confidence Intervals and Hypothesis tests for the Mean Building valid, credible and appropriately detailed simulation models: Introduction and definitions, Guidelines for determining the level of models detail, Management’s Role in the Simulation Process, Techniques for increasing model validity and credibility, Statistical procedure for comparing the real world observations and simulation output data. (4.2, 4.3, 4.4, 4.5, 5.1, 5.2, 5.4, 5.5,5.6, 5.6.1, 5.6.2 of Text)

12

3 Selecting Input Probability Distributions: Useful probability distributions, activity I, II and III. Shifted and truncated distributions; Specifying multivariate distribution, correlations, and stochastic processes; Selecting the distribution in the absence of data, Models of arrival process. (6.2, 6.4, 6.5, 6.6, 6.8, 6.10, 6.11, 6.12 of Text).

12

4 Random Number Generators: Linear congruential Generators, Other kinds,Testing, number generators, Generating the Random Variates: General approaches, Generating continuous random variates, Generating discrete random variates, Generating random vectors, and correlated random variants, Generating arrival processes (7.2, 7.3, 7.4, 8.2, 8.3, 8.4, 8.5, 8.6 of Text).

10

5 Output data analysis for a single system: 08







Course Outcomes : After studying the course students will be able to:

1. Define the need of simulation and modeling. 2. Describe various simulation models. 3. Discuss the process of selecting of probability distributions. 4. Perform output data analysis.


CO1 PO1,PO2,PO4

CO2 PO1,PO2,PO4,PO5

CO3 PO1,PO2,PO4,PO5


CO5 PO1,PO2,PO5,PO8

TEXT BOOK:

1. Averill Law, "Simulation modeling and analysis", McGraw Hill 4th edition, 2007.

REFERENCE BOOKS:

1. Tayfur Altiok and Benjamin Melamed, “Simulation modeling and analysis with ARENA”,

Elsevier, Academic press, 2007.

2. Jerry Banks, "Discrete event system Simulation", Pearson, 2009

3. Seila Ceric and Tadikamalla, "Applied simulation modeling", Cengage, 2009.

4. George. S. Fishman, "Discrete event simulation", Springer, 2001.

5. Frank L. Severance, "System modeling and simulation", Wiley, 2009.

Transient and steady state behavior of a stochastic process; Types of simulations with regard to analysis; Statistical analysis for terminating simulation; Statistical analysis for steady state parameters; Statistical analysis for steady state cycle parameters; Multiple measures of performance, Time plots of important variables. (Blended Learning) (9.2, 9.3, 9.4, 9.4.1, 9.4.3, 9.5, 9.5.1, 9.5.2, 9.5.3, 9.6, 9.7, 9.8 of Text)

Course Objectives :

This course will enable students to: 1. Acquire fundamental knowledge in understanding the representation of digital image and its properties. 2. Equip with various image transform and enhancement techniques. 3. Learn the technique of eliminating the effects of degradation in the image. 4. Select the region of interest using segmentation techniques. 5. Exposure to various multispectral analysis techniques


No. of

Hours

Teaching

1

Digital image fundamentals: Introduction: Digital Image- fundamental steps of Digital Image Processing Systems, Sampling and quantization, Elements of Visual Perception, Connectivity and Relations between Pixels, Arithmetic, Logical, Spatial Operations.

10

2

Image transforms and enhancement: Image Transforms: 2D Orthogonal and Unitary Transforms-

Properties and examples. 2D DFT- FFT – DCT - Hadamard Transform - Haar Transform - Slant Transform - KL Transform -Properties and Examples. Image Enhancement: Histogram Equalization Technique, Fundamentals of spatial filtering, Smoothing Spatial filters.

10

3

Image restoration and reconstruction: Image Restoration: Restoration in the presence of noise, Linear-position-invariant degradation. Reconstruction: Projections and the Radon Transform, Reconstruction using Parallel-Beam filtered back projections.

10

4

Segmentation: Edge Detection - Line Detection - Curve Detection - Edge Linking And Boundary Extraction, Boundary Representation, Region Representation And Segmentation, Morphology-Dilation, Erosion, Opening And Closing. Hit And Miss Algorithms Feature Analysis.

12

5

Color and multispectral image processing: Color Image-Processing Fundamentals: RGB Models, HSI Models, Relationship Between Different Models. Multispectral Image Analysis: Three Dimensional Image Processing, Computerized Axial Tomography, Stereoscopic Image Display, Shaded Surface Display. (Blended Learning)

10

Sub Title : ADVANCES IN IMAGE PROCESSING


Exam Duration: 3 hours CIE + SEE = 50+50 =100 Total No. of Contact Hours : 52







Course Outcomes : 1. Understanding of the representation of digital images and its properties.

2. Knowledge of applicability of transforms in image processing and enhancement techniques. 3. Use of restoration techniques to improve the quality of image which has undergone various degradations. 4. Use of segmentation techniques to select the region of interest in the image for analysis. 5. Knowledge of various color models, three dimensional image processing.







TEXT BOOKS: 1. Digital Image Processing, Gonzalez.R.C & Woods. R.E., 3/e, Pearson Education, 2008.

2. Fundamentals of Digital image Processing, Anil K Jain, Prentice Hall of India, 2004.

REFERENCE BOOKS: 1. Digital Image Processing, Kenneth R Castleman, Pearson Education, 1996.

2. Digital Image Processing, S. Jayaraman, S. Esakkirajan, T. Veerakumar, McGraw Hill

Education, 2009.

Course Objectives :

This course will enable students to: 1. Discuss layered architecture for communication networks and the specific functionality of the network layer. 2. Explain the basic principles of routing and the manner, this is implemented in conventional networks and the evolving routing algorithms based on Internetworking requirements, optical backbone and the wireless access part of the network. 3. Compare and contrast different routing algorithms existing and their performance characteristics


No. of

Hours

Teaching

1

NETWORK ROUTING: BASICS AND FOUNDATIONS: Networking and Network Routing: An Introduction: Addressing and Internet Service: An Overview, Network Routing: An Overview, IP Addressing, On Architectures, Service Architecture, Protocol Stack Architecture, Router Architecture, Network Topology Architecture, Network Management Architecture, Public Switched Telephone Network, Communication Technologies, Standards Committees, Last Two Bits. Routing Algorithms: Shortest Path and Widest Path: Bellman–Ford Algorithm and the Distance Vector Approach, Dijkstra’s Algorithm, Comparison of the Bellman–Ford Algorithm and Dijkstra’s Algorithm, Shortest Path Computation with Candidate Path Caching, Widest Path Computation with Candidate Path Caching, Widest Path Algorithm, k-Shortest Paths Algorithm Routing Protocols: Framework and Principles: Routing Protocol, Routing Algorithm, and Routing Table, Routing Information Representation and Protocol Messages, Distance Vector Routing Protocol, Link State Routing Protocol, Path Vector Routing Protocol, Link Cost

10

2

ROUTING IN IP NETWORKS: IP Routing and Distance Vector Protocol Family : Routers, Networks, and Routing Information: Some Basics, Static Routes, Routing Information Protocol, Version 1 (RIPv1), Routing Information Protocol, Version 2 (RIPv2), Interior Gateway Routing Protocol (IGRP), Enhanced Interior Gateway Routing Protocol (EIGRP), Route Redistribution OSPF and Integrated IS-IS :From a Protocol Family to anInstanceof a Protocol, OSPF: Protocol Features, OSPF Packet Format, Examples of Router LSAs and Network LSAs, Integrated

12

Sub Title : NETWORK ROUTING ALGORITHMS


Exam Duration: 3 hours CIE + SEE = 50+50 =100 Total No. of Contact Hours : 52

IS-IS, Similarities and Differences Between IS-IS and OSPF Internet Routing Architectures: Internet Routing Evolution, Addressing and Routing: Illustrations, Current Architectural View of the Internet, Allocation of IP Prefixes and AS Number, Policy-Based Routing, Point of Presence, Traffic Engineering Implications, Internet Routing Instability

3

Router Architectures: Functions of a Router, Types of Routers, Elements of a Router, Packet Flow, Packet Processing: Fast Path versus Slow Path, Router Architectures. IP Address Lookup Algorithms: Impact of Addressing on Lookup, Longest Prefix Matching, Naïve Algorithms, Binary Tries, Multibit Tries, Compressing Multibit Tries, Search by Length Algorithms, Search by Value Approaches, Hardware Algorithms, Comparing Different Approaches. IP Packet Filtering and Classification: Importance of Packet Classification, Packet Classification Problem, Packet Classification Algorithms, Naïve Solutions, Two-Dimensional Solutions, Approaches ford Dimensions, Extending Two-Dimensional Solutions, Divide and Conquer Approaches, Tuple Space Approaches, Decision Tree Approaches, Hardware-Based Solutions

12

4

ADVANCED ROUTING PROTOCOLS FOR WIRELESS NETWORKS: Wireless networking basic aspects, Basic routing concepts, AD hoc routing, Mesh routing, Vehicular routing, Sensor routing

08

5

TOWARD NEXT GENERATION ROUTING: Quality of Service Routing: QoS Attributes, Adapting Shortest Path and Widest Path Routing: A Basic Framework, Update Frequency, Information Inaccuracy, and Impact on Routing, Lessons from Dynamic Call Routing in the Telephone Network, Heterogeneous Service, Single-Link Case, A General Framework for Source-Based QoS Routing with Path Caching, Routing Protocols for QoS Routing MPLS and GMPLS: Traffic Engineering Extension to Routing Protocols, Multiprotocol Label Switching, Generalized MPLS, MPLS Virtual Private Networks. Routing and Traffic Engineering with MPLS: Traffic Engineering of IP/MPLS Networks, VPN Traffic Engineering, Routing/Traffic Engineering for Voice Over MPLS. VoIP Routing: Interoperability through IP and PSTN : PSTN Call Routing Using the Internet, PSTN Call Routing: Managed IP Approach, IP-PSTN Interworking for VoIP, IP Multimedia Subsystem, Multiple Heterogeneous Providers Environment and All-IP Environment of VoIP Services. (Blended Learning)

12







Course Outcomes : At the end of the course the students will be able to:

1. Given the network and user requirements and the type of channel over which the network has to operate, the student would be in a position to apply his knowledge for identifying a suitable routing algorithm, implementing it and analyzing its performance. 2. The student would also be able to design a new algorithm or modify an existing algorithm to satisfy the evolving demands in the network and by the user applications.







TEXT BOOKS:

1. Deepankar Medhiand Karthikeyan Ramasamy, “Network Routing: Algorithms, Protocols,

and Architectures”, (The Morgan Kaufmann Series in Networking ), Elsevier Inc 2007

2. Miguel Elias M. Campista and Marcelo G. Rubinstein, “Advanced Routing Protocols for

Wireless Networks”, John Wiley & Sons, Inc, © ISTE Ltd 2014

Reference Books:

1. William Stallings, “High speed networks and Internets Performance and Quality of

Service”, 2nd Edition, Pearson Education Asia. Reprint India 2002.

2. M. Steen Strub, “Routing in Communication network,” Prentice –Hall International,

Newyork, 1995.

3. James D. McCabe, “Network Analysis, Architecture, and Design”, 3rd Edition, 2007

Elsevier Inc.

NOTE: Experiments can be done using Hardware tools and Software tools based experiments

can be done using, FEKO simulator.

1. Experimental study of radiation pattern of different antennas.

2. Measurement techniques of radiation characteristics of an antenna.

3. Determine the directivity and gains of Horn/ Yagi/ dipole/ Parabolic antennas.

4. Determination of the modes transit time, electronic timing range and sensitivity of klystron

source.

5. ASK modulation and Demodulation technique using (CD401 IC /KIT)

6. FSK modulation and Demodulation technique using (CD401 IC /KIT)

7. PSK modulation and Demodulation technique using (CD401 IC /KIT)

FEKO Experiments

8. Design of dipole antenna using FEKO

9. Design of Yagi antenna using FEKO

10. Design of Horn antenna using FEKO

Study Experiments:

Design of parabolic, Magic Tee, Directional Coupler using FEKO TOOL


CO1 PO1,PO2,PO3,PO4

CO2 PO1,PO2,PO3,PO4,PO5, O6,PO8

CO3 PO1,PO2,PO3,PO4

CO4 PO1,PO2,PO3,PO4

CO5 PO1,PO2,PO3,PO4,PO5, PO6, PO8

Sub Title : ADVANCED COMMUNICATION LAB

Sub Code: 20LDNL17 No. of Credits: 2=0:0:2(L:T:P) No of lecture hours per week: 3

Exam Duration:3 Hours CIE + SEE = 50+50 =100

Course Outcomes:

CO1. Able to apply theoretical knowledge to demonstrate radiation pattern of different antenna

CO2. Able to implement digital communication techniques

CO3. Able to conduct the experiments on different antenns.

CO4. Able to conduct the experiments on microwave benches.

CO5. Able to design and simulate different antennas

Course objectives:

1. To apply theoretical knowledge to demonstrate radiation pattern of different antenna.

2. To study and understand digital modulation techniques.

3. To conduct the experiments on microwave benches.

4. To demonstrate radiation pattern/Impedance measurement.

5. To study design of broadband and aperture antennas.


SCHEME OF TEACHING AND EXAMINATION (Autonomous) for Academic Year 2020-21

M. Tech in Computer Network Engineering

Batch:2020-2021

I semester

Sl.

N

o.

Sub

Code

Subject

Title

Teaching

Departm

ent

Teaching hours per week Maximum

Marks allotted

Examinati

on

Credits Lectu

re

Tutorial/

Seminar/

Assignm

ent

Practic

al

/

Projec

t

CI

E

SE

E

Tot

al

1. 20SCN1

1

Probability

Statistics

and

Queuing

theory

MAT 4 - - 50 50 100 3

2. 20SCN1

2

Advances

in

Computer

Networks

ISE

4 - - 50 50 100 3

3. 20SCN1

3

Cryptogra

phy and

Network

Security

ISE

4 - - 50 50 100 3

4. 20SCN1

4

Cloud

Computin

g

ISE

4 - - 50 50 100 3

5. 20SCN1

5X

ELECTIVE

– I

ISE 4 - - 50 50 100 3

6. 20SCNL1

6

Computer

Networks

and CNS

Laborator

y

ISE

- - 3 50 50 100 2

7. 20SCNS1

7

Technical

Seminar

ISE - 2 - 50 - 50 2

8. 20SCNM

18 Mini

project/

ISE - - 6 50 - 50 2

Industry

visit/

Field work

Total 40

0

30

0 700 21

Technical Seminar: Seminar on Advanced topics from refereed journals by each student.

ELECTIVE I

Sl .No Name of the Subject Subject Code

1 Wireless Ad Hoc Networks 20SCN151

2 Internet of Things 20SCN152

3 Trends In Artificial Intelligence And Soft Computing 20SCN153

4 Advanced Storage Area Networks 20SCN154

Sub Title : PROBABILITY STATISTICS AND QUEUING THEORY

SubCode:20SCN11 No. of Credits:3= 3:0:0 (L-T-P) No.of Lecture Hours/Week :4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100


52

Course Objectives:

1.Develop analytical capability and to impart knowledge of Probability, Statistics and Queuing.

2. Apply above concepts in Engineering and Technology.

3.Acquire knowledge of Hypothesis testing and Queuing methods and their applications so as to

enable them to apply them for solving real world problems

UNIT

No

Syllabus Content

No of

Hours

1 Axioms of probability, Conditional probability, Total probability, Baye’s

theorem, Discrete Random variable, Probability mass function, Continuous

Random variable. Probability density function, Cumulative Distribution

Function, and its properties, Two-dimensional Random variables, Joint pdf /

cdf and their properties

12

2 Probability Distributions / Discrete distributions: Binomial, Poisson Geometric

and Hyper-geometric distributions and their properties. Continuous

distributions: Uniform, Normal, exponential distributions and their properties

10

3 Random Processes: Classification, Methods of description, Special classes,

Average values of Random Processes, Analytical representation of Random

Process, Autocorrelation Function, Cross-correlation function and their

properties, Ergodicity, Poisson process, Markov Process and Markov chain.

10

4 Testing Hypothesis: Testing of Hypothesis: Formulation of Null hypothesis,

critical region, level of significance, errors in testing, Tests of significance for

Large and Small Samples, t-distribution, its properties and uses, F-distribution,

its properties and uses, Chi-square distribution and its properties and uses, χ2

– test for goodness of fit, χ2 test for independence.

10

5 Symbolic representation of a Queuing Model, Poisson Queue system, Little

Law, Types of Stochastic Processes, Birth-Death Process, The M/M/1 Queuing

System, The M/M/s Queuing System, The M/M/s Queuing with Finite buffers.

10

Note 1: All units will have internal choice

Note 2: Three Assignments are evaluated for 10 marks:

Assignment – I from Units 1 and 2.

Assignment – II from Units 3 and 4

Assignment -III from Unit 5

Note 3:Subject Seminar and Group activity is evaluated for 10 marks

Course Outcomes:

After the completion of the above course students will be able to:

CO1: Demonstrate use of probability and characterize probability models using probability mass

(density) functions & cumulative distribution functions.

CO2: Explain the techniques of developing discrete & continuous probability distributions and its

applications.

CO3: Outline methods of Hypothesis testing for goodness of fit

CO4: Define the terminology &nomenclature appropriate queuing theory and also distinguish various

queuing models.






TEXT BOOKS:

1. Probability, Statistics and Queuing Theory, V. Sundarapandian, Eastern Economy Edition, PHI Learning Pvt. Ltd, 2009.

REFERENCE BOOKS / WEBLINKS:

1. Probability & Statistics with Reliability, Queuing and Computer Applications, 2 nd Edition by Kishor. S. Trivedi , Prentice Hall of India ,2004.

2. Probability, Statistics and Random Processes, 1st Edition by P Kausalya, Pearson Education, 2013.

Course Title : ADVANCES IN COMPUTER NETWORKS

CourseCode: 20SCN12 No. of Credits:3=3: 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100


Course objectives:

1. Overview of Computer Networks.

2. To understand various Network architectures.

3. Concepts of network protocols.

4. To become familiar with the network traffic, congestion, controlling and resource allocation.

Unit

No.

Syllabus

No of

Hours

1 Introduction: Building a Network, Requirements, Perspectives, Scalable Connectivity,

Cost-Effective Resource sharing, Support for Common Services, Manageability, Protocol

layering, Performance, Bandwidth and Latency, Delay X Bandwidth Product,

Perspectives on Connecting, Classes of Links, Reliable Transmission, Stop-and-Wait ,

Sliding Window, Concurrent Logical Channels.

Text: Chapter-1.1-1.5, 2.1,2.4-2.5

10

2 Internetworking I: Switching and Bridging, Datagram’s, Virtual Circuit Switching, Source

Routing, Bridges and LAN Switches, Basic Internetworking (IP), What is an Internetwork

?, Service Model, Global Addresses, Datagram Forwarding in IP, Sub netting and classless

addressing, Address Translation(ARP), Configuration(DHCP), Error Reporting(ICMP),

Virtual Networks and Tunnels.

Text: Chapter-3.1-3.2

12

3 Internetworking- II: Network as a Graph, Distance Vector(RIP), Link State(OSPF),Metrics,

The Global Internet, Routing Areas, Routing among Autonomous, systems(BGP),

IP Version 6(IPv6), Mobility and Mobile IP. Implementing and Performance of

switches,Ports and Routers.

Text: Chapter-3.3-3.4, 4.1- 4.4

10

4 Network Protocols: Simple Demultiplexer (UDP), Reliable Byte Stream(TCP), End-to-

End Issues, Segment Format, Connecting Establishment and Termination, Sliding

Window Revisited, Triggering Transmission, Adaptive Retransmission, Record

Boundaries,TCP Congestion Control, Additive Increase/ Multiplicative Decrease, Slow

Start, Fast Retransmit and Fast Recovery.


10

5 Congestion Control and Resource Allocation: Congestion-Avoidance Mechanisms,DEC

bit, Random Early Detection (RED), Source-Based Congestion Avoidance. The Domain

NameSystem(DNS),Electronic Mail(SMTP,POP,IMAP,MIME),World Wide

Web(HTTP),Network Management(SNMP) .


10






Note 3:Subject Seminar is evaluated for 10 marks

Course Outcomes:

After completing the course the students are able to:

CO1: Analysis of network services, protocols and architectures, explain why they are layered.

CO2: Design & implement Internet applications and their protocols using the sockets API.

CO3: Develop& implement effective communication mechanisms using techniques

like connection establishment, queuing theory, recovery.

CO4: Implement various congestion control techniques.

Cos Mapping with PO’s

CO1 PO2,PO4,PO6

CO2 PO3,PO4,PO7,PO9

CO3 PO3,PO5

CO4 PO3,PO4,PO11

TEXT BOOKS:

1. Larry Peterson and Bruce S Davis “Computer Networks :A System Approach” 5thEdition

, Elsevier -2014

REFERENCE BOOKS:

1. Uyless Black “Computer Networks, Protocols , Standards and Interfaces” 2ndEdition - PHI 2. Behrouz A Forouzan“TCP/IP Protocol Suite” 4thEdition – Tata McGraw-Hill 3. Douglas E Comer, “ Internetworking with TCP/IP, Principles, Protocols and Architecture” 6th Edition, PHI - 2014

Course Title : CRYPTOGRAPHY AND NETWORK SECURITY

Course Code: 20SCN13 No. of Credits: 3= 3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3hours

CIE + SEE = 50 + 50 =100 Total No. of Contact Hours :

52

Course Objectives:

1. To understand the fundamentals of Cryptography . 2. To acquire knowledge on standard algorithms used to provide security. 3. To understand the various key distribution and management schemes. 4. To gain knowledge of securing data in transit across networks

UNIT

No

Syllabus Content

No of

Hours

1 Classical Encryption Techniques: Symmetric Cipher Model, Cryptography,

Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar Cipher,

Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One

Time Pad

( Text Book : Chapter-1:1,2,3)

Block Ciphers and the data encryption standard: Traditional block

Cipherstructure, stream Ciphers and block Ciphers, Motivation for the feistel

Cipher structure, the feistel Cipher, The data encryption standard, DES

encryption, DES decryption, A DES example, results, the avalanche effect, the

strength of DES, the use of 56-Bit Keys, the nature of the DES algorithm, timing

attacks, Block cipher design principles, number of rounds, design of function F,

key schedule algorithm.

(Text Book : Chapter-2: 1,2,3,4,5)

10

2 Public-Key Cryptography and RSA

Principles of public-key cryptosystems. Publickey cryptosystems. Applications

for public-key cryptosystems, requirements for public-key cryptosystems.

public-key cryptanalysis. The RSA algorithm, description of the algorithm,

computational aspects, the security of RSA. Text Book : Chapter-8: 1,2

Other Public-Key Cryptosystems:

Diffie-hellman key exchange: The algorithm, key exchange protocols, man in

the middle attack, Elgamal Cryptographic systems, Elliptic curve arithmetic:

Abelian groups, elliptic curves over real numbers, elliptic curves over Zp, elliptic

curves over GF(2m) Elliptic curve cryptography: Analog of Diffie-hellman key

exchange, Elliptic curve encryption/decryption, security of Elliptic curve

cryptography. Pseudorandom number generation: PRNG based on RSA PRNG

Based on ECC.

Text Book : Chapter-9:1,2,3,4,5

10

3 Key Management and Distribution

Symmetric key distribution using Symmetric encryption:A key distribution

scenario, Hierarchical key control, session key lifetime, a transparent key

control scheme, Decentralized key control, controlling key usage,Symmetric

key distribution using asymmetric encryption: simple secret key distribution,

secret key distribution with confidentiality and authentication, A hybrid

scheme.Distribution of public keys: public announcement of public keys,

publicly available directory, public key authority, public keys certificates.X-509

certificates: Certificates, X-509 version 3

Text Book : Chapter-13: 1,2,3,4,5

User Authentication

Remote user Authentication principles: Mutual Authentication, one way

Authentication.Remote user Authentication using Symmetric

encryption:Mutual Authentication, one way Authentication.

Kerberos: Motivation , Kerberos version 4, Kerberos version 5:Differences

between version 4 and 5

Remote user Authentication using Asymmetric encryption: Mutual

Authentication, one way Authentication

Federated identity management: identity management, identity federation

Text Book : Chapter-14: 1,2,3,4 ,5

10

4 Transport –Level Security

Web Security Considerations: Web Security Threats, Web Traffic Security

Approaches.Secure Sockets Layer: SSL Architecture, SSL Record Protocol,

Change Cipher Spec Protocol, Alert Protocol, and shake Protocol,

Cryptographic Computations.

Transport Layer Security:Version Number, Message Authentication Code,

Pseudorandom Functions, Alert Codes, Cipher Suites, Client Certificate Types,

Certificate Verify And Finished Messages, Cryptographic Computations,

Padding. HTTPS :Connection Initiation, Connection Closure. Secure Shell (SSH)

Transport Layer Protocol, User Authentication Protocol, Connection Protocol.


10

5 Electronic Mail Security

Pretty good privacy: Notation, Operational description

S/MIME:RFC5322, Multipurpose internet mail extensions, S/MIME

functionality, S/MIME messages

Domain keys identified mail: Internet Mail Architecture, E-Mail threats, DKIM

strategy, DKIM functional flow

Text Book : Chapter-17:1,2,3

IP Security

IP Security overview: Applications of IPsec, benefits of IPsec, Routing

applications, IPsec documents, IPsec services, transport and tunnel modes

IP Security policy: Security associations, Security associations database,

Security policy database, IP traffic processing, Encapsulating Security payload:

ESP format, encryption and authentication algorithms, Padding, Anti replay

service, transport and tunnel modes

Combining security associations: Authentication plus confidentiality, basic

combinations of security associations, Internet key exchange:key

determinations protocol, header and payload formats


12






Note 3:Subject Seminar& group activity is evaluated for 10 marks

Course Outcomes:

After the completion of the course students will be able to

CO1: Analyze the vulnerabilities in any computing system and hence be able to design a security solution.

CO2:Identify the security issues in the network and resolve it.

CO3:Apply key management and distribution techniques .

CO4:Analyze security mechanisms at various layers of network model.

COs Mapping with PO’s

CO1 PO1,PO2,PO3,PO4

CO2 PO1,PO2,PO3,PO4



TEXT BOOK : BOOKS:

1. William Stallings: Cryptography and Network Security Principles and Practice, Pearson 6th edition. 2013


1. V K Pachghare: Cryptography and Information Security, PHE ,2013.

Course Title : CLOUD COMPUTING

Course Code: 20SCN14 No. of Credits: 3=3: 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration : 3hours CIE + SEE = 50 + 50 =100 Total No. of Contact Hours :

52

Course Objective:

● To study the fundamental characteristics, architecture and the different service models of Cloud Computing. ● To learn the Virtualization concepts and technologies used in Cloud Computing. ● To gain the knowledge of managing and securing the Cloud. ● To impart the concept of Service Oriented Architecture. ● To learn and work with the applications of different Cloud Services.

Unit

No

Syllabus No of

Hours

1 Defining Cloud Computing, Cloud Types, Examining

the Characteristics of Cloud Computing, Assessing the Role of

Open Standards.

Understanding Cloud Architecture-Exploring the Cloud Computing Stack,

Understanding Services and Applications by Type -Defining Infrastructure as a

Service (IaaS), Defining Platform as a Service (PaaS), Defining Software as a

Service (SaaS).

TB-Chapter 1,2,3,4

10

2 Understanding Abstraction and Virtualization-Using Virtualization Technologies, Load Balancing and Virtualization, Understanding Hypervisors, Understanding Machine Imaging, Porting Applications

Capacity Planning, Defining Baseline and Metrics, Network Capacity, Scaling

TB-Chapter 5,6

10

3 Managing the Cloud-Administrating the Clouds, Cloud Management Products, Emerging Cloud Management Standards.

Understanding Cloud Security-Securing the Cloud, Securing Data, Establishing Identity and Presence.

TB-Chapter 11,12

10

4 Understanding Service Oriented Architecture-Introducing Service Oriented

Architecture, Defining SOA Communications, Managing and Monitoring SOA,

Relating SOA and Cloud Computing.

Moving Applications to the Cloud, Applications in the Clouds, Applications and

Cloud APIs.

Working with Cloud-Based Storage - Measuring the Digital Universe,

Provisioning Cloud Storage, Exploring Cloud Backup Solutions,

Cloud Storage Interoperability.

TB-Chapter 13,14,15

12

5 Using Google Web Services, Exploring Google Applications, Surveying the Google

Application Portfolio, Exploring the Google Toolkit, Working with the Google App

Engine

Using Amazon Web Services, Understanding Amazon Web Services, Amazon

Web Service Components and Services, Working with the Elastic Compute Cloud

(EC2), Working with Amazon Storage Systems, Understanding Amazon Database

Services

Using Microsoft Cloud Services, Exploring Microsoft Cloud Services, Defining the

Windows Azure Platform, Using Windows Live

TB-Chapter 8,9,10

10







Course Outcome:

Students will be able to:

CO1: Analyze and Identify the architecture, infrastructure and delivery models of cloud computing

CO2: Identify and apply the suitable virtualization concepts.

CO3: To analyze & implement the security, management and administration of Cloud.

CO4: Address the core issues of cloud computing such as Managing SOA and Moving Applications to

the cloud.

CO5: Analyze systems, protocols and mechanisms to develop and host applications on the Cloud.


CO1 PO1,PO2,PO3, PO4

CO2 PO3, PO4, PO5, PO7,PO9

CO3 PO4, PO5, PO6, PO8, PO9,PO10,PO11,PO12



Text Books:

1. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2011.

Reference Books:

1. Dan C Marinescu: Cloud Computing Theory and Practice Elsevier(MK) 2013. 2. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and Paradigms, Willey 2014. 3. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and Security, CRC Press 2013.

Course Title : COMPUTER NETWORKS AND CNS LABORATORY

CourseCode: 20SCNL16 No. of Credits:2= 0:0: 2.0 (L-T-

P)


Exam Duration : 3 hours CIE + SEE = 50 + 50 =100

Course objectives:

1. To learn Concepts of fundamental protocols. 2. To acquire knowledge of implementation concepts in error detections. 3. To understand the fundamentals of Cryptography through practical implementation. 4. To implement standard algorithms used to provide confidentiality and integrity.

Implement the following using C/C++ /JAVA or equivalent with LINUX/Windows environment:

1. Write a program to transfer the contents of a requested file from Server to the Client using TCP/IP Sockets.

2. Implement Distance Vector Routing algorithm.

3. Write a program for implementing the Error Detection Technique while data transfer in unreliable network code using CRC (16-bits) Technique.

4. Write a program to implement Caesar substitution cipher .

5. Write a program to implement rail fence transposition cipher .

6. Write a program to implement vegener polyalphabetic cipher.

7. Write a program to implement RSA encryption and decryption algorithms .

8. Write a program to implement Diffie-Hellman Key Exchange algorithm.

9. Consider an alphanumeric data, encrypt and Decrypt the data using advanced encryption

standards and verify for the correctness.

10. Implement secure hash algorithm for Data Integrity. Implement MD5 and SHA-1 algorithm, which

accepts a string input, and produce a fixed size number -128 bits for MD5; 160 bits for SHA-1, this number

is a hash of the input. Show that a small change in the input results in a substantial change in the output.

Simulation Programs using OPNET /NS2/NS3/NCTUNS/Packet Tracer or any other equivalent software

11. Simulate a 3 node point to point network with duplex links between them. Set the Queue size and

vary the bandwidth and find the number of packets dropped.

12. Simulate a four node point-to-point network with the links connected as follows:

n0 – n2, n1 – n2 and n2 – n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply relevant

applications over TCP and UDP agents changing the parameter and determine the number of packets

sent by TCP / UDP.

Note: In the examination the student has to answer one question from a lot of 12 questions.

Course Outcomes:


CO1: Design client server applications using socket programming API.

CO2: Implement routing , error detection algorithms.

CO3: Analyze the network performance based on simulation results .

CO4: Design and implement ciphers.


CO1 PO2, PO3

CO2 PO2, PO3,PO4

CO3 PO2, PO3,PO4

CO4 PO2, PO3,PO4

Course Title : Technical Seminar

CourseCode: 20SCNS17 No. of Credits:2=0: 2:0 (L-T-P) No. of lecture hours/week : 2

Exam Duration : 3 hours CIE = 50

Course Title : Mini Project/Industry Visit/Field Work

CourseCode: 20SCNM18 No. of Credits:2=0:0:6 (L-T-P) No. of lecture hours/week : 6


ELECTIVE I

Sub Title : WIRELESS AD-HOC NETWORKS

Sub Code:20SCN151 No. of Credits: 3=3:0:0(L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE +Assignment + SEE =

50+50=100

Total No. of Contact Hours :52

Course objectives:

The objectives of this course are to:

1. Overview of Ad-hoc Networks 2. To gain Knowledge of Ad-hoc network protocols 3. To be aware of current and emerging trends in Ad-hoc Wireless Networks. 4. To aquire knowledge of energy management in ad-hoc wireless networks.

UNIT

No

Syllabus Content

No of

Hours

1 Ad-hoc Wireless Networks : Introduction, Issues in Ad-hoc Wireless Networks, Adhoc Wireless Internet.

MAC Protocols for Ad-hoc Wireless Networks: Introduction, Issues in Designing a MAC Protocol, Design Goals of MAC Protocols, Classification of MAC protocols, Contention-Based Protocols, Contention-Based Protocols with Reservation Mechanisms, Contention-Based Protocols with Scheduling Mechanisms, MAC Protocols that Use Directional Antennas.

Chapter 5.1-5.3,6.1-6.8

11

2 Routing Protocols for Ad-hoc Wireless Networks: Introduction, Issues in Designing a Routing Protocol for Ad-hoc Wireless Networks, Classification of Routing Protocols: Table Driven Routing Protocols, On-Demand Routing Protocols, Hybrid Routing Protocols, Hierarchical Routing Protocols and Power-Aware Routing Protocols.

Chapter 7.1-7.9

11

3 Multicast Routing in Ad-hoc Wireless Networks: Introduction, Issues in Designing a Multicast Routing Protocol, Operation of Multicast Routing Protocols, An Architecture Reference Model for Multicast Routing Protocols, Classifications of Multicast Routing Protocols, Tree-Based Multicast Routing Protocols and Mesh-Based Multicast Routing

Protocols.

Chapter8.1-8.7

10

4 Transport Layer and Security Protocols for Ad-hoc Networks: Introduction, Issues in Designing a Transport Layer Protocol, Design Goals of a Transport Layer Protocol, Classification of Transport Layer Solutions, TCP over Transport Layer Solutions.

Security in Ad-hoc Wireless Networks: Issues and Challenges in Security Provisioning, Network Security Attacks, Key Management and Secure routing Ad-hoc Wireless Networks.

Chapter 9.1-9.5,9.7-9.12

10

5 Quality of Service and Energy Management in Ad-hoc Wireless Networks: Introduction, Issues and Challenges in Providing QoS in Ad-hoc Wireless Networks, Classification of QoS Solutions, MAC Layer Solutions.

Energy Management in Ad-hoc Wireless Networks: Introduction, Need for Energy Management in Ad-hoc Wireless Networks, Classification of Energy Management Schemes, Battery Management Schemes, Transmission Management Schemes, System Power Management Schemes.

Chapter 10.1-10.4,11.1-11.6

10






Note 3: Note 3:Subject Seminar& group activity is evaluated for 10 marks

Course Outcomes:

At the end of the course, the students will be able to:

CO1:Design wireless network

CO2:Implement the different routing protocols.

CO3:Choose appropriate protocol for various applications

CO4:Identify security issues present at different level

CO5:Analyze energy consumption and improve system power



CO2 PO1,PO2,PO3,PO4,PO5,PO6,PO8




TEXT BOOK:

1. C. Siva Ram Murthy & B. S. Manoj: Ad-hoc Wireless Networks, 2nd Edition, Pearson Education, 2011


1. Srikanta Patnaik and Xiaolong Li: Recent Development in Wireless Sensor and Ad-hoc Networks Springer, 2015.

2. C.K. Toh: Ad-hoc Mobile Wireless Networks- Protocols and Systems, Pearson

Education, 2015.

https://www.amazon.in/s/ref=dp_byline_sr_ebooks_2?ie=UTF8&text=Xiaolong+Li&search-alias=digital-text&field-author=Xiaolong+Li&sort=relevancerank

Course Title : INTERNET OF THINGS

CourseCode:20SCN152 No. of Credits:3=3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE + SEE= 50+50 =100


Course Objectives

1. Assess the genesis and impact of IoT applications, architectures in the real world.

2. To Understand the key Technologies and protocols in IoT

3. To Analyze various Layers connectivity and motivation of IPV6

4. To Illustrate the role of IoT in various domains of Industry

5. Infer the role of Data Analytics in IOT

UNIT No Syllabus Content

No of Hours

1 What is The Internet of Things? Overview and Motivations, Examples of

Applications, IPV6 Role, Areas of Development and Standardization,

Scope of the Present Investigation. Internet of Things Definitions and

frameworks-IoT Definitions, IoT Frameworks, Basic Nodal Capabilities.

Internet of Things Application Examples-Overview, Smart

Metering/Advanced Metering Infrastructure-Health/Body Area

Networks, City Automation, Automotive Applications, Home

Automation, Smart Cards, Tracking.

TEXT BOOK 2 :Chapter1-1.1,1.2,1.3,1.4,1.5 Chapter2-2.1,2.2,2.3

Chapter3-3.1,3.2,3.3,3.4,3.5,3.6,3.7,3.8

12

2 Fundamental IoTMechanism and Key Technologies-Identification of

IoT Object and Services, Structural Aspects of the IoT, Key IoT

Technologies. Evolving IoT Standards-Overview and Approaches,IETF

IPV6 Routing Protocol for RPL Roll, Constrained Application Protocol,

Representational State Transfer, ETSI M2M,Third Generation

10

Partnership Project Service Requirements for Machine-Type

Communications, CENELEC, IETF IPv6 Over Lowpower WPAN, Zigbee

IP(ZIP)

TEXT BOOK 2: Chapter4-4.1,4.2,4.3

Chapter5-5.1,5.2,5.3,5.4,5.5,5.6,5.7,5.8,5.9

3 Layer ½ Connectivity: Wireless Technologies for the IoT-WPAN

Technologies for IoT/M2M, Cellular and Mobile Network Technologies

for IoT/M2M,Layer 3 Connectivity :IPv6 Technologies for the IoT:

Overview and Motivations. Address Capabilities,IPv6 Protocol

Overview, IPv6 Tunneling, IPsec in IPv6,Header Compression Schemes,

Quality of Service in IPv6,Migration Strategies to IPv6.

TEXT BOOK 2: Chapter6-6.1,6.2, Chapter7-7.1,7.2,7.3,7.4,7.5

10

4 Case Studies illustrating IoT Design-Introduction, Home Automation,

Cities, Environment, Agriculture, Productivity Applications.

TEXT BOOK 1:Chapter 9-9.1,9.2,9.3,9.4,9.5,9.6

10

5 Data Analytics for IoT– Introduction, Apache Hadoop, Using Hadoop

MapReduce for Batch Data Analysis, Apache Oozie, Apache Spark,

Apache Storm, Using Apache Storm for Real-time Data Analysis,

Structural Health Monitoring .

TEXT BOOK 1:Chapter 10-10.1,10.2,10.3,10.4,10.5,10.6,10.7,10.8

10






Note 3:Subject Seminar & group activity is evaluated for 10 marks

Course outcomes:

Upon completion of the course, the students will be able to

CO1:Interpret the impact and challenges posed by IoT networks leading to new architectural models.

CO2: Appraise the role of IoT protocols for efficient network communication

CO3: Deployment of different sensor technologies and Layers to connect the network.

CO4: To Deploy the role of IoT design in various domains of Industry

CO5:Elaborate the need for Data Analytics .



CO2 PO3,PO4,PO5,PO6,PO7,PO9,PO10


CO4 PO4,PO5,PO6,

PO8,PO9,PO10,PO11,PO12


TEXT BOOK:

1. ArshdeepBahga, Vijay Madisetti, ”Internet of Things : A Hands on Approach” Universities Press., 2015 2. Daniel Minoli, ”Building the Internet of Things with IPv6 and MIPv6:The Evolving World of M2M Communications”, Wiley, 2013


1.Michael Miller,” The Internet of Things”, First Edition, Pearson, 2015.

2.Claire Rowland,Elizabeth Goodman et.al.,” Designing Connected Products”, First Edition,O’Reilly, 2015

Course Title : TRENDS IN ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING

CourseCode:20SCN153 No. of Credits:3=3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE + SEE= 50+50 =100


Course Objectives

1. Describe Artificial Intelligence ,its utility and intelligent agents 2. Use and implement search techniques 3. Use knowledge representation techniques for problem solving

4. Describe and apply Fuzzy systems to various problem domains 5. Describe and apply GA to different problem domains


No of Hours

1 Role of AI in Engineering, AI in daily life, Intelligence and AI, Different

Task Domains of AI, History and Early Works of AI, History of AI,

Programming Methods, Limitaions of Ai, Agent, Performance

Evaluation, Task environment of an Agent, Agents Classification, Agent

Architecture Logic Programming, Logic Representation, Propositional

Logic, Predicate Logic and Predicate Calculus, Horn Clauses, Well

formd Formula, Computable functions and predicate, Quantifiers,

Universe of discourse, Applications of Predicate Logic,

Unification, Resolution, Conjuctive Normal Form, conversion to

normal form or clausal form .Text1:Ch1,Ch2,Ch3

10

2 Fundamental Problem of Logic: Logic Inadequacy: Fundamental

Problem of Logic- Monotonicity wuith “Flying Penguin” example,

General disadvantage of monotonicity property in logic , logic in search

space problem, logic in decidability and Incompleteness, Logic in

Uncertainty Modelling, Knowledge representation: Knowledge, Need

to represent knowledge, Knowledge representation with mapping

scheme, properties of a good knowledge base system, Knowledge

representation issues, AND-OR graphs, Types of knowledge,

Knowledge representation schemes, , semantic nets, Frames,

conceptual graphs, conceptual dependence theory, script, weak and

12

strong slot filler. Reasoning: Types of Reasoning, Methods of reasoning,

Application of Reasoning, Forward and Backward Reasoning

Text1:Ch4,Ch6,Ch7.1-7.4

3 Search Techniques: Search, Representation techniques, Categories of

Search, Disadvantage of state space search, Issues in design of search

programs, General Search examples, Classification of search diagram

representation, Hill climbing method and Hill climbing search

,Simulates Annealing, Best-First Search, Branch and Bound Search, A

search Game Playing: Two player games, Minmax Search, Complexity

of Minmax algorithm, Alpha-Beta Pruning Planning: Necessity of

planning, Components of Planning, Planning Agents, Plan-

gererating schemes, Algorithm for planning, Planning

Representation with STRIPS, BlOCKS WORLD, difficulties with planning.

Text1:Ch8,Ch9,Ch10,Ch11

10

4 Fuzzy Sets and Uncertainties: Fuzzy set and fuzzy logic, set and fuzzy

operators, , Extended fuzzy operations, Fuzzy relations, Properties of

fuzzy relations, Fuzzy system and design, Linguistic hedges, Syntax for IF

and Then rules, , Types of fuzzy rule based system, Fuzzy linguistic

controller, Fuzzy Inference, Graphical techniques of Inference, How,

Fuzzy logic is used, Fuzzification, De-fuzzification. Unique features of

Fuzzy Logic, Application of Fuzzy Logic, Fuzzy logic uncertainty and

probability, Advantages and Limitations of Fuzzy logic and Fuzzy

Systems.Text1:Ch5

10

5 Advancement of AI: Expert System, Expert System structure,

Knowledge acquisition,Knowledge representation, Inference control

mechanism, User interface, Expert System Shell, Knowledge

Representation, Inference Mechanism, Developer Interface and User

Interface, Characteristics of Expert system, Advantages of an expert

system, Production System, Artificial Neural Networks, : Characteristics

of Neural Networks, Architecture of neural networks, Types of neural

networks, Application of neural networks. Text1:Ch12

10







Course Outcomes:

CO1:Design intelligent agents for problem solving, reasoning, planning, decision making, and

learning.

CO2:Apply AI technique to current applications.

CO3:Apply Problem solving, knowledge representation, reasoning, and learning techniques to

solve real world problems

CO4:Design and build expert systems for various application domains.

CO5:Apply Soft Computing techniques such as neural networks, fuzzy logic to solve problems in various

application domains


CO1 PO1,PO2,PO3

CO2 PO1,PO2,PO3

CO3 PO1,PO2,PO3

CO4 PO2,PO3,PO4

CO5 PO2,PO3,PO4

Text Books:

1. Anindita Das Battacharjee, Artificial Intelligence and Soft computing for Beginners, Shroff

Publishers, 2nd edition


1. Elaine Rich,Kevin Knight, Shivashanka B Nair:Artificial Intelligence, Tata CGraw Hill 3rd edition 2013.

2. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, Pearson 3rd

edition. 3. Neural Networks, Fuzzy Logic and Genetic Algorithms by S. Rajasekaran, G. A. Vijayalakshmi

Pai PHI publication

4. Nils J. Nilsson: “Principles of Artificial Intelligence”, Elsevier, ISBN-13: 978093461310

Sub Title : ADVANCES IN STORAGE AREA NETWORKS

Sub Code: 20SCN154 No. of Credits:3=3 : 0 : 0 (L-T-P) No. of Lecture Hours/Week : 4

Exam Duration :

3 hours

Exam Marks :CIE +Assignment + SEE = 45 + 5 + 50 =100


Unit No. Syllabus Content No. of Hours

1 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.

Sections: 1.1-1.3, 2.1-2.8

12

2 I/O Techniques: The Physical I/O path from the CPU to the Storage System; SCSI; Fiber Channel Protocol Stack; Fibre Channel SAN; IP Storage. Network Attached Storage: The NAS Architecture, The NAS hardware Architecture, The NAS Software Architecture, Network connectivity, NAS as a storage system. File System and NAS: Local File Systems; Network file Systems and file servers; Shared Disk file systems; Comparison of fibre Channel and NAS.

Sections: 3.1-3.5, 4.1-4.5

10

3 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.

Sections: 5.3-5.7

10

Course Objectives:

1. To understand the fundamentals of storage architecture along with storage virtualization. 2. To understand the metrics used for designing storage area networks. 3. To enable the students to understand RAID concepts. 4. To appreciate the use of cables technologies used in SAN technology.

4 Applications of Storage Network: Definition of the Term ‘Storage Network’, Storage Sharing, Availability of Data, Adaptability and Scalability of IT Systems, General Conditions for Backup Network Backup Services Components of Backup Servers, Backup clients

Sections: 6.1-6.4, 7.1-7.4

10

5 Management of Storage Network: System Management, Requirement of management System, Support by Management System, Management Interface, Standardized Mechanisms, Property Mechanisms, In-band Management, out-of-band management.

Sections: 10.1-10.4

10







Course Outcomes:

After the completion of course, the students will be able to:

CO1: Identify the need for storage networks and its advantages.

CO2: Recognize various RAID levels.

CO3: Apply the concept of storage virtualization and recognize steps for Business continuity

planning in an Enterprise. CO4: Analyze SAN architecture along with the use of cables technologies.

CO5: Realize the concept of management of storage network.


CO1 PO1, PO2, PO12

CO2 PO1, PO2

CO3 PO1,PO2,PO11

CO4 PO1,PO2,PO12

CO5 PO1, PO2,PO11, PO12

TEXT BOOKS:

1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2013.

REFERENCE BOOKS/WEB LINKS:

1.Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-Hill, 2011.

2. Marc Farley: Storage Networking Fundamentals – An Introduction to Storage Devices, Subsystems,

Applications, Management, and File Systems, Cisco Press, 2005.

3. Richard Barker and Paul Massiglia: “Storage Area Network Essentials A CompleteGuide to

understanding and Implementing SANs”, Wiley India, 2006


SCHEME OF TEACHING AND EXAMINATION (Autonomous)for Academic Year 2020-2021

M. Tech in Cyber Forensics and Information Security

Batch:2020-2021

I semester

Sl.

No

.

Sub

Code

Subject

Title

Teaching

Departme

nt


allotted

Examinati

on

Credits Lectu

re

Tutorial/

Seminar/

Assignment

Practi

cal

/

Projec

t

CIE SEE Total

1. 20SCF1

1

Probability

Statistics

and

Queuing

Theory

MAT 4 - - 50 50 100 3

2. 20SCF1

2

Risk

Assessmen

t and

Security

Audit

ISE 4 - - 50 50 100 3

3. 20SCF1

3

Cryptograp

hy and

Network

Security

ISE 4 - - 50 50 100 3

4. 20SCF1

4

Web

Application

s and Web

Security

ISE 4 - - 50 50 100 3

5. 20SCF1

5X

ELECTIVE –

I

ISE 4 - - 50 50 100 3

6. 20SCFL

16

Computer

Networks

and CNS

Lab

ISE - - 3 50 50 100 2

7. 20SCFS

17

Technical

Seminar

ISE - 2 - 50 - 50 2

8. 20SCF

M18

Mini

project/

Industry

visit/

Field work

ISE - - 6 50 - 50 2

Total 400 300 700 21

Technical Seminar: Seminar on Advanced topics from refereed journals by each student.

ELECTIVE I

Sl .No Name of the Subject Subject Code

1 Cloud Security 20SCF151

2 Mobile And Digital Forensics 20SCF152

3 Trends in Artificial Intelligence and Soft Computing 20SCF153

4 Advances In Storage Area Networks 20SCF154

Course Objectives:

1.Develop analytical capability and to impart knowledge of Probability, Statistics and Queuing.

2. Apply above concepts in Engineering and Technology.

3.Acquire knowledge of Hypothesis testing and Queuing methods and their applications so as to

enable them to apply them for solving real world problems

UNIT

No

Syllabus Content

No of

Hours

1 Axioms of probability, Conditional probability, Total probability, Baye’s theorem,

Discrete Random variable, Probability mass function, Continuous Random variable.

Probability density function, Cumulative Distribution Function, and its properties,

Two-dimensional Random variables, Joint pdf / cdf and their properties

12

2 Probability Distributions / Discrete distributions: Binomial, Poisson Geometric and

Hyper-geometric distributions and their properties. Continuous distributions:

Uniform, Normal, exponential distributions and their properties

10

3 Random Processes: Classification, Methods of description, Special classes, Average

values of Random Processes, Analytical representation of Random Process,

Autocorrelation Function, Cross-correlation function and their properties,

Ergodicity, Poisson process, Markov Process and Markov chain.

10

4 Testing Hypothesis: Testing of Hypothesis: Formulation of Null hypothesis, critical

region, level of significance, errors in testing, Tests of significance for Large and Small

Samples, t-distribution, its properties and uses, F-distribution, its properties and

uses, Chi-square distribution and its properties and uses, χ2 – test for goodness of

fit, χ2 test for independence.

10

5 Symbolic representation of a Queuing Model, Poisson Queue system, Little Law,

Types of Stochastic Processes, Birth-Death Process, The M/M/1 Queuing System,

The M/M/s Queuing System, The M/M/s Queuing with Finite buffers.

10

Sub Title : PROBABILITY STATISTICS AND QUEUING THEORY

SubCode:20SCF11 No. of Credits:3= 3:0:0 (L-T-P) No.of Lecture Hours/Week :4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100








Course Outcomes:

After the completion of the above course students will be able to:

CO1: Demonstrate use of probability and characterize probability models using probability mass

(density) functions & cumulative distribution functions.

CO2: Explain the techniques of developing discrete & continuous probability distributions and its

applications.

CO3: Outline methods of Hypothesis testing for goodness of fit

CO4: Define the terminology &nomenclature appropriate queuing theory and also distinguish various

queuing models.






TEXT BOOKS:

1. Probability, Statistics and Queuing Theory, V. Sundarapandian, Eastern Economy Edition, PHI Learning Pvt. Ltd, 2009.


1. Probability & Statistics with Reliability, Queuing and Computer Applications, 2 nd

Edition by Kishor. S. Trivedi , Prentice Hall of India ,2004.

2. Probability, Statistics and Random Processes, 1st Edition by P Kausalya, Pearson

Education, 2013.

Course Title: RISK ASSESSMENT & SECURITY AUDIT

Course Code:

20SCF12 No. of Credits: 3 = 3: 0 : 0 (L–T– P) No of Lecture Hours/Week:4

Exam Duration:

3 Hours

CIE + SEE = 50 + 50 =100


52

Course Objectives:

1.To gain the knowledge about Information Risk.

2. To discover knowledge in collecting data about organization.

3. To do various analysis on Information Risk Assessment.

4. To understand IT audit and its activities.

Unit

No Syllabus content

No of

Hours

1 INTRODUCTION: What is Risk? –Information Security Risk Assessment

Overview- Drivers, Laws and Regulations- Risk Assessment Frame work –

Practical Approach.

Text Book1: Chapter1: Page 1-26

Chapter2: Page 27

10

2. DATA COLLECTION: The Sponsors- The Project Team- Data Collection

Mechanisms- Executive Interviews- Document Requests- IT Assets Inventories-

Profile & Control Survey Consolidation.


10

3. DATA ANALYSIS :Compiling Observations- Preparation of catalogs- System Risk

Computation Impact Analysis Scheme- Final Risk Score


10

4. RISK ASSESSMENT :System Risk Analysis- Risk Prioritization- System Specific Risk

Treatment- Issue Registers- Methodology- Result- Risk Registers- Post Mortem.


10

Chapter6: Page 177-187

Chapter7: Page 199-224

Chapter8: Page 236

5. SECURITY AUDIT PROCESS: Pre-planning audit- Audit Risk Assessment-

Performing Audit- Internal Controls Audit Evidence- Audit Testing- Audit

Finding- Follow-up activities.


12







Course Outcomes:

After the successful completion of the course the students are able to:

CO1: Analyze the difference between Security Metrics and Audits.

CO2: Knowledge on Vulnerability Management

CO3: Know the Information Security Audit Tasks, Reports and Post Auditing Actions

CO4: Apply Information Security Assessments

CO5: Design risk management process and control practices in an audit context


CO1: PO1, PO2,PO3,PO4

CO2: PO1, PO2 ,PO3,PO4

CO3: PO1, PO2, PO3,PO4,PO5

CO4: PO1, PO2, PO3,PO5

CO5: PO1, PO2,PO4,PO7

TEXT BOOKS:

1. Mark Talabis, “Information Security Risk Assessment Toolkit: Practical Assessments

through Data Collection and Data Analysis”, Syngress; 1 edition, ISBN: 978-1-59749-735-

0, 2012.

2. David L. Cannon, “CISA Certified Information Systems Auditor Study Guide”, John Wiley

& Sons, ISBN: 978-0-470-23152-4, 2009.

Course Objectives:

1. To understand the fundamentals of Cryptography .

2. To acquire knowledge on standard algorithms used to provide security.

3. To understand the various key distribution and management schemes.

4. To gain knowledge of securing data in transit across networks


No of

Hours

1 Classical Encryption Techniques: Symmetric Cipher Model, Cryptography,

Cryptanalysis and Brute-Force Attack, Substitution Techniques, Caesar Cipher,

Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One Time

Pad ( Text Book : Chapter 1:1,2,3)

Block Ciphers and the data encryption standard: Traditional block Cipherstructure,

stream Ciphers and block Ciphers, Motivation for the feistel Cipher structure, the

feistel Cipher, The data encryption standard, DES encryption, DES decryption, A DES

example, results, the avalanche effect, the strength of DES, the use of 56-Bit Keys,

the nature of the DES algorithm, timing attacks, Block cipher design principles,

number of rounds, design of function F, key schedule algorithm.

(Text Book : Chapter 2: 1,2,3,4,5)

10

Course Title : CRYPTOGRAPHY AND NETWORK SECURITY

Course Code: 20SCF13 No. of Credits: 3=3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration : 3hours CIE + SEE = 50 + 50 =100 Total No. of Contact Hours : 52

2 Public-Key Cryptography and RSA

Principles of public-key cryptosystems. Publickey cryptosystems. Applications for

public-key cryptosystems, requirements for public-key cryptosystems. public-key

cryptanalysis. The RSA algorithm, description of the algorithm, computational

aspects, the security of RSA.

Text Book : Chapter-8:1,2

Other Public-Key Cryptosystems: Diffie-hellman key exchange: The algorithm, key

exchange protocols, man in the middle attack, Elgamal Cryptographic systems,

Elliptic curve arithmetic: Abelian groups, elliptic curves over real numbers, elliptic

curves over Zp, elliptic curves over GF(2m) Elliptic curve cryptography: Analog of

Diffie-hellman key exchange, Elliptic curve encryption/decryption, security of Elliptic

curve cryptography. Pseudorandom number generation: PRNG based on RSA PRNG

Based on ECC.Text Book : Chapter-9:1,2,3,4,5

10

3 Key Management and Distribution:Symmetric key distribution using Symmetric

encryption:A key distribution scenario, Hierarchical key control, session key lifetime,

a transparent key control scheme, Decentralized key control, controlling key

usage,Symmetric key distribution using asymmetric encryption: simple secret key

distribution, secret key distribution with confidentiality and authentication, A hybrid

scheme.Distribution of public keys: public announcement of public keys, publicly

available directory, public key authority, public keys certificates.X-509 certificates:

Certificates, X-509 version 3.


User Authentication:Remote user Authentication principles: Mutual Authentication,

one way Authentication.Remote user Authentication using Symmetric

encryption:Mutual Authentication, one way Authentication.

Kerberos: Motivation , Kerberos version 4, Kerberos version 5:Differences between

version 4 and 5

Remote user Authentication using Asymmetric encryption: Mutual Authentication,

one way Authentication

Federated identity management: identity management, identity federation

Text Book : Chapter-14: 1,2,3,4 ,5

10

4 Transport –Level Security

Web Security Considerations: Web Security Threats, Web Traffic Security

Approaches.Secure Sockets Layer: SSL Architecture, SSL Record Protocol, Change

Cipher Spec Protocol, Alert Protocol, and shake Protocol, Cryptographic

Computations.Transport Layer Security:Version Number, Message Authentication

Code, Pseudorandom Functions, Alert Codes, Cipher Suites, Client Certificate Types,

Certificate Verify And Finished Messages, Cryptographic Computations, Padding.

HTTPS :Connection Initiation, Connection Closure. Secure Shell (SSH) Transport Layer

Protocol, User Authentication Protocol, Connection Protocol.


10

5 Electronic Mail Security:Pretty good privacy: Notation, Operational description

S/MIME:RFC5322, Multipurpose internet mail extensions, S/MIME functionality,

S/MIME messages Domain keys identified mail: Internet Mail Architecture, E-Mail

threats, DKIM strategy, DKIM functional flow

Text Book : Chapter-17: 1,2,3

IP Security:IP Security overview: Applications of IPsec, benefits of IPsec, Routing

applications, IPsec documents, IPsec services, transport and tunnel modes IP

Security policy: Security associations, Security associations database, Security policy

database, IP traffic processing, Encapsulating Security payload: ESP format,

encryption and authentication algorithms, Padding, Anti replay service, transport

and tunnel modes Combining security associations: Authentication plus

confidentiality, basic combinations of security associations, Internet key

exchange:key determinations protocol, header and payload formats


12







Course Outcomes:


CO1: Analyze the vulnerabilities in any computing system and hence be able to design a security

solution.

CO2:Identify the security issues in the network and resolve it.

CO3:Apply key management and distribution techniques .

CO4:Analyze security mechanisms at various layers of network model.


CO1 PO1,PO2,PO3,PO4

CO2 PO1,PO2,PO3,PO4



TEXT BOOK : BOOKS:

1. William Stallings: Cryptography and Network Security Principles and Practice,

Pearson 6th edition. 2013


1. V K Pachghare: Cryptography and Information Security, PHE ,2013.

Unit

No.

Syllabus Content

No. of

Hours

1 Web Application (In) security: The Evolution of Web Applications, Common Web Application

Functions, Benefits of Web Applications, Web Application Security. Core Defense

Mechanisms: Handling User Access Authentication, Session Management, Access Control,

Handling User Input, Varieties of Input Approaches to Input Handling, Boundary Validation.

Multistep Validation and Canonicalization: Handling Attackers, Handling Errors, Maintaining

Audit Logs, Alerting Administrators, Reacting to Attacks.Chapter 1: Page 1-13

Chapter 2: Page 15-32

10

2 Web Application Technologies: The HTTP Protocol, HTTP Requests, HTTP Responses, HTTP

Methods, URLs, REST, HTTP Headers, Cookies, Status Codes, HTTPS, HTTP Proxies, HTTP

Authentication, Web Functionality, Server-Side Functionality, ClientSide Functionality, State

and Sessions, Encoding Schemes, URL Encoding, Unicode Encoding, HTML Encoding, Base64

Encoding, Hex Encoding, Remoting and Serialization Frameworks.Chapter 3: Page 35-59

09

3 Mapping the Application: Enumerating Content and Functionality, Web Spidering, User-

Directed Spidering, Discovering Hidden Content, Application Pages Versus Functional Paths,

Discovering Hidden Parameters, Analyzing the Application, Identifying Entry Points for User

Input, Identifying Server-Side Technologies, Identifying Server-Side Functionality, Mapping

the Attack Surface.

Chapter 4: Page 61-91

12

Course Objectives:

1. Web applications vulnerability and malicious attacks. 2. Basic web technologies used for web application development. 3. Basic concepts of Mapping the application. 4. Illustrate different attacking illustrations. 5. Basic concepts of Attacking.

Course Title :WEB APPLICATION AND WEB SECURITY

Course code : 20SCF14 No. of Credits:3=3: 0 : 0 (L-T-P) No.of Lecture Hours/Week: 4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100


4 Attacking Authentication: Authentication Technologies, Design Flaws in Authentication

Mechanisms, Bad Passwords, Brute-Forcible Login, Verbose Failure Messages, Vulnerable

Transmission of Credentials, Password Change, Functionality, Forgotten Password

Functionality, “Remember Me” Functionality, User Impersonation, Functionality

Incomplete, Validation of Credentials, Nonunique Usernames, Predictable Usernames,

Predictable Initial Passwords, Insecure Distribution of Credentials. Attacking Access

Controls: Common Vulnerabilities, Completely Unprotected, Functionality Identifier-Based

Functions, Multistage Functions, Static Files, Platform Misconfiguration, Insecure Access

Control Methods.Chapter 6:page 133-154, Chapter 8: page 217-223

09

5 Attacking Data Stores: Injecting into Interpreted Contexts, Bypassing a Login, Injecting into

SQL, Exploiting a Basic Vulnerability Injecting into Different Statement Types, Finding SQL

Injection Bugs, Fingerprinting the Database, The UNION Operator, Extracting Useful Data,

Extracting Data with UNION, Bypassing Filters, Second-Order SQL Injection, Advanced

Exploitation Beyond SQL Injection: Escalating the Database Attack, Using SQL Exploitation

Tools, SQL Syntax and Error Reference, Preventing SQL Injection

Chapter 7: Page no 237-299

12







Course Outcomes:


CO1:Achieve Knowledge of web applications vulnerability and malicious attacks.

CO2:Apply the basic web technologies used for web application development

CO3: Analyze the basic concepts of Mapping the application.

CO4: Able to illustrate different attacking illustrations.

CO5: Basic concepts of Attacking Data Stores.


CO1 PO1,PO2, PO4,PO5,PO7

CO2 PO1,PO2, PO4,PO5

CO3 PO1, PO2,PO4,PO5,

CO4 PO1,PO2,PO3, PO4,

CO5 PO1,PO2, PO4,PO5, PO7

TEXT BOOK:

1. The Web Application Hacker's Handbook: Finding And Exploiting Security DefyddStuttard, Marcus Pinto Wiley Publishing, Second Edition.

REFERENCE BOOKS:

1. Professional Pen Testing for Web application, Andres Andreu, Wrox Press.

2. Carlos Serrao, Vicente Aguilera, Fabio Cerullo, Web Application Security Springer; 1st Edition

3. Joel Scambray, Vincent Liu, Caleb Sima ,“Hacking exposed, McGraw-Hill; 3rd Edition,

(October, 2010).

4. OReilly Web Security Privacy and Commerce 2nd Edition 2011.

5. Software Security Theory Programming and Practice, Richard sinn, Cengage Learning.

6.Database Security and Auditing, Hassan, Cengage Learning

ELECTIVE –I

Course Objectives:

1. Fundamental security concepts and architectures that serve as building blocks to database security 2. Concepts of user account management and administration, including security risks 3. To use current database management system to design and configure the user and data permissions. 4. Operational components necessary to maximize database security using various security models

Unit No. Syllabus Content

No. of

Hours

1 Cloud Computing Fundamentals:Essential Characteristics-On-Demand Self-Service,

BroadNetwork Access, Location-Independent Resource Pooling, Rapid Elasticity,

Measured Service. Architectural Influences-High-Performance Computing, Utility and

Enterprise Grid Computing, Autonomic Computing, Service Consolidation, Horizontal

Scaling, Web Services, High-Scalability Architecture. Technological Influences-Universal

Connectivity, Commoditization, Excess Capacity, Open-Source Software, Virtualization.

Operational Influences- Consolidation, Outsourcing.

Chap- 1

10

2 Cloud Computing Architecture:Cloud Delivery Models- Iaas, Paas, Saas. Cloud

Deployment Models- Public Clouds, Community Clouds, Private Clouds, Hybrid Clouds.

Expected Benefits- Flexibility and Resiliency, Reduced Costs, Centralization of Data

Storage, Reduced Time to Deployment, Scalability

Chap- 2

10

Sub Title : CLOUD SECURITY

Sub Code: 20SCF151 No. of Credits:3=3: 0 : 0 (L-T-P) No.of Lecture Hours/Week: 4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100


3 Cloud Computing Software Security Fundamentals:Cloud Information Security

Objectives- Confi dentiality, Integrity, and Availability.Cloud Security Services-

Authentication, Authorization, Auditing, Accountability. Relevant Cloud Security Design –

Principles, Least Privilege, Separation of Duties, Cloud Security Services. Relevant Cloud

Security Design Principles-Secure Cloud Software Requirements . Secure Cloud Software

Testing. Cloud Computing and Business Continuity Planning/Disaster Recovery.

Chap- 3

11

4 Cloud Computing Risk Issues:The CIA Triad - Privacy and Compliance Risks, Threats to

Infrastructure, Data, and Access Control Common Threats and Vulnerabilities, Cloud

Service Provider Risks.

Chap- 4

11

5 Cloud Computing Security Challenges & Architecture:Security Policy Implementation-

Policy Types, Computer Security Incident Response Team. Virtualization Security

Management- Virtual Threats, VM Security Recommendations, VM-Specific Security

Techniques. Cloud Computing Security Architecture- Architectural Considerations,

Identity Management and Access Control.

Chap- 5,6

10







Course Outcomes:








Text Book :

1. Cloud Security- A Comprehensive Guide to Secure Cloud Computing by Ronald L. Krutz, Russell Dean Vines

CO1:Carry out a risk analysis for a large database

CO2:Implement identification and authentication procedures, fine-grained access control and data

encryption techniques.

CO3:Set up accounts with privileges and roles

CO4:Audit accounts and the database system

Course Objectives

1. Understand the basics of wireless technologies and security 2. Become knowledgeable in mobile phone forensics and android forensics 3. Learn the methods of investigation using digital forensic techniques.

Unit

No.

Syllabus Content

No. of

Hours

1 Overview of wireless technologies and security: Personal Area Networks, Wireless

Local Area Networks, Metropolitan Area Networks, Wide Area Networks.

TextBook1: Chapter1: Page1-10

10

2 Wireless threats, vulnerabilities and security: Wireless LANs, War Driving, War

Chalking, War Flying, Common Wi-fi security recommendations, PDA Security, Cell

Phones and Security, Wireless DoS attacks, GPS Jamming, Identity theft.


09

3 Wireless crime fighting; Wireless crime prevention techniques, police use of wireless

devices, personal security and RFID, wireless honeypots.


12

4 Digital forensic principles and wireless forensics: Cyber crime forensic principles,

Investigating cyber crime, Network forensics in a wireless environment, 802.11

Forensics, PDA forensics, Cell phone forensics.


09

5 The wireless future: Introduction, new Twists, pervasive computing and cultural

shifts, wireless shifts and trends, new functionalities for wireless devices, The home

element, Relationships, virtual communities and beyond, city-sized hotspots,

security and privacy.


12

Sub Title : MOBILE AND DIGITAL FORENSICS

Sub Code:

20SCF152

No. of Credits:3=3: 0 : 0 (L-T-P) No.of Lecture Hours/Week: 4

Exam Duration :

3 hours

CIE + SEE = 50 + 50 =100


Course Outcomes:


CO1: Understand the definition of computer forensics fundamentals

CO2: Describe the types of computer forensics technology.

CO3: Analyze various computer forensics systems.

CO4: Illustrate the methods for data recovery, evidence collection and data seizure







TEXT BOOK:

1. Gregory Kipper, “Wireless Crime and Forensic Investigation”, Auerbach Publications, 2007. REFERENCES:

1. Iosif I. Androulidakis, “ Mobile phone security and forensics: A practical approach”, Springer

publications, 2012 .

2. Andrew Hoog, “ Android Forensics: Investigation, Analysis and Mobile Security for Google Android”,

Elsevier publications, 2011.

3. Angus M.Marshall, “ Digital forensics: Digital evidence in criminal investigation”, John – Wiley and

Sons, 2008.

Course Title : TRENDS IN ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING

CourseCode: 20SCF153 No. of Credits:3=3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE + SEE= 50+50 =100


Course Objectives

1. Describe Artificial Intelligence ,its utility and intelligent agents

2. Use and implement search techniques

3. Use knowledge representation techniques for problem solving

4. Describe and apply Fuzzy systems to various problem domains

5. Describe and apply GA to different problem domains

UNIT

No

Syllabus Content

No of

Hours

1 Role of AI in Engineering, AI in daily life, Intelligence and AI, Different Task Domains

of AI, History and Early Works of AI, History of AI, Programming Methods,

Limitaions of Ai, Agent, Performance Evaluation, Task environment of an Agent,

Agents Classification, Agent Architecture Logic Programming, Logic

Representation, Propositional Logic, Predicate Logic and Predicate Calculus,

Horn Clauses, Well formd Formula, Computable functions and predicate,

Quantifiers, Universe of discourse, Applications of Predicate Logic,

Unification, Resolution, Conjuctive Normal Form, conversion to normal form or

clausal form .Text1:Ch1,Ch2,Ch3

10

2 Fundamental Problem of Logic: Logic Inadequacy: Fundamental Problem of

Logic- Monotonicity wuith “Flying Penguin” example, General disadvantage of

monotonicity property in logic , logic in search space problem, logic in decidability

and Incompleteness, Logic in Uncertainty Modelling, Knowledge representation:

Knowledge, Need to represent knowledge, Knowledge representation with

mapping scheme, properties of a good knowledge base system, Knowledge

representation issues, AND-OR graphs, Types of knowledge, Knowledge

representation schemes, , semantic nets, Frames, conceptual graphs, conceptual

dependence theory, script, weak and strong slot filler. Reasoning: Types of

Reasoning, Methods of reasoning, Application of Reasoning, Forward and Backward

Reasoning

12

Text1:Ch4,Ch6,Ch7.1-7.4

3 Search Techniques: Search, Representation techniques, Categories of Search,

Disadvantage of state space search, Issues in design of search programs, General

Search examples, Classification of search diagram representation, Hill climbing

method and Hill climbing search ,Simulates Annealing, Best-First Search, Branch

and Bound Search, A search Game Playing: Two player games, Minmax Search,

Complexity of Minmax algorithm, Alpha-Beta Pruning Planning: Necessity of

planning, Components of Planning, Planning Agents, Plan- gererating

schemes, Algorithm for planning, Planning Representation with STRIPS,

BlOCKS WORLD, difficulties with planning. Text1:Ch8,Ch9,Ch10,Ch11

10

4 Fuzzy Sets and Uncertainties: Fuzzy set and fuzzy logic, set and fuzzy operators, ,

Extended fuzzy operations, Fuzzy relations, Properties of fuzzy relations, Fuzzy

system and design, Linguistic hedges, Syntax for IF and Then rules, , Types of fuzzy

rule based system, Fuzzy linguistic controller, Fuzzy Inference, Graphical

techniques of Inference, How, Fuzzy logic is used, Fuzzification, De-fuzzification.

Unique features of Fuzzy Logic, Application of Fuzzy Logic, Fuzzy logic uncertainty

and probability, Advantages and Limitations of Fuzzy logic and Fuzzy

Systems.Text1:Ch5

10

5 Advancement of AI: Expert System, Expert System structure, Knowledge

acquisition,Knowledge representation, Inference control mechanism, User

interface, Expert System Shell, Knowledge Representation, Inference

Mechanism, Developer Interface and User Interface, Characteristics of Expert

system, Advantages of an expert system, Production System, Artificial Neural

Networks, : Characteristics of Neural Networks, Architecture of neural networks,

Types of neural networks, Application of neural networks. Text1:Ch12

10







Course Outcomes:

CO1:Design intelligent agents for problem solving, reasoning, planning, decision

making, and learning.

CO2:Apply AI technique to current applications.

CO3:Apply Problem solving, knowledge representation, reasoning, and learning

techniques to solve real world problems

CO4:Design and build expert systems for various application domains.

CO5:Apply Soft Computing techniques such as neural networks, fuzzy logic to solve

problems in various application domains


CO1 PO1,PO2,PO3

CO2 PO1,PO2,PO3

CO3 PO1,PO2,PO3

CO4 PO2,PO3,PO4

CO5 PO2,PO3,PO4

Text Books:

1. Anindita Das Battacharjee, Artificial Intelligence and Soft computing for

Beginners, Shroff Publishers, 2nd edition


1. Elaine Rich,Kevin Knight, Shivashanka B Nair:Artificial Intelligence, Tata CGraw Hill 3rd edition 2013.

2. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, Pearson 3rd edition.

3. Neural Networks, Fuzzy Logic and Genetic Algorithms by S. Rajasekaran, G. A. Vijayalakshmi

Pai PHI publication


Sub Title : ADVANCES IN STORAGE AREA NETWORKS

CourseCode: 20SCF154 No. of Credits:3=3 : 0 : 0 (L-T-P) No. of lecture hours/week : 4

Exam Duration :

3 hours

CIE + SEE= 50+50 =100


Course Objectives: 1. To understand the fundamentals of storage architecture along with storage

virtualization.

2. To understand the metrics used for designing storage area networks.

3. To enable the students to understand RAID concepts.

4. To appreciate the use of cables technologies used in SAN technology.

Unit

No.

Syllabus Content No. of

Hours

1 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.

Sections: 1.1-1.3, 2.1-2.8

12

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

SCSI; Fiber Channel Protocol Stack; Fibre Channel SAN; IP Storage.

Network Attached Storage: The NAS Architecture, The NAS hardware

Architecture, The NAS Software Architecture, Network connectivity, NAS

as a storage system. File System and NAS: Local File Systems; Network file

Systems and file servers; Shared Disk file systems; Comparison of fibre

Channel and NAS.

Sections: 3.1-3.5, 4.1-4.5

10

3 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.

Sections: 5.3-5.7

10

4 Applications of Storage Network: Definition of the Term ‘Storage

Network’, Storage Sharing, Availability of Data, Adaptability and

Scalability of IT Systems, General Conditions for Backup Network Backup

Services Components of Backup Servers, Backup clients

Sections: 6.1-6.4, 7.1-7.4

10

5 Management of Storage Network: System Management, Requirement of

management System, Support by Management System, Management

Interface, Standardized Mechanisms, Property Mechanisms, In-band

Management, out-of-band management.

Sections: 10.1-10.4

10







Course Outcomes: After the completion of course, the students will be able to:

CO1: Identify the need for storage networks and its advantages.

CO2: Recognize various RAID levels.

CO3: Apply the concept of storage virtualization and recognize steps for Business

continuity

planning in an Enterprise.

CO4: Analyze SAN architecture along with the use of cables technologies.

CO5: Realize the concept of management of storage network.


CO1 PO1, PO2, PO12

CO2 PO1, PO2

CO3 PO1,PO2,PO11

CO4 PO1,PO2,PO12

CO5 PO1, PO2,PO11, PO12

TEXT BOOKS:

1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2013.

REFERENCE BOOKS/WEB LINKS:

1.Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-Hill, 2011.

2. Marc Farley: Storage Networking Fundamentals – An Introduction to Storage Devices,

Subsystems, Applications, Management, and File Systems, Cisco Press, 2005.

3. Richard Barker and Paul Massiglia: “Storage Area Network Essentials A CompleteGuide to

understanding and Implementing SANs”, Wiley India, 2006

Course objectives:

1. To learn Concepts of fundamental protocols.

2. To acquire knowledge of implementation concepts in error detections.

3. To understand the fundamentals of Cryptography through practical implementation.

4. To implement standard algorithms used to provide confidentiality and integrity.

Implement the following using C/C++ /JAVA or equivalent with LINUX/Windows environment:

1. Write a program to transfer the contents of a requested file from Server to the Client using

TCP/IP Sockets.

2. Implement Distance Vector Routing algorithm.

3. Write a program for implementing the Error Detection Technique while data transfer in

unreliable network code using CRC (16-bits) Technique.

4. Write a program to implement Caesar substitution cipher .

5. Write a program to implement rail fence transposition cipher .

6. Write a program to implement vegener polyalphabetic cipher.

7. Write a program to implement RSA encryption and decryption algorithms .

8. Write a program to implement Diffie-Hellman Key Exchange algorithm.

9. Consider an alphanumeric data, encrypt and Decrypt the data using advanced encryption

standards and verify for the correctness.

10. Implement secure hash algorithm for Data Integrity. Implement MD5 and SHA-1

algorithm, which accepts a string input, and produce a fixed size number -128 bits for

MD5; 160 bits for SHA-1, this number is a hash of the input. Show that a small change in

the input results in a substantial change in the output.

Course Title : COMPUTER NETWORKS AND CNS LABORATORY

CourseCode: 18SCNL16 No. of Credits:2= 0:0: 2.0 (L-T-

P)


Exam Duration : 3 hours CIE + SEE = 50 + 50 =100

Simulation Programs using OPNET /NS2/NS3/NCTUNS/Packet Tracer or any other equivalent software

11. Simulate a 3 node point to point network with duplex links between them. Set the Queue

size and vary the bandwidth and find the number of packets dropped.

12. Simulate a four node point-to-point network with the links connected as follows:

n0 – n2, n1 – n2 and n2 – n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply

relevant applications over TCP and UDP agents changing the parameter and determine the

number of packets sent by TCP / UDP.

Note: In the examination the student has to answer one question from a lot of 12 questions.

Course Outcomes:


CO1: Design client server applications using socket programming API.

CO2: Implement routing , error detection algorithms.

CO3: Analyze the network performance based on simulation results .

CO4: Design and implement ciphers.


CO1 PO2, PO3

CO2 PO2, PO3,PO4

CO3 PO2, PO3,PO4

CO4 PO2, PO3,PO4

Course Title : TECHNICAL SEMINAR

CourseCode: 20SCFS17 No. of Credits:2= 0:2:0 (L-T-P) No. of lecture hours/week


Course Title : MINI PROJECT/INDUSTRY VISIT/FIELD WORK

CourseCode:

20SCFM18

No. of Credits:2= 0:0:6 (L-T-P) No. of lecture hours/week :

Exam Duration : 3

hours

CIE = 50


(An Autonomous Institute affiliated to VTU, Accredited by NAAC with ‘A’ grade)

Department of Telecommunication Engineering


M. Tech in Computer Science & Engineering

I semester

Sl.

No

.

Sub Code Subject

Title

Teachi

ng

Depart

ment


allotted

Examinat

ion

Credits Lect

ure

Tutorial/

Seminar/

Assignment

Practi

cal

/

Proje

ct

CIE SEE Tota

l

1 20SCS11 Probabilit

y Statistics

and

Queueing

Theory

(Maths)

MAT 4 - - 50 50 100 3

2 20SCS12 Cloud

Computin

g Theory

and

Practices

CSE 4 - - 50 50 100 3

3 20SCS13 Internet

of Things CSE 4 - - 50 50 100 3

4 20SCS14 Soft

Computin

g

CSE 4 - - 50 50 100 3

5 20SCS15X ELECTIVE

– I CSE 4 - - 50 50 100 3

6 20SCS16X ELECTIVE

– II

CSE 4 - - 50 50 100 3

7 20SCSL17 IoT

Laborator

y

CSE - - 3 50 50 100 2

8 20SCSS18 Technical

Seminar

CSE

- 4 - 50 - 50 2

9 20SCSM19 Minor

project/

Industry

visit/

Field work

CSE - - 6 50 - 50 2

Total 450 350 800 24

Technical Seminar:

Seminar on Advanced topics from refereed journals by each student.


Sl

.No

Sub Code Subject title Subject Code Subject title

1 20SCS151 Advanced Operating System 20SCS161 Introduction to Blackchain

Technology

2 20SCS152 Advances in Computer

Network

20SCS162 Advanced Algorithms and Data

structure

3 20SCS153 Artificial Intelligence and

Prolog Programming

20SCS163 Cyber Security and Cyber Laws

4 20SCS154 Parallel Computing with GPU

Architecture

20SCS164 Computational Intelligence

M. Tech in Computer Science & Engineering

I semester

Course Title: Cloud Computing

Course Code:

20SCS12

No. of Credits: 3 : 0 : 0

(L-T-P)

Number of lecture

hours/week : 4

Exam Duration : 3

hours

CIE+SEE = 50+50=100 Total No. of Contact Hours

: 52

Course

Objectives

:

Description

1. To learn how to use Cloud Services.

2. To implement Virtualization

3. To implement Task Scheduling algorithms.

4. Apply Map-Reduce concept to applications.

5. To build Private Cloud.

6. Broadly educate to know the impact of engineering on legal and societal

issues involved.

Unit

No

Syllabus Content

No of

Hours

1 Introduction: Network centric computing and network centric content, Peer-to-

peer systems, Cloud Computing: an old idea whose time has come, Cloud

Computing delivery models & Services, Ethical issues, Cloud vulnerabilities,

Challenges.

Cloud Infrastructure: Amazon, Google, Azure & online services, open source

private clouds. Storage diversity and vendor lock-in, inter cloud, Energy use &

ecological impact of data centers, service level and compliance level agreement,

Responsibility sharing, user experience, Software licensing.

10

2 Cloud Computing: Applications & Paradigms, Challenges, existing and new

application opportunities, Architectural styles of cloud applications, Workflows

coordination of multiple activities, Coordination based on a state machine model

-the Zoo Keeper, The Map Reduce programming model, Apache Hadoop, A case

study: the Grep The Web application, High performance computing on a cloud,

cloud for biological research, Social computing, digital content, and cloud

computing.

Cloud Applications: Scientific Applications, Business and consumer

Application

10

3 Cloud Resource Virtualization: definition, merits and demerits, types and

techniques, Layering and virtualization, Virtual machine monitors, Virtual

machines Full virtualization and para virtualization, Hardware support for

virtualization Case study: Xen -a VMM based on para virtualization,

Optimization of network virtualization in Xen 2.0, vBlades – para virtualization

targeting a x86-64 Itanium processor, A performance comparison of virtual

machines, The darker side of virtualization, Software fault isolation.

11

4 Self Study Component:

Cloud Resource Management and Scheduling: Policies and mechanisms for

resource management, Stability of a two-level resource allocation architecture,

Feedback control based on dynamic thresholds, Coordination of specialized

autonomic performance managers, utility based model for cloud-based web

services, Resource bundling, combinatorial auctions for cloud resources, fair

queuing, Start time fair queuing, borrowed virtual time.

Python for Cloud: Python for Amazon Web services, Python for Google Cloud

platform, Python for Windows Azure, python for map Reduce

11

5 Cloud Security, Cloud Application Development, Storage systems: Storage

models, file systems, databases, DFS, General parallel File system, GFS, Apache

Hadoop, Locks & Chubby, TPS & NOSQL databases, Bigdata, Mega store.

Cloud Security: Risks, Security, Privacy, Trust, Security of OS, VM, VMM,

Shared Image, Management OS, Xoar.

10

Course

Outcomes

Description RBT

Levels

CO1 Analyze the Cloud computing setup with it's vulnerabilities and

applications using different architectures.

L1,

L3

CO2 Design different workflows according to requirements and Apply map

reduce programming model.

L4,

CO3 Apply and Design suitable Virtualization concept, Cloud Resource

Management and design scheduling algorithms.

L5

CO4 Create combinatorial auctions for cloud resources and Design scheduling

algorithms for computing clouds

L6

CO5 Assess cloud Storage systems and Cloud security, the risks involved, its

impact and develop cloud application

L2

CO6 Broadly Educate to know the impact of engineering on legal and societal

issues involved in addressing the security issues of cloud computing.

L1,

L2

CO-PO

Mapping

PO

1

PO

2

PO3 PO

4

PO

5

P06 PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 2 1

CO2 2 1 2 2

CO3 2 2 2 2

CO4 2 2 1 2 1

CO5 3 2 2 2 1

CO6 2 3 2 2 2 1

Strong -3 Medium -2 Weak -1

TEXT BOOKS:

1. Dan C. Marinescu, Cloud Computing: Theory and Practice, Elsevier Science, 2013, 1st

Edition, Print Book ISBN :9780124046276, eBook ISBN :9780124046412

REFERENCE BOOKS:

1. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and

Paradigms, Willey 2014.

SELF STUDY REFERENCES/WEBLINKS:

1. Cloud Computing : A hands on Approach, Arshdeep Bagha - Vijay Bagha Madisetti ,

2013, ISBN/EAN13: 1494435144 / 9781494435141.

2. https://nptel.ac.in/content/syllabus_pdf/106104182.pdf

3. https://nptel.ac.in/content/syllabus_pdf/106105167.pdf

COURSE COORDINATOR: Dr. SIDDARAJU

https://nptel.ac.in/content/syllabus_pdf/106104182.pdf

https://nptel.ac.in/content/syllabus_pdf/106105167.pdf

Course Title: Internet Of Things

Course Code:

20SCS13

No. of Credits: 3 = 3 : 0 : 0

(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE+ SEE = 50+50=100 Total No. of Contact

Hours : 52

Course

Objectives:

Description

1. Infer the concepts of Physical and Logical design in IoT to deploy

applications at different levels.

2. Interpret the vision of IoT from a global context.

3. Understand the IoT Market perspective and discover the IoT architectural

standards.

4. Identify the specifications involved in designing IoT applications.

5. Classify the Real-World Domain specific IoT applications.

Unit

No

Syllabus Content

No of

Hours

1 Introduction and Concepts: Definition & Characteristics of IoT, Physical

Design of IoT: Things in IoT, IoT Protocols, Logical Design of IoT: IoT

Functional Blocks, IoT Communication Models, IoT Communication APIs, IoT

Enabling Technologies: Wireless Sensor Networks, Cloud Computing, Big Data

Analytics, Communication Protocols, Embedded Systems, IoT Levels and

Deployment Templates: IoT Level-1, IoT Level-2, IoT Level-3, IoT Level-4,

IoT Level-5, IoT Level-6.

11

2 M2M to IoT: The Vision-Introduction, From M2M to IoT, M2M towards IoT-

the global context, A use case example, Differing Characteristics.

10

3 M2M to IoT: A Market Perspective- Introduction, Some Definitions, M2M

Value Chains, IoT Value Chains, An emerging industrial structure for IoT, The

international driven global value chain and global information monopolies. M2M

to IoT-An Architectural Overview: Building an architecture, Main design

principles and needed capabilities, An IoT architecture outline, standards

considerations.

10

4 IoT Architecture-State of the Art – Introduction, State of the art, SDN and

NFV for IoT: Software Defined Networking, Network Function Virtualization,

IoT Design Methodology: Purpose & Requirements Specification, Process

Specification, Domain Model Specification, Information Model Specification,

Service Specifications, IoT Level Specification, Functional View Specification,

Operational View Specification, Device & Component Integration and

Application Development.

11

5 Self-Study Component :

Domain Specific IoTs: Home Automation: Smart Lighting, Smart Appliances,

Intrusion Detection, Smoke/Gas Detectors, Cities: Smart Parking, Smart

10

Lighting, Smart Roads, Structural Health Monitoring, Surveillance, Emergency

Response, Environment: Weather Monitoring, Air Pollution Monitoring, Noise

Pollution Monitoring, Forest Fire Detection, River Floods Detection, Energy:

Smart Grids, Renewable Energy Systems, Prognostics, Retail: Inventory

Management, Smart Payments, Smart Vending Machines, Logistics: Route

Generation & Scheduling, Fleet Tracking, Shipment Monitoring, Remote Vehicle

Diagnostics, Agriculture: Smart Irrigation, Green House Control, Industry:

Machine Diagnosis & Prognosis, Indoor Air Quality Monitoring, Health &

Lifestyle: Health & Fitness Monitoring, Wearable Electronics.

Course

Outcomes Description

RBT

Levels

CO1

Examine the Physical design and Logical design required to enable IoT

applications and employ technologies to deploy applications at different

levels.

L3

CO2 Express the vision of M2M and IoT to satisfy the requirements of a global

market. L2

CO3 Determine the architectural principles and standards for structuring the IoT

applications. L2

CO4 Compare and Contrast the use of Devices, Gateways and Data

Management in IoT. L3

CO5 Articulate the need for SDN, NFV from IoT perspective and analyze the

design methodologies involved in building the IoT applications. L3

CO6 Illustrate the applications of IoT in different domains and identify Real

World Design Constraints. L2

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7 PO8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 3 3 3 - - - - - - -

CO2 2 2 2 2 2 - - - - - - -

CO3 3 3 2 2 2 - - - - - - -

CO4 2 2 2 2 2 - - - - - - -

CO5 3 3 3 3 3 - - - - - - -

CO6 3 3 3 3 3 - - - - - - -


TEXT BOOKS:

1. Arshdeep Bahga, Vijay Madisetti, "Internet of Things: A Hands-on Approach", 1st

Edition, Orient Blackswan Private Limited, 2015. (ISBN-13: 978-8173719547)

2. Ian Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos,

David Boyle, "From Machine-to-Machine to the Internet of Things: Introduction to a

New Age of Intelligence", 1st Edition, Academic Press, 2014. (ISBN-13: 978-

0124076846)

REFERENCE BOOKS:

1) Cuno Pfister, "Make: Getting Started with the Internet of Things: Connecting Sensors

and Microcontrollers to the Cloud", 1st Edition, O'Reilly Publishers, 2011. (ISBN-13: 978-

9350234136)

2) Adrian Mcewen, Hakin Cassimally, "Designing the Internet of Things", 1st Edition, Wiley

Publishers, 2015. (ISBN-13: 978-8126556861)

3) Raj Kamal, "Internet of Things", 1st Edition, McGraw Hill Education Publishers, 2017.

(ISBN-13: 978-9352605224)

4) David Hanes, et al., "IoT Fundamentals: Networking Technologies, Protocols and Use

Cases for the Internet of Things", 1st Edition, Pearson Education, 2017. (ISBN-13: 978-

9386873743)

5) Rahul Dubey, "An Introduction to Internet of Things: Connecting Devices, Edge

Gateway, and Cloud with Applications", 1st Edition, Cengage India Learning Pvt Ltd, 2019.

(ISBN-13: 978-9353500931)

COURSE COORDINATOR: Dr.Gowrishankar S.

Course Title: Soft Computing

Course Code:

20SCS14


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE+SEE = 50+50=100 Total Number of Contact

Hours : 52

Course

Objectives:

Description

1. To learn the key aspects of Soft computing

2. To know about the components and building block hypothesis of Genetic

Algorithm.

3. To gain insight onto Neuro Fuzzy modeling and control.

4. To gain knowledge in machine learning through Support vector machines

Unit

No

Syllabus Content

No of

Hours

1 Introduction to Soft computing: Neural networks, Fuzzy logic, Genetic

algorithms, Hybrid systems and its applications. Fundamental concept of ANN,

Evolution, basic Model of ANN, Terminologies used in ANN, MP model, linear

superagility, Hebb Network.

11

2 Supervised Learning: Perceptual Network, Adaptive linear neuron, Multiple

adaptive linear neurons, Back propagation Network, Associative Memory

Network: introduction, training algorithms for pattern association, associative

memory network, hetero-associative memory network, bidirectional associative

memory.

10

3 Classical sets and Fuzzy Sets – classical and Fuzzy Relations – Features of

membership functions, Fuzzification and methods of membership value

assignment. De fuzzification lambda cuts for fuzzy relations and fuzzy sets.

10

4 Fuzzy Decision Making: introduction, individual decision making, multi

person Decision making, multi objective decision making, multi attribute

decision making, fuzzy Bayesian decision making, Fuzzy logic control systems:

introduction, control system design, architecture and operation of FLC systems,

FLC system Models, Applications of FLC systems

11

5 Self-Study Component:

Genetic algorithms: Introduction - Basic operations - Traditional optimization

and search techniques. Genetic algorithms and search space, Operators of

genetic algorithms – Genetic programming

10

Course

Outcomes

Description RBT

Levels

CO1 Understand the basics of soft computing, ANN and Terminologies to

relate and understand the real time problems

R2

R3

CO2 Solve the real-time problems using ANN representations R3 R4

CO3 Analyze and adopt fuzzy logic in designing and implementing soft

computing applications.

R3

R4

CO4 Analyze and apply genetic algorithms to solve the optimization problems R3

R4

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 3

CO2 3 3 2

CO3 3 3 3 2

CO4 3 3 3 2 2 2


TEXT BOOKS:

1. Principles of Soft computing, S N Sivanandam, and S N Deepa, Wiley India, 3rd edition ISBN

13: 978812658744-5, 2019

REFERENCE BOOKS:

1. Neuro-fuzzy and soft computing, J.S.R. Jang, C.T. Sun, E. Mizutani, Phi (EEE edition), 2012,

ISBN 0-13-261066-3

2. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”, Third Edition

WEBLINKS:

1. Introduction to Soft Computing by Prof. Debasis Samanta NPTEL course

2. L. A. Zadeh, "Fuzzy Algorithms", Information and Control, vol. 12, pp. 94-102, 1968. CrossRef

Google Scholar

3. 2. L. A. Zadeh, "A Rationale for Fuzzy Control", J.Dynamic Systems Measurement and Control, vol.

94, pp. 3-4, 1972. CrossRef Google Scholar

4. 3. L. A. Zadeh, "Outline of a New Approach to the Analysis of Complex Systems and Decision

Processes", IEEE Trans. Systems Man and Cybernetics, vol. SMC-3, pp. 28-44, 1973

COURSE COORDINATOR: Dr. K R Shylaja

Course Title: INTERNET OF THINGS LABORATORY

Course Code:

18SCSL17

No. of Credits: 2 = 0 : 0 : 2

(L-T-P) No. of Practical

hours/week : 3 Exam Duration :

3 hours

CIE+ SEE = 50+50=100

Course

Objectives:

Description

1. Develop IoT applications using sensing devices, actuation, processing and

communications through IoT development kits.

2. Illustrate the process of building, testing and working of IoT applications

through prototyping and programming.

Sl.

No Syllabus Content

1. Write a Raspberry Pi based program to make eight LEDs to blink as flowing water.

2. Illustrate the process of turning an LED ON or OFF using a button on a Raspberry Pi.

3. Design and develop a heart monitoring system using Arduino/Raspberry Pi.

4. Develop a home security system using Raspberry Pi/Arduino and PIR Sensor.

5. Write Python program to monitor the environmental temperature using Arduino/Raspberry

Pi.

6. Devise a program to connect or disconnect a circuit using slide switch on a Raspberry Pi.

7. Develop a Raspberry Pi based program to gradually increase or decrease the luminance of

an LED with Pulse Width Modulation to simulate human breathing.

8. Write a program using Arduino/Raspberry Pi to display the characters on a LCD module.

Course

Outcomes Description

RBT

Levels

CO1 Examine the key components that make up an IoT system. L3

CO2

Experiment with various sensor modules like environmental, health and

security modules and examine how they fit in the overall development

process of IoT applications.

L3

CO3 Develop hands-on skills by prototyping and building IoT applications. L3

CO4 Determine how the IoT concept fits within the broader ICT industry. L3

CO-PO

Mapping

PO

1 PO2

PO

3 PO4 PO5 PO6 PO7

PO

8 PO9

PO

10

PO

11

PO

12

CO1 3 3 3 3 3 - - - - - - -

CO2 3 3 3 2 3 - - - - - - -

CO3 3 3 3 3 3 - - - - - - -

CO4 2 2 2 2 2 - - - - - - -


TEXT BOOKS:

Conduct of Practical Examination

All the laboratory programs are to be included for practical examination.

The instructions and breakup of marks printed on the cover page of the answer script are to be

strictly adhered by the examiners.

Students are allowed to pick any one program randomly from the lot.

Change of program is allowed only once and the marks will be deducted as per the Dr.AIT

Autonomous/Examination rules and regulations.

COURSE COORDINATOR: Dr. Gowrishankar S.

Course Title: Advanced Operating System

Course Code:

20SCS151


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE+ SEE = 50+50=100

Total No. of Contact Hours

: 52

Course

Objectives:

Description

1. To learn the fundamentals of Operating Systems.

2. To learn the mechanisms of OS to handle processes and threads and their

communication

3. To learn the mechanisms involved in memory management in contemporary OS

4. To gain knowledge on distributed operating system concepts that includes

architecture, Mutual exclusion algorithms, deadlock detection algorithms and

agreement protocols

5. To know the components and management aspects of concurrency management

6. To learn programmatically to implement simple OS mechanisms

Unit

No

Syllabus Content

No of

Hours

1 Operating System: Overview, Process description & Control: Operating System

Objectives and Functions, The Evolution of Operating Systems, Major

Achievements, Developments Leading to Modern Operating Systems: What is a

Process?, Process States, Process Description, Process Control, Execution of the

Operating System, Security Issues, UNIX SVR4 Process Management

Text Book 2: Chapter 2 & 3

10

2 Threads, SMP, and Microkernel, Processes and Threads, Symmetric

Multiprocessing (SMP), Microkernel, Solaris Thread and SMP Management,

Virtual Memory: hardware and control structures, Operating System Software,

UNIX and Solaris Memory Management.

Text Book2: Chapter 4 & 8

11

3 Multiprocessor and Real-Time Scheduling: Multiprocessor Scheduling, Real-

Time Scheduling, Linux Scheduling, UNIX process Scheduling, Distributed

Operating System: Motivation, Types of Network-based OS, Network structure,

Text Book 1: Chapter 10 Text Book 2: Chapter 16

10

4 Distributed File system: Background, Naming and transparency, Remote File

Access, State full and Stateless services. Distributed Synchronization: Event

Ordering, Mutual Exclusion, Atomicity, Concurrency Control, Deadlock

Handling, Election algorithm and Reaching agreement

Text Book 1: Chapter 17 & 18

11


File Management: Overview, file Organization and access, file directories, File

sharing, Record blocking, secondary storage management, File System Security,

UNIX file Management.

10

Case Study: Linux system, Design Principles, kernel modules, process

management, scheduling, memory management, file system, input and output,

inter process communication, network structure, security

Text Book 1: Chapter 21, Text book 2: Chapter 12

Course

Outcomes

Description RBT

Levels

CO1 Understand the structure and components of OS and their working

mechanism

R1 R2

R3

CO2 Analyze and design the applications to run in parallel using OS modules R3 R4

CO3 Analyze and implement the mechanisms involved for sharing resources

in distributed and timesharing environments

R2 R4

CO4 Conceptualize the components involved in designing a contemporary OS R3

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P06 PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 2

CO2 3 3 3 2

CO3 3 3 3 2 2

CO4 3 3 2 2


TEXT BOOKS:

1. Avi Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts, 9th Edition,

John wiley & Sons, Inc. ISBN: 978-1-118-09375-7, ©2013

2. William Stallings, Operating Systems: Internals and Design Principles, 8th edition Pearson

Education Limited, 2014 ISBN: 1292061944, 9781292061948

REFERENCE BOOKS:

1. D.M Dhamdhere: Operating systems - A concept based Approach, 3rd Edition,

Tata McGraw- Hill, 2012.

2. P.C.P. Bhatt: Introduction to Operating Systems Concepts and Practice, 3rd

Edition, PHI, 2010.

3. Harvey M Deital: Operating systems, 3rd Edition, Pearson Education, 2011.


1. Operating System By Prof. Sorav Bansal, IIT Delhi,

https://swayam.gov.in/nd1_noc20_cs04/preview

2. Linux Kernel Programming - IPC b/w Userspace and KernelSpace by udemy https://www.udemy.com/course/netlinksockets/

3. Introuction to Operating Systems from Udemy

https://classroom.udacity.com/courses/ud923/lessons/3056258560/concepts/33061990140923


https://www.udemy.com/course/netlinksockets/

https://classroom.udacity.com/courses/ud923/lessons/3056258560/concepts/33061990140923

Course Title: Advances in Computer Networks

Course Code:

20SCS152


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50+50

Total Number of

Contact Hours : 52

Course

Objectives:

Description

1. Discuss with the basics of Computer Networks.

2. Compare various Network architectures.

3. Discuss various fundamental network protocols..

4. Define and analyze network traffic, Congestion Control and Resource

Allocation.

Unit

No

Syllabus Content No of

Hours

1 Foundation: Building a Network, Requirements, Perspectives, Scalable

Connectivity, Cost-Effective Resource sharing, Support for Common

Services, Manageability, Protocol layering, Performance, Bandwidth and

Latency, Delay X Bandwidth Product, Reliable Transmission, Exercise

Problems Stop-and-Wait Protocol , Sliding Window protocol.

11

2 Internetworking I: Switching and Bridging, Datagram’s, Virtual Circuit

Switching, Source Routing, Bridges and LAN Switches, Basic

Internetworking (IP), Exercise Problems. What is an Internetwork?, Service

Model, Global Addresses, Datagram Forwarding in IP, sub-netting and

classless addressing, Address Translation (ARP), Host Configuration

(DHCP), Error Reporting (ICMP),

11

3 Internetworking- II: Network as a Graph, Distance Vector (RIP), Link State

(OSPF), Metrics, The Global Internet, Routing Areas, Routing among

Autonomous systems (BGP), IP Version 6 (IPv6).

10

4 End-to-End Protocols: Simple Demultiplexer (UDP), Reliable Byte

Stream(TCP), End-to-End Issues, Segment Format, Connecting Establishment

and Termination, Sliding Window Revisited, Triggering Transmission,

Adaptive Retransmission, Queuing Disciplines, FIFO, Fair Queuing, TCP

Congestion Control, Additive Increase/ Multiplicative Decrease, Slow Start,

Fast Retransmit and Fast Recovery

10


Congestion Control and Resource Allocation Congestion-Avoidance

Mechanisms, DEC bit, Random Early Detection (RED), Source-Based

Congestion Avoidance. The Domain Name System (DNS), Electronic Mail

(SMTP, POP, IMAP, MIME), World Wide Web (HTTP), Network

Management (SNMP)

10

Course

Outcomes

Description RBT

Levels

CO1 List and classify network services, protocols and architectures, explain

why they are layered. L2

CO2 Compare various network architectures L

CO3 Analyze various Network protocols and their applications L3

CO4 Explain develop effective communication mechanisms using

techniques like connection establishment, queuing theory, recovery etc. L3

CO5 Define and analyze network traffic, congestion control and resource

allocation L3

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 2

CO2 3 2 2

CO3 3 3

CO4 3 2 2

CO5 3 2

Strong -3 medium -2 weak -1

TEXT BOOKS:

1. Larry Peterson and Bruce S Davis “Computer Networks :A System Approach” 5th Edition,

Elsevier -2014

2. Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols and Architecture”

6th Edition, PHI - 2014

REFERENCE BOOKS:

1. Uyless Black, “Computer Networks Protocols , Standards and Inte rfaces” 2nd Edition -

PHI.

2. Behrouz A Forouzan, “TCP /IP Protocol Suite” 4 th Edition – Tata McGraw-Hill

COURSE COORDINATOR: SHAMSHEKHAR S PATIL

Course Title: Artificial Intelligence and Prolog Programming

Course Code:

20SCS153


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50+50=100 Total No. of Contact Hours

: 52

Course

Objectives:

Description

1. To Implement non-trivial AI techniques in a relatively large system

2. To understand uncertainty and Problem solving techniques.

3. To understand various symbolic knowledge representation to specify domains

and reasoning tasks of a situated software agent.

4. To understand different logical systems for inference over formal domain

representations, and trace how a particular inference algorithm works on a

given problem specification.

5. To understand how to write a Prolog programs for Artificial Intelligence

6. Analyzing and Solving Artificial Intelligence programs by using

Backtracking methods

Unit

No

Syllabus Content

No of

Hours

1 What is Artificial Intelligence: The AI Problems, The Underlying assumption,

What is an AI Technique?, The Level of the model, Criteria for success, real

world Problems, problem spaces and search: Defining, the problem as a state

space search, Production systems, Problem characteristics, Production system

characteristics, Issues in the design of search programs, Additional Problems.

Intelligent Agents: Agents and Environments, The nature of environments, The

structure of agents. (Text Book 1: Chapter 1 & 2 Text Book 2: Chapter 2)

10

2 Heuristic search techniques: Generate-and-test, Hill climbing, Best-first

search, Problem reduction, Constraint satisfaction, Mean-ends analysis.

Knowledge representation issues: Representations and mappings, Approaches to

knowledge representation, Issues in knowledge representation, The frame

problem. Using predicate logic: Representing simple facts in logic, representing

instance and ISA relationships, Computable functions and predicates. (Text Book

1: Chapter 3, 4 & 5)

10

3 Symbolic Reasoning Under Uncertainty: Introduction to non-monotonic

reasoning, Logic for non-monotonic reasoning, Implementation Issues, Breadth-

first search, Statistical Reasoning: Probability and bayes Theorem, Certainty

factors and rule-based systems, Bayesian Networks

Text Book 1: Chapter 7 & 8 Text Book 2: Chapter 13

10

4 Prolog Programming for Artificial Intelligence, An Overview of Prolog, An

example program: defining family relations, Extending the example program by

rules, A recursive rule definition, How Prolog answers questions, Declarative and

procedural meaning of programs; Syntax and Meaning of Prolog Programs, Data

objects, Matching Declarative meaning of Prolog programs, Procedural meaning,

Example: monkey and banana, Order of clauses and goals, Remarks on the

relation between Prolog and logic.

(Text Book 3: Chapters 1 & 2)

11

5 Lists, Operators, Arithmetic, Representation of lists, Some operations on lists,

Operator notation, Arithmetic, Using Structures: Example Programs, Retrieving

structured information from a database, Doing data abstraction, Simulating a non-

deterministic automaton, Travel planning, The eight queens problem,

Controlling, Backtracking, Preventing backtracking, Examples using cut,

Negation as failure, Problems with cut and negation, Input and Output,

Communication with files.

(Text Book 3: Chapter 3, 4 ,5 & 6)

Self-Study Components:

Implement programs on agent building, knowledge representation and reasoning

mechanisms in prolog

11

Course

Outcomes

Description RBT

Levels

CO1 Acquire knowledge and understand AI agents with problem solving,

reasoning, planning, decision making, and learning abilities

CO2 Analyze the real time problems to represent it in AI framework and

techniques

CO3 Use prolog programming constructs to represent AI components

CO4 Design and implement AI applications in prolog to solve real time

problems

CO-PO

Mapping

PO

1

PO

2

PO3 PO

4

PO

5

P06 PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 2 2

CO2 3 3 3 2 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3 3


TEXT BOOKS:

1. Elaine Rich,Kevin Knight, Shivashanka B Nair:Artificial Intelligence, Tata CGraw Hill 3rd

edition. 2013, ISBN 10: 0070087709 ISBN 13: 9780070087705

2. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, Pearson 3rd edition

2013, ISBN: 0-13-604259-7

3. Ivan Bratko Prolog Programming for Artificial Intelligence , (International Computer Science

Series) 4th Edition, Publisher: Pearson Education Canada; 4th edition, 2011,

ISBN-10: 0321417461; ISBN-13: 978-0321417466

REFERENCE BOOKS:



1. An Introduction to Artificial Intelligence By Prof. Mausam , IIT Delhi


2. W3schools online tutorials

https://www.tutorialspoint.com/prolog_in_artificial_intelligence/index.asp

3. https://lpn.swi-prolog.org/lpnpage.php?pageid=online


http://www.abebooks.com/products/isbn/9780070087705/5012983601

http://www.abebooks.com/products/isbn/9780070087705/5012983601


https://www.tutorialspoint.com/prolog_in_artificial_intelligence/index.asp

https://lpn.swi-prolog.org/lpnpage.php?pageid=online

Course Title: Parallel Computing with GPU Architecture.

Course Code:

20SCS154


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50+50=100

Total No. of Contact

Hours : 52

Course

Objectives:

Description

1. Understand the need of parallel algorithms.

2: Decomposition strategies of problem.

3: Knowledge about the measure the performance of parallel algorithm.

4. Study applications of parallel computing.

5. Understanding the programming with MPI, OpenMP.

Unit

No


Hours

1. Introduction to Parallel Computing: Implicit Parallelism, Limitations of

Memory, Dichotomy of Parallel Computing Platforms, Physical Organization

of Parallel Platforms, Communication Costs in Parallel Machines, Routing

Mechanisms for Interconnection Networks, Impact of Process-Processor

Mapping and Mapping Techniques.

10

2. Design Decomposition Techniques: Characteristics of Tasks and

Interactions, Mapping Techniques for Load Balancing, Methods for

Containing Interaction Overheads, Parallel Algorithm Models Basic

Communication Operations One-to-All Broadcast and All-to-One Reduction,

All-to-All Broadcast and Reduction, All-Reduce and Prefix-Sum Operations,

Scatter and Gather.

10

3. Performance Metrics for parallel systems. The effect of Granularity and Data

Mapping on Performance. The Scalability of parallel systems, ISO efficiency

metric of scalability, sources of parallel overhead, Minimum execution time

and minimum cost-optimal execution time.

10

4. Dense Matrix Algorithms: Matrix-Vector Multiplication, Matrix-Matrix

Multiplication, Solving a System of Linear Equations Sorting: Issues, Sorting

Networks, Bubble Sort and its Variants, Quicksort, Bucket and Sample Sort.

10

5. Self Study Components:

OpenMP, MPI, CUDA/OpenCL, Chapel, etc. Thread basics, Work Sharing

constructs, Scheduling, Reduction, Mutual Exclusion Synchronization &

Barriers, The MPI Programming Model, MPI Basics, Global Operations,

Asynchronous Communication, Modularity, Other MPI Features Basic of

GPGPU, CUDA Programming model, CUDA memory type Performance

Issues.

12

Course

Outcomes

Description RBT

Levels

CO1 Students are able to describe principles of parallel algorithm design. L2

CO2 Students are able to analyze analytical modeling of parallel programs,

programming models for shared- and distributed-memory systems. L4

CO3 Students are able to analyze performance evaluation of Parallel

algorithms. L4

CO4 Students are able to design parallel algorithms for matrix, graph and sorting

operations. L3

CO5 Students are able to explore how to use a GPU as a general processing

device. L3

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P06 PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 2 2 2 - - - - - - -

CO2 3 3 3 2 2 - - - - - - -

CO3 3 3 3 3 2 - - - - - - -

CO4 3 3 3 3 3 - - - - - - -

CO5 3 3 3 2 2 - - - - - - -


TEXT BOOKS:

1. Introduction to Parallel Computing (2nd ed.), by Ananth Grama, Anshul Gupta, George Karypis,

and Vipin Kumar.

2. High Performance Cluster Computing: Programming and Applications, Volume 2 By Buyya

Raijkumar.

3. CUDA Programming: A Developer's Guide to Parallel Computing with GPUs by shane cook.

REFERENCE BOOKS:

1. Introduction to High-Performance Scientific Computing, Victor Eijkhout, 2011. http://tacc

web.austin.utexas.edu/staff/home/veijkhout/public_html/Articles/EijkhoutIntroToHPC.pdf

2. High Performance Computing, Charles Severance, 1998. http://cnx.org/content/col11136/latest/

3. MPI: The Complete Reference, Marc Snir, Steve Otto, Steven Huss-Lederman, David Walker,

and Jack Dongarra, 1996. http://www.netlib.org/utk/papers/mpi-book/mpi-book.html

4. MPI: The Complete Reference, Marc Snir, Steve Otto, Steven Huss-Lederman, David Walker,

and Jack Dongarra, 1996. http://www.netlib.org/utk/papers/mpi-book/mpi-book.html

5. Designing and Building Parallel Programs, Ian Foster, 1995. http://www.mcs.anl.gov/~itf/dbpp/

6. Parallel Programming in C with MPI and OpenMP, Michael J. Quinn, McGraw-Hill.

COURSE COORDINATOR: Dr. Prabha R

http://cnx.org/content/col11136/latest/

http://www.netlib.org/utk/papers/mpi-book/mpi-book.html

http://www.netlib.org/utk/papers/mpi-book/mpi-book.html

Course Title: Introduction to Blockchain Technology

Course Code:

20SCS161


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE+ Assignment + SEE

= 50+50=100

Total No. of Contact Hours

: 52

Course

Objectives:

Description

1. To learn fundamentals of Blockchain Technology.

2. To apply the cryptographic primitives in making the Blockchain model

robust.

3. To be familiar with Consensus Algorithm.

4. To learn and apply concept of Decentralized in real life applications.

Unit

No

Syllabus Content

No of

Hours

1 Introduction to Blockchain

What is Blockchain, Reality about Blockchain and How Block chain works,

Blockchain Architecture and Platforms(Big Chain DB, corda, Etherum etc.),

Digital Ledger Technology, Peer–to-Peer Network, Centralized, Decentralized

and Distributed Networks, Layers of Blockchain, why Blockchain is important,

Smart Contracts, Block in a Blockchain, Transaction, Permission less and

Permissioned Blockchain, Consortium Blockchain, The Chain and the Longest

Chain, Distributed Consensus, Byzantine Fault Tolerant Consensus Methods

11

2 Crypto Primitives

Cryptographic Hash Function, Properties of a hash function, Hash pointer and

Merkle tree, Digital Signature, Public Key Cryptography, A basic

cryptocurrency.

Bitcoin: Creation of coins, Payments and double spending, FORTH – the

precursor for Bitcoin scripting, Bitcoin Scripts, Bitcoin P2P Network,

Transaction in Bitcoin Network, Block Mining, Block propagation and block

relay.

10

3 Mining and Consensus

Why Consensus, Distributed consensus in open environments, Consensus in a

Bitcoin network, Proof of Work (PoW), Hashcash PoW, Attacks on PoW and

the monopoly problem, Proof of Stake (POS), Round Robin Consensus

Algorithm, Proof of Authority, Proof of Burn (POB), Proof of Elapsed Time,

Consensus Comparison Matrix, Ledger Conflicts and resolution.

10

4 Privacy, Security Issues in Blockchain

Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity

preservation, attacks on Blockchains – such as Sybil attacks, selfish mining,

10

51% attacks - -advent of aground, and Shading based consensus algorithms to

prevent these attacks.


DECENTRALIZED APPLICATIONS (DAPPS)

Applications - Applications of Blockchain in Healthcare, e-governance,

anomaly detections, use cases, trends on blockchains, server less blocks,

scalability issues, and blockchain on clouds.

Hyper ledger – Fabric architecture, implementation, networking, fabric

transactions, demonstration, smart contracts.

11

Course

Outcomes

Description RBT

Levels

CO1 Acquire the basic knowledge of Blockchain technology L1,L2

CO2 Apply the cryptographic primitives in making the Blockchain model

robust.

L3

CO3 Analyze various mining and Consensus algorithms used in Blockchain L4

CO4 Aware about privacy and security issues in Blockchain L2

CO5 Design and understand various applications using Blockchain. L5

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 2 2

CO2 3 3 3 2 2 2

CO3 3 3 2 2 2 2

CO4 3 3 3 3 2 2

CO5 3 3 3 2 3 2


TEXT BOOKS:

1. Arvind Narayanan, “Bitcoin and Cryptocurrency Technologies: A Comprehensive

Introduction”, Princeton University Press,July 19, 2016

2. “S. Shukla, M. Dhawan, S. Sharma, S. Venkatesan, ‘Blockchain Technology:

Cryptocurrency and Applications’, Oxford University Press, 2019.

REFERENCE BOOKS:

1. Andreas M. Antonopoulos, Mastering Bitcoin, O'Reilly, 2014

2. Melanie Swa, Blockchain: Blueprint for a new Economy, O’Reilly, 2015

3. Antony Lewis, the Basics of Bitcoin and Blockchain.

4. Bikramaditya Singhal, Gautam Dhameja, Priyansu Sekhar Panda, Beginning Blockchain-

A Beginner’s Guide to Building Blockchain Solutions, APress, 2018


1. Imran Bashir, Mastering Blockchain, Packt Publishing, Birmingham, UK 2016

2. https://swayam.gov.in/nd1_noc19_cs63/preview

COURSE COORDINATOR: Dr. SIDDARAJU

Course Title: Advance Algorithms and Data Structure

Course Code:

20SCS162


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE+ SEE = 50+50=100 Total No. of Contact Hours

: 52

Course

Objectives:

Description

1. To learn implementing iterative and recursive optimized solutions

2. To learn the graph search algorithms.

3. To study network flow problems.

4. To study the working mechanism of advanced data structures

5. To understand the application of hashing technique

Unit

No

Syllabus Content

No of

Hours

1 Review of Analysis Techniques: Growth of Functions: Asymptotic notations;

Standard notations and common functions; Recurrences and Solution of

Recurrence equations- The Course substitution method, The recurrence – tree

method, The master method; Amortized Analysis: Aggregate, Accounting and

Potential Methods

11

2 Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in

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

Fulkerson method; Maximum bipartite matching.

10

3 Hash Tables, Direct-address tables, Hash tables, Hash functions, Open

addressing, Perfect hashing, Heaps Maintaining the heap property, Building a

heap, The heapsort algorithm, Priority queues, Binomial heaps, Fibonacci

heaps.

10

4 Binary Search Trees, What is a binary search tree? Querying a binary search

tree, Insertion and deletion , Randomly built binary search trees, Red-Black

Trees, Properties of red-black trees, Rotations, Insertion Deletion

11


Application to Splay Trees. External Memory ADT - B-Trees. Priority

Queues, B-Trees, Definition of B-trees, Basic operations on B-trees , Deleting

a key from a B-tree, Structure of Fibonacci heaps,

10

Course

Outcomes

Description RBT

Levels

CO1 Analyze and solve the time complexity of iterative , recursive and graph

based algorithms

R2, R3,

R4

CO2 Interpret the logic and determine the suitable operational mechanism of

data structures for a real-time applications

R2, R3,

R4

CO3 Investigate and Analyze the optimized operations on data structures R4

CO4 Implement projects using best suitable data structures for real time

applications using modern programming tool/simulation.

R5

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 3

CO2 3 3 3 2 2

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3


TEXT BOOKS:

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

Edition, Prentice-Hall of India, 2010. ISBN:9780262033848

REFERENCE BOOKS:

1. Ellis Horowitz, SartajSahni, S.Rajasekharan: Fundamentals of Computer Algorithms, 2nd

Edition, Universities press, 2007, ISBN 8173716129, 9788173716126

2. Horowitz, Sahani, Dinesh Mehata, ―Fundamentals of Data Structures in C++‖, Galgotia

Publisher, ISBN: 8175152788, 9788175152786.

3. M Folk, B Zoellick, G. Riccardi, ―File Structures‖, Pearson Education, ISBN:81-7758-37-

5

4. Peter Brass, ―Advanced Data Structures‖, Cambridge University Press, ISBN: 978-1-107-

43982-5


1. Introduction to algorithms and analysis By Prof. Sourav Mukhopadhyay | IIT

Kharagpur


2. Khan Academy course on advanced algorithms and data structure



Course Title: Course Title : Cyber Security and Cyber laws

Course Code:

20SCS163


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50+50=100


Hours : 52

Course

Objectives:

Description

1. To provide an understanding Computer forensics fundamentals

2. To analyze various computer forensics technologies

3. To provide computer forensics systems

4. To identify methods for data recovery.

5. 5. To apply the methods for preservation of digital evidence

Unit

No


Hours

1. Computer Forensics Fundamentals

Introduction to Computer Forensics, Use of Computer Forensics in Law

Enforcement, Computer Forensics Assistance to Human

Resources/Employment Proceedings, Computer Forensics Services,

Benefits of Professional Forensics Methodology.

10

2. Types of Computer Forensics Technology

Types of Military Computer Forensic Technology, Types of Law

Enforcement: Computer Forensic Technology, Types of Business

Computer Forensic Technology, Specialized Forensics Techniques, Hidden

Data and How to Find It, Spyware and Adware.

Encryption Methods and Vulnerabilities, Protecting Data from Being

Compromised, Internet Tracing Methods ,Security and Wireless

Technologies ,Avoiding Pitfalls with Firewalls, Biometric Security

Systems.

11

3. Types of Computer Forensics Systems Internet Security Systems, Intrusion Detection Systems, Firewall Security

Systems, Storage Area Network Security Systems, Network Disaster

Recovery Systems, Public Key Infrastructure Systems, Wireless Network

Security Systems.

Satellite Encryption Security Systems, Instant Messaging (IM) Security

Systems, Net Privacy Systems, Identity Management Security Systems

,Identity Theft , Biometric Security Systems, Homeland Security Systems

11

4. Data Recovery

Data Recovery Defined ,Data Backup and Recovery ,The Role of Backup in

Data Recovery ,The Data-Recovery Solution ,Hiding and Recovering

Hidden Data

Evidence Collection and Data Seizure

Why Collect Evidence?, Collection Options ,Obstacles ,Types of Evidence

,The Rules of Evidence ,Volatile Evidence ,General Procedure Collection

and Archiving, Methods of Collection, Artefacts.

10

5. Self-study component:

Duplication and Preservation of Digital Evidence

Preserving the Digital Crime Scene, Computer Evidence Processing Step.

Computer Image Verification and Authentication Special Needs of

Evidential Authentication, Practical Considerations.

10

Course

Outcomes

Description RBT

Levels

CO1 To explore the definition of computer forensics fundamentals. L3

CO2 Describe the types of computer forensics technology L2

CO3 Analyze various computer forensics systems L4

CO4 Illustrate the methods for data recovery, evidence collection and

data seizure. L3

CO5 Summarize duplication and preservation of digital evidence. L2

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 3 3 3 - - - - - - -

CO2 3 3 2 3 3 - - - - - - -

CO3 3 3 3 3 3 - - - - - - -

CO4 3 3 3 2 3 - - - - - - -

CO5 3 2 3 3 2 - - - - - - -

TEXT BOOKS:

1. 1. John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd

Edition, Charles,River Media, 2005 ISBN-13: 978-1584503897.

REFERENCE BOOKS:


1. ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and

Practitioners,2nd Edition, Springer’s, 2010ISBN 978-3-642-04101-3

2. Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques &

Countermeasures forEthical Hackers & IT Security Experts, Ali Jahangiri, 2009ISBN-

13: 978-098427150

3. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council

Press Series:Computer Forensics), 2010ISBN-13: 978-1435483521

Course Title: Wireless and Mobile Computing

Course Code:

20SCS164


(L-T-P)

Number of lecture

hours/week : 4

Exam Duration :

3 hours

CIE + SEE = 50+50=100


Hours : 52

Course

Objectives:

Description

1. To introduce the concepts of wireless communication

2. To understand CDMA, GSM, Mobile IP, WImax.

3. To understand Different Mobile OS.

4. To learn various Markup Languages and CDC, CLDC, MIDP

Programming for CLDC, MIDlet model and security concerns.

Unit

No


Hours

1. Mobile Computing Architecture: Architecture for Mobile Computing, 3-

tier Architecture, Design Considerations for Mobile Computing. Wireless

Networks : Global Systems for Mobile Communication (GSM and Short

Service Messages (SMS): GSM Architecture, Entities, Call routing in GSM,

PLMN Interface, GSM Addresses and Identities, Network Aspects in GSM,

Mobility Management, GSM Frequency allocation. Introduction to SMS,

SMS Architecture, SM MT, SM MO, SMS as Information bearer,

applications, GPRS and Packet Data Network, GPRS Network Architecture,

GPRS Network Operations, Data Services in GPRS, Applications for GPRS,

Billing and Charging in GPRS

11

2. Mobile Client: Moving beyond desktop, Mobile handset overview, Mobile

phones and their features, PDA, Design Constraints in applications for

handheld devices. Mobile IP: Introduction, discovery, Registration,

Tunneling, Cellular IP.

10

3. Self-study component:

Mobile OS and Computing Environment: Smart Client Architecture, The

Client: User Interface, Data Storage, Performance, Data Synchronization,

Messaging. The Server: Data Synchronization, Enterprise Data Source,

Messaging. Mobile Operating Systems: WinCE, Palm OS, Symbian OS,

Linux and Proprietary OS.

10

4. Building, Mobile Internet Applications: Thin client: Architecture, the

client, Middleware, messaging Servers, Processing a Wireless request,

Wireless Applications Protocol (WAP) Overview, Wireless Languages:

Markup Languages, HDML, WML, HTML, cHTML, XHTML, VoiceXML

11

5. J2ME: Introduction, CDC, CLDC, MIDP; Programming for CLDC, MIDlet

model, Provisioning, MIDlet lifecycle, Creating new application, MIDlet

event handling, GUI in MIDP, Low level GUI Components,

Multimedia APIs; Communication in MIDP, Security Considerations in

MIDP.

10

Course

Outcomes

Description RBT

Levels

CO1 To differentiate the state of the art techniques in wireless

communication. L2

CO2 Compare and contrast the CDMA, GSM, Mobile IP and WiMax

technologies. L2

CO3 Distinguish the different Mobile OS, develop program for CLDC,

MIDP let model and security concerns. L2

CO4 To develop Mobile Applications. L3

CO5 To develop applications using J2ME technology. L3

CO-PO

Mapping

PO

1

PO

2

PO

3

PO

4

PO

5

P0

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

CO1 3 3 3 3 3 - - - - - - -

CO2 3 3 2 2 2 - - - - - - -

CO3 3 3 3 2 3 - - - - - - -

CO4 3 3 3 3 3 - - - - - - -

CO5 3 3 3 3 3 - - - - - - -


TEXT BOOKS:

1. Ashok Talukder, Roopa Yavagal, Hasan Ahmed: Mobile Computing, Technology,

Applications and Service Creation, 2nd Edition, Tata McGraw Hill, 2010.

2. Martyn Mallik: Mobile and Wireless Design Essentials, Wiley India, 2003.

REFERENCE BOOKS:

1. Raj kamal: Mobile Computing, Oxford University Press, 2007.

2. Iti Saha Misra: Wireless Communications and Networks, 3G and Beyond, Tata McGraw

Hill, 2009


M.Tech in Structural Engineering

Documents

Transcript of M.Tech in Structural Engineering