UPTU SEE MBA Aptitude Syllabus 2018, UPTU SEE MCA Aptitude Syllabus 2018, UPTU SEE Engineering Syllabus 2018, UPTU Syllabus for MCA 2018, UPSEE Admission Test Syllabus 2018, UPSEE Syllabus Pattern 2018, Syllabus for UPTU Aptitude Test Syllabus 2018, Download UPTU SEE Exam Syllabus 2018, UPSEE Examination Syllabus 2018, UPTU SEE Syllabus Material 2018, UPTU SEE Question Paper Download 2018, UPTU SEE PG Syllabus 2018, UPSEE Entrance Exam Syllabus
|Home Page||Entrance Exam||Eligibility||Admission to Lateral Entry||Domicile Requirement||Exam Pattern|
|Application Form||Exam Centres||Syllabus||Results||Counselling||Important Dates|
UPSEE PG 2018 MBA / MCA Aptitude Test Syllabus
Paper – 9 ( Aptitude Test for MBA )
The test is aimed at evaluating the verbal ability, quantitative aptitude, logical & abstract reasoning and knowledge of current affairs. The following is a brief description of contents of the test paper.
Section A ( English Language ) : Grammar, vocabulary, uncommon words, sentence completion, synonyms, antonyms, relationship between words & phrases and comprehension of passages.
Section B ( Numerical Aptitude ) : Numerical calculation, arithmetic, simple algebra, geometry and trigonometry, Interpretation of graphs, charts and tables.
Section C ( Thinking and Decision Making ) : Creative thinking, unfamiliar relationships, verbal reasoning, finding patternstrends and Assessment of figures & diagrams.
Section D ( General Awareness ) : Knowledge of current affairs and other issues related to trade, industry, economy, sports, culture and science.
Paper – 10 ( Aptitude Test for MCA )
Modern Algebra : Idempotent law, identities, complementary laws, Demorgan’s theorem, mapping, inverse relation, equivalence relation, Piano’s Axiom, definition of rational numbers and integers through equivalence relation.
Algebra : Surds, solution of simultaneous and quadratic equations, arithmetic, geometric and harmonic progression, Binomial theorem for any index, logarithms, exponential and logarithmic series, determinants.
Probability : Definition, dependent and independent events, numerical problems on addition and multiplication of probability, theorems of probability.
Trigonometry : Simple identities, trigonometric equations, properties of triangles, use of mathematical tables, solution of triangles, height and distance, inverse functions, DeMoiver’s theorem.
Co-Ordinate Geometry : Co-ordinate geometry of the straight lines, pair of straight lines, circle, parabola, ellipse and hyperbola and their properties.
Calculus : Differentiation of function of functions, tangents and normal, simple examples of maxima of minima, limits of function, integration of function (by parts, by substitution and by partial fraction), definite integral (application to volumes and surfaces of frustums of sphere, cone and cylinder).
Vectors : Position vector, addition and subtraction of vectors, scalar and vector products and their applications.
Dynamics : Velocity, composition of velocity, relative velocity, acceleration, composition of acceleration, motion under gravity, projectiles, laws of motions, principles of conservation of momentum and energy, direct impact of smooth bodies, pulleys.
Statics : Composition of co-planar, concurrent and parallel forces, moments and couples, resultant of set of coplanar forces and conditions of equilibrium, determination of Centroides in simple case, problems involving friction.
(ii) Statistics : Theory of probability, Mean, Median, Mode, Dispersion and Standard Deviation.
(iii) Logical Ability :Questions to test analytical and reasoning capability of candidates.
Paper – 11 ( Aptitude Test for 2nd Year MCA ( Lateral Entry ) )
Modern Algebra and Matrices : Algebraic structures and general properties, semigroups, groups. Rings and Fields: definitions, elementary properties and standard results. Matrices, operation on matrices, Inverse and rank of a matrix, Eigen values, eigenvectors and system
of linear equations.
Set Theory : Introduction, sets and cardinals, combination of sets, multi sets and set identities. Relations – definition, operations on relations, composite relations, properties of relations, partial order relations. Functions – definition, classification of functions, operations
on functions, recursively defined functions.
Number Theory and Methods of Proof : Natural numbers, factorization and prime numbers, floor and ceiling functions. Methods of proof – Introduction, direct and indirect methods of proof, mathematical Induction.
Combinatorics and Probability : Introduction, counting techniques, Pigeonhole principle. Probability –definition, sample space, algebra of events, axioms of probability, prior and posterior probability, Baye’s theorem.
Principles of Computer Science : Computer organization – evaluation of computers, computer arithmetic, control design, processor design, input output organization, memory organization. Data Structures – Arrays, lists, stacks, queues. Trees and graphs – definition,
properties and applications. Analysis of algorithms.
Proposition logic and Boolean Algebra : Propositions, truth tables, tautology, contradiction, algebra of propositions. Binary systems, axioms and theorems of Boolean algebra, Boolean functions and digital circuits.
Numerical Techniques : Floating point Arithmetic, solution of the system of linear equations, roots of polynomials, interpolation and curve fitting.
Theory of Computation : Finite-state machines, regular and non-regular languages, Turing machines and applications.
Questions in this part will be aimed to assess the reasoning and logical ability of the candidates.