Application Process:
In GATE 2012, candidates need to register and fill the application ONLINE only by accessing the zonal GATE websites of IISc and seven IITs. The application process is complete only when a print out of the filled ONLINE application with the candidate's signature and a good quality photo affixed in the appropriate place is received by the respective GATE office along with necessary documents, if any, on or before 24 October 2011. Please note that sale of application forms through banks and GATE office counters has been discontinued.
Downloadable Admit Card:
Sending Admit cards by post has been discontinued from this year. Admit cards can only be downloaded from the zonal GATE websites from 2nd January 2012. Bring the admit card to the test center along with at least one original (not photocopied / scanned copy) and valid (not expired) photo identification.
ONLINE examination in two additional papers:
In GATE 2011, the papers with codes GG, TF, AE and MN had ONLINE examination. In GATE 2012, two additional papers, AR and AG, will also have ONLINE examination. The ONLINE examination will be conducted in two sessions on Sunday, January 29, 2012.
Forenoon session (09:00 hrs to 12:00 hrs): AR, GG and TF.
Afternoon session (14:00 hrs to 17:00 hrs): AE, AG and MN.
Numerical answer type questions in ONLINE papers:
In the ONLINE papers (AE, AG, AR, GG, MN and TF), the question paper will consist of questions of multiple choice type and questions of numerical answer type. For multiple choice type questions, each question will have four choices for the answer. For numerical answer type questions, each question will have a number as the answer. The number of numerical answer type questions may vary between 5 and 10 in each question paper.
Prefinal year students:
Prefinal year students are not eligible to write GATE 2012. For details, refer to eligibility for GATE examination.
GATE Exam Question Papers for 2012 Exams , GATE Previous Years Solved Question Papers, GATE Sample Question papers Electronics, Civil, Mech, Computer Sc., Electrical from 20032011 Ndmission to post graduate programmes with MHRD and some other government scholarship/assistantship at engineering colleges/institutes in the country are open to those who qualify through GATE. GATE qualified candidates with Bachelor degree in Engineering/ Technology/ Architecture/ Pharmacy or Master degree in any branch of Science/Mathematics/Statistics/Computer Applications are eligible for Master/Doctoral programmes in Engineering/ Technology/Architecture/Pharmacy as well as for Doctoral programmes in relevant branches of Science. To avail the scholarship, the candidate must additionally secure admission to such a postgraduate programme, as per the prevailing procedure of the admitting institution. GATE qualification, however, is not required for candidates with Master degree in Engineering/ Technology/ Architecture/ Pharmacy who may be seeking scholarship/assistantship for relevant doctoral programmes. 
The overall coordination and responsibility of conducting GATE 2012 lies with Indian Institute of Technology Madras , designated as the Organizing Institute for GATE 2012.
ELIGIBILITY FOR GATE 
The following categories of candidates are eligible to appear in GATE :

