**IIT-JAM Mathematics Test Series**

Dips Academy provides all India test series for IIT-JAM and
NET.

IIT-JAM Test Series Start From: 1, September-2014.

NET Test Series Start from: 1, October-2014,

For more details- Contact

**Dips Academy**

Address:- Dips House: 27-J, Jia Sarai, Hauz Khas, Delhi –
110016

Contact:- 011 – 26525686, 9899161734

Email:- info@dipsacademy.com

Website:- www.dipsacademy.com

NET (

**National Eligibility Test**) is associate degree examination conducted by the University Grants Commission so as to determine the eligibility for post and for award the Junior Research Fellowship. The examination is meant for Indian nationals and aims to implement uniform standards on aspirants getting into the teaching and analysis field in varied disciplines.
The UGC NET examination
takes place twice a year - once in June and then in December. NET is conducted
for the subsequent subjects:

o Humanities - including
Languages

o Social Sciences.

o Environmental Sciences

o Forensic Science

oComputer Science and
Applications

o Electronic Science

**Also Read:**

**DIPS ACADEMY: MENTORING WITH MODERN TOOLS**

The CSIR (

**Council of Scientific and Industrial Research**) together with the UGC conducts the UGC-CSIR web for the subsequent subjects:
o Life Sciences

o Chemical Sciences

o Physical Sciences

o Mathematical Sciences

o Earth, atmospherically,
Ocean and Planetary Sciences

The check for Junior
Research Fellowship has been in situ since 1984. Whereas within the year 1988,
the Indian government granted the UGC the proper to conduct the UGC NET exam.

However, in spite of the
simplest efforts by UGC, opinion is sort of divided among critics. Some say web
is simply a sham that doesn't truly differentiate the cream of individuals
extremely worthy to be lecturers from the others. On the opposite hand, there are
a unit others WHO firmly believe the ideology, processes and outcome of the
examination in Toto.

Opinions apart, the actual
fact remains that the

**UGC-NET examination**could be a reality that needs to be borne by all lectureship and research aspirants in Republic of India.**Also Read:**

**How to Prepare for the UGC NET Exam?**

CSIR-UGC NET
exam is being rated as one of the most challenging competitive exams, Now a
million dollar question- what is that well defined strategy in this competition
era? DIPS academy understands the importance of it and provides its students an
experienced and trusted adviser

Dips
academy is considered as one of the best coaching centers for GATE exam. When
this academy was founded the students were taught in a small room. But with the
rapid success of this institute and the students it has extended its building
and classrooms. The faculty members are well educated and have excellent
knowledge in their specific subjects. They are always ready to help the
students at any time. Assessment of the students is being done by a team of
professionals.Resource:- EzineArticles

The University Grants Commission National Eligibility Test is a prestigious pursuit. The stakes involved are really high because people who get through have an opportunity to build a really bright career. Only those holding a valid masters degree are eligible for the UGC NET Exam. However, preparing for the exam requires diligent effort and systematic preparation technique. Being rated as one of the most competitive exams, the UGC NET is not a difficult to achieve target once you have the right strategy in place.

For those of you who are planning to appear for the UGC NET Exam, here are a few tips on how to prepare:

The UGC NET exam covers a vast syllabus and if you are planning to clear it, you better start your preparations well in advance. From general knowledge topics to specific subject related information, you have to be well versed with every detail. Start by doing simple things like keeping notes of current affairs and other subject relevant information.

You may good with some topics or certain subjects and bad with the others. Depending on your ability to adapt, you need to figure out which are the subjects that will need more effort and accordingly prepare a priority order to study them.

Exam preparation always seems scary. But, instead of fearing the result, if you invest your efforts in preparing rightly, chances are you could end up with best of results. In case of the UGC NET Exam as well, don't start by picking the complex topics of every subject. Instead, choose the basics. They are simpler so you are guaranteed to master them faster. Also, the important thing to understand is that once you master the basics, understanding the complex topic becomes easier.

