Scribd
Upload
152 views2 pages

Syllabus For The Subjective Test For Students Seeking Admission To M.Tech. (CS) and (CRS) Course

The document provides a syllabus for the subjective test for students seeking admission to M.Tech.(CS) and (CrS) courses. It outlines the topics that will be covered in the test for the Computer Science group and the Non-CS/Mathematics group. For Computer Science, topics include data structures, discrete mathematics, programming languages, algorithms, computer architecture, operating systems, formal languages and automata theory, databases, and computer networks. For Non-CS/Mathematics, topics cover analytical reasoning, algebra, coordinate geometry, calculus, discrete probability theory, and graph theory.

Uploaded by

SAYANTAN PAL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
152 views2 pages

Syllabus For The Subjective Test For Students Seeking Admission To M.Tech. (CS) and (CRS) Course

The document provides a syllabus for the subjective test for students seeking admission to M.Tech.(CS) and (CrS) courses. It outlines the topics that will be covered in the test for the Computer Science group and the Non-CS/Mathematics group. For Computer Science, topics include data structures, discrete mathematics, programming languages, algorithms, computer architecture, operating systems, formal languages and automata theory, databases, and computer networks. For Non-CS/Mathematics, topics cover analytical reasoning, algebra, coordinate geometry, calculus, discrete probability theory, and graph theory.

Uploaded by

SAYANTAN PAL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Syllabus for the subjective test for students seeking

admission to M.Tech.(CS) and (CrS) course.

CS Group (Computer Science)

Data structures - array, stack, queue, linked list, binary tree, heap, AVL tree, B-tree.

Discrete Mathematics - recurrence relations, generating functions, graph theory - paths


and cycles, connected components, trees, digraphs.

Programming languages - Fundamental concepts - abstract data types, procedure call


and parameter passing, dynamic memory allocation, at least one of C, C++, Java and
Python.

Design and analysis of algorithms - Asymptotic notation, searching, sorting, selection,


graph traversal, minimum spanning tree.

Switching Theory and Logic Design - Boolean algebra, minimization of Boolean


functions, combinational and sequential circuits - synthesis and design.

Computer organization and architecture - Number representation, computer


arithmetic, memory organization, I/O organization, microprogramming, pipelining,
instruction level parallelism.

Operating systems - Memory management, processor management, critical section


problem, deadlocks, device management, file systems.

Formal languages and automata theory - Finite automata and regular expressions,
pushdown automata, context-free grammars, Turing machines, elements of undecidability.

Database management systems - Relational model, relational algebra, relational


calculus, functional dependency, normalization (2NF, 3NF and BCNF).

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 IPv4.

Non-CS Group (Mathematics)

Analytical Reasoning

Algebra - Arithmetic, geometric and harmonic progression. Continued fractions.


Elementary combinatorics: Permutations and combinations, 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, Primality. Algebra of matrices. Determinant, rank and
inverse of a matrix. Solutions of linear equations. Eigenvalues and eigenvectors of
matrices. Groups and their properties. Subgroups, Normal subgroups, abelian groups.
Boolean algebra.

Coordinate geometry - Straight lines, circles, parabolas, ellipses and hyperbolas.

Calculus - Sequences and series: Power series, Taylor and Maclaurin series. Limits and
continuity of functions of one variable. Differentiation and integration of functions of one
variable with applications. Definite integrals. Maxima and minima. Functions of several
variables: limits, continuity, differentiability. Double integrals and their applications.
Ordinary linear differential equations. Vector calculus.

Elementary discrete probability theory - Combinatorial probability, Conditional


probability, Bayes theorem. Binomial and Poisson distributions.

Graph Theory - Graphs, different representations, subgraphs, connectivity, Trees and


their properties.

You might also like