GATE 2012 application forms will be available from Monday 12 September 2011
Submission of Online Application (website closure) Monday, 17 October 2011 LAST DAY Application extended upto 21st Oct. 2011
Receipt of printed version of Online Application at respective zonal GATE office Monday, 24 October 2011
Admit card can only be downloaded from the zonal GATE websites from 2nd January 2012. Sending Admit cards by post has been discontinued. Bring the admit card at the test center along with at least one original (not photocopied / scanned copy) and valid (not expired) photo identification. ONLY one of the following photo identifications is permitted: Driving license, Passport, PAN Card, Voter ID, College ID, Employee identification card, or a notarized Affidavit with Photo, Signature, Date of Birth and Residential Address. Photocopies of the original identification document are not acceptable. Candidates will not be permitted to take the test if original and valid photo identification is not presented.
The examination for the papers with codes AE, AG, AR, GG, MN and TF will be carried out ONLINE using computers where the candidates will be required to enter the answer for each question using mouse. For all other papers, the candidates will have to mark the correct choice on an Optical Response Sheet (ORS) by darkening the appropriate bubble against each question.
In the ONLINE papers, the question paper will consist of questions of multiple choice type and numerical answer type. For multiple choice type questions, each question will have four choices for the answer. For numerical answer type questions, each question will have a number as the answer and choices will not be given.
GATE 2012 would contain questions of four different types in various papers:
Multiple choice questions carrying 1 or 2 marks each.
Common data questions, where two successive questions use the same set of input data.
Linked answer questions, where the answer to the first question of the pair is required in order to answer its successor.
Numerical answer questions, where the answer is a number, to be entered by the candidate.
Examples of such questions can be found in Question Types.
In all the papers, there will be a total of 65 questions carrying 100 marks, out of which 10 questions carrying 15 marks in General Aptitude (GA) are compulsory.
In the papers bearing the codes AE, AG, BT, CE, CH, CS, EC, EE, GG, IN, ME, MN, MT, PI, TF and XE, the Engineering Mathematics will carry 15 % of the total marks, the General Aptitude section will carry 15 % of the total marks and the remaining 70 % of the total marks is devoted to the subject of the paper.
In the papers bearing the codes AR, CY, GG, MA, PH and XL, the General Aptitude section will carry 15 % of the total marks and the remaining 85 % of the total marks is devoted to the subject of the paper.
Candidates can submit Application Form in two different modes : Online and Offline. The preferred mode of application process is Online
Application  Category  Application Fee 
Online  General/OBC  Rs.1000/ 
SC/ST/PD  Rs.500/ 
Step 1:Decide Payment Option
Step 2: Obtain SC / ST / PD Certificate (if applicable)
Authorities empowered to issue Certificates
Step 3: Apply Online
Candidates must follow the instructions provided while applying online.
At the end of this process, a PDF file will be generated with the following pages:
Take a print out of the entire file on A4 size white sheets using a laser/inkjet printer.
Step 4: Cash Payment: (only for Challan Payment option)
The bank challan (Page5) will be printed in triplicate. Take it to any one of the branches of ICICI, Indian Bank or State Bank of India (as opted by the candidate) and pay the fees. Bank will retain a copy and will return two copies to you. In those two copies, retain the Candidate's copy with you and attach the GATE Copy with the application.
Step 5:
Step 6: Post/Submission
Before posting your application form, make sure that, in addition to the other relevant attachments, you have attached either a copy of the degree certificate or a certificate from your college principal as indicated below:
To download the format of the certificate to be sent by the candidates, click here.
Candidates With Backlog: Candidates with a backlog of papers should submit a copy of the marks sheet of final semester / final year or copy of the course completion certificate or a letter from the principal indicating that the student has a backlog and will be completing the degree in 2012.
Duly filledin Application with appropriate enclosures must be sent by Speed Post (preferably) or by Registered Post to The Chairman, GATE of the Zone corresponding to the 1st Choice of Examination City, so as to reach on or beforeMonday, 24th October, 2011
OR
It can be handed over personally to the respective Zonal GATE Office on or before Monday, 24th October, 2011.
GATE 2012 results will be announced on March 15, 2012 at 10:00 hrs and will be available on the GATE websites of IITs and IISc.
GATE 2012 score is valid for TWO YEARS from the date of announcement of the GATE 2012 results.
GATE 2012 results may be made available on payment basis to interested organizations (educational institutions, R & D laboratories, industries, etc.) in India and abroad based on a Memorandum of Understanding (MOU) between IIT Delhi and the requesting organization. Details in this regard can be obtained from the Chairman, GATE, IIT Delhi.
How to Apply?
Candidates have to apply only Online. Details of the application fee and the steps in the application process are given below.
General/OBC Category  Rs. 1000/ Application Fee
SC/ST/PD Category  Rs. 500/ Application Fee
Application Process
Step 1:Decide Payment Option
Step 2: Obtain SC / ST / PD Certificate (if applicable)
Step 3: Apply Online
Candidates must follow the instructions provided while applying online.
At the end of this process, a PDF file will be generated with the following pages:
Take a print out of the entire file on A4 size white sheets using a laser/inkjet printer.
Step 4: Cash Payment: (only for Challan Payment option)
The bank challan (Page5) will be printed in triplicate. Take it to any one of the branches of ICICI, Indian Bank or State Bank of India (as opted by the candidate) and pay the fees. Bank will retain a copy and will return two copies to you. In those two copies, retain the Candidate's copy with you and attach the GATE Copy with the application.
Step 5:
Step 6: Post/Submission
Before posting your application form, make sure that, in addition to the other relevant attachments, you have attached either a copy of the degree certificate or a certificate from your college principal as indicated below:
Candidates With Backlog: Candidates with a backlog of papers should submit a copy of the marks sheet of final semester / final year or copy of the course completion certificate or a letter from the principal indicating that the student has a backlog and will be completing the degree in 2012.
Duly filledin Application with appropriate enclosures must be sent by Speed Post (preferably) or by Registered Post to The Chairman, GATE of the Zone corresponding to the 1st Choice of Examination City, so as to reach on or beforeMonday, 24th October, 2011
Duly filledin Application with appropriate enclosures must be sent by Speed Post (preferably) or by Registered Post to The Chairman, GATE of the Zone corresponding to the 1st Choice of Examination City, so as to reach on or beforeMonday, 24th October, 2011
OR
It can be handed over personally to the respective Zonal GATE Office on or before Monday, 24th October, 2011.
Before applying, candidates are advised to download the GATE 2012 Information Brochure and read it carefully.
Engineering Mathematics
Linear Algebra:
Matrix Algebra, Systems of linear equations, Eigen values and eigen vectors.
Calculus:
Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integrals, Partial Derivatives, Maxima and minima, Multiple integrals, Fourier series. Vector identities, Directional derivatives, Line, Surface and Volume integrals, Stokes, Gauss and Green's theorems.
Differential equations:
First order equation (linear and nonlinear), Higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy's and Euler's equations, Initial and boundary value problems, Partial Differential Equations and variable separable method.
Complex variables:
Analytic functions, Cauchy's integral theorem and integral formula, Taylor's and Laurent' series, Residue theorem, solution integrals.
Probability and Statistics:
Sampling theorems, Conditional probability, Mean, median, mode and standard deviation, Random variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution, Correlation and regression analysis.
Numerical Methods:
Solutions of nonlinear algebraic equations, single and multistep methods for differential equations.
Transform Theory:
Fourier transform, Laplace transform, Ztransform.
Electrical Engineering
Electric Circuits and Fields:
Network graph, KCL, KVL, node and mesh analysis, transient response of dc and ac networks; sinusoidal steadystate analysis, resonance, basic filter concepts; ideal current and voltage sources, Thevenin's, Norton's and Superposition and Maximum Power Transfer theorems, twoport networks, three phase circuits; Gauss Theorem, electric field and potential due to point, line, plane and spherical charge distributions; Ampere's and BiotSavart's laws; inductance; dielectrics; capacitance.
Signals and Systems:
Representation of continuous and discretetime signals; shifting and scaling operations; linear, timeinvariant and causal systems; Fourier series representation of continuous periodic signals; sampling theorem; Fourier, Laplace and Z transforms.
Electrical Machines:
Single phase transformer  equivalent circuit, phasor diagram, tests, regulation and efficiency; three phase transformers  connections, parallel operation; autotransformer; energy conversion principles; DC machines  types, windings, generator characteristics, armature reaction and commutation, starting and speed control of motors; three phase induction motors  principles, types, performance characteristics, starting and speed control; single phase induction motors; synchronous machines  performance, regulation and parallel operation of generators, motor starting, characteristics and applications; servo and stepper motors.
Power Systems:
Basic power generation concepts; transmission line models and performance; cable performance, insulation; corona and radio interference; distribution systems; perunit quantities; bus impedance and admittance matrices; load flow; voltage control; power factor correction; economic operation; symmetrical components; fault analysis; principles of overcurrent, differential and distance protection; solid state relays and digital protection; circuit breakers; system stability concepts, swing curves and equal area criterion; HVDC transmission and FACTS concepts.
Control Systems:
Principles of feedback; transfer function; block diagrams; steadystate errors; Routh and Niquist techniques; Bode plots; root loci; lag, lead and leadlag compensation; state space model; state transition matrix, controllability and observability.
Electrical and Electronic Measurements:
Bridges and potentiometers; PMMC, moving iron, dynamometer and induction type instruments; measurement of voltage, current, power, energy and power factor; instrument transformers; digital voltmeters and multimeters; phase, time and frequency measurement; Qmeters; oscilloscopes; potentiometric recorders; error analysis.
Analog and Digital Electronics:
Characteristics of diodes, BJT, FET; amplifiers  biasing, equivalent circuit and frequency response; oscillators and feedback amplifiers; operational amplifiers  characteristics and applications; simple active filters; VCOs and timers; combinational and sequential logic circuits; multiplexer; Schmitt trigger; multivibrators; sample and hold circuits; A/D and D/A converters; 8bit microprocessor basics, architecture, programming and interfacing.
Power Electronics and Drives:
Semiconductor power diodes, transistors, thyristors, triacs, GTOs, MOSFETs and IGBTs  static characteristics and principles of operation; triggering circuits; phase control rectifiers; bridge converters  fully controlled and half controlled; principles of choppers and inverters; basis concepts of adjustable speed dc and ac drives.
Engineering Mathematics
Mathematical Logic:
Propositional Logic; First Order Logic.
Probability:
Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & Algebra:
Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Combinatorics:
Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph Theory:
Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Linear Algebra:
Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods:
LU decomposition for systems of linear equations; numerical solutions of nonlinear algebraic equations by Secant, Bisection and NewtonRaphson Methods; Numerical integration by trapezoidal and Simpson's rules.
Calculus:
Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
Computer Science and Information Technology
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 datapath, 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, Divideandconquer; 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, NPhard, NPcomplete.
Theory of Computation:
Regular languages and finite automata, Context free languages and Pushdown 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, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
Databases:
ERmodel, 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:
HTML, XML, basic concepts of clientserver computing.
Engineering Mathematics
Linear Algebra:
Matrix Algebra, Systems of linear equations, Eigen values and Eigen vectors.
Calculus:
Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integrals, Partial Derivatives, Maxima and minima, Multiple integrals, Fourier series. Vector identities, Directional derivatives, Line, Surface and Volume integrals, Stokes, Gauss and Green's theorems.
Differential equations:
First order equation (linear and nonlinear), Higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy's and Euler's equations, Initial and boundary value problems, Partial Differential Equations and variable separable method.
Complex variables:
Analytic functions, Cauchy's integral theorem and integral formula, Taylor's and Laurent' series, Residue theorem, solution integrals.
Probability and Statistics:
Sampling theorems, Conditional probability, Mean, median, mode and standard deviation, Random variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution, Correlation and regression analysis.
Numerical Methods:
Solutions of nonlinear algebraic equations, single and multistep methods for differential equations.
Transform Theory:
Fourier transform, Laplace transform, Ztransform.
Electronics and Communication Engineering
Networks:
Network graphs: matrices associated with graphs; incidence, fundamental cut set and fundamental circuit matrices. Solution methods: nodal and mesh analysis. Network theorems: superposition, Thevenin and Norton's maximum power transfer, WyeDelta transformation. Steady state sinusoidal analysis using phasors. Linear constant coefficient differential equations; time domain analysis of simple RLC circuits, Solution of network equations using Laplace transform: frequency domain analysis of RLC circuits. 2port network parameters: driving point and transfer functions. State equations for networks.
Electronic Devices:
Energy bands in silicon, intrinsic and extrinsic silicon. Carrier transport in silicon: diffusion current, drift current, mobility, and resistivity. Generation and recombination of carriers. pn junction diode, Zener diode, tunnel diode, BJT, JFET, MOS capacitor, MOSFET, LED, pIn and avalanche photo diode, Basics of LASERs. Device technology: integrated circuits fabrication process, oxidation, diffusion, ion implantation, photolithography, ntub, ptub and twintub CMOS process.
Analog Circuits:
Small Signal Equivalent circuits of diodes, BJTs, MOSFETs and analog CMOS. Simple diode circuits, clipping, clamping, rectifier. Biasing and bias stability of transistor and FET amplifiers. Amplifiers: singleand multistage, differential and operational, feedback, and power. Frequency response of amplifiers. Simple opamp circuits. Filters. Sinusoidal oscillators; criterion for oscillation; singletransistor and opamp configurations. Function generators and waveshaping circuits, 555 Timers. Power supplies.
Digital circuits:
Boolean algebra, minimization of Boolean functions; logic gates; digital IC families (DTL, TTL, ECL, MOS, CMOS). Combinatorial circuits: arithmetic circuits, code converters, multiplexers, decoders, PROMs and PLAs. Sequential circuits: latches and flipflops, counters and shiftregisters. Sample and hold circuits, ADCs, DACs. Semiconductor memories. Microprocessor(8085): architecture, programming, memory and I/O interfacing.
Signals and Systems:
Definitions and properties of Laplace transform, continuoustime and discretetime Fourier series, continuoustime and discretetime Fourier Transform, DFT and FFT, ztransform. Sampling theorem. Linear TimeInvariant (LTI) Systems: definitions and properties; causality, stability, impulse response, convolution, poles and zeros, parallel and cascade structure, frequency response, group delay, phase delay. Signal transmission through LTI systems.
Control Systems:
Basic control system components; block diagrammatic description, reduction of block diagrams. Open loop and closed loop (feedback) systems and stability analysis of these systems. Signal flow graphs and their use in determining transfer functions of systems; transient and steady state analysis of LTI control systems and frequency response. Tools and techniques for LTI control system analysis: root loci, RouthHurwitz criterion, Bode and Nyquist plots. Control system compensators: elements of lead and lag compensation, elements of ProportionalIntegralDerivative (PID) control. State variable representation and solution of state equation of LTI control systems.
Communications:
Random signals and noise: probability, random variables, probability density function, autocorrelation, power spectral density. Analog communication systems: amplitude and angle modulation and demodulation systems, spectral analysis of these operations, superheterodyne receivers; elements of hardware, realizations of analog communication systems; signaltonoise ratio (SNR) calculations for amplitude modulation (AM) and frequency modulation (FM) for low noise conditions. Fundamentals of information theory and channel capacity theorem. Digital communication systems: pulse code modulation (PCM), differential pulse code modulation (DPCM), digital modulation schemes: amplitude, phase and frequency shift keying schemes (ASK, PSK, FSK), matched filter receivers, bandwidth consideration and probability of error calculations for these schemes. Basics of TDMA, FDMA and CDMA and GSM.
Electromagnetics:
Elements of vector calculus: divergence and curl; Gauss' and Stokes' theorems, Maxwell's equations: differential and integral forms. Wave equation, Poynting vector. Plane waves: propagation through various media; reflection and refraction; phase and group velocity; skin depth. Transmission lines: characteristic impedance; impedance transformation; Smith chart; impedance matching; S parameters, pulse excitation. Waveguides: modes in rectangular waveguides; boundary conditions; cutoff frequencies; dispersion relations. Basics of propagation in dielectric waveguide and optical fibers. Basics of Antennas: Dipole antennas; radiation pattern; antenna gain.
No.  Question  