When you are reading, don't do so with the purpose of memorizing. It may take time, but you have to focus on developing an in-depth understanding and not simply memorizing. In simple terms, this technique may take a little longer to show the results however it is guaranteed to be more effective.

Simply studying is not enough. You need to train your mind and body to get ready for the real exam. Mock tests are an excellent way to do this. Appear for mock tests on a regular basis. Gradually, as you get into the exam mode, time yourself. This will help you figure out which are the sections that you must target first and the approximate amount of time that you are going to need to solve different types of questions.

Resource:- How to Prepare for the UGC NET Exam?

**It's a vast syllabus**The UGC NET exam covers a vast syllabus and if you are planning to clear it, you better start your preparations well in advance. From general knowledge topics to specific subject related information, you have to be well versed with every detail. Start by doing simple things like keeping notes of current affairs and other subject relevant information.

**For more Detail Visit our Website:-****DipsAcademy.com****Prioritize the subjects!**You may good with some topics or certain subjects and bad with the others. Depending on your ability to adapt, you need to figure out which are the subjects that will need more effort and accordingly prepare a priority order to study them.

**Don't start with the tough topics**Exam preparation always seems scary. But, instead of fearing the result, if you invest your efforts in preparing rightly, chances are you could end up with best of results. In case of the UGC NET Exam as well, don't start by picking the complex topics of every subject. Instead, choose the basics. They are simpler so you are guaranteed to master them faster. Also, the important thing to understand is that once you master the basics, understanding the complex topic becomes easier.

**For more Detail Visit our Website:-****DipsAcademy.com****Read carefully!**When you are reading, don't do so with the purpose of memorizing. It may take time, but you have to focus on developing an in-depth understanding and not simply memorizing. In simple terms, this technique may take a little longer to show the results however it is guaranteed to be more effective.

**Give mock tests!**Simply studying is not enough. You need to train your mind and body to get ready for the real exam. Mock tests are an excellent way to do this. Appear for mock tests on a regular basis. Gradually, as you get into the exam mode, time yourself. This will help you figure out which are the sections that you must target first and the approximate amount of time that you are going to need to solve different types of questions.

Resource:- How to Prepare for the UGC NET Exam?

The Civil Services IAS exam is held by UPSC every year. The IAS exam pattern comprises three stages: the Prelims stage, Mains examination, and Personality interview. Each of the three levels in the IAS exam pattern happen to be carried out by Union Public Service Comission.

The Preliminary or simply CSAT is the 1st level within the three level civil services exam. It's usually conducted around second or possibly third Sunday each May in which around one and a half lac IAS hopefuls turn up for the civil services Preliminary. The Prelims comprises of a couple of papers of two hundred scores equally common to all prospects. Questions about Indian constitutional set up, current affairs, GK, History, Geography, General Science, and Financial system are typically expected during the first paper of civil services Prelims. While the 2nd paper comprises of queries about mental ability, comprehension, logical analysis, English passage, statistics, and decision making potential. End result of Prelims are announced during the 2nd week of August and just candidate who get past the Preliminary can show up in the 2nd level of the IAS Exam pattern.

The second level is referred to as the Mains exam and comprises 2000 score. It must be remembered that this IAS Preliminary is merely of qualifying nature additionally, the marks won't be taken into account when considering the final merit list. Civil service contenders have to pick out two optional papers for the purpose of the civil services Mains, whilst GS and Essay are common to all aspirants. English, in addition to one Indian language paper are compulsory however solely of qualifying nature and scores are never revealed nor measured for the purpose of merit determination.

The third stage is considered the Interview phase conducted by a panel of specialists within the Union Public Service Comission hq located at Shahjahan Road, New Delhi. Just those candidates who manage to qualify the civil services Mains are eligible for the civil service interview. Usually 2.5 times the total seats in a particular year are called for this civil services interview assessment which usually commences around the last week of March and consequently carries on right till the 1st week of May. The interview is led by a UPSC member and other panel members tend to be primarily invited to conduct the interview and subject experts or even noted bureaucrats or technocrats. The IAS interview normally takes 20 mins even though many IAS candidates have faced 5 minute interviews also.

