1.

Subject Code: ME 418 Course Title: Supply Chain Management (DEC-8)

2. Contact Hours: 42+14=56 L: 3 T: 0 /1 P: 2/0

3. Examination Duration (Hrs.) : Theory: 3 Practical: 0

4. Relative Weight : CWS: 25 PRS: 0 MTE: 25 ETE: 50 PRE: 0

5. Credits :4

6. Semester : VIII

7. Subject Area : DEC

8. Pre-requisite : NIL
9. Objective : T o understand the key considerations at the various
stages involved in the supply of product in order to
maintain the smooth flow from source to the point
of consumption so that the overall organizational
performance may improve.
10. Details of Course:

S. No. Contents Contact

Hours

1 Introduction 7
Perspective of Supply Chain Management, Managing uncertainty, Key
issue in supply chain management.

2 Inventory Management and Risk Pooling 7

Inventory management, Classification of inventory, Centralized versus
Decentralized Warehousing and Risk pooling, Value of Information,
Quantification of Bullwhip effect, Causes and remedies of Bullwhip
effect.

3 Resource planning 7
Aggregate Production Planning- Chase and leveling strategies, MRP,
MRP-II, Agile manufacturing Systems

ME-132
 4 Procurement and Outsourcing strategies 7
Introduction, outsourcing benefits and risks, Make/Buy decision, e-
procurement, Vendor selection and quota allocation.

5 Strategic Alliances 7
Introduction, Third party logistics, Demand driven strategies,
Distribution strategies- direct shipment, cross docking, transshipment,
Supplier relationships management, Customer relationship
management.

6 International Issues in Supply Chain Management 7

Concepts in Globalization, Globalization forces, Risks and Advantages
of International supply chains, Issues in International supply chain
management, Regional differences in logistics.

Total 42
11. Suggested Books:

S. Name of Authors /Books / Publishers

No.

1 Designing and Managing the Supply Chain: concepts, strategic and case studies
by David Simchi-Levi, Philip kaminsky, Edith Simchi-Levi, Ravi Shankar, Tata
McGrawHill, ISBN- 0072357568.

2 Supply Chain Management by Chopra S. and Meindl P., Pearson, ISBN-

8131789209, 2012.

3 Supply Chain Management: Text and Cases by ShahJanat, Pearson Education,

ISBN- 8131715175, 2009.

ME-133
1. Subject Code: MC-405 Course Title: Graph Theory

2. Contact Hours : L-3 T-0 P-2

3. Examination Duration (Hrs.) : Theory: 3 Practical: Nil

4. Relative Weightage : CWS: 15 PRS: 15 MTE: 30 ETE: 40 PRE: 0

5. Credits :4

6. Semester : VII

7. Subject Area : DCC

8. Pre-requisite :

9. Objective : To explain basic concepts in graph theory, define new graphs serve as models
for many standard problem.
10. Details of Course

S. No. Contents Contact

Hours

1. Introduction: Graphs, Subgraphs, Some basic properties of 10

graphs and subgraphs, Isomorphism, Various types of graphs and
their subgraphs, trails, walks, paths, circuits and cycles, connected
graphs, disconnected graphs and components, various operations
on graphs, Eulerian graphs, Hamiltonian paths and cycles,
Adjacency and incidence matrices of a graph, shortest path,
algorithms to find shortest path.

2. Hamiltonian and Eulerian Graphs: Necessary conditions for 8

Hamiltonian graphs, sufficient conditions for Hamiltonian graphs,
traveling salesman problem, characterization of Eulerian graphs,
construction of Eulerian tour, The Chinese postman problem.

3. Trees: Characterization of trees, rooted and binary trees, spanning 8

trees and their properties, spanning trees in weighted graphs,
minimum spanning tree, algorithms for minimum spanning tree.

MC-66
 4. Cut Vertices and Edge Connectivity: Cut vertices, cut sets and 8