1 
Consider the following program segment for a hypothetical CPU having three user registers Rl, R2 and R3.
Let the clock cycles required for various operations be as follows: 

Options 


Correct Answer  B  
2  The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?  
Options 


Correct Answer  C  
3  The Boolean function x^{,} y^{,} + xy + x^{, }y  
Options 


Correct Answer  D  
4  In an MxN matrix such that all nonzero entries are covered in a rows and b columns. Then the maximum number of nonzero entries, such that no two are on the same row or column, is  
Options 


Correct Answer  A  
5 
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, courseNo ® grade rollNo, courseNo ® grade name ® rollNo rollNo ® name The highest normal form of this relation scheme is 

Correct Answer  A  
6  The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by  
Options 


Correct Answer  D  
7 
Consider the following program segment for a hypothetical CPU having three user registers Rl, R2 and R3.
Consider that the memory is byte addressable with size 32 bits, and the program has been loaded starting from memory location 1000 (decimal). If an interrupt occurs while the CPU has been halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be 

Options 


Correct Answer  A  
8  Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G is  
Options 


Correct Answer  A  
9 
What does the following algorithm approximate? (Assume m > 1, Î > 0). x = m; yi; while (x  y > Î) { x = (x + y) / 2 ; y = m/x ; } print (x) ; 

