It PDF
It PDF
It PDF
For
B.Tech Program
in
Information Technology
By
C.S.J.M.University,Kanpur
Object Oriented
Systems Theory
Object Oriented Sys Lab
Digital Electronics
Digital Electronics Lab
Mathematics III
Engg. Mechanics
Data Structures
Data Structures Lab
General Proficiency
L
3
3
0
T
2
2
0
P
0
0
3
Cr
4
3
2
0
1
0
3
0
1
0
1
3
0
3
0
2
2
3
4
3
3
0
3
0
0
2
2
0
2
0
2
0
0
3
0
3
4
4
3
2
3
2
5
3
0
3
0
3
3
3
0
1
0
0
0
2
1
1
0
0
3X2
0
2
0
0
0
3X2
3
2
4
1
4
4
3
2
1
3
3
3
0
3
3
1
0
0
0
0
1
0
0
0
3
0
0
4
4
3
1
4
4
1
Semester: 4th
DIT-S202
DIT S204
DIT-S206T
DIT-S206P
HSS-S401
MTH-S301
GP-102
Computer Organisation
PPL
Software Engineering
Software Engineering Lab
INDUSTRIAL ECONOMICS
DISCRETE MATHEMATICS
General Proficiency
Semester: 5th
Cr
DIT -S301TMicroprocessors
3
DIT-S301P Microprocessors Lab
0
DIT-S303 Theory of computation
3
DIT-S305 Design & Analysis of Algorithm3
DIT-S307T DBMS
3
DIT-S307P DBMS Lab
0
DIT-S309T Operating System
3
DIT-S309P Operating System Lab
0
GP-103
General Proficiency
0
0
0
0
1
0
0
0
0
3
0
0
0
3X2
0
3
3
1
4
4
3
2
3
1
1
3
0
3
0
0
0
0
0
3
1
3
2
0
1
0
1
0
3
0
3X2
1
1
3
0
0
0
0
3
4
1
3
0
0
0
0
0
0
6
2
4
4
2
1
4
1
Semester: 6th
DIT-S302T
DIT-S302P
DIT-S308T
DIT-S308P
------SST-S301
HSS-S301
GP-104
Computer Networks
Computer Networks Lab
Internet Technology
Internet Technology Lab
Departmental Elective
Departmental Elective
Mathematics Elective
Summer Training
Professional Communication
General Proficiency
Semester: 7th
DIT-S401T
DIT-S401P
-----HSS-S201
PRT-S401
SSM-S401
GP-105
Semester: 8th
DIT-S402
------PRT-S402
GP-106
Information Systems
Departmental Elective
Departmental Elective
Departmental Elective
B Tech Project II
General Proficiency
2
2
1
List of Electives
DIT S501
DIT -S502
DIT -S503
DIT- S504
DIT S505
DIT -S506
DIT -S507
DIT -S508
DIT -S509
DIT -S510
DIT -S511
DIT -S512
DIT -S513
DIT -S514
DIT -S515
DIT -S516
DIT-S517
DIT-S518
DIT-S519
DIT-S520
DIT-S521
DIT-S522
DIT-S523
DIT-S524
DIT-S525
DIT-S526
DIT S527
MTH-S501
MTH -S502
MTH-S503
L
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
T
0
0
0
0
1
0
1
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
P
0
0
0
0
2
0
2
0
2
0
0
0
0
0
0
0
0
0
0
1
0
0
0
Cr
4
4
4
4
5
4
5
4
5
4
4
4
4
4
4
4
4
4
4
4
4
4
4
3
3
3
1
3
3
0
0
0
0
2
0
0
0
0
4
0
0
4
4
4
3
4
4
MTH-S101
Breakup:
3104
Mathematics-I
Course Details:
Unit I
Applications of Integrals : Areas between curves, Methods of finding volume : Slicing, Solids of
revolution, Cylindrical shell, Lengths of plane curves, Areas of surface of revolution, Moments and Center
of mass, Improper integrals .
Unit II
Sequences: Definition, Monotonic sequences, Bounded sequences, Convergent and Divergent Sequences.
Series: Infinite series, Oscillating and Geometric series, their Convergence, Divergence. Tests of
Convergence: nth Term test of divergence, Integral test, Comparison Test, Limit Comparison test, Ratio
test, nth root test (Cauchy root test), Alternating series, Absolute and Conditional convergence.
Power Series: Power series and its convergence, Radius and interval of convergence, Term by term
differentiation, Term by term integration, Product of power series, Taylor and Maclaurin series,
Convergence of Taylor series, Error estimates, Taylors Theorem with remainder .
Unit III
Vector Calculus: Vector valued functions, Arc length and Unit Tangent vector, Curvature, Torsion and
TNB frame .
Partial Derivatives: Function of two or more variables (Limit, Continuity, Differentiability , Taylors
Theorem ) , Partial derivatives, Chain Rule, Partial Derivatives of higher orders, , Maxima and Minima and
Saddle Point, Lagrange Multipliers, Exact differential, Leibniz Theorem.
Directional derivatives, Gradient Vectors, Divergence and Curl, Tangent planes .
Unit III
Multiple Integrals: Double and triple integral, Change of order, Jacobian, Change of variables, Application
to area and volume, Dirichlet integral and Applications.
Line, surface integrals , Path independence, Statement and problems of Greens, Stokes and Gauss
divergence theorems (without proof).
Text Books and Reference :
1. G.B.Thomas and R.L.Finney : Calculus and Analytical Geometry, 9th edition, Pearson Educaion
2. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 2005.
Course Code:
PHY-S101T
Breakup:
3103
Course Code:
PHY-S101P
Breakup: 0 0 3 2
Course Code:
ISC S101T
Breakup:
Course Name:
3003
Course Details:
Course Code:
ISC S101P
Breakup:
Course Name:
0032
Course Details:
Learning OS Commands
Practice of all Internal and External DOS Commands, Writing simple batch programs, Exposure to Windows
environment, Practice of UNIX commands and Vi editor, Writing simple shell script
C Programming:
Practicing programs to get exposure to basic data types, algebraic expressions, Conditional statements, Input
Output Formatting, Control structures, arrays, functions, structures, pointers and basic file handling.
Course Code:
TCA S102T
Course Name:
Workshop Concepts
Breakup:
1102
Course Details:
Historical perspectives; Classification of Manufacturing process.
Machining: Basic principles of lathe machine & operations performed on it. Basic description of machines
& operations of shaper-planer, drilling, milling, grinding.Unconventional machining processes , Machine
tools.
Casting processes:pattern & allowances. Moulding sands & its desirable properties. Mould making with the
use of a core. Gating system. Casting defects & remedies. Cupola furnace. Die-casting & its uses.
Metal forming: Basic metal forming operations & uses of such as-forging, rolling, wire& tube
drawing/making & extrusion, & its products/applications, press work & die & punch assembly, cutting &
forming, its application. Hot working vs Cold working. Powder metallurgy: powder metallurgy process & its
applications, plastic-products manufacturing, galvanizing & electroplating.
Welding: Importance & basics concepts of welding, classification of welding processes. Gas welding, types
of flames, Electric arc welding. Resistance welding. Soldering & brazing and its uses. Modern trends in
manufacturing, Automation. Introduction to NC/CNC/DNC,FMS,CAD/CAM,CIM and factory of future.
Course code:
TCA S102P
Course Name:
Workshop Practice
Breakup:
0033
Course Details:
1. Foundry (1 turn)
2. Welding (3 turns)
a. Gas Welding (1 turn)
b. Arc Welding (2 turns)
(i). Lap Joint (1 turn)
(ii) Butt Joint (1 turn)
3.
4.
5.
6.
Course Code:
HSS-S101
Breakup: 3 1 0 4
Course Code:
MTH-S102
Course Name:
Mathematics-II
Breakup:
3104
Course Details:
Unit-I
Linear Algebra
Matrices, Elementary row and Column operations, Echelon form, Determinants, Rank of matrix, Vector
spaces, Linear dependence and Independence, Linear transforms and matrices, Consistency of linear system
of equations and their solution, Special Matrices : Symmetric, Hermition etc, Characteristic equation,
Cayley-Hamilton theorem(statement only), Eigen values and Eigen vectors, Diagonalization .
Unit-II
Differential Equations : Separable, Exact Differential Equation , Integrating Factors, Linear differential
equations with constant coefficients, Homogeneous Linear differential equations, Bernoulli Equation,
Simultaneous linear differential equations, Clairauts equation, Homogeneous linear differential equations of
second order with constant coefficients, Complex root case, Differential operators, Euler-Cauchy equation ,
Wronskian, Nonhomogeneous equations,
Solution by undetermined coefficients, solution by variation of parameters.
Series solution: Ordinary differential equations of 2nd order with variable coefficients (Frobenius Method).
Unit-III: Laplace Transform
Laplace transform, Existence Theorem, Laplace transform of derivatives and integrals, Inverse Laplace
transform, Unit step function, Dirac Delta function, Laplace transform of periodic functions, Convolution
Theorem, Applications to solve simple linear and simultaneous differential equations.
Text Books and Reference :
1. E. Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons, 2005.
2. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 2005.
3. C. Ray Wylie & Louis C. Barrett, Advanced Engineering Mathematics, Tata McGraw-Hill Publishing
Company Ltd. 2003.
4. G.F. Simmons, Differential Equations, Tata McGraw-Hill Publishing Company Ltd. 1981.
Course Code:
PHY-S102T
Breakup:
3103
Course Code:
PHY-S102P
Breakup:
0032
Course Code:
CHM S101T
Course Name:
Chemistry - I
Breakup:
3003
Course Details:
UNIT-I - Atoms and Molecules:
1.
Course Code:
CHM S101P
Course Name:
Chemistry Lab- I
Breakup:
0032
Course Details:
Exp. 01.
To estimate the strength of the given unknown solution of Mohrs salt (Ferrous ammonium
sulphate (FeSO4(NH4)2SO4.6H2O) using KMnO4 solution as an intermediate.
Exp. 02.
Exp. 03.
Exp. 04.
Exp. 05.
Exp. 06.
Exp. 07.
Exp. 08.
To determine the partition coefficient of acetic acid between n-butanol and water.
Exp. 09.
Exp. 10.
To determine the viscosity of a given liquid (30% sugar solution) at room temperature using
Ostwalds viscometer.
Exp. 11.
To separate Ag(I), Hg (I) and Pb (II) ions by paper chromatography and calculate their RF
values.
Exp. 12.
Understanding reaction kinetics and calculating the rate and order of a reaction.
Exp.13.
To study the kinetics of methyl acetate hydrolysis catalyzed by 0.5N HCl solution.
Course Code:
TCA-S101
Breakup: 0 2 4 5
Orthographic projections: Lines, planes and surfaces of objects, Sectional views, Auxiliary views, Space
geometry: lines and planes, True lengths and shapes, Properties of parallelism, Perpendicularity and
intersections of lines and planes, Simple intersections of solids and development of lateral simple solids.
Isometric Projections: Introduction , isometric scale, isometric projection of simple plane figures, isometric
projection of tetrahedron, hexahedron (cube), right regular prisms , pyramids, cylinders, cones, spheres, cut
spheres and combinations of solids.
Introduction to computer graphics: Some problems on above topics on computer graphics.
Course Code:
ESC-S101T
Breakup: 3 1 0 3
Course Code:
ESC-S101P
Breakup: 0 0 3 2
Breakup:
- 1 - 0 - 3
Breakup:
- 0 - 3 - 2
26. Implement the complex number ADT in C++ using a class. The complex ADT is used to represent
complex numbers of the form c=a+ib, where a and b are real numbers. The operations supported by
this ADT are:
27. Reading a complex number. Subtraction of complex numbers.
28. Writing a complex number. Multiplication of complex numbers.
29. Addition of Complex numbers. f) Division of complex numbers.
30. Note: 1. overload <<>> operators in part a and part b.
31. 2. overload +, - , * , / operators in parts c, d, e and f.
32. Write a template based C++ program that determines if a particular value occurs in an array of
values.
33. Write a C++ program that uses functions to perform the following operations:
34. Insert a sub-string into the given main string from a given position.
35. Delete n characters from a given position in a given string.
36. Write a C++ program that uses a function to reverse the given character string in place, without any
duplication of characters.
37. Write a C++ program to make the frequency count of letters in a given text.
38. Write a C++ program to count the lines, words and characters in a given text.
39. Write a C++ program to determine if the given string is a palindrome or not.
40. Write a C++ program to make frequency count of words in a given text.
41. Write a C++ program that displays the position or index in the string S where the string t begins, or
1 if S doesnt contain t.
42. 2s complement of a number is obtained by scanning it from right to left and complementing all the
bits after the first appearance of a 1. Thus 2s complement of 11100 is 00100. Write a C++ program
to find the 2s complement of a binary number.
43. Write a C++ program that counts the number of 1 bit in a given integer.
44. Write a C++ program to generate Pascals triangle.
45. Write a C++ program to construct of pyramid of numbers.
46. Write a C++ program to compute the Sine series.
47. Write a C++ program that converts Roman numeral into an Arabic integer.
48. Write a C++ program which converts a positive Arabic integer into its
49. corresponding Roman Numeral.
50. Write a C++ program to display the contents of a text file.
51. Write a C++ program which copies one file to another.
52. Write a C++ program that counts the characters, lines and words in the text file.
53. Write a C++ program to change a specific character in a file.
54. Note: Filename , number of the byte in the file to be changed and the new character are specified on
the command line.
55. Write a C++ program to reverse the first n characters in a file.
56. Write a C++ program that uses a function to delete all duplicate characters in the given string.
57. Write a C++ program that uses a function to convert a number to a character string.
58. Write a C++ program that uses a recursive function to find the binary equivalent of a given nonnegative integer n.
59. Write a C++ program to generate prime numbers up to n using Sieve of Eratosthenes method.
60. Write a C++ program
61. <!--[if !supportLists]-->a) <!--[endif]-->To write an object to a file.
62. <!--[if !supportLists]-->b) <!--[endif]-->To read an object from the file.
63. Write C++ programs that illustrate how the following forms of inheritance are supported:
64. Single inheritance and Multiple inheritance
65. Multi level inheritance and Hierarchical inheritance
66. Write a C++ program that illustrates the order of execution of constructors and destructors when new
class is derived from more than one base class.
67. Write a C++ program that illustrates how run time polymorphism is achieved using virtual functions.
68. Write a C++ program that illustrates the role of virtual base class in building class hierarchy.
69. Write a C++ program that illustrates the role of abstract class in building class hierarchy
Breakup:
- 0 - 0 - 3
1. Charles H. Roth Junior, Fundamentals of Logic Design, Jaico Publishing House, Mumbai, IV Edition,
1992
2. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India, 1979
3. William I. Fletcher, An Engineering Approach to Digital Design, Prentice Hall of India
4. Alan B. Marcovitz, Introduction to Logic Design, McGraw-Hill 2001
5. Ronald J. Tocci, Digital Systems Principles and Applications, PHI, 1995
6.
Kenneth J. Ayala, The 8051 Microcontroller, Architecture, Programming and Applications, Penram
International Publishing, India, 1996
Breakup:
- 0 - 1 - 1
Breakup:
- 0 - 0 - 4
Breakup:
- 0 - 3X2 - 2
Using STACK to check matching left and right characters such as parantheses, curly braces and
square brackets in a given string.
2 Single server queuing system and gathering statistics.
3 Operations on Stacks.
4 Sparse Matrices
5 Linear linked list implementation
6 Operations on Doubly Linked List and Circular List with a test application
7 Operations on Ordered Binary Trees.
8 Graph Traversal Techniques
9 Implementation of Quicksort, Mergesort and Heapsort
10 Operations on Binary Trees
11 Shortest Path Problem
Course Code:
MTH-S201
Breakup:
3104
Course Code:
ESC-S201
Breakup:
3104
Breakup:
- 1 - 0 - 4
Breakup:
- 0 - 0 - 4
Breakup:
- 0 - 0 - 4
Breakup:
- 0 - 3 - 1
9. Case Studies : Payroll System, Banking System, Purchase Order System, Library Management
System, Railway Reservation System, Bill Tracking System, College Admission System, State Management
System.
Course Code:
Course Name:
MTH-S301
Breakup:
3104
Discrete Mathematics
Course Details:
Unit-I
Logic: Introduction to formal logic, Formulae of prepositional logic, Truth tables, Tautology, Satisfiability,
Contradiction, Normal and principle normal forms, Completeness. Theory of inference. Predicate calculus:
Quantifiers, Inference Theory of predicate logic, Validity, Consistency and Completeness.
Unit-II
Sets, Operations on sets, Ordered pairs, Recursive definitions, Relations and Functions, Equivalence
relations, Composition of relations, Closures, Partially ordered sets, Hasse Diagrams,
Lattices ( Definition and some properties ).
Unit-III
Algebraic Structures : Definition, Semi groups, Groups, Subgroups, Abelian groups, Cyclic groups.
Unit-IV
Graph Theory: Incidence, Degrees, Walks, Paths, Circuits, Charactarization theorems, Connectedness, Euler
graphs, Hamiltonian graphs, Travelling salesman problem, Shortest distance algorithm (Djkstras), Trees,
Binary trees, Spanning trees, Spanning tree algorithms Kruksals and Prims.
Unit-V
Introduction to Combinatorics: Counting techniques, pigeonhole principle, Mathematical induction, Strong
induction , Permutations and Combination.
Unit-VI
Generating functions, Recurrence relations and their solutions.
Text Books and Reference :
1. C.L.Liu : Discrete Mathematics
2. B.Kolman, R.C.Busby, and S.C.Ross, Discrete mathematical structures, 5/e, Prentice Hall, 2004
3. J.L.Mott, A.Kandel and T.P.Baker : Discrete mathematical structures For computer scientists &
Mathematicians , PrenticeHall India
J.P.Trembley, R. Manohar, Discrete mathematical structures with applications to computer science,
McGraw Hill, Inc. New York, NY,1975
Breakup:
- 0 - 0 - 3
Books and References: 1. K. Ray and K M Bhurchandi, Advanced Microprocessors and Peripherals, I Edition, Tata
McGraw-Hill, 2000.
2. 2Goankar, Microprocessor Architecture Programming and Applications with 8085, Wiley
Eastern, 1998
3. 3Myke Predko, Programming and Customizing the 8051 Microcontroller, Tata McGraw-Hill,
1999
4. Mohd. Ali Mazidi and Janice Gillispie, The 8051 Microcontroller and Embedded Systems,
Prentice Hall of India Pvt. Ltd., 2000
5. Douglas V. Hall, Microprocessors and Interfacing Programming and Hardware, Tata McGrawHill, 1999
6. Kenneth J. Ayala, The 8051 Microcontroller, Architecture, Programming and Applications,
Penram International Publishing, India, 1996
7. Kenneth J. Ayala, The 8086 Microprocessor, Programming and Interfacing The PC, Penram
International Publishing, India, 1995
8. Barry B. Brey, The Intel Microprocessor 8086 / 8088, 80180, 80286, 80386 and 80846
Architecture, Programming and Interfacing, Prentice Hall of India Pvt. Ltd. 1995
9. Ajale, An Introduction to The Intel Family of Microprocessors, Pearson Education, Asia, 2001
10. The 8088 & 8086 Microprocessing, William A. Tviebel Avtavsigh, III Edition, 2000
Breakup:
- 0 - 1 - 1
Breakup:
- 0 - 1 - 1
Breakup:
- 0 - 0 - 4
Breakup:
- 1 - 0 - 3
Breakup:
- 0 - 3 - 2
Breakup:
- 0 - 0 - 3
Breakup:
- 0 - 1 - 1
Breakup:
- 0 - 0 - 3
Breakup:
- 0 - 1 - 1
Breakup:
- 0 - 0 - 3
Breakup:
- 0 - 3 - 2
Breakup:
- 0 - 0 - 4
Breakup:
Breakup:
3103
Professional Communication
Course Details:
Unit 1- Presentation Techniques
Meaning and importance of presentation technique
Use of presentation techniques in everyday life
Presentation skills required for business organization
Types of business presentations-meetings, seminars, Conferences
Unit 2-Oral presentations
Effective oral presentation techniques
Tips for good oral delivery; debates, elocution, impromptu speeches
Levels and models of organizational Communication
Interviews-types of interviews
Group discussions
Unit 3- Written communication
Style and tone of writing business messages and Documents.
Writing for websites, internet e-mails and short messages
Applications, letters, memos
Proposals and report writing
Unit 4 - Nonverbal presentations
Nonverbal communication techniques
Business manners, ethics and personality development
Audio/visual presentations, power point presentations
Art of delivery
Unit 5- Literary concepts
Stories, essays, comprehension
Reading techniques-skimming and scanning methods
Listening skills
- 0 - 1 - 1
Recommended Books:
1. Business Communication Today, Bovee, Thill and
Schatzman: Pearson Education(Singapore),2003
2. Business Communication-a framework of success, H.Dan
OHair, James S.ORourke and Mary John O Hair: South
Western College Publishing 2001.
3. Basic Business Communication, Raymond V.Lesikar,
Marie E.Flatley: Tata McGraw Hill Publishing Company
Ltd., 2002.
Breakup:
3 0 0 4
Breakup:
- 1 - 0 - 4
Departmental Electives
Breakup:
- 0 - 0 - 3
risk types, Risk Breakdown Structure (RBS), Risk Management Process: Risk identification, Risk
analysis, Risk planning, Risk monitoring, Cost Benefit Analysis, Software Project Management Tools:
CASE Tools, Planning and Scheduling Tools, MS-Project.
Books:
3. Software Project Management by M. Cotterell
4. Information Technology Project Management
5. Management Information and Control by
6. Software Project Managemnet by S. A. Kelkar
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
1. Simon Haykin, Communications Systems, IV Edition, John Wiley and Sons, 2001
2. Fred Halsall, Multimedia Communications, Application Networks Protocols & Standards,
Pearson Education, Asia 2002, Chapters 3,4,5.
3. Proakis, Digital Communication, McGraw-Hill, 1982.
4. Mark Nelson, Data Compression Book, BPB Publication, 1992
5. Watkinson J., Compression in Video & Audio, Focal Press, London, 1995.
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 1 - 0 - 3
References :
1. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill
2. Asthana, Sinha, "Computer Graphics", Addison Wesley Newman and Sproul, "Principle
of Interactive Computer Graphics", McGraw Hill
Breakup:
0 - 0 - 2 - 2
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 1 - 0 - 3
Breakup:
0 - 0 - 2 - 2
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 1 - 0 - 3
Breakup:
0 - 0 - 2 - 2
Breakup:
3 - 0 - 0 - 4
Books:
CMOS VLSI Design: Circuits and Systems Perspective, by N Weste and D. Harris, Fourth edition,
Addison Wesley (Pearson), 2010
Digital VLSI Chip Design with Cadence and Synopsys CAD Tools by Erik Brunvand 2009
(Paperback)
Digital Integrated Circuits, Jan M. Rabaey, Anantha Chandrakasan, and Borivoje Nikolic. Second
Edition, A Prentice-Hall, 2003
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 1 - 4
Breakup:
3 - 0 - 1 - 4
Breakup:
3 - 0 - 0 - 4
UNIT 3:
Simulation of continuous Systems, analog vs digital simulation, simulation of water reservoir
system, simulation of a servo system, simulation of an
auto-pilot. Discrete system simulation, fixed time-step vs event-to-eventmodel, generation of random
numbers, test of randomness, Monte-Carlo
computation vs stochastic simulation.
UNIT 4:
System dynamics ,exponential growth models, exponential decay models, logistic curves, system
dynamics diagrams, world model.
UNIT 5:
Simulation of PERT networks, critical path computation, uncertaintities in activityduration, resource
allocation and consideration, Simulation
languages, object oriented simulation.
Reference Books:
1) Geoftrey Gordon, System Simulation, PHI
2) Narsingh Deo, System Simulation with digital computer, PHI.
3) Averill M. Law, W. David Kelton, Simulation Modelling and
Analysis,TMH.
Breakup:
3 - 0 - 0 - 4
UNIT 5:
Mean Field Approximation, Helmholtz Machines; Minimum Description Length, Bayesian
Networks, Computational Learning Theory, onnectionist Symbol Processing, Reinforcement
Learning, Neurophysiology for Computer Scientists.
References:
1) Bishop, C. M. (1995) Neural Networks for Pattern Recognition,. Oxford University Press.
2) Optional enrichment: Anderson, J. A., and Rosenfeld, E.
3) Handout: Derivation of the backprop learning rule
4) Haykin, S. Neural Networks: A Comprehensive Foundation, 2 nd edition.
5) Kearns, M. J., and Vazirani, U. V. An introduction to Computational Learning Theory,.
Cambridge, MA: MIT Press.
6) Churchland, P.S. (1986) Neurophilosophy: Toward a Unified Science of the Mind-Brain..
Cambridge, MA: MIT Press.
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Breakup:
3 - 0 - 0 - 4
Math Electives
Course code:
Course name:
MTH-S502
Breakup:
3104
Operations Research
Course Details:
UNIT- I
Introduction: Uses, scope and applications of operations research.
Linear Programming: Mathematical formulation of Linear programming problems. Solution of LPP by
Graphical method, Simplex method, Duality in Linear Programming Problem, Dual Simplex method,
Sensitivity analysis.
UNIT-II
Transportation Problems:Various methods for finding initial basic feasible solution and optimal solution .
Assignment Problems: Hungarian method for solving assignment problems.
Sequencing problem: Basic assumptions, n- jobs on two machine, n- jobs on three machines, two jobs on
three machines.
UNIT-III
Game Theory: Two persons zero sum game, pure and mixed strategy games, saddle point, solutions of a
game with or without saddle point ,dominance rule, different methods of solving (Algebraic, Graphical,
Linear programming ).
Inventory Control Models: Deterministic EOQ inventory models.
UNIT-IV
Network Models: Minimal spanning tree algorithm, Shortest route problem, Maximal flow model.
Project Management: Phases of project management, guidelines for network construction, CPM and PERT.
Course Code:
MTH-S503
Course Name:
Graph Theory
Breakup:
3204
Course Details:
Unit I
Graphs, Sub graphs, Some basic properties, Different types of graphs ( Regular, Bipartite, Induced, Quotient
etc ) walks, paths & circuits, connected graphs, disconnected graphs and its components, Euler graphs and
its properties, Fluerys algorithms and Chinese postman problem Operation on graphs, Hamiltonian graphs
and its properties, Hamiltonian paths and circuits, the traveling sales man problem. Shortest distance
algorithms ( Dijkstras ) .
Unit II
Cuts sets and cut vertices, some properties, all cut sets in a graph, fundamental circuits and cut sets ,
connectivity and separability , Rank, Nullity of a graph.
Digraphs : Definition, Types of Digraphs, Digraphs and Binary relations, Directed path and connectedness,
Euler Digraphs.
Unit- III
Trees and its characterization, Distance, Height, Diameters, Radius of a tree, Weighted Tree, Rooted and
Binary trees, Spanning trees , Weighted spanning tree , Minimum weight spanning tree algorithms prims
and Kruskals. Chords, Branches, Fundamental circuits.
Unit IV
Matrix representation of graphs : Incidence, Adjacency, Circuit, Cut-set and Path matrices and their
properties. Matrix representation of Digraphs ( Adjacency matrix ).
Unit V
Planarity: Planer graphs, Regions, Euler formula, Kuratowski two graphs, Characterization of planarity,
detection of planarity, Thickness and Crossings number of a graph.
Colouring of graphs: Vertex colouring , Edge colouring, Five colour Theorem, Chromatic number,
chromatic polynomials, Methods of finding the chromatic polynomial, Chromatic partitioning,
Independence number and Covering number.
Matchings , Maximal matching, Augmenting path, Halls marriage problem
Unit -VI
Enumeration : counting labelled and unlabelled graphs and trees. Cycle index, Figure counting series,
Configuration counting series, Polyas Theorem( without Proof). Application to simple and multiple graphs
with at most two edges between vertices.
Transportation networks : Network flows, Max flow-Min cut Theorem.
Text Books and Reference :
1. Deo, N, Graph theory with applications to Engineering and Computer
Science, PHI
2. V. Balakrishnan, Schaum's Outline of Graph Theory, TMH
3. Robin J. Wilson, Introduction to Graph Theory, Pearson Education
4. Harary, F, Graph Theory, Narosa
5. Geir Agnarsson, Graph Theory: Modeling, Applications and Algorithms,
Pearson Education
6. Bondy and Murthy: Graph theory and application. Addison Wesley
Course Code:
Course Name:
MTH-S504
Breakup:
3104
Course Details:
UNIT- I
Joint Distribution Functions, Necessary and Sufficient conditions for independence of random variables,
Central Limit Theorem, Statistic, Sufficient Statistic.
UNIT- II
Estimation Theory; Methods of Estimation, Unbiased, Consistent, Maximum likelihood estimators,
Minimum Variance, Unbiased Estimators .
UNIT- III
Testing of Hypotheses; Simple and Composite Hypotheses, Two types of error, Power of a test, Neyman
Pearson Lemma for most powerful Tests, Application of the Lemma, Various tests of significance for the
mean and variance, Contingency tables and X - tests. Confidence Interval Estimation .
Text Books and Reference :
1. V.K.Rohatgi & Saleh: An introduction to Probability and statistics, Wiley Eastern
2. Ramana: Higher Engineering Mathematics, McGraw Hill
3. E. Kreyszig, Advanced Engineering Mathematics ( Chapter 22 ), John Wiley & Sons, 2005.