M.Sc. (Computer Science)
M.Sc. (Computer Science) would be a 2- year (four semesters) academic program.
After twelve years’ schooling, a 3/4 year Bachelor’s degree in Computer Science/Engineering or relevant area from a recognized University/Institution, with at least 55% marks in aggregate or an equivalent grade, with Mathematics as a subject of study at the bachelor’s level, or at 10+2(12th Class) level.
Format of the Entrance Test question paper and course:
The duration of the test will be three hours. The test will consist of 100 multiple choice questions of one mark each. Each question will have four options and out of these four options, one option will be correct.
There will be no subjective question. There will be no negative marking.
The test will be divided into the following three parts:
PART A: Analytical and Logical Abilities, English Language Proficiency
Data Sufficiency, Problem Solving, Integrated Reasoning, English Grammar, Sentence Completion, Verbal Analogies, Word Groups
PART B: Mathematical Science
Set Theory and Algebra: Sets, Relations, Functions, Groups, Partial Orders, Lattice, Boolean Algebra.
Matrices and Determinants: Determinants, Matrices, systems of Linear Equations,
Combinatorics: Permutations, Combinations, Counting, Summation.
Probability and Statistics: Mean, median, mode and standard deviation; Conditional probability, independent events, total probability, Baye's theorem
Calculus: Limit, Continuity and Differentiability, Mean value Theorems, Theorems of Integral Calculus, Evaluation of Definite and Improper Integrals, partial Derivatives, Total Derivatives, Maxima and Minima.
Ordinary Differential Equations: First Order First Degree Equations, Variable Separable Method, Homogeneous Equations, Exact Equations, Integrating Factors, Linear Equations.
Vector Analysis: Addition, Subtraction, Dot Product and Cross Products of Vectors.
PART C: Undergraduate level Computer Science
Discrete Mathematics: Sets, Relations, Functions, Boolean Algebra, Propositional logic, First order Predicate Logic,
Programming in C: Elements of C, Identifiers, Data Types, Control Structures, Iteration, Structured Data Types: Array, Structure, Union, Strings, Pointers, Functions, Parameter Passing to Functions, Recursion.
Data Structures: Arrays, Linked Lists, Queues, Stacks, Trees and Graphs
Algorithms: Elementary Space and Time Complexity Analysis, Sorting: Bubble Sort, Insertion Sort, Selection Sort, Searching: Linear and Binary Search.
Digital Logic Design and Computer Architecture: Number System, Data Representation, and Computer Arithmetic, Logic Gates, Combinational and Sequential Circuits, Computer Organization, Instruction Formats and Addressing, Memory Organization and I/O Interfaces.
Candidates can expect
i. Twenty (20) questions from Part A
ii.Thirty (30) questions from Part B; and
iii.Fifty (50) questions from Part C
See the Entrance Test for the year 2012