The Graduate Aptitude Test in Engineering (GATE) is an All-India examination administered and conducted in eight zones across the country by the GATE Committee comprising of Faculty members from IISc, Bangalore and other seven IIT's on behalf of the National Coordinating Board, Department of Education, Ministry of Human Resources Development.
GATE exam will be held on 4, 5, 11 and 12 February 2017 and the pattern of the exam will consists of 65 questions (objective type and numerical answer type (NAT)) in that 65 questions 10 questions will be asked from the general aptitude section and carry 15 marks. The time duration of the exam will be 3 hours. For 1-mark multiple-choice questions, 1/3 marks will be deducted for a wrong answer. Likewise, for 2-marks multiple-choice questions, 2/3 marks will be deducted for a wrong answer. There is no negative marking for numerical answer type questions.
|Name of the sections||Number of Questions||Marks Per Question||Total Marks|
|Total||65 Questions||100 Marks|
|For women/SC/ST/PWD||Rs 750/-|
|Other Candidates||Rs 1500/-|
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, 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.
Computer Science and Information Technology
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
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 in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
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.
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
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.
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.