CS - Syllabus Pages
CS - Syllabus Pages
CS - Syllabus Pages
• Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders
and lattices. Monoids, Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting,
recurrence relations, generating functions.
• Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors,
LU decomposition.
• Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem.
Integration.
• Probability and Statistics: Random variables. Uniform, normal, exponential, Poisson and binomial
distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes
theorem
SECTION 5 : ALGORITHMS
Searching, sorting, hashing. Asymptotic worst-case time and space complexity. Algorithm design
techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning
trees, shortest paths
1
SECTION 7: COMPILER DESIGN
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression
elimination.
SECTION 9 : DATABASES
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File
organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.