The final outcome in this three level IAS exam pattern is declared some days before the Preliminary examination in May consequently pulling to a close an entire pattern of your IAS exam spanning 12 months.

**Initial Phase in IAS Exam Pattern**The Preliminary or simply CSAT is the 1st level within the three level civil services exam. It's usually conducted around second or possibly third Sunday each May in which around one and a half lac IAS hopefuls turn up for the civil services Preliminary. The Prelims comprises of a couple of papers of two hundred scores equally common to all prospects. Questions about Indian constitutional set up, current affairs, GK, History, Geography, General Science, and Financial system are typically expected during the first paper of civil services Prelims. While the 2nd paper comprises of queries about mental ability, comprehension, logical analysis, English passage, statistics, and decision making potential. End result of Prelims are announced during the 2nd week of August and just candidate who get past the Preliminary can show up in the 2nd level of the IAS Exam pattern.

**Also Read:**__GATE Coaching || NET Coaching Institute |@ Dips Academy__**2nd Phase in IAS Exam Pattern**The second level is referred to as the Mains exam and comprises 2000 score. It must be remembered that this IAS Preliminary is merely of qualifying nature additionally, the marks won't be taken into account when considering the final merit list. Civil service contenders have to pick out two optional papers for the purpose of the civil services Mains, whilst GS and Essay are common to all aspirants. English, in addition to one Indian language paper are compulsory however solely of qualifying nature and scores are never revealed nor measured for the purpose of merit determination.

**Third Level in IAS Exam Pattern**The third stage is considered the Interview phase conducted by a panel of specialists within the Union Public Service Comission hq located at Shahjahan Road, New Delhi. Just those candidates who manage to qualify the civil services Mains are eligible for the civil service interview. Usually 2.5 times the total seats in a particular year are called for this civil services interview assessment which usually commences around the last week of March and consequently carries on right till the 1st week of May. The interview is led by a UPSC member and other panel members tend to be primarily invited to conduct the interview and subject experts or even noted bureaucrats or technocrats. The IAS interview normally takes 20 mins even though many IAS candidates have faced 5 minute interviews also.

The final outcome in this three level IAS exam pattern is declared some days before the Preliminary examination in May consequently pulling to a close an entire pattern of your IAS exam spanning 12 months.

**for more details visit:****Maths for GATE****Coaching Institutes for GATE**

**Resource:**What Is the IAS Exam Pattern?**Contact Us:**

**Dips Academy**

**Address:-**Jia Sarai, Hauz Khas, Delhi -- 110016

**Contact**:- 011 -- 26525686, 9899161734

**Visit:**www.dipsacademy.com

Distributions. Characteristic functions. Probability inequalities (Tchebyshef, Markov, Jensen). Modes of convergence, weak and strong laws of large numbers, Central Limit theorems (i.i.d. case). Markov chains with finite and countable state space, classification of states, limiting behaviour of n-step transition probabilities, stationary distribution. Standard discrete and continuous univariate distributions. Sampling distributions. Standard errors and asymptotic distributions, distribution of order statistics and range. Methods of estimation. Properties of estimators. Confidence intervals. Tests of hypotheses: most powerful and uniformly most powerful tests, Likelihood ratio tests. Analysis of discrete data and chi-square test of goodness of fit. Large sample tests. Simple nonparametric tests for one and two sample problems, rank correlation and test for independence. Elementary Bayesian inference. Gauss-Markov models, estimability of parameters, Best linear unbiased estimators, tests for linear hypotheses and confidence intervals. Analysis of variance and covariance. Fixed, random and mixed effects models. Simple and multiple linear regression. Elementary regression diagnostics. Logistic regression. Multivariate normal distribution, Wishart distribution and their properties. Distribution of quadratic forms. Inference for parameters, partial and multiple correlation coefficients and related tests. Data reduction techniques: Principle component analysis, Discriminant analysis, Cluster analysis, Canonical correlation. Simple random sampling, stratified sampling and systematic sampling. Probability proportional to size sampling. Ratio and regression methods. Completely randomized, randomized blocks and Latin-square designs. Connected, complete and orthogonal block designs, BIBD. 2K factorial experiments: confounding and construction. Series and parallel systems, hazard function and failure rates, censoring and life testing.

