# THAPAR UNIVERSITY – 2016

Admission for Master of Computer Application (M.C.A.)

 General SC/ST PH Total 64 23 3 90 (+ 14 FN/NRI seats. Refer section 10 for eligibility & other conditions)
(B) Second year through lateral entry
 General SC/ST PH Total 12 5 1 18
SYLLABUS MCA (3 year program) Duration of Test : 3 Hrs No. of Questions : 150 There will be objective type questions. 1/4th marks shall be deducted for wrong answer Section-I: Mathematics (60 Questions) 1. Geometry: Two-Dimensional; straight lines, circles and conic sections, Three- Dimensional; straightlines andspheres. 2. Algebra: Set theory, Relations, Mappings and its applications, Permutations and Combinations. 3. Calculus: Limits, Continuity and Differentiability, Rolle's and Mean value theorems, Differentiation, Partial Differentiation, Maxima and Minima of functions of one and two variable. Successive differentiation. Integration by using substitution, partial fraction and by parts, Definite integral and its properties, Applications of definite integral to evaluate length and area ofsimple planecurves. 4. Vector Analysis: Scalar and vector products of two,threeand four vectors and their applications. 5. Statistics, Probability and Linear programming: Measures of Central tendency, Dispersion, Skewness and Kurtosis. Correlation and Regression. Basic concepts o f probability, ConditIonal probability, Baye's theorem, Discrete and continuous distributions (Binomial, Poisson, and Normal distributions), Fundamentals of linear programming problems, Graphical solution, Simplex method andits variants. 6. Matrices: Types of matrices rank of a matrix, solution of system of linear equations, Cayley Hamilton theorem, Inverse of a matrix, Determinant and its properties. 7. Numerical Analysis: Solution of non-linear equations using iterative methods, Interpolation (Newton's, Lagrange's and Forward formulae), Numerical Integration (Trapezoidal and Simpson Rule). Section-II: Computer Awareness (50 Questions) Computer Basics : Organization of a computer, Central Processing Unit (CPU), input/output devices, computer memory, memory organization, back-up devices, Categories of Computers. Data Representation : Representation of characters, integers, and fractions, binary and hexadecimal representations, Binary Arithmetic: Addition, subtraction, division, multiplication, floating point representation of numbers, normalized floating point representation, Boolean algebra: truth tables, Venn diagrams. Basics of C Programming and Operating Systems : Computer programming in C : data types, loop and control statements, functions. Fundamentals of operating systems: multiprogramming, multitasking, Multiprocessing and time sharing systems. Networking and Internet : Categories of Computer Network, Network topologies, Network media, Concepts of LAN, MAN and WAN, Search Engines, Basic internet applications. Section-III: Analytical Ability, Communication Skills and General Knowledge: (40 Questions) The questions in this section will cover logical reasoning, quantitative reasoning, visual-spatial reasoning and Communication skills. T his section shall also contain questions to test the general knowledge about business, finance, industry, transportation, scientic inventions, information technology , governance , healthcare , cultural dimensions etc. II MCA (2 year program) Duration of Test: 3 Hrs No. of Questions : 150 Question paper will have multiple choice questions. There will be a negative marking of 25% for each wrong answer. Section-I: Mathematics (40 questions)
1. Geometry: Two dimensional- straight lines, circles and conic sections; Three dimensional-straightlines and spheres.
2. Mathematical Foundation for Computer Science: Set theory, Permutation and combinations; Relations, Properties and representation of relations, Transitive closure, Partial ordering relation, Special types of lattices and finite Boolean algebra; Functions and their applications, Recurrence relations, Algebraic structures (semi-group and groups), Graphs and their representation, Connected graphs and spanning tree, Proposition and logical connectives, Conditional and biconditional statements, Rules of inference using statement calculus, Quantifiers and inference theory using predicate calculus
3. Vector Analysis: Scalar and vector products of two, three and four vectors, and their applications.
4. Statistics, Probability and Linear Programming: Measures of central tendency, Dispersion, Skewness and kurtosis, Correlation and regression, Basic concepts of probability, Conditional probability, Baye’s theorem, Discrete and continuous distributions (Binomial, Poisson, and Normal distributions), Fundamentals of linear programming problems, Graphical solution, Simplex method and its variants.
5. Matrices: Types of matrices Rank of a matrix, Solution of system of linear equations, Cayley Hamilton theorem, Inverse of a matrix, Determinant and its properties.
6. Numerical Analysis: Solution of non-linear equations using iterative methods, Interpolation (Newton, Lagrange and Forward formulae), Numerical Integration (TrapezoidalandSimpson Rule).
Section-II: Computer Science (75 questions)
1. C Programming: Fundamentals, Identifiers and keywords, Data types, Declarations, Standard and formatted input-output statements, Operators and Precedence, Control statements, Storage classes, Pre-processors, Functions, Recursion, Arrays and strings, Pointers, Structure and union, File handling.
2. Operating Systems: Fundamentals, Process management, CPU scheduling algorithms, Memory management- paging, segmentation, demand paging; Deadlocks- prevention, avoidance, detection and recovery; Process synchronization, File management, Disk scheduling, I/O devices.
3. Computer Organization and Architecture: Number system, Karnaugh map, Combinational circuits, Sequential circuits, Instruction cycle, Addressing modes, Parallel processing, Instruction pipeline, Memory hierarchy, Cache memory, Virtual memory- paging and segmentation.
4. Data Structures: Algorithm complexity, Big O notation, Arrays, Linked Lists, Stacks, Recursion, Queues, Binary search trees, Threaded tree, AVL, B-trees, B+ trees, Graphs- BFS, DFS, applications of graphs; Searching and sorting algorithms, Hashing.
5. Object Oriented Programming: Basic concepts of object-oriented programming, Classes and objects in C++, Static member functions, Inline and friend functions, Constructors and destructors, Function overloading, Operator overloading, Type conversions, Inheritance, Virtual functions and polymorphism, Files and streams, Exception handling.
6. System Analysis and Design: Categories of information systems, Structured analysis method, System prototype method, SDLC, Feasibility study, Requirements gathering, Data flow diagrams, Data dictionaries, Decision tables, Decision trees, Design of input, Design of output, Program structure chart, Coupling, Cohesion, Span of Control, Module size, and Shared modules.
7. Networking and Internet: Categories of computer network, Network topologies, Network media, Concepts of LAN, MAN and WAN, OSI and TCP/IP reference model, Classless and classful addressing, IPv4, Search Engines, Basic Internet and intranet applications.
Section-III: Analytical Ability, Communication Skills and General Knowledge: (35 questions) Logical reasoning, quantitative reasoning, visual-spatial reasoning, communication skills, general knowledge about scientific inventions and information technology. IMPORTANT DATES AND INFORMATION: The online application form is available on www.thapar.edu. Fill the complete details and then take the print out of the form. Please keep one copy of the printout of completely filled form as it will be required at the time of document checking during counselling.
 Amount to be deposited with print out of application forms taken from website. Rs 1500
How to Apply:
• Candidates seeking admission in Thapar University shall fill up the online application form available on our website www.thapar.edu. The candidates are required to fill complete details in the online form. Follow the process mentioned asunder for filling up online application form :