their properties, the max-flow min-cut theorem, max-flow algorithm,
connectivity and edge connectivity, Menger’s theorem (without
proof), max-flow algorithm.

5. Coloring of Graphs: Coloring, proper coloring, chromatic number, 8

chromatic partitioning, a maximal independent set, matching,
maximum matching in bipartite graphs and in general graphs.

Total 42
11. Suggested Books
S. Name of Books/Authors/Publishers Year of
No. Publication/
Reprint

1. G. Chatrand, and O.R. Ollermann, Applied and Algorithmic Graph 1993

theory, McGraw Hill

2. Narishgh Deo, Graph theory with applications to engineering and 1979

computer science, PHI, New Delhi.

3. Geir Agnarsson and R. Gveenlaw, Graph theory: Modeling 2009

applications and Algorithms, Pearson edu., Inc.

4. L.R. Foulds, Graph theory applications, Narosa Pub. House 1992

5. Corman, Leiserson and Rivest, Introduction to Algorithms, PHI 1998

MC-67
1. Subject Code: HU201 Course Title: Engineering Economics

2. Contact Hours : L: 3 T: 0 P: 0

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 25 PRS 0 MTE 25 ETE 50 PR 0

5. Credits :3

6. Semester : III

7. Subject Area : HMC

8. Pre-requisite : NIL

9. Objective : Understand the fundamental concepts of

engineering economy.
10. Details of Course:
S.No. Contact
Contents Hours

1. Introduction: Nature and significance of economics, Goods and Utility, 10

Basic Concept of Demand and Supply, Elasticity of Demand-
Price elasticity of Demand, Cross elasticity of Demand, Production -
Production Function, Production Process and Factors of Production,
Market – Introduction to Monopoly, Perfect Competition, Oligopoly
and Monopolistic Competition, Cost Concepts- Opportunity Cost,
Total Cost, Average Cost; Marginal Cost; Life Cycle cost, Sunk Cost;
Preparation of Cost Sheet Profit Maximisation- numerical problem.

2. Money- its evaluation and function, Bank- Commercial Bank and 10

Central Bank and brief idea about function of banking system:. Tax
and Subsidy, Type of Tax- Direct and Indirect, Monetary and fiscal
policy, Inflation and Business cycle, International trade, terms of
Trade, Gain from International Trade, Free Trade vs. Protection,
Dumping, Balance of Payment.

COE-49
 3. Role of Science, Engineering and Technology in Economic 12
Development: Seven salient Feature of the Indian Economy; Inclusive
Growth; relevance for the Indian Economy; Globalisation& opening up
of the Indian Economy; GDP- definition and Its measurement; How
knowledge of engineering and ology may be used to improve life at
slum; Green Revolution and White revolution. Reasons for their
success and can we replicate them. Appropriate Technology &
Sustainable Development. Entrepreneurship: Macro environment for
promotion of entrepreneurship: How environment has changed after
advent of IT and Globalisation.

4. Elementary Economic Analysis: Interest formulas and their 10

Applications; Calculations of economic equivalence, Bases for
Comparison of Alternatives: Present Worth Method, Future worth
method, Annual equivalent, Internal Rate of Return; Business Risk;
Factors which should be taken care while deciding price of the product
in the market.

TOTAL 42
11. Suggested books
S.No. Name of Books / Authors/ Publishers/Year of Publication/Reprint

1. Engineering Economy, Engi G.J. Thuesen, & W.J. Fabrycky, Prentice-Hall of India
Private Limited,(2007)

2. Engineering Economy, William G. Sullivan, James A. Bontadelli& Elin M. Wicks,

Pearson Education Asia,( First Indian reprint),2009

3. Engineering Economic Analysis, Donald G. Newman, Jerome P. Lavelle & Ted G.

Eschenbach, , Engineering Press,2001

4. Economics for Engineering Students, Seema Singh, , IK International Publishing

House Pvt. Ltd,2014