Linear programming problem. Simplex methods, duality. Elementary queuing and inventory models. Steady-state solutions of Markovian queuing models: M/M/1, M/M/l with limited waiting space, M/M/C, M/M/C with limited waiting space, M/G/1.

Linear Algebra : Finite dimensional vector spaces. Linear transformations and their matrix representations, rank; systems of linear equations, eigenvalues and eigenvectors, minimal polynomial, Cayley-Hamilton theorem, diagonalisa-tion, Hermitian, Skew –Hermitian and unitary matrices. Finite dimensional inner product spaces, selfadjoint and Normal linear operators, spectral theorem, Quadratic forms.

of linear equations; direct and itervative methods, (Jacobi Gauss- Seidel and SOR) with convergence; matrix eigenvalue problems; Jacobi and Given’s methods, numerical solution of ordinary differential equations; initial value problems. Taylor series method, Runge-Kutta methods, predictorcorrector methods; convergence and stability. Partial Differential Equations: Linear and quasilinear first order partial differential equations, method of characteristics; second order linear equations in two variables and their classification: Cauchy, Dirichlet and Neumann problems, Green’s function of Laplace, wave and diffusion equations in two variables Fourier series and transform methods of solutions of the above equations and applications to physical problems. Mechanics: Forces in three dimensions, Poinsot central axis, virtual work, Lagrange’s equations for holonomic systems, theory of small oscillations, Hamiltonian equations. Topology : Basic concepts of topology, product topology, connectedness, compactness, countability and separation axioms, Urysohn’s Lemma, Tietze extension theorem, metrization theorems, Tychonoff theorem on compactness of product spaces. Probability and Statistics : Probability space, conditional probability, Baye’s theorem, independence, Random variables, joint and conditional distributions, standard probability distributions and their properties, expectation, condition expectation, moments. Weak and strong law of large numbers, central limit theorem. Sampling distributions, UMVU estimators, sufficiency and consistency, maximum likelihood estimtors. Testing of hypothesis, Neymann-Pearson tests, monotone likelihood ratio, likelihood ratio tests, standard parametric tests based on normal, X2, t, F-distributions. Linear regression and test for linearity of regression, Interval estimation. Linear Programming: Linear programming problem and its formulation, convex sets their properties, graphical method, basic feasible solution, simplex method, big-M and two phase methods, infeasible and unbounded LPP’s alternate optima. Dual problem and duality theorems, dual simplex method and its application in post optimality analysis, interpretation of dual variables. Balanced and unbalanced transport-ation problems, unimodular property and u-v method for solving transportation problems. Hungarian method for solving assignment problems. Calculus of Variations and Integral Equations : Variational problems with fixed boundaries; sufficient conditions for extrremum, linear integral equations of Fredholm and Volterra type, their iterative solutions, Fredholm alternative.

polynomials, diagonalizability, Jordan canonical form. Abstract Algebra : Groups: subgroups, Lagrange’s theorem, normal subgroup, quotient group, homomorphism, permutation groups, Cayley’s theorem, Sylow theorems, Rings, Ideals Fields. Ordinary Differential Equations : First order ODEs and their solutions, singular solutions, experience and uniqueness of initial value problems for first order ODE. Gewneral theory of homogeneous and homomor-geneous linear differential

