### $$\textbf{Indian Statistical Institute}$$

$\textbf{Frequency:}$ Once in a year.

$\textbf{Admission Details:}$ https://www.isical.ac.in/~admission/#

$$\textbf{1. M. TECH(CS)} \\ \text{1.1. MCQ -Type for ISI Admission Test (MMA)}$$

$\text{Previous Year Papers with Solution:}$ https://gatecse.in/isi-mmapca-previous-year-papers-with-solution/

$$\textbf{Syllabus: MCQ-Type}$$

• $\text{Analytical Reasoning.}$
• $\text{Algebra:}$  Arithmetic, Geometric and Harmonic Progression. Continued fractions. Permutations and Combinations. Binomial theorem. Theory of equations. Inequalities involving arithmetic mean and geometric mean, Cauchy-Schwarz inequality. Complex numbers and De Moivre's theorem. Elementary Set Theory. Functions and relations. Elementary Number Theory: divisibility, congruence, primality. Matrices: determinant, rank and inverse, properties of symmetric and idempotent matrices, Eigenvalues and eigenvectors, quadratic forms. System of linear equations. Basic properties of a group. Principle of mathematical induction. Theory of polynomials, remainder theorem, factor theorem.
• $\text{Coordinate geometry:}$ Straight line, Circle, Parabola, Ellipse and Hyperbola.
• $\text{Calculus:}$ Sequences and its properties. Series: Power series, Taylor series and Maclaurin series, convergence. Limits and continuity of functions of one variable. Differentiation and integration of functions of one variable with applications. Rolle's theorem and Mean value theorem. Definite integrals. Maxima and minima. Functions of several variables: limits, continuity, differentiability. Double integrals and their applications. Ordinary linear differential equations.
• $\text{Elementary discrete probability theory:}$ Combinatorial probability, Conditional probability, Bayes theorem and applications.
• $\text{Trigonometric functions and identities.}$

$$\text{1.2. Descriptive Type Test for ISI Admission Test (PCB)}$$

$\text{Previous Year Papers with Solution:}$ https://gatecse.in/isi-pcb-previous-year-papers-with-solution/

$$\textbf{Syllabus: Descriptive-Type }$$

$\textbf{Syllabus for the descriptive type test in computer science at the undergraduate level } \\ \textbf{for students seeking admission to the CS stream of the M.Tech.(CS) and (CrS) course }$

• $\text{Analytical Reasoning}$
• $\text{Data structures -}$  array, stack, queue, linked list, binary tree, heap, AVL tree, B-tree.
• $\text{Discrete Mathematics -}$ recurrence relations, generating functions, graph theory - paths and cycles, connected components, trees, digraphs.
• $\text{Design and analysis of algorithms -}$ Asymptotic notation, searching, sorting, selection, graph traversal, minimum spanning tree.
• $\text{Switching Theory and Logic Design -}$ Boolean algebra, minimization of Boolean functions, combinational and sequential circuits - synthesis and design.
• $\text{Computer organization and architecture -}$ Number representation, computer arithmetic, memory organization, 1/O organization, microprogramming, pipelining, instruction level parallelism.
• $\text{Operating systems -}$ Memory management, processor management, critical section problem, deadlocks, device management, file systems.
• $\text{Formal languages and automata theory -}$  Finite automata and regular expressions, pushdown automata, context-free grammars, Turing machines, elements of undecidability.
• $\text{Database management systems -}$ Relational model, relational algebra, relational calculus, functional dependency, normalization $\textsf{(2NF, 3NF and BCNF).}$
• $\text{Computer networks-}$ OSI, LAN technology - Bus/tree, Ring, Star; MAC protocols; WAN technology - circuit switching, packet switching; data communications - data encoding, routing, flow control, error detection/correction, Inter-networking, TCP/IP networking including $\textsf{IPv4}.$

$\textbf{Syllabus for the descriptive type test in computer science at the undergraduate level } \\ \textbf{for students seeking admission to the non-CS stream of the M.Tech.(CS) and (CrS) course }$

• $\text{Analytical Reasoning}$
• $\text{Algebra -}$ Arithmetic, geometric and harmonic progressions. Continued fractions. Elementary combinatorics: Permutations and combinations, and Binomial theorem. Theory of equations. Polynomials of a single variable. Inequalities. Complex numbers and De Moivre's theorem. Elementary set theory. Functions and relations. Elementary number theory: Divisibility, congruences, and primality. Algebra of matrices. Determinant, rank and inverse of a matrix. System of linear equations. Eigenvalues and eigenvectors of matrices. Properties of symmetric and idempotent matrices. Quadratic forms. Groups and their properties. Subgroups, normal subgroups, and abelian groups. Boolean algebra.
• $\text{Coordinate geometry -}$ Straight lines, circles, parabolas, ellipses and hyperbolas.
• $\text{Calculus -}$ Sequences and series. Limits and continuity of functions of one variable. Differentiation and integration of functions of one variable with applications. Maxima and minima. Power series, Taylor and Maclaurin series. Definite integrals. Functions of several variables: limits, continuity, differentiability. Double integrals and their applications. Ordinary linear differential equations. Vector calculus.
• $\text{Elementary discrete probability theory -}$ Combinatorial probability, Conditional probability, and Bayes theorem. Discrete random variables. Expectation and variance of discrete random variables.
• $\text{Graph Theory -}$ Graphs, Adjacency matrix and adjacency list representations of graphs, subgraphs, connectivity, Trees and their properties.

$$\textbf{2. JRF in Computer Science}$$

Previous Year Papers with Solution: https://gatecse.in/isi-jrf-previous-year-papers-with-solution/

3
Like
0
Love
0
Haha
0
Wow
0
Angry
0