Graduate Aptitude Test in Engineering (GATE) is an all India examination that primarily tests the comprehensive understanding of various undergraduate subjects in Engineering and Technology. GATE is conducted jointly by the Indian Institute of Science and seven IITs (IIT Bombay, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Roorkee) on behalf of the National Coordination Board – GATE, Department of Higher Education, Ministry of Human Resource Development (MHRD), Government of India.

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. The operations related to GATE in each of the 8 zones are managed by a zonal GATE Office at the IITs or IISc. The Organizing Institute (OI) is responsible for the end-to-end process and coordination amongst the administering Institutes. The GATE score of a candidate reflects the relative performance level of a candidate. The score is used for admissions to various post-graduate programmes (eg. M.E., M.Tech, direct Ph.D.) in Indian higher education institutes with financial assistance provided by MHRD and other Government agencies. The score may also be used by Public sector units for employment screening purposes.

Over 500 institutes including the IISc, IITs and NITs require GATE score for admission to their ME, M.Tech and MS Programs.A host of PSUs use GATE Scores for jobs in these organizations. GATE is held in multiple sessions from end of January to Mid of Feb. GATE score is valid for three years. The paper has 65 questions carrying 100 marks, out of which 10 questions carrying a total of 15 marks are in General Aptitude (GA). GATE qualified students are eligible for stipend of Rs. 12400/- per month.

The GATE examination consists of a single paper of 3 hours duration which contains 65 questions carrying a maximum of 100 marks.

carrying 1 or 2 marks each in all papers and sections. These questions are objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct answer(s).

of 1 or 2 marks each in all papers and sections. For these questions the answer is a real number, to be entered by the candidate using the virtual keypad. No choices will be shown for this type of questions.

The examination for all the papers will be carried out in an ONLINE Computer Based Test (CBT) mode where the candidates will be shown the questions in a random sequence on a computer screen. The candidates are required to either select the answer (for MCQ type) or enter the answer for numerical answer type question using a mouse on a virtual keyboard (keyboard of the computer will be disabled). Candidates will be provided with blank paper sheets for rough work and these have to be returned back after the examination. At the end of the 3-hour window, the computer will automatically close the screen from further actions.

Propositional Logic; First Order Logic.

Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.

Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

**Digital Logic** : Logic functions, Minimization, Design and synthesis of combinational and
sequential circuits; Number representation and computer arithmetic (fixed and floating
point).

**Computer Organization and Architecture:**Machine instructions and addressing modes,
ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA
mode), Instruction pipelining, Cache and main memory, Secondary storage.

**Programming and Data Structures:**Programming in C; Functions, Recursion, Parameter
passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees,
Binary search trees, Binary heaps.

**Algorithms**: Analysis, Asymptotic notation, Notions of space and time complexity, Worst
and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-
conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths;
Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and
space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-
complete.

**Theory of Computation:**MATHEMATICAL LOGIC
: Regular languages and finite automata, Context free languages
and Push-down automata, Recursively enumerable sets and Turing machines,
Undecidability.

**Compiler Design:**Lexical analysis, Parsing, Syntax directed translation, Runtime
environments, Intermediate and target code generation, Basics of code optimization.

**Operating System:**Processes, Threads, Inter-process communication, Concurrency,
Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File
systems, I/O systems, Protection and security.

**Databases:**ER-model, Relational model (relational algebra, tuple calculus), Database
design (integrity constraints, normal forms), Query languages (SQL), File structures
(sequential files, indexing, B and B+ trees), Transactions and concurrency control.

**Information Systems and Software Engineering:**information gathering, requirement and
feasibility analysis, data flow diagrams, process specifications, input/output design, process life
cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

**Computer Networks: **ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error
control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4),
Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches,
gateways, and routers. Network security – basic concepts of public key and private key
cryptography, digital signature, firewalls.

**Web technologies: **Web technologies:

Bachelor's degree holders in Engineering/Technology/ Architecture (4 years after 10+2) and those who are in the final year of such programmes.

Master's degree holders in any branch of Science/Mathematics/ Statistics/Computer Applications or equivalent and those who are in the final year of such programmes.

Candidates in the second or higher year of the Four-year Integrated Master's degree programme (Post-B.Sc.) in Engineering/Technology.

Candidates in the fourth or higher year of Five-year Integrated Master's degree programme or Dual Degree programme in Engineering/Technology.

Candidates with qualifications obtained through examinations conducted by professional societies recognized by UPSC/AICTE (e.g. AMIE by Institute of Engineers (India); AMICE by Institute of Civil Engineers (India)) as equivalent to B.E./B.Tech. Those who have completed section A or equivalent of such professional courses are also eligible.

Pre-final year students are not eligible to write GATE 2015.