equations. Variation of parameters. Types of singular points in the phase plane of an autonomous system of two equations. Partial Differential Equations: Elements of first order PDE. Second order linear PDE: Classification, wave Laplace and Heat equations. Basic properties and important solutions of classical initial and boundary value problems. Elements of Numerical Analysis: Interpolation : Lagrange and Newton’s forms, error in interpolation. Solution of nonlinear equations by iteration, various iterative methods including Newton. Raphson method, fixed point iteration. Convergence, integration: trapezoidal rule, Simpson’s rule, Gaussian rule, expressions for the error terms. Solution of ordinary differential equations: simple difference equations, series method, Euler’s method, Runge Kutta methods, predictor- corrector methods, error estimates.

Fundamental operations in Algebra, Expansions, Factorization, simultaneous linear and quadratic equations, indices, logarithms, arithmetic, geometric and harmonic progressions, binomial theorem, permutations and combinations, surds, determinants, matrices and application to solution of simultaneous linear equations, Set Theory, Group Theory. Coordinate Geometry: Rectangular Cartesian coordinates, equations of a line, midpoint, intersections etc., equations of a circle, distance formulae, pair of straight lines, parabola, ellipse and hyperbola, simple geometric transformations such as translation, rotation, scaling. Calculus: Limit of functions, continuous functions, differentiation of functions tangents and normals, simple examples of maxima and minima, Integration of function by parts, by substitution and by partial fraction, definite integrals, and applications of Definite Integrals to areas. Differential Equations: Differential equations of first order and their solutions, linear differential

equations with constant coefficients, homogenous

linear differential equations.

Vector: Position Vector,

additions and subtraction of

vectors, scalar and vector

products and their

applications to simple

geometrical problems and

mechanics.

Absolute convergence, Uniform convergence, properties of continuous functions, Rolle’s theorem, Mean value theorem, Taylor’s and Maclaurian’s series, Maxima and Minima, Indeterminate forms.

Statistics & Linear Programming: Frequency distribution and measure of dispersion, skewness and Kurtosis, Permutations and Combinations, Probability, Random variables and distribution function, Mathematical expectation and generating function, Binomial, Poisson normal distribution curve fitting and principle of least squares, Correlation and Regression, Sampling and large sample tests, Test of significance base on t, x2 and f distribution, Formulation of simple linear programming problems, basic concepts of graphical and simple methods.

Analytical Ability and Logical Reasoning

The questions in this section will cover logical reasoning, quantitative reasoning.

ComputerAwareness

Data Representation: Representation of characters, integers and fractions, binary and hexadecimal representations, Binary Arithmetic: Addition, subtraction, division, multiplication, single arithmetic and two’s complement arithmetic, floating point representation of numbers, normalized floating point representation, Boolean algebra, truth tables, Venn diagrams.

Elements of Data Structures Computer Organization C Language

**Operation Research (O.R)**Linear programming problem. Simplex methods, duality. Elementary queuing and inventory models. Steady-state solutions of Markovian queuing models: M/M/1, M/M/l with limited waiting space, M/M/C, M/M/C with limited waiting space, M/G/1.

**GATE**Linear Algebra : Finite dimensional vector spaces. Linear transformations and their matrix representations, rank; systems of linear equations, eigenvalues and eigenvectors, minimal polynomial, Cayley-Hamilton theorem, diagonalisa-tion, Hermitian, Skew –Hermitian and unitary matrices. Finite dimensional inner product spaces, selfadjoint and Normal linear operators, spectral theorem, Quadratic forms.

