GATE – Graduate Aptitude Test in Engineering -2013:
GATE – Graduate Aptitude Test in Engineering – is an all India level examination, conducted and controlled by the Indian Institute of Science in cooperation with seven Indian Institutes of Technology on behalf of the National Coordination Board - GATE, Department of Higher Education, Ministry of Human Resource Development (MHRD),
and Government of India. The GATE committee which consists of representatives from the governing institutes is the sole authority for conducting the examination and declaring the results.
Eligibility Criteria for GATE-2013:
The following categories of candidates are eligible to appear in GATE.
1. Candidates with Bachelor Degree in Engineering/Technology/Architecture(4 years after 10+2) and those who are in the final or pre-final year of such programme
2. Candidates with Master Degree in any branch of Science/Mathematics/Statistics/Computer Applications or its equivalent and those who are in the final or pre-final year of such programme
3. Candidates in the second or higher year of the Four-year Integrated Master Degree Programme (Post B.Sc.) in Engineering/Technology or in the third, or higher year of Give-year Integrated Master Degree Programme and Dual Degree Programme in Engineering/Technology
4. Candidates with qualifications obtained through examinations conducted by professional societies recognized by UPSC/AICTE (e.g. AMIE by IE(I), AMICE(1) by the Institute of Civil Engineers (India) – ICE (I) as equivalent to B.E./B.Tech. The students who have completed section A or equivalent of such professional courses are also eligible
GATE-2013 Pattern of Examination:
The GATE examination consists of a single paper of 3 hours’ duration, which contains 65 questions carrying a maximum of 100 marks. The question paper is divided into three sections.
Section A (Engineering, Math and Technical Subjects) consists of about 25 questions of ONE MARK each.
Section B (Engineering, Math and Technical Subjects) consists of about 25 questions of TWO MARKS each.
Section C (General Ability) consists of about 10 questions of about ONE and TWO MARKS each.
The question paper consists of only multiple choice questions. Each question has four choices for the answer. The candidate needs to mark the correct choice on an Optical Response Sheet (ORS) by darkening the appropriate bubble. Incorrect answers carry negative marks.
How to Crack GATE?-2013:
Make a target to get high percentile and all India rank in the GATE
To get a high score in the GATE exam doesn’t mean that you are selected. In this exam candidates are selected on their relative scores. So, getting a score of 95% does not mean a percentile of 95.
Here you compete with the best candidates in India. To get through the GATE you should know where you are among the top few candidates.
Follow standard book for GATE
Make an extensive search for standard books in the library and go for the best ones. Try to cover complete syllabus within the time you have 95 or 6 months). If it isn’t possible, get expertise in the topics you have studied.
Apply group study method
Group study is one of the best ways for preparation of GATE. Assign a few section/topics to your friend and you focus on the remaining. Then have a brief session and discussion and exchange what both of you have studied/gained.
This not only saves your time and efforts but also enhances understanding on the topics/concepts.
Take actual practice tests
Taking actual practices tests is very important. When you begin to take the test, switch off your cell phone and have a timer which tells you the time of your test. You can take up a mock test series to experience the test in a classroom environment.
Analyze your practice test results
Analyzing the results of your practice tests is very insignificant. If you do not analyze, it does not add value to your performance. You should check and find out where you have mistaken and could have scored more.
Know your accuracy rates in various topics and prepare a topic wise datasheet to make record of your performance in different test papers.
Solve previous years’ GATE papers
Solve previous years’ GATE papers to understand what the actual paper would be like. It also brushes up your mind and tells you the weaknesses in the subject knowledge. So try to solve as many test papers as you can. This is the best way to prepare and get through the GATE examination.
2013- GATE Syllabus for Computer Science & Information Technology:
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.
Combination: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Coloring; 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 non-linear algebraic equations by Secant, Bisection and Newton-Raphson 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, maximum & minimum.
Computer Science and Information Technology:
Digital Logic: Logic functions, Minimization, Design and synthesis of combination and sequential circuits; Number representation ad 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 pipe-lining, 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 path; Hashing, Sorting, Searching. Asymptotic analysis 9best, 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: 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, Run-time 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.
Compute 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 cryptograph, digital signature, firewalls.
Web technologies: HTML, XML, basic concepts of client- server computing.
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 equations (linear and non-linear). 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. Taylors and Laurents 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 distributions, Correlation and regression analysis.
Numerical Methods Solutions of non-linear algebraic equations, Single and multi-step methods for differential equations.
Transform Theory Fourier transform, Laplace transform, Z-transform.