Scribd
Upload
6 views1 page

Gate 2025

The document outlines key topics in engineering mathematics, including discrete mathematics, linear algebra, calculus, and probability and statistics. It also covers programming concepts in C, data structures, algorithms, theory of computation, and compiler design. Each section highlights essential principles and techniques relevant to these fields.

Uploaded by

Sk Shane alam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
6 views1 page

Gate 2025

The document outlines key topics in engineering mathematics, including discrete mathematics, linear algebra, calculus, and probability and statistics. It also covers programming concepts in C, data structures, algorithms, theory of computation, and compiler design. Each section highlights essential principles and techniques relevant to these fields.

Uploaded by

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

Section 1: Engineering Mathematics

Discrete Mathematics: Propositional and first order logic. Sets, relations,


functions, partial orders and
lattices. Monoids, Groups. Graphs: connectivity, matching, colouring.
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 4: Programming and Data Structures


Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary
search trees, binary heaps,
graphs.
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.
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down
automata. Regular and
context-free languages, pumping lemma. Turing machines and undecidability.
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 sub
expression elimination

You might also like