Options 


Correct Answer  C  
10 
Consider the following C program main () { int x, y, m, n ; scanf ("%d %d", &x, &y); / * Assume x > 0 and y > 0 * / m = x; n = y ; while ( m ! = n) { if (m > n) m = m — n; else n = n  m ; } printf("%d",n); } The program computes 

Options 


Correct Answer  C  
11  The best data structure to check whether an arithmetic expression has balanced parentheses is a  
Options 


Correct Answer  B  
12 
A PriorityQueue is implemented as a MaxHeap. Initially, it has 5 elements. The levelorder traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The levelorder traversal of the heap after the insertion of the elements is 

Options 


Correct Answer  D  
13 
Consider the following C program segment
The value returned by the function DoSomething when a pointer to the root of a 

Options 


Correct Answer  D  
14  An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be  
Options 


Correct Answer  D  
15  Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48bit jamming signal is 46.4 ms. The minimum frame size is:  
Options 


Correct Answer  C  
16 
Consider the following C program segment: char p [ 20]; char * s = "string" ; int length = strlen (s) ; for (i = 0 ; i < length; i++) p[ i ] = s [length  i] ;
print f ("%s", p) ; 

Correct Answer  A  
17 
Consider the grammar S ® (S)  a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n_{1}, n_{2} and n_{3} respectively. The following relationship holds good 

