SNPV Syllabus: M.Sc. MATHS (FINAL) – All-syllabus

शहीद नंदकुमार पटेल विश्वविद्यालय (SNPV Raigarh) का M.Sc. MATHS (FINAL) सिलेबस (Syllabus) PDF फ्री डाउनलोड करें – MSc। आधिकारिक सिलेबस – इकाइयाँ, अंक और पेपर की पूरी जानकारी।

PDF

M.Sc. MATHS (FINAL)

Shaheed Nandkumar Patel Vishwavidyalaya, Raigarh
UniversityShaheed Nandkumar Patel Vishwavidyalaya (SNPV)
Course
Subject / PaperM.Sc. MATHS (FINAL)
FilePDF · 1.4 MB
👁️ Syllabus Preview
Loading preview…

✅ Free download. No sign-up needed.

🎯 परीक्षा से पहले ज़रूर देखें

सिर्फ पुराने पेपर काफ़ी नहीं — इस साल क्या आ सकता है, वो जानिए!

पिछले साल का पेपर आपको पैटर्न बताता है, लेकिन परीक्षा में इस साल के प्रश्न आते हैं। Pariksha Pass App में हमारी टीम ने पिछले कई वर्षों के पेपर्स का विश्लेषण करके हर विषय के संभावित प्रश्न पत्र (Guessing Papers) तैयार किए हैं — ताकि आप कम समय में सही चीज़ें पढ़ें।

📚 हर विषय के 3 सेटएक विषय के 3 अलग-अलग Guessing Paper — पूरे सिलेबस की अच्छी कवरेज।
✍️ सटीक और छोटे उत्तरहर प्रश्न का परीक्षा में लिखने लायक उत्तर — रटने की जगह समझकर लिखें।
🏷️ Year Tagहर प्रश्न के आगे लिखा है कि वह किस साल पूछा गया था — बार-बार आने वाले प्रश्न तुरंत पहचानें।
🏫 यूनिवर्सिटी-वारABVV, PRSU, HYV, SMKV, SGGV, SNPV — अपनी यूनिवर्सिटी के हिसाब से पेपर।
🔤 हिंदी और Englishदोनों माध्यम में उपलब्ध — जिस भाषा में परीक्षा देते हैं, उसी में पढ़ें।
📱 मोबाइल पर कहीं भीबस, कॉलेज या घर — फ़ोन पर ही पूरी तैयारी, नोट्स ढूँढने का झंझट नहीं।
  1. App डाउनलोड करें — Google Play से Pariksha Pass
  2. अपनी यूनिवर्सिटी और कोर्स चुनें
  3. Guessing Paper पढ़ें और परीक्षा की तैयारी पक्की करें
अभी Pariksha Pass App डाउनलोड करें

👀 पहले फ्री डेमो Guessing Paper देखें →

⏳ परीक्षा पास आ रही है — आख़िरी दिनों में सबसे ज़्यादा काम आते हैं सही प्रश्न। आज ही तैयारी शुरू करें!

About this SNPV syllabus

This PDF contains the official syllabus "M.Sc. MATHS (FINAL)" issued for students of Shaheed Nandkumar Patel Vishwavidyalaya. It lists the papers, units, credits and marks distribution you need to study for your semester examinations.

How to study with the syllabus

  • अपना सेमेस्टर और पेपर कोड ढूँढें (NEP में: DSC = मुख्य विषय, DSE = वैकल्पिक, GE = सामान्य वैकल्पिक, SEC = कौशल, VAC = मूल्य वर्धित, AEC = क्षमता संवर्धन)।
  • सभी इकाइयों के नाम एक पेज पर लिखें और जो इकाई पूरी हो जाए उस पर ✓ लगाते जाएँ।
  • हर इकाई को पिछले वर्षों के प्रश्न पत्रों से मिलाएँ, ताकि सबसे ज़रूरी टॉपिक पता चलें।

Syllabus contents (text version)

यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।

