GATE

  About GATE

The Indian Institute of Science (IISc) and seven Indian Institutes of Technology (IITs at Bombay, Delhi, Guwahati, Kanpur, Kharagpur, Madras and Roorkee) jointly administer the conduct of GATE Exam. The operations related to GATE in 8 zones all over India are managed by a Zonal GATE Office at IISc. or IITs. The Organizing Institute (OI) is responsible for the end-to-end process and coordination amongst the administering Institutes. The Organizing Institute for GATE 2016 was IISc Bangalore, for GATE 2017 was IIT Roorkee & for GATE 2018 is IIT Guwahati.

Highlights of GATE are:

1.      Examinations for all papers would be conducted by an ONLINE Computer Based Test (CBT). The online exam will have Multiple Choice Questions (MCQ) and Numerical Questions where answers are to be keyed in by the candidates using virtual keypad

2.      GATE 2018 score is valid for 3 years from the date of Result Announcement

Eligibility Criteria for GATE (No Age Limit)

GATE Score Card

After the declaration of the results, candidates can download their GATE Score Card for the paper (for which he/she has taken the examination). The score cards will be issued for only those candidates whose marks are equal to or above the qualifying marks of SC/ST/PwD candidates in that paper.

   Benefits

1.      A good GATE score is helpful for getting admission in to IITs, IISC, IIITs, NITs and many other renowned institutions

2.      Many PSUs like HAL, IOCL, PGCIL, BARC etc consider GATE score

3.      GATE qualification is also a minimum requirement to apply for various fellowships awarded by many Government organizations like DRDO, BARC, ISRO etc.

4.      GATE qualified candidates are also eligible for the award of Junior Research Fellowship in CSIR Laboratories and CSIR sponsored projects.

5.      Focused GATE Preparation also helps in other prestigious PSU recruitment examintions like CIL, AP Genco, AP Transco, NTPC, BSNL etc

6.      MS program at Singapore, New Zealand & Germany

7.      Fellowship at IIMA & IIMB in management course with a monthly stipend of Rs. 22,000

8.      Helps in better preparation for B.Tech semesters

9.      Brushing up technical skills for Campus Recruitment

Benefits of M. Tech:

1.      M. Tech from a good institute helps you to stand out from the rest

2.      M. Tech opens up a lot of career paths in the fields of Teaching, Research and other Core sectors, apart from the existing alternatives

3.      Better Placements in top PSUs, MNCs and Indian companies both in India and Abroad.

4.      A Minimum stipend of 12,400/- per month is given to regular students joining colleges under MHRD

5.      Opportinity to work in research positions like JRFs, in ISRO/DRDO/BARC/IITs etc.

Syllabus

Section1: 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, 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.

Section 2: Digital Logic

Boolean algebra. Combinational and sequential circuits. Minimization. Number

representations and computer arithmetic (fixed and floating point).

Section 3: 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).

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 search, minimum spanning trees, shortest paths.

Section 6: 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.

Section 7: Compiler Design

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

code generation.

Section 8: Operating System

Processes, threads, inter‐process communication, concurrency and synchronization.

Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

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.

Section 10: Computer Networks

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.