‘Course Name OPERATIONS RESEARCH Course Code MAN 401 Credits 4 LTP 310 Total No. of Lectures : 42 Course Objectives: “At the end ofthis couse; the stodents should be able to describe the characteristics and scope of Operations Research, identify and solve linear models of Optimization problems, formulate and solve problems of ‘Transportation Model and Assignment Model, understand and apply the theory of Queuing Models in solving problems. Lecture wise breakup No.of Lectures T] Definition of Operations Research, Characteristics of Operations Research, Scope of | 2 Operations Research ZT] Formulation of Linear Programming problem , Graphical Solution, Simplex Method, | 16 Unrestricted variables, Artificial variables, M-Method, Dual Phase method J [Introduction to the Transportation model, Assumption in the Transportation Model, Definition | 8 of the Transportation Model, Matrix terminology, Formulation and solution of Transportation Model. Assignment Model. 7] Queuing Model, Introduction, Application of Queuing Model, Elements of Queuing System, | 8 Operating characteristics of Queuing System, Waiting time and idle time costs. | Non Linear Programming, Introduction, Local and Global optimum, necessary and sufficient | 8 conditions, Direct search methods- Golden Section and Dichotomous methods, gradient methods. Course Outcomes: By the end of this course, the students will be able to: 1) describe the characteristics and scope of Operations Research 2), identify and solve linear models of Optimization problems 3). Solve simple problems of The Transportation Model and Assignment Model 4). Solve simple problems of Queuing Models 3)_ Solve Non — Linear Programming problems ‘Suggested Books: Sr.No. | Name of Book / Authors / Publishers Year of Publi Edition T | "Operations Research”, Taha, HLA, 8th edition, Pearson. 2007 2] “Operations Research”, Ravindran, Philips, and Solberg, 2° edition, John | 2000 Wiley & sons. 3 | "Engineering Optimization”, SS Rao, 3 edition, New Age. 72000 4] “Operations Research”, Kantiswarup, Gupta PK. & Sultan Chand & Sons. | 2007 3 | “Operations Research”, Sharma S.D., Kedamath, Ramnath & Company. | 1994 6 “Operations Research”, Bronson R, Shaum’s Outline Series. 1997PGtuseName [OPTIMIZATION TECHNIQUES | Course Code | MAN 402, [Credit 4 LTP. 3-1-0) Course Objectives: Total No. of Lectures — 42 At the end of this course, the student should be able to formulate mathematical model of optimization problems, identify and solve near models of optimization probleins, apply classical methods to solve nonlinear models for optimization problems, apply gradient based and direct iterative methods to solve nonlinear problems. : No. of Lecture wise breakup Rea 1 | Linear “programming: Formulation, Graphical solution, Simplex method , Relation | (16) between Graphical and Simplex method, Unrestricted variables, Artificial variables, M- Method and Dual Phase method | Optimization Techniques: a Unconstrained problems - (Single and multivariable optimization) Necessary and sufficient conditions for extreme points, Constrained problems - (multivariable optimization ) Equality constraints - Jacobian and Lagrangean methods, Application of Jacobian method to linear problems. Inequality constraints ~ extension of Lagrangean method, Karush Kuhn tucker Conditions. 3 | Non Linear programming: aay Uneonstrained Algorithms ~ Direct search methods, Dichotomous and Golden search; Univariate and Hooke and Jeeves search methods; Gradient methods, Cauchy's steepest ascent method and Newton's method, Constrained Algorithms: Separable Programming, Quadratic Programming, Geometric Programming ‘Course Outcomes: By the end of this course, the student will be able to: 1, Form mathematical model of optimization problems 2. Solve Linear Programming Problems 3. Solve simple Optimization problems using classical / iterative methods. Suggested Books: Sr.No. | Name of Book / Authors / Publishers ‘Year of Publication! Edition T__ | “Operations Research”, Hamady Taha, 8° edition, Pearson 2007 2___ | “Operations Research”, Ravindran, Phillips, and Solberg, John Wiley & sons, | 2000 3__| “Engineering Optimization”, SS Rao, New Age 2000 4 [“Operations Research”, Kantiswarup, Gupta P.K. & Sultan Chand & Sons. | 2007GourseName = ALGEBRA Course Code MANGE Credits 4 rTP = a “Total No. of Lectures — 4 _| Course Objectives: a ‘At the end ofthis eourse, the iodenis should be able to understand the concept oFa group and give examples of| jproups. They should know the basic concepts of group theory and be able to apply these concepts. They should | beable to understand the concepts ofa vector space, linear transformation of vector spaces. They should beable | 10-pply the theory to solve problems, No.of Lecture wise breakup Lectures Definition oF @ group, examples, some preliminary lenmas, Subgroups, Examples, Cosets, [10 Order ofa group, Lagrange’s Theorem,Eulee's Theorem, A counting principle. ‘Normal subgroups and quotient groups, Homomorphism, Cauchy's Theorem, Sylows Theorem | 16 for Abelian groupe, Automorphisms, Cayley's ‘Theorem, Permutation groups, Conjugacy classes, Class Equation Vector Spaces: Vector spaces R"(R), Linear dependence, Basis, Dimension, Co-ordinates with respect to 8 bess, Change of bass, Subspace,, Linear transformation R*—>R® , Range space and Rank, Null space. and Nullity, Rank and Nullity relation, Matrix representation of linear transformation, Similar matrices, Invertible linear transformation Inner product, Norm, Gram ‘Schmidt orthogonalizaton proces. 16 [Course Outcomes: By the end of the couse, the students will beable to | Understand the concept ofa group and give examples of groups 2, Know the basie concep of group theory and beable to apply these concepts. 53. Understand the concepts ofa vector space linear transformation of vector spaces 4. Understand and apply the theory of vector spaces to solve problems Suggested Books: ‘Sr.No, | Name of Book / Authors Publishers T | Topiesin Algebra", Hestein, IN, Wiley Easter Limited, New Deli 2 ["iodeen Algebra, Singh, 5 and Zaneeroddin, Q Vikas Publishing Howse, New Delhi "Rings and Modules", Musil, C, Narosa Publishing House, (Second Revised Edition) New Dei Thizoducton fo Linear Algebra with Applications, Kolman and Hill, Pearson EducationNUMBER THEORY ‘MAN 432 4 30 "Total No. of Lectures = 42 [Course Objectives: ‘At the end of this course, the sudenis should be able fo describe the fundamental properties of integers. They | should be able to solve congruences by using the various concepts of number theory. They should be able to solve Diophantine equations Lecture wise breakup T introduction, Divisibiliy, Greatest common divisor, The uclidean algorithm, primes, Fundamental theorem of Arithmetic, Congracnces, Residue clases and reduced residue classes, Fermat's theorem, Euler's theorem, Wilson Theocem, Solution of congruences, congruences of degreel, Chinese Remainder theorems with applications. Euler's function, ‘Congruences of higher degree, prime power modull, prime modulus, Primitive roots, Indices and their applications, power residues, Quadratic residues, Quadratic reciprocity, Legendre Symbol, Euler's criterion, Gauss's Lemma, Quadratic reciprocity law, Jacobi syrabol, Greatest integer function, Aritimelie Function, Mobius inversion formula, Diophantine equations ‘Course Outcomes By the end of he course, the students will be able to 1, Describe the fundamental properties of integers. 2, Solve congruences by using the various concepts of number theory. 3. Solve Diophantine equations ‘Suggested Books: ‘SrNo. | Name of Book / Authors /Publishers Year of Publication? Edition T | "An introduction to theory of nambes™, Niven 1, Zuckerman S. H, and [1991 ‘Montgomary L. H.John Wiley and Sons. “Theory of Numbers”, Hardy and Wright W. HlOxford University Press 159 “Higher arthmeti”, Davenport H. Cambridge University Press 1939, “Elementary Number Theory", David M. Burton, Wm.C.brown Publishers, | 1989 Dubuque, ova[ Course Name : FOURIER SERIES AND INTEGRAL TRANSFORMS Course Code MAN a33 Credits 2 4 LTP 31-0 Course Objectives: Total No. of Lectures—42 0 ) AC the end of this course, the students should be able To expand Finetions in Fourier series, Fourier ___[ integrals and lear Fourier sine and cosine Transforms, Harmonic analysis and thei applications. 3 [The studens shoud be able to evaluate Laplace transforms and Inverse Laplace transform. 3| The students should be able to apply Laplace transforms to solve ordinary differential and integral equations. Lecture wise breakup No. of _ Lectures T Periodic functions, Trigonometric series, Fourier Series, Euler's formulae, | (12) Conditions for existence of Fourier series, Functions of any period p = 2L, Even ‘and odd functions, Half range expansions, Complex Fourier series, Appli of Fourier series, Parseval’s identity, Harmonic analysis. Approximation by Trigonometric Polynomials Fourier Sine and Cosine Integrals , Evaluation of Integrals, Fourier Cosine and Sine Transforms, Properties of Fourier | (18) Transform, Linearity and Symmetry, change of Time Scale, Time Shiftin Frequency Shifting , Fourier Transform of derivatives and integrals, convolution , Properties of Fourier cosine and sine Transforms, Parseval Identity for Fourier “Transform , Finite Fourier Cosine and Sine Transform Zz Fourier Integral, Fourier Transforms, 3 Taplace transform, Inverse transform, Properties of Laplace transform, | (12) Transforms of derivatives and integrals, s-Shifting, t-Shifting, Unit step function, Dirae’s delta function, Differentiation and integration of transforms, Convolution ‘Theorem Applications to differential and Integral equations. Course Outcomes: T ] By the end of this course the students will be able to expand a function in terms of its Fourier Series, Fourier Integrals, Fourier Transforms and apply harmonic analysis to_numerical data. % | The students will be able to evaluate Laplace transforms and inverse Laplace transforms. 5 The students will be able to use Laplace transform to solve differential and Integral equations arising engineering problems. ‘Suggested Books: Sr. No, | Name of Book / Authors / Publishers ‘Year of Publication Edition 1 “Higher Engineering Mathematics“, B V Ramana, Tata McGraw -Hill 2006 2 “Advanced Engineering Mathematics”, E. Kreyszig, John Wiley. 2006 2003 3 “Advanced Engineering Mathematics”, Wylie and Barrett, McGraw Hill.‘Course Code i [ SAL-CULUS OF VARIATIONS Credits MAN 434 a a ee (Course Objectives: At a Total No, of Lectures 42 Teeture wise breakup 7 Dreakup No, of Lectures Yaition of Tunetional-K necessary condon fran extrema, Euler's equation (12) Some classical problems. Fixed end point problems for unknown functions. Variational problems with subsidiary conditions. General_variation of @ functional, Variable end point problems, wansversalty conditions, Transversal theorem, Weirstress-Erdmann corer condition. Canonical form of Euler equations and their first integrals. Canonical transformations. Noether's ‘theorem, Hamilton-Jacobi equations. Jacobi’s theorem. “The second variation of @ functional and the Tormula Tor second variation. Legendre’s necessary condition, Jacobi's necessary condition, Conjugate points, Sufficient Condition for a weak extremum, General definition ofa field and field ofa functional. Hilbert invariant integral. Weierstrass E-functional, Sufficient conditions for a strong 4} Direct methods in calculus of variations, Euler's finite difference method and the Rayleigh Ritz method. Application to sturm-Liowille problem. Course Outcomes: ‘Atthe end of the course the students wil be able to ‘Understand the concept of national, extremum and a variational problem. Learn the concepts of transversality conditions and canonical transformation. earn the concept and formulae for the second variation ofa functional “They will be able to apply direct methods in calculus of variations, Euler's Rayleigh Ritz method and Sturm-Liouville Theorem. “ite aerence metho, Se Suggested Books:—_—__ Pubaton! No. | Name of Book / Authors Publishers “Calculus of variations", IM, Gelfand and'S, V. Fomin "Caleulus of variations”, LE Elspol.( Course Name [ALGEBRAIC CODING THEORY [eourse Code awe oY Course Code MAN @35 4 30 Total No. of Lectures —42 (Course Objectives | At the end ofthis course, the sadens Should fe abe To tarslteTandamental problems of coding Woy mathematical problems and then solve them by vsing the theory of Fite Flos, pelynomial rings and Fite ‘roups. They should be able to understand and apply the theory of linear codes. They should be able to understand and apply the theory of Cyclic codes. Lecture wise breakup T | INTRODUCTION TO CODING THEORY Souree and Chansel coding, Error detecting and error correcting codes 2 [ ERROR DETECTION, ERROR CORRECTION AND DECODING Communication Chantels, Maximum likelihood decoding, Hamming distance, Nearest neighbout/ minimum distance decoding, Distance ofa code FINITE FIELDS | Fields, Polynomial rings, Stuctue of finite fields, Minimal polynomials LINEAR CODES Vector spaces over finite fields, Linear Codes, Hamming weight, Bases for linear codes Generator matrix and parity check matrix, Equivalence of linear codes, Encoding with & linear code, Decoding of linear codes, Cosets, Nearest neighbor decoding for linear codes, ‘Syndrome Decoding, Weight Enumeraior of a Code, Mecuvlliam’s Identity, CYCLIC CODES {__[ Beton, Geter ptamias, Gener matic and pry check max, Decoding of linear codes [ Course Outeamese By the end of the couse, the students will be able to 1 Translate fundamental problems of coding theory ito mathematical problems and then solve them By using the theory of finite fields, polynomial rings and finite groups 2. Understand and apply the theory of linea codes 3._Understand and apply the theory of cyclic codes, ‘Suggested Books: Year of Publication? Edition ‘SeNo: | Name of Book/ Authors Publisher Year of Publication? Edition 1 | "Coding Theory", San Ling & Chaoping Xing , Cambridge University Press [2004 2 |Pintroduction tothe ‘Theory of Error Correcting Codes”, Vera Pless, Cambridge | 2003 University Press 3 [introduction to Error Correcting Codes", Raymond Fl, Clarendon Press, | 1986 Oxford “Theory of Eror Correcting Codes Pan | & IP, FU Macwilliams & NIA Sloane | 1977