sir please tell me the topics which would be come in m.c.a lateral entry exam of uptu 2020 in detail ?
Dear Aspirant,
UPTU is conducted by Dr Abdul Kalam Technical University, Uttar Pradesh. It is a state-level entrance exam, which takes place once a year for admission in various UG and PG courses like Technology, Architecture, Design, Pharmacy, Business Administration and Computer Applications. The applications will be available soon and the exam is supposed to be held on 10th of May 2020.
The mode of the exam is online and has objective-type or MCQ type questions which will be asked to candidates chosen language, be it English or Hindi. Four marks will be allotted to each correct answer and there will be no negative marking for any wrong answer. The MCA (Lateral Entry) paper will have 100 questions and the maximum marks for the paper will be 400 and the duration of the paper will be 200 marks.
The syllabus is as follows:
(1) MATHEMATICAL STRUCTURES
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, Eigenvalues, eigenvectors and system of linear equations.
Set Theory: Introduction, sets and cardinals, a combination of sets, multisets 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.
(II) COMPUTING CONCEPTS
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.
(III) REASONING ABILITY
Questions in this part will be aimed to assess the reasoning and logical ability of the candidates.
Hope this helps. All the best!