GATE Syllabus for CSE | Videos | Computer Science and Information Technology

GATE  Syllabus for CSE –GATE Syllabus

GATE Syllabus for CSE – Computer Science and Information Technology.

Before preparation for GATE, the applicants should have complete information and knowledge about GATE examination syllabus. So here are some GATE 2017 Syllabus for CSE  paper. The GATE exam syllabus of Computer Science and Information Technology has given by IITs and IISC.

GATE CSE paper can have twenty-five questions each holding one mark (e.g., sub-total 25 marks) and thirty questions each containing two scores (e.g., sub-total 60 marks) and fifteen marks will be based on General Aptitude questions. The test paper can have multiple choice and numerical answer way of questions. Please note the Gate exam will have General Aptitude test, and it will define differently in GATE syllabus CSE.

GATE Syllabus for CSE

NOTE: For study material of GATE just

GATE Syllabus for CSE are given below: 

Engineering Mathematics: Discrete 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, a system of linear equations, eigenvalues and eigenvectors, LU decomposition.

Calculus: Limits, continuity, and differentiability. Maxima and minima. Mean value theorem. Integration

Probability: Random variables. Uniforms, normal, exponential, Poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

GATE Syllabus for CSE

Computer Science and Information Technology

Digital Logic: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory, and secondary storage; I/O interface (Interrupt and DMA mode).

Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heap, graph.

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

Theory of Computation
Regular expressions and finite automata. Context-free grammars and pushdown automata. Periodic and context-free languages, pumping lemma. Turning machines and undecidability.

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

Operating System
Processes, threads, inter-process communication, concurrency, and synchronization. Deadlock. CPE scheduling. Memory management and virtual memory. File systems.

ER- model. Relational model; relational algebra, tuple calculus, SQL, Integrity constraints, standard forms. File organization, indexing (e.g., B and B + TREES). Transactions and concurrency control.

Computer Networks
The 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 protocol (DNS, SMTP, POP, FTP, HTTP). Primary of the wi-fi. Network security: authentication, basic of the public key and private key cryptography, digital signatures and certificates, firewalls.

NOTE: For study material of GATE just CLICK HERE.


Leave a Reply

Your email address will not be published. Required fields are marked *