**Complex Analysis :**Analytic functions, conformal mappings, bilinear transformations, complex integration; Cauchy’s integral theorem and formula, Liouville’s theorem, maximum modulus principle, Taylor and Laurent’s series, residue theorem and applications for evaluating real integrals.**Real Analysis :**Sequences and series of functions , uniform convergence, power series, Fourier series, functions of several variables, maxima, minima, multiple integrals, line, surface and volume integrals, theorems of green, Stokes and Gauss; metric spaces, completeness, Weiestrass approxi-mation theorem, compactness, Lebesgue measure, measurable functions; Lebesgue integral, Fatou’s lemma, dominated convergence theorem. Ordinary Differential equations: First order ordinary differential equations, existence and uniqueness theorems, systems of linear first order ordinary differential equations, linear ordinary differential equations of higher order with constant coefficients; linear second order ordinary differential equations with variable coefficients, method of Laplace transforms for solving ordinary differential equations, series solutions; Legendre and Bessel functions and their orthogonality, Sturm Liouville system, Green’s functions. Algebra: Normal subgroups and homomorphisms theorems, automorphisms. Group actions, sylow’s theorems and their applications groups of order less than or equal to 20, Finite p-groups. Euclidean domains, principal, Principal ideal domains and unique factorizations domains. Prime ideals and maximal ideals in commutative rings. Functional Analysis: Banach spaces, Hahn-Banach theorems, open mapping and closed graph theorems, principle uniform boundedness; Hilbert spaces, orthonormal sets, Riesz representation theorem, self-adjoint, unitary and normal linear operators on Hilbert Spaces. Numerical Analysis: Numerical solution of algebraic and transcendental equations; bisection, secant method, Newton-Raphson method, fixed point iteration, interpolation: existence and error of polynomial interpolation. Lagrange, Newton, Hermite (osculatory) interpolations; numerical differenti-ation and integration, Trapezoidal and Simpson rules; Gaussian quadrature; (Gauss-Legendre and Gauss- Chebyshev), method of undetermined parameters, least square and orthonormal polynomial approximation; numerical solution of systems If you miss an opportunity, do not cloud your eyes with tears; keep your vision clear so that you will not miss the next one DIPS Academy /11**ISI Kolkata**of linear equations; direct and itervative methods, (Jacobi Gauss- Seidel and SOR) with convergence; matrix eigenvalue problems; Jacobi and Given’s methods, numerical solution of ordinary differential equations; initial value problems. Taylor series method, Runge-Kutta methods, predictorcorrector methods; convergence and stability. Partial Differential Equations: Linear and quasilinear first order partial differential equations, method of characteristics; second order linear equations in two variables and their classification: Cauchy, Dirichlet and Neumann problems, Green’s function of Laplace, wave and diffusion equations in two variables Fourier series and transform methods of solutions of the above equations and applications to physical problems. Mechanics: Forces in three dimensions, Poinsot central axis, virtual work, Lagrange’s equations for holonomic systems, theory of small oscillations, Hamiltonian equations. Topology : Basic concepts of topology, product topology, connectedness, compactness, countability and separation axioms, Urysohn’s Lemma, Tietze extension theorem, metrization theorems, Tychonoff theorem on compactness of product spaces. Probability and Statistics : Probability space, conditional probability, Baye’s theorem, independence, Random variables, joint and conditional distributions, standard probability distributions and their properties, expectation, condition expectation, moments. Weak and strong law of large numbers, central limit theorem. Sampling distributions, UMVU estimators, sufficiency and consistency, maximum likelihood estimtors. Testing of hypothesis, Neymann-Pearson tests, monotone likelihood ratio, likelihood ratio tests, standard parametric tests based on normal, X2, t, F-distributions. Linear regression and test for linearity of regression, Interval estimation. Linear Programming: Linear programming problem and its formulation, convex sets their properties, graphical method, basic feasible solution, simplex method, big-M and two phase methods, infeasible and unbounded LPP’s alternate optima. Dual problem and duality theorems, dual simplex method and its application in post optimality analysis, interpretation of dual variables. Balanced and unbalanced transport-ation problems, unimodular property and u-v method for solving transportation problems. Hungarian method for solving assignment problems. Calculus of Variations and Integral Equations : Variational problems with fixed boundaries; sufficient conditions for extrremum, linear integral equations of Fredholm and Volterra type, their iterative solutions, Fredholm alternative.

