GATE
GATE
GATE
What is GATE?
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 faculty from Indian Institute of
Science, Bangalore and seven Indian
Institutes of Technology on behalf of the
National Coordinating Board - GATE,
Department of Education, Ministry of Human
Resources Development (MHRD), Government
of India.
Objective
To identify meritorious and motivated
candidates for admission to Post Graduate
Programmes in Engineering, Technology,
Architecture and Pharmacy at the National
level. To serve as benchmark for
normalization of the Undergraduate
Engineering Education in the country.
Why should we take
GATE?
M.Tech degree leads to specialization and furthering of
interest in a certain area which may lead to Ph.D
GATE scores are valid for 1 year. One can reappear for the
GATE exam if one is not satisfied with the earlier score. The
new score (if better than the old one) will be used for
admission.
Students have to apply to individual institutes and get
application forms after the GATE results are out. M.Tech. course
admission details are advertised in leading newspapers from
April 1 till July end. However, some institutes do not advertise
and students should approach them directly for the forms. The
concerned institute may conduct a written test and/or interview
for admission.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders;
Lattice; Boolean Algebra.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering;
matching; independent sets; Colouring; Planarity; Isomorphism.
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.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments,
Intermediate and target code generation, Basics of code optimization.
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.
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.
Information systems and Software Engg: 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, mainteneance.
Always remember :
NO PAIN, NO GAIN !!