i am eee iwant to do cse in mtech what is the sylabus for it

Hello,

In order to take admission in MTech in CSE, you have to appear for GATE in CSE/IT. The syllabus of CSE in GATE are:

Engineering mathematics :

Propositional and first order logic. Sets, relations, functions, partial orders and lattices. 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: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

Digital Logic Boolean algebra :

Combinational and sequential circuits. Minimization. Number representations and computer arithmetic.

Computer Organization and Architecture

Machine instructions and addressing modes. ALU, datapath and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface(interrupt and DMA mode).

Programming and Data Structure

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Algorithms

Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divideandconquer. Graph search, minimum spanning trees, shortest paths.

Theory of Computation

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

Operating System

Processes, threads, interprocess communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

Database

ERmodel. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

Computer Network

Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

Check the link below to know more about GATE and the exam pattern

https://www.google.com/amp/s/engineering.careers360.com/articles/gate-exam-pattern

Good luck!