COE-50
1. Subject Code: CO301 Course Title: Software Engineering

2. Contact Hours : L: 3 T: 0 P: 2

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 15 PRS 15 MTE 30 ETE 40 PR 0

5. Credits :4

6. Semester : IV

7. Subject Area : DCC

8. Pre-requisite : Nil

9. Objective : To introduce fundamentals of software engineering including requirement

specifications, software design, testing and maintenance.

10. Details of Course

S.No. Contents Contact

Hours

1. Introduction: Introduction to software Engineering, Software 8

characteristics, Software components, Software applications, Software
Engineering Principles, Software metrics and measurement, monitoring
and control. Software development life-cycle, Water fall model,
prototyping model, Incremental model, Iterative enhancement Model,
Spiral model.

2. Software Requirement Specification: Requirements Elicitation 8

Techniques, Requirements analysis, Models for Requirements
analysis, requirements specification, requirements validation.

3. System Design: Design Principles: Problem partitioning, abstraction. 6

Top down and bottom up – design, structured approach. Functional
versus object oriented approach of design, design specification,
Cohesiveness and Coupling. Overview of SA/SD Methodology,
structured analysis, data flow diagrams, extending DFD to structure
chart.
COE-62
6. Semester :V

7. Subject Area : DCC

8. Pre-requisite : Elementary set theory, Relations, Mappings, and
some abstract algebra
9. Objective : To provide knowledge and skills in theoretical
foundations of computing that are needed to study
and practice computer science.
10. Details of Course

S.No. Contact
Contents Hours

1. Introduction: Alphabets, Strings and Languages; Automata and 8

Grammars, Deterministic finite Automata (DFA)-Formal Definition,
Simplified notation: State transition graph, Transition table, Language
of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon
transition, Language of NFA, Equivalence of NFA and DFA,
Minimization of Finite Automata, Distinguishing one string from other,
Myhill-Nerode Theorem.

2. Regular expression (RE): Definition, Operators of regular expression 8

and their precedence, Algebraic laws for Regular expressions, Kleen’s
Theorem, Regular expression to FA, DFA to Regular expression,
Arden Theorem, Non Regular Languages, Pumping Lemma for
regular Languages. Application of Pumping Lemma, Closure
properties of Regular Languages, Decision properties of Regular
Languages, FA with output: Moore and Mealy machine, Equivalence
of Moore and Mealy Machine, Applications and Limitation of FA.

3. 6
Context free grammar (CFG):Definition, Examples, Derivation ,
Derivation trees, Ambiguity in Grammar, Inherent ambiguity,
Ambiguous to Unambiguous CFG, Useless symbols, Simplification of
CFGs, Normal forms for CFGs: CNF and GNF,

4. 6
Context Free Languages (CFL):
Closure properties of CFLs, Decision Properties of CFLs: Emptiness,
Finiteness and Membership, Pumping lemma for CFLs.
 COE-64
5. Push Down Automata (PDA): Description and definition, 6
Instantaneous Description, Language of PDA, Acceptance by Final
state, Acceptance by empty stack, Deterministic PDA, Equivalence of
PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA.

6. Turing machines (TM): Basic model, definition and representation, 10

Instantaneous Description, Language acceptance by TM, Variants of
Turing Machine, TM as Computer of Integer functions, Universal TM,
Church’s Thesis, Recursive and recursively enumerable languages,
Halting problem, Introduction to Undecidability, Undecidable problems
about TMs. Post correspondence problem (PCP), Modified PCP,
Introduction to recursive function theory.

TOTAL 42
11. Suggested Books

S.No. Name of Books / Authors/ Publishers/ Year of Publication/ Reprint

Text Books

1 Hopcroft, Ullman, “Introduction to Automata Theory, Languages and

Computation”, Pearson Education.ISBN-13: 978-0321455369,2006

2 K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science Automata,

Languages and Computation”, PHI, ISBN-10: 8120329686,2007

Reference Books

