0% found this document useful (0 votes)
9 views30 pages

M.Sc. Math Syllabus

Mathematics m.sc

Uploaded by

ASIF ANSARI
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
9 views30 pages

M.Sc. Math Syllabus

Mathematics m.sc

Uploaded by

ASIF ANSARI
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
1 Scheme for Choice Based Credit System in [Link]. Mathematics SEMESTER COMPULSORY FOUNDATION COURSE (Credits: Theory-04, Tutorial-01) MAT-F-101 MODERN ALGEBRA Theory 9) ou; Tutorial:15 Hours Marks. 90(\/S5 900) Hr.» § Attd. + Assignment)+70/ESE:3Hrs =100Pass ori (MSE:17+ESE:28)=45 Time-3 Hrs Instruction to faculty members and Question Seter for: Mid Semester Examination (MSE): There will be Two groups of questions in written examination of 20 marks. Group A is compulsory and will contain five questions of multiple type questions consisting of 1 mark each Group © will contain descriptive type five questions of five. marks cach, out of which any three are to be answerec’ The Mid Semester Examination sivall have three components. (2) Two Semester Intemal Assessment Test (SIA) of 20 Marks each (b) Class Attendance Score of 5 marks and (¢) DaytoDay & Extracurricular activities of 5 marks. “Best f Two" shall be applicable for computation of marks for SIA. (Attendance Upto 75% 1mark: 751 using Van Kampen’s theorem. fundamental groups of a topological group. Brouwer's fixed point theorem. fundamental theorem of algebra, vector fields on planner sets. Frobenius theorem for 3 x 3 matrices. (2 QUESTIONS) UNITE Covering spaces. unique path lifting theorem. covering homotopy theorems. group of covering transformations. criteria of lifting of maps in terms of fundamental groups. universal covering. its existence. special cases of manifolds and topological groups. Singular homology, reduced homology. Eilenberg Steenrod axioms of homology (no proof for homotopy invariance axiom decision axiom and exact segnence axiom) and theory application, relation between fundamental group and first homology. (2 QUESTIONS) UNIT HI Calculation of homology of S". Brouwer’s fixed point theorem for f : E" > E". application spheres. veetor fields. Mayer-Vietoris sequence (without proof) & its applications. Singular cohomology modules. Kronecker product. connecting homomorphism. contra-funcioriality of singular cohomology modules. naturality of connecting homomorphism. exact cohomology sequence of pai. homotopy invariance. excision properties, cohomology of a point. Mayer vietoris sequence and its application in computation of cohomology of S*. RP*. CP" torus. compact surface of genus g and non-orientable compact surface. (2. QUESTIONS) UNIT IV Compact connected 2-manifolds. their orientabiligy and non-orientabiligy. examples. connected sum. construction of projective space and Klein’s bottle from a square. Klien’s bottle as union of two Mobius strips. canonical of sphere. torus and projective plannes. Klin’s bottle as union of two Mobius strips. triangulation of compact surfaces. Classification theorem for compact surfaces. connected sum of tours and projective plans as the connected sum of three projective planes. Euler characteristic as a topological invariant of compact surfaces. connected sum formula, 2-manofolds with boundary and their classifications. Euler characteristic of a bordered surface, models of compact bordered surfaces in R’. (2 QUESTIONS) References : + James R. Munkres. Topology — A first Course. Prentice Hall of India Pvt. Ltd., New Delhi, 1978. Paper-XIV MACHANICS OF SOLIDS/OPERATIONS RESEARCH/DIFFERENTIABLE STRUCTURE ON A MANIFOLD/INFORMATION THEORY, ‘Time : 3 Hrs. Full Marks :70 Inall mine questions will be set out of which candidates are required to answer 5 questions. QNo. 1 is compulsory consist of seven very short answer type questions cach of 2 marks covering entire syllabus. MECHANICS OF SOLIDS SYLLABUS: UNIT Analysis off Strain-Affine transformation. Infinite simal affine deformation. Geometrical interpretation of the components of stain. Strain quadric of Cauchy. Principal strains and invariants. General infinite simal deformation. Saint-Venant’s equations of Compatibility. Finite deformations. @2Qu TIONS) UNIT Analysis of Stress-Stress tensor. Equations of equilibrium. Transformation of coordinates. Stress qudric of Cauchy. Principal stress and invariants. Maximum normal and shear stresses, (2 QUESTIONS) UNIT IT Equations of Elasticity. Generalized Hooke’s law. Homogeneous isotropic media, Elast moduli for isotropic media. Elasticity moduli for isotropic media. Equilibrium and dynam equations for an isotropic elastic solid. Strain energy function and its connection with Hooke’s Jaw. Uniqueness of solution Beltrami-Michell compatibility equations. Saint-Venant’s principle. Torsion-Torsion of cylindrical bars. Tortional rigidity. Torsion and stress functions. Lines of shearing stress. Simple problems ~ Plane stress. Generalized plane stress. Airy stress function, General solution of Biharmonic equation. Stresses and displacements in terms of complex Js. Simple problems. Stress function appropriate to problems of plane stress problems of semi-infinite solids with displacements or stresses prescribed on the plane boundary. (2 QUESTIONS) UNIT IV Waves-Propagation of waves in an isotropic elastic solid medium. Waves of dilation and distortion. Plane waves. Elastic surface waves such as Rayleigh and Love waves. Variational methods - Theorems of minimum potential energy. Theorem of minimum complementary energy. Reciprocal theorem of Betti and Rayleigh. Deflection of elastic string central line of a beam and elastic membrane. Torsion of cylinders. Variational problem related to biharmonic equation. Solution of Euler’s equation by Ritz. Galerkin and Kantorovich methods. (2 QUESTIONS) References : + LS. Sokolnikoff, Mathematical Theory of Elasticity, Tata McGraw-Hill Publishing Company Ltd., New Delhi. 1977. + A.E. Love. A Treatise on the Mathematical Theory of Elasticity. Cambridge University Press. London. 1963 + _Y.C. Fung Foundations of Solid Mechanics. Prentice Hall, New Delhi. 1965. +S. Timoshenko and N. Goodier. Theory of Elasticity, McGraw Hill, New York 1970, OPERATIONS RESEARCH Time :3 Hrs. Full Marks :70 In all nine questions will be set out of which candidates are required to answer 5 questions. Qo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNITI Sequencing : Introduction, sequencing problem with n-jobs and two machines. optimal sequencing problems with n-jobs and three machine. Problems with n-jobs and m-machine, graphical solution, (2 QUESTIONS) UNIT IL Replacement Problems : Introduction, replacement of item that Deteriorate with time, Replacement of items whose maintenance costs change with time and the value of money remains same during the period. replacement of items whose maintenance costs increase with time and the value of money also changes with time. replacement of items that fail completely, individual replacement policy, group replacement policy. Queuing theory : Introduction, characteristics of queuing system, queue discipline, symbols ete. Poisson process and exponential distribution, properties of Poisson process, classification of queues. definition of transient and steady state, model (M/M/L) (D/fl Fo), (M/M/) (SIRO) (M/M/T) (MFIFO). (2 QUESTIONS) UNIT HT Non-Linear programming — Introduction, definitions of general non-linear programming problems, problems of constrained maxima and minima; necessary and sufficient conditions for non-linear programming problems, Hessian ~ matrix, Lagrangian functions with Lagrangian multiplier. constraints are not all equality constraints. sufficiency of saddle point problem, Kuhn-Tucker condition, (2 QUESTIONS) UNIT IV Non-linear programming techniques — Introduction of GMPP & GN 1 PP its sanetion by Wolte’s method. Beale’s method. (2 QUESTIONS) References + ES. Hillier and G. J. Lieberman. Introduction to Operations Research (Sixth Edition). McGraw Hill International Edition. Industrial Engineering Series. 1995 (This book comes with a CD containing tutorial software), + G. Hadley, Linear Programming. Narosa Publishing House. 1995. + [Link]. Nonlinear and Dynamic Programming. Addisor-Wisely. Reading Mass. + Kanti Swarup, [Link] and Man Mohan, Operations Research, Sultan Chand & Sons, New Delhi. + S.S. Rao. Optimization Theory and Applications. Wiley Eastem Ltd., New Delhi. + Prem Kumar Gupta and D.S. Hira. Operations Research-An Introduction, $. Chand & Company Ltd. New Delhi. + [Link] , Oprations research, Prentice Hall India.1997. DIFFERENTIABLE STRUCTURES ON A MANIFOLD ‘Time : 3 Hrs. Full Marks :70 In all nine questions will be set out of which candidates are required to answer 5 questions. QNNo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNIT Almost Hermite manifolds. Riem Almost analytic vector -fields. Curvature tensor. Linear connections. Kahler manifolds. Affine Connections. Holomorphic sectional curvature. Curvature tensor. Almost Analytic Vector fields, (2 QUESTIONS) UNIT IL Nearly Kahler manifolds. Curvature ident Almost analytic Vector Fields. Constant Holomorphic sectional curvature. (2 QUESTIONS) UNIT HL Almost Kahler manifolds. Analytic vector fields. Conformal transformation. Curvature identities, Almost Contact Metric manifolds — Almost Grayan manifolds. K-Contact Riemannian manifolds. Sasakian manifolds. Cosymplectic manifolds. (2 QUESTIONS) UNITIV Subamanifolds of almost Hermite and Kahler manifolds. Sub-manifolds of almost contact metric manifolds. CR-Submanifolds of Kahler manifolds and Sasakian manifolds. The integrability of distributions. (2 QUESTIONS) References : + RS. Mishra. Structures on a differentiable manifold and their applications. Chadrama Prakashan. Allahabad, 1984. FORMATION THEORY : Time : 3 Hrs, Full Marks :70 nll nine questions will be set out of which candidates are required to answer $ questions. QUNo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNITI Measures of information. Axioms for a measure of uncertainty. The Shannon entropy ani properties. Joint and conditional entropies. Transformation and its properties. Noiseless coding — ingredients of noiseless coding problem. Uniquely decipherable codes. Necessary and sufficient condition for the existence of instaneous codes. Construction of optimal codes. (2 QUESTIONS) UNIT IT Discrete memory less channel. Classification of channels. Information processed by a channel, Calculation of channel capacity. Decoding schemes. The ideal observer. The fundamental theorem of Information theory and its strong and weak converses (2 QUESTIONS) UNIT IIL Continuous channels — The time-descrete Gaussian channel, Uncertainty of an absolutely continuous random variable. The converse to the coding theorem for time-discrete Gaussian channel. The time-continuous Gaussian channel. Band-limited channels. 2 QUESTIONS) UNIT IV Information functions, the fundamental equation of information, information functions continuous at the origin, nonnegative bounded information functions, measurable information functions and entropy. Axiomatic characterizations of the Shannon entropy due to Tverberg and Leo. The general solution of the fundamental equation of information. Derivations and their role in the study of information functions. ‘The branching property. Some characterizations of the shannon entropy based upon the branching property. Entropies with the sum property. The Shannon inequality. Sub additive. additive entropies. (2 QUESTIONS) References : + [Link], Information Theory, Inter science Publishers. New York 1965. + [Link]. An introduction to information Theory. Me Graw-Hill Book Company ine. 1961 + J. Aczel and Z. Daroczy. On measures of information and their characterizations. Academic press. New York. INTEGRAL TRANSFORMS/ALGEBRAIC CODING THEORY MATHEMATICS OF FINANCE AND INSURANCE / APPLIED STATISTICS/BOUNDARY LAYER THEORY INTEGRAL TRANSFORMS Time : 3 Hrs. Full Marks :70 In all nine questions will be set out of which candidates are required to answer 5 questions. QUNo. 1 is compulsory consist of seven very short answer type questions cach of 2 marks covering entire syllabus. SYLLABUS : UNITE Fundamental Formulae-The Laplace Transform-Definition Region of convergence. abscissa of convergence, absolute convergence, Uniform convergence of Laplace Transform. Complex Inversion formula The Stieltje transform-Elementary properties of the transform. Relation to the Laplace transform. Complex Inversion formulae. (2. QUESTIONS) UNITIL ‘The Fourier transform : Dirichlet’s conditions. Definition of Fourier transform. Fourier Sine Transform, Fourier cosine transform. Inversion theorem for complex fourier transform. Difinition of convolution and convolution theorem for Fourier transforms. Parseval’s identity of Fourier transforms. (2 QUESTIONS) UNIT I ‘The Mellin transform : Definition of Mellin transform and its properties. Mellin transforms of derivatives and certain integral expressions. (2 QUESTIONS) UNIT IV Hankel Transform : Definition of Hankel transform and its elementary properties. Inversion formula for the Hankel transform. Hankel transform of derivatives, Parseval’s theorem. (2 QUESTIONS) References : 1. The Laplace Transforms - [Link] 2. Use of Integral Transforms - Sneddon ALGEBRAIC CODING THEORY ‘Time : 3 Hrs. Full Marks :70 Inall nine questions will be set out of which candidates are required to answer 5 questions, QUNo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS : UNIT. Coding theory, Introduction, examples, Inpotant code parameters, Correcting and detecting errors, Sphere-packing bound, Gilbert-Varshamov bound, Sigleton bound. (2 QUESTIONS) UNIT IT Linear codes: Vector spaces over finite fields,Linear codes,Binary linear , Hamming weight, Bases of linear codes, Generator matrix and parity check matrix. (2 QUESTIONS) UNIT HI Equivalence of linear codes, Encoding with a linear code,Decoding of linear codes, Cosets, Nearest neighbour decoding for linear codes, Syndrom decoding. (2 QUESTIONS) UNIT IV Cyclic codes: Definitions, Generator and parity check polynomials, Generator and parity check, matrices, Decoding of cyclic codes, Burst-error-correcting [Link]-Solomon codes. (1 QUESTIONS) Some special cyclic codes: BCH codes, RS codes, Defintions, Parameters of BCH codes,Decoding of BCH codes Reed-Muller Codes. Maximum-distance Separable (MDS) Codes. Generator and Parity-check matrices of MDS Code. Weight Distribution of MDS Code. MDS codes from RS codes, Codes derived from Hadamard Matrices. (1 QUESTIONS) Reference: 1. Rill, Afirst course in codding theory, oxford university press 2. [Link] and [Link], The Theory of error correcting codes, North Holland Publishing company, Amsterdom. 3. San Ling and Chaoing xing, Coding Theory- A First Course. 4. Applied Abstract Algebra - Lid and Pilz 2nd Edition, 5. Todd K. Moon, Error Correction Coding, Wiley India 6. Steven Roman, Coding and Information Theory, Springer-Verlag. 7. algebraic coding theory, E.R. Berlekamp 8. Error Correcting Coding Theory,Man Young Rhee. 9. Brror-Correcting Codes, W.W. Peterson and E.J. Weldon, Jr. 10, Algebraic Coding Theory, E.R. Berlekamp MATHEMATICS OF FINANCE AND INSURANCE ‘Time : 3 Hrs. Full Marks :70 Inall nine questions will be set out of which candidates are required to answer 5 questions. QNo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNITI Prerequisite — Application of Mathematics and Finance & Insurance Optional Paper BMG 1 304 (@&b)F) Financial Derivatives — An Introduction : Types of Financial Derivat : Options and its kind : and SWAPS, ‘The Arbitrage Theorem and Introduction to portfolio Selection and Capital Market Theory ~ Static and Continuous ~ Time Model. — Forwards and Futures (2 QUESTIONS) UNIT IL Pricing by Arbitrage ~ A Single ~ Period Option Pricing Model: Multi Pricing Model-Cox-Ross-Rubinstein Model : Bounds on Option Prices. ‘The Dynamics of Derivative Prices-Stochastic Differential Equations (SDEs) ~ Major Models of SDEs. Lonear Constant Coefficient SDEs: Geometric SDEs : Square Root Process: Mean Reverting Process and Omstein-Uhlenbeck Process. Martingale Measue and Risk-Neutral Probabilities : Pricing of martingale measures. smial Options with equivalent (2 QUESTIONS) UNIT HIT ‘The Black-Scholes Option Pricing Model- Using no arbitrage approach, limiting case of Binomial Option Pricing and Risk-Neutral probabilities, The American Option Pricing-Extended Trading Strategies; Analysis of Amerivan Put Options: early exercise premium and relation to free boundary problems. Concepts from Insurance : Introduction : The Claim Number Process : ‘The Claim Size Process: Solvability of the Portfolio: Reinsurance and Ruin Problem. Premium and Ordering of Risks-Premium Calculation Principles and Ordering Distributions. (2 QUESTIONS) UNITIV Distributions of Aggregate Claim Amount-Individual and Collective Model:Compound Distributions : Claim Number of Distributions: Recursive Computation Methods: Lundberg, Bounds and Approximation by Compound Distributions. Risk Processes-Time-Dependent Risk Models: Poisson Arrival Processes : Ruin Probabilities and Bounds Asymptotic and Approximation. Time Dependent Risk Models ~ Ruin Problems and Computations of Ruin Functions; Dual Queuing Model : Risk Models in Continuous Time and Numerical Evaluation of Ruin Functions. (2 QUESTIONS) Referenees : * John C. Hull, Options. Futures and other derivatives. Prentice Hall of India Pvt. Ltd. + Sheldon M. Ross. An Introduction to Mathematical Finance. Cambridge University Press. APPLIED STATISTICS Time : 3 Hrs. Full Marks :70 In all nine questions will be set out of which candidates are required to answer 5 questions. [Link]. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNITE. Demand analysis. price elasticity and demand. partial elasticity of demand, Lontieg’s method. Pigou’s method. Engle’s curve and Engle’s law. Parety’s law of income distribution, curves of concentration, (2 QUESTIONS) UNIT IT Analysis of Variance. One way classification, statistical analysis of the [Link] experiment- statistical analysis of C.R.D. (Completely randomized design) least square estimates of effects, exception of sum of squares. randomized block design (R.B.D.) — statistical analysis of R.B.D. for one observation per experiment unit. Variance of estimates. expectation of sum of squares, efficiency of R.B.D. relative to C.R.D. (2 QUESTIONS) UNIT UL Design of sample survey. Principle steps in a sample survey sampling and non-sampling error. types of sampling, selection of a simple random sample, simple random sampling, stratified random sampling. Psychological and educational statistics — scaling of scores on a test. percentile scores, scaling of rankings, scaling of normal probability curves. scaling of ratings in terms of normal curve, reliability of test scars, error variance, index of reliability, parallel test method of determining test reliability, (2 QUESTIONS) UNITIV Vital Statistics — uses of vital statistics, methods of obtaining vital statistics, measurement of population , measurement of mortality, crude death rate (C.D.R.) specific death rate (SDR). specific rate, life table or (Mortality table). abridged life table, fertility measurement of population growth. (2 QUESTIONS) References: + Fundamental of Applied Statistics ~ $.[Link] & V. K. Kappor + Statistical Method — S.P. Gupta + An Introduction to statistical method ~ $.[Link] BOUDARY LAYER THEORY : Time : 3 Hrs. Full Marks :70 Inall nine questions will be set out of which candidates are required to answer 5 questions. QNo. 1 is compulsory consist of seven very short answer type questions each of 2 marks covering entire syllabus. SYLLABUS: UNIT. Exact solution of Navier-Stoke’s equation — flow between two concentric rotating cylinders. Hiemenz flow. flow due to lane wall suddenly set in motion, flow due to an oscillating wall. (2 QUESTIONS) UNIT IT Theory of very slow motion — flow past a sphere. (Stroke's flow). Flow past a sphere (Osceen’s flow), Lubrication Theory. Theory of laminar boundary layer — (a) two dimensional boundary layer equation for flow over a plane wall, boundary layer on a flat plate. (Blassius-Topler solution). (2 QUESTIONS) UNIT TI characteristic of boundary layer parameters. (b) Similar solution of the boundary layer equation, boundary layer. How past a wedge boundary layer along the wall of a convergent channel. boundary layer on a symmetrically placed cylinder and body of evolution. (2 QUESTIONS) UNIT IV. Boundary layer control in laminar flow — methods of boundary layer control in laminar flow, boundary layer suction. (2 QUESTIONS) References : + Boundary layer theory ~Sli + Foundation of fluid dyna ting. —S.W. Yuan, Prentice Hall of India (F) + Laminar boundary layer ~L. Rosenheard. C.U.P. Clarendon Press. + Viscous fluid dynamics —J. L. Bansal. Oxford & IBM pub. co. Paper-XVI DESSERTAION PROJECT Time: 6 hours FM. 100 ANY ONE OF SPECIAL PAPER

You might also like