**IISc**polynomials, diagonalizability, Jordan canonical form. Abstract Algebra : Groups: subgroups, Lagrange’s theorem, normal subgroup, quotient group, homomorphism, permutation groups, Cayley’s theorem, Sylow theorems, Rings, Ideals Fields. Ordinary Differential Equations : First order ODEs and their solutions, singular solutions, experience and uniqueness of initial value problems for first order ODE. Gewneral theory of homogeneous and homomor-geneous linear differential

equations. Variation of parameters. Types of singular points in the phase plane of an autonomous system of two equations. Partial Differential Equations: Elements of first order PDE. Second order linear PDE: Classification, wave Laplace and Heat equations. Basic properties and important solutions of classical initial and boundary value problems. Elements of Numerical Analysis: Interpolation : Lagrange and Newton’s forms, error in interpolation. Solution of nonlinear equations by iteration, various iterative methods including Newton. Raphson method, fixed point iteration. Convergence, integration: trapezoidal rule, Simpson’s rule, Gaussian rule, expressions for the error terms. Solution of ordinary differential equations: simple difference equations, series method, Euler’s method, Runge Kutta methods, predictor- corrector methods, error estimates.

**MCA Entrance Exam****Algebra:**Fundamental operations in Algebra, Expansions, Factorization, simultaneous linear and quadratic equations, indices, logarithms, arithmetic, geometric and harmonic progressions, binomial theorem, permutations and combinations, surds, determinants, matrices and application to solution of simultaneous linear equations, Set Theory, Group Theory. Coordinate Geometry: Rectangular Cartesian coordinates, equations of a line, midpoint, intersections etc., equations of a circle, distance formulae, pair of straight lines, parabola, ellipse and hyperbola, simple geometric transformations such as translation, rotation, scaling. Calculus: Limit of functions, continuous functions, differentiation of functions tangents and normals, simple examples of maxima and minima, Integration of function by parts, by substitution and by partial fraction, definite integrals, and applications of Definite Integrals to areas. Differential Equations: Differential equations of first order and their solutions, linear differential

equations with constant coefficients, homogenous

linear differential equations.

Vector: Position Vector,

additions and subtraction of

vectors, scalar and vector

products and their

applications to simple

geometrical problems and

mechanics.

**Trigonometry:**Simple identities, trigonometric equations, properties of triangles, solution of triangles, height and distance, inverse function, Inverse Trigonometric functions, General solutions of trigonometric equations, Complex numbers. Real Analysis: Sequence of real numbers, Convergent Sequences, Cauchy’s Sequences, Monotonic Sequences, Infinite series and their different tests of convergence, The only way to gain respect is, firstly to give it DIPS Academy /14

**JNU**Absolute convergence, Uniform convergence, properties of continuous functions, Rolle’s theorem, Mean value theorem, Taylor’s and Maclaurian’s series, Maxima and Minima, Indeterminate forms.

Statistics & Linear Programming: Frequency distribution and measure of dispersion, skewness and Kurtosis, Permutations and Combinations, Probability, Random variables and distribution function, Mathematical expectation and generating function, Binomial, Poisson normal distribution curve fitting and principle of least squares, Correlation and Regression, Sampling and large sample tests, Test of significance base on t, x2 and f distribution, Formulation of simple linear programming problems, basic concepts of graphical and simple methods.

Analytical Ability and Logical Reasoning

The questions in this section will cover logical reasoning, quantitative reasoning.

ComputerAwareness

**Computer Basics:**Organization of a Computer, Central Processing Unit (CPU), Structure of instructions in CPU, input/output devices, computer memory, memory organization, back- up devices.Data Representation: Representation of characters, integers and fractions, binary and hexadecimal representations, Binary Arithmetic: Addition, subtraction, division, multiplication, single arithmetic and two’s complement arithmetic, floating point representation of numbers, normalized floating point representation, Boolean algebra, truth tables, Venn diagrams.

Elements of Data Structures Computer Organization C Language

**Resource:- net-mathematics**