Options 


Correct Answer  B  
18 
Consider the following C function: int f (int n) { static int i = 1; if (n >= 5) return n; n = n + i; i ++; return f (n); } The value returned by f(1) is 

Options 


Correct Answer  C  
19 
Consider the following code fragment: if (fork ( ) = = 0) {a = a + 5; print f (“%d, %d / n”, a, and a); } else {a  5; print f (“ %d, %d / n”, a,& a); } Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which one of the following is TRUE? 

Options 


Correct Answer  B  
20  The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?  
Options 


Correct Answer  B 
The Graduate Aptitude Test in Engineering (GATE) is an allIndia 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), and Government of India.
The zones and the corresponding administrative institutes are
Zone 1  Indian Institute of Science Bangalore
Zone 2  Indian Institute of Technology Bombay
Zone 3  Indian Institute of Technology Delhi
Zone 4  Indian Institute of Technology Guwahati
Zone 5  Indian Institute of Technology Kanpur
Zone 6  Indian Institute of Technology Kharagpur
Zone 7  Indian Institute of Technology Madras
Zone 8  Indian Institute of Technology Roorkee
Admission to post graduate programmes with MHRD and some other government scholarship/assistantship at engineering colleges/institutes in the country are open to those who qualify through GATE. GATE qualified candidates with Bachelor degree in Engineering/ Technology/ Architecture/ Pharmacy or Master degree in any branch of Science/Mathematics/Statistics/Computer Applications are eligible for Master/Doctoral programmes in Engineering/ Technology/Architecture/Pharmacy as well as for Doctoral programmes in relevant branches of Science. To avail the scholarship, the candidate must additionally secure admission to such a postgraduate programme, as per the prevailing procedure of the admitting institution. GATE qualification, however, is not required for candidates with Master degree in Engineering/ Technology/ Architecture/ Pharmacy who may be seeking scholarship/assistantship for relevant doctoral programmes.
Some institutions specify GATE as the mandatory qualification even for admission of selffinancing students to postgraduate programmes. GATE qualified candidates in Engineering disciplines are also eligible for the award of Junior Research Fellowship in CSIR Laboratories. Some government organizations prescribe GATE qualification as a requirement for applying to the post of a Scientist/Engineer.