1. Martin J. C., “Introduction to Languages and Theory of Computations”, TMH

,ISBN 978–0–07–319146–1,2010

2. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI ,

ISBN-13: 978-0132624787
 3. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition,
Narosa Publishers, New Delhi , ISBN 0-7637-142

4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata

Theory and Computation”, Pearson Education, ISBN 978-81-317-2356-2

1. Subject Code: CO313 Course Title: Computer Graphics

2. Contact Hours : L: 3 T: 0 P: 2

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 15 PRS 15 MTE 30 ETE 40 PR 0

5. Credits :4

6. Semester :V

7. Subject Area : DEC

8. Pre-requisite : NIL

9. Objective : The objective of the course is to help students learn broad introduction to the
theory and practice of computer graphics.

10. Details of Course

S.No. Contents Contact
Hours

1. Overview of Computer Graphics: Usage of Graphics and their 6

applications, Over view of Graphics systems: Refreshing display
devices, Random and raster scan display devices, Colour Models:
RGB, HSV etc., Tablets, Joysticks, Track balls, Mouse and light pens,
plotters, printers, digitizers.
 2. Output primitives:: DDA Line drawing algorithm, Bresenham’s Line 8
Drawing Algorithm, Mid-point circle algorithm, Mid-point Ellipse
algorithms, filling algorithms, boundary fill and flood fill algorithms,
scanline filling, character generation, line attributes, fill styles, anti-
aliasing.
3. Transformations:Basic 2D Transformations, Matrix representations & 6
Homogeneous Coordinates, Matrix Representations for basic 2D and
3D transformations, Composite Transformations, reflection and shear
transformations, affine transformation, transformations between
coordinate systems.

4. Two dimensional viewing: The viewing Pipeline, Viewing Coordinate 8

Reference Frame, Window-to-Viewport Coordinate Transformation,
Two Dimensional Viewing Functions, Barky line clipping algorithm,
Algorithm for polygon clipping, Sutherland-Hodgeman polygon clipping,
Wailer-Atherton polygon clipping, curve clipping, Text clipping.

5 Curves and Surfaces: Representation of surfaces, polygon meshes, 6

plane equations, parametric cubic curves, Hermite Curves, Bezier
Curves, 4 point and 5 point Bezier curves using Bernstein Polynomials,
Conditions for smoothly joining curve segments, Bezier bi-cubic surface
patch, B-Spline Curves, Cubic B-Spline curves using uniform knot
vectors, Testing for first and second order continuities

6 Projection: Parallel Projection, Oblique Projection on XY plane, 8

Isometric Projection, Perspective Projection, One Vanishing Point
(V.P.) projection, Generation of 2 V.P. Projection, planar geometric
projections. Shading and Hidden Surface Removal: Shading,
Illumination Model for diffused Reflection, Effect of ambient lighting,
distances, Specular Reflection Model, Computing Reflection Vector,
Curved Surfaces, Polygonal Approximations, Guard Shading, Phong
Model, Hidden Surface Removal, Back Face Detection, Depth Buffer
(Z-Buffer, A-Buffer) Method, Scan Line Method, Depth Sorting Method,
Area Subdivision Method.
TOTAL 42
11. Suggested Books
S.No. Name of Books / Authors/ Publishers/ Year of Publication/ Reprint
 Text Books:

1. D. Hearn , P. Baker& W. Carithers, “Computer Graphics with OpenGL”, Pearson,

2015

2. Z. Xiang & R. Plastock “Computer Graphics”, Schaum’s Series, McGraw Hill, 2007

3. David F. Rogers, “Procedural Elements for Computer Graphics”, Tata McGraw Hill
Book Company, 2002

Reference Books:

1. D. Rogers and J. Adams, “Mathematical Elements for Computer Graphics”,

MacGraw- Hill International Edition, 2002

2. Foley et al., “Computer Graphics Principles & practice”, Addison Wesley, 1999
COE-91