MASTER OF SCIENCE
1. The examination for the degree of Master of Science consist of 2 parts
(A) The Previous examination and
(B) The Final Examination.
2. A candidate who after obtaining the degree of Bachelor of science the University or an
examination of any statutory University in any statutory University in India which has been
recognised by they University as equivalent to B.Sc. degree of the university and has completed
a regular course of study in the teaching department of the University in the subject in which
he offers himself for examination for one academic year shall by admitted to the previous
examination for the degree of master of Science.
Provided however every candidate shall offer for the Previous Examination one of the subjects
will be given to those candidates who offered Maths as one of their subject in B.Sc.
completed a regular course of study for one academic year in a teaching department of the
University or in a College affiliated to the University shall be admitted to the Final Examination
for the degree of Master of Science in the subject in which he/she has passed the Previous
examination.
A Candidate who has passed the previous examination for the degree of Master of Science of
another University may also be admitted to the final Examination for the degree of Master of
Science after obtaining necessary permission from the Kulpati, provided that he offered for his
previous Examination a course of study of an equivalent standard with almost identical syllabus
as is required for the Previous Examination of this University, and has attended a regular course
of study for one academic yea. in a College affiliated to the University teaching department of
the University.
4. The examination shall be partly be meant of paper and partly practical including Sessional,
except in the case of mathematical where the examination shall be paper only.
and non collegiate candidates shall be eligible for admission to the examination as per provision
or ordinance No.6 relating to Examination (General).
Provided that non-collegiate candidate shall be permitted to offer only such subjects/papers as
are taught to the regular students at any of the University teaching Department or College.
6. The Subject of the Examination .shall be of the following :
be allowed to present himself for the M.Sc. Examination in any one of more of the optional
papers in the subject not taken by him at the said examination and if successful will be given a
certificate to that effect.
7. From the session 1986-87 for the Previous Examination, candidate must obtain for a pass at
leasst 32% in each theory and Practical and 36% of the aggregate marks in the Theory paper
and Practical separately in each examination. The above provision of 20% in each paper shall
be applicable for Final Examination from the academic session of 1987 -88
8. No division will be assigned on the result of the Previous Examination the division in which a
candidate is placed shall be determined on the basis of aggregate of marks obtained in both.
9. Successful candidates who obtain 60% or more of the aggregate marks shall be placed in the
first Division, those obtaining less than 60% but not less 48% in the second Division and all other
success full candidate obtaining less than 48% in the Third Division.
10. Candidates who have passed the M.Sc. Examination of the University in any subject in Third
or Second Division and desire to appear at the M.Sc. Examination in the same subject for·
improving division without attending a regular course of study in a College affiliated to the
University or in a Teaching Department of the University be allowed to appear at the afo.resid
examination as non-collegiate student on the following conditions.
(i) There shall be only two Divisions. for such candidates the First these division shall be the
same as prescribed in the ordinance i.e. examinees who are successful in Final of the
Examination.· and have obtained 60% or more aggregate of the marks in Previous and Final
Examination taken together shall be placed in the First Division and Examinees who are
successful in Final Examination and have obtained less than 60% but not less than 48% of
aggregate marks in previous and Final examination taken together shall be placed in the
Second. Division.
(ii) The result of the candidates obtaining less than 48% of the aggregate marks in previous and
Final Examination taken together shall not be declared.
(iii) Candidates shall have the option to appear at both the previous and final examination in
one and the same year and for being successful at the examination, the candidates shall obtain
48% of the aggregate marks. Provided that such candidates who opt to appear in previous and
final examination separately shall have to obtain minimum aggregate required for the previous
examination but he will have to obtain at least 48% in the aggregate of previous and final
examination taken to gather or else his result will be cancelled.
(iv) The syllabus for the examination shall be same as prescribed for the year in which the
examination held.
(v) Not more than to attempt shall be allowed to such a candidate. Failure of
appearance at the examination after per permission has been accorded by the
University shall be counted as an attempt. Provided however: such candidates
who to appear at the previous and final examination separately will be allowed
only one attempt of the previous examination and two attempts as the final
examination.
(VI) Candidates who wish to avail the opportunity given in fore going .Paper will
have to apply for permission as required in the Ordinance relating to admission
of non - collegiate students to the University examination along with registration
fee.
(vii) In case, a student Improves his division under provision of this Para, the fresh
Degree will be issued after cancelling his first Degree.
-----000----
COMPULSORY
PAPER- I
COMPULSORY
Integration Theory and Functional Analysis
PAPER- I
Integration Theory
Signed measure Hahn decomposition theorem, mutually singular measures, RadonNikondym
Theorem, Labesgue decomposition, Rises representation theorem. Extension theorem
Differentiation and Integration. Decomposition into absolutely continuous and singular parts.
Baire sets. Baire measure, continuous functions with compact support. Regularity of measure
on locally compact spaces.
Functional Analysis
Normed Linear spaces Banach spaces and examples Quotient space of normed linear spaces
and its completeness equivatient norms Lemma. basic properties of finite dimensional normed
linear spaces and compactness. Weak convergence and bounded linear transformations
normed linear spaces of bounded linear transformations dual spaces with examples Uniform
roundedness theorem and some of its consequences. Open mapping and closed graph
linear
spaces. Reflective spaces Weak Sequential Compactness Compact operators. solvability of
linear Equations in Banach spaces- The closed
Range Theorem.
lnner Product spaces. Hilbert spaces. Orthonormal Sets Bessel's inequality. Complete
presentation theorem Ad joint of an operation a Hilbert space. Reflexivity of Hilbert spaces
Self adjoin operators, Positive, projection, Normal and unitary operators.
REFERENCES :
2. B Choudhary and Sudarsan Nanda Functional Analysis with Applications Wiley eastern Ltd. 1989
8. Walter Rudin : Real & Complex Analysis, Tata McGraw Hill Publishing Company. New Delhi
10. A Siddiqui Functional Analysis With Applications Tata McGraw Hill Publishing Company New Delhi.
COMPULSORY
PAPER- II
PARTIAL DIFFERENTIAL EQUATIONS, MECHANICS & GRAVITATION
Partial Differential Equations Examples of PDE. Classification.
Functions, Green's Function, Energy Methods.
Heat Equation- Fundamental Solution Mean Value Formula, properties of Solutions, Energy
Methods. Wave Equation Solution by Spherical means, Homogeneous Equations, Energy
Methods.
Nonlinear First Order PDE, Complete Integrals, envelopes, Characteristics, Hamilton Jacobi
Formula Weak Solutions, Uniqueness, Riemann's problem Long Time Behaviour)
Representation of Solutions- Separation of Variables, Similarity Solutions (Plane and Travelling
Waves, Solutions Similarity under Scaling) Fourier and Laplace Transforms, Hopf -cole
transform, Hodograph and Legendre Transforms, Potential Functions, Asymptotic (Singular
Perturbations Laplace's method, Geometric Optics, Stationary Phase, Homogenization), Power
Series (Non characteristic Surfaces Real Analytic Functions, Caucky - Kovalevskaya Theorem.)
MECHANICS
Analytical Dynamics
equations of second kind Uniqueness of solution, Energy equation for conservative fields.
problems of calculus of variations, Shortest distance minimum surface of revolution.
Brachistochrone problem. Isoperimetric problem. Geodesic. Fundamental lemma of calculus of
Independent functions, (ii) higher order derivatives. Conditional extremum under geometric
constraints and under integral constraints.
Gravitation.
Attraction and potential of rod, disc, spherical shells and sphere, Surface integral of normal
attraction (application & causes, theorem,) Laplace and Poisson equations, Work done by sell
attracting systems, Distributions for a given potential. Equipotential surfaces. Surface and solid
harmonics Surface density in terms of surface harmonics.
REFERENCES :
5. H. Goldstem Classical Mechanics, Addition Wesley
6. Narayan Chandra rana & Pramod Sharad Chandra Joag Classical Mechanics tata McGrawHill
Publishing Company 1991
----000---
OPTIONAL
FUNDAMENTALS OF COMPUTER SCIENCE & DATA STRUCTURE
Note: Five question out of 10 questions to be attempted.
Computer Basics introduction to computers with characteristics and their uses,
Structure of computers, Micro, Mini and Mainterme computer, Data representation,
Numbering system and their arithmetic, Fixed point and flothing point representation
of overflow and underflow conditions using 7-bit and 8-bit registers, Error detection and
correction codes
Input devices and computer Memory Description of various input/ output units of
computers, VDU, OMR, OCR, Bas coding, Memory organization, Memory cells, Read only
memory serial access memory Physical devices used to construct memory.
Computer architecture and operating system lnter-connection of units, Memory of
processor, l/O to processor communication, interrupt,- objectives of an operating
system Function of an operating system, types of an operating system- batch,
multiprogramming, online and real time operating system.
Computer and communication : Computer Network technology, Communication
protocols, Different topologies Linear Circular sates, tree concept of LAN, WAN, MAN
Concept of Data - structive, Type and operations, Algorithms, complexity Time, space,
Trade off. Linked List: Representation, Travesing, searching instruction into a linked list
(First, mid & last position with algorithm) deletation stacks, dueues, Recunsion, Array
representation of-stacks, Arithmetic expressions (Polish Notation) Application recession
and queues.
Trees - Binary trees, representation, traversing, binary search trees, searching and
inserting in Binary search. Deleting in a Binary search tree General tree.
Sorting: Insertion, quick, heap, bubble & merge, selection sort
REFERENCES :
-----000----
OPTIONAL
An overview of programming. Programming language, Classification.
C Essentials- Program Development. Functions. Anatomy of a Function. Variables are Constas
Expressions. Assignment Statements. Formatting Source Files. Continuation Characis. The Pre-
processors.
Scalar data types Declarations, Different types of integers Different kinds of Integer constants
Floating point types, Initialization, Mixing Explicit conversions.
Casts, Enumeration types, The void data type, Typesets, Finding the address of an object
Pointers, control Flon-Conditional Branching, The switch statement Looping Nested Loops The
Operators and Expressions Precedence & Associatively, Unary Plus and Minus operators. Binary
Never miss an update for this examGet a notification when new results, admit cards or notices are published. / नई अपडेट की सूचना पाएं।

More SNPV MSc papers