GATE

                                                     The Graduate Aptitude Test in Engineering, GATE, is a premier examination for securing admission into higher education programmers, commonly referred to as Masters, at technical and research institutions. The GATE is organized by the consortium of the elite IITs and IIScs. It is tipped as the pioneering instrument in advancing technical education at master's level in India.To secure a very high percentile you should always remember the fact that you are adjudged relatively not absolutely. Hence, your rank obviously depends on how you performed relative to your competitors. Many times, it happens that the candidates are sure of getting many questions correct. But one should always know that although the questions have only one correct answer, other probable choices are deliberately put there to confuse the candidates. In that sense preparing the choices other than the correct one is also a part of the bringing the element of innovation, which is the real challenge the test taker faces to arrive at the very correct choice.$The question that poses itself to the GATE aspirants now is, how to prepare, what methodologies to be adopted to ensure ones admission into the esteemed IITs or the IIScs or other high profile institutions.
          
              There will be a total of 65 questions carrying 100 marks.

•   Q.1 to Q.25 (25 questions) carry one mark each (sub-total 25 marks). 
•   Q.26 to Q.55 (30 questions) carry two marks each (sub-total 60 marks).
•   Questions Q.56 - Q.65 belong to General Aptitude (GA). Questions
•   Q.56 - Q.60 (5 questions) carry 1 mark each (sub-total 5 marks) and 
•   Questions Q.61 - Q.65 (5 questions) carry 2-marks each (sub-total 10 marks).
•   Questions Q.48 - Q.51 (2 pairs) are common data questions and Question pairs 
•   (Q.52, Q.53) and (Q.54, Q.55) are linked answer questions. The answer to the second question of the linked answer questions depends on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is unstamped, then the answer to the second question in the pair will not be evaluated.

NEGATIVE MARKING                                       Q.1 - Q.25 and Q.56 - Q.60, 33% mark will be deducted for each wrong answer.
                       Q.26 - Q.51 and Q.61 - Q.65, 66% mark will be deducted for each wrong answer. 

                      The question pairs (Q.52, Q.53), and (Q.54, Q.55) are questions with linked answers. There will be negative marks only for wrong answer to the first question of the linked answer question pair i.e. for Q.52 and Q.54, 66% mark will be deducted for each wrong answer.                        There is no negative marking for Q.53 and Q.55.Questions on Engineering Mathematics will carry about 15% of the total marks (excluding General Aptitude section) in all the papers bearing the codes AG, BT, CE, CH, CS, EC, EE, IN, ME, MN, MT and PI.             
  
 Other Benefits of Appearing for GATE Exam

• GATE exam is not restricted for M. Tech admission only. Preparing GATE syllabus will help engineering students for BSNL (JTO), DRDO, BHEL, IES, APGENCO, APTRANSCO and others.

• The overall coordination and responsibility lies with one of the above institutes, designated as the "Organizing Institute". It is an annual exam for admission to M.Tech and M.S. programs in most engineering institutes in India as well as pharmacy institutes. PSU's like BARC, NPCIL, HAL etc.

• Give importance to GATE scores for various job positions in their organizations. GATE seats are fixed in every institute. It is regarded as a benchmark test for engineering graduates.

Jobs on the Basis of GATE Score

• You would get preferences in big companies if you have good marks in GATE like in IOCL, BARC, NTPC, BHEL, REC, BPCL etc.

• If you have a good GATE score then you can apply in these companies as per your requirement & companies criteria by visiting their official websites. 

• You can also approach big private companies if you have good GATE score.

Things to Ponder Over Gate

• Secure a national rank below 400 to get admission in IITs and IIScs.

• 400 to 1000 ranks can get you a seat in NITs and University Colleges.

• Some branches have very few seats and a good rank guarantees a seat in these branches.

• Nearly one lakh candidates compete for CSE/IT in GATE-2010. 30,000 to 50,000 candidates compete for EEE, Mechanical and Civil branches.

• Video lessons of IIT, IISC professors are available in the NPTEL website.

• Candidates who joined B.Tech after diploma through lateral entry should allot more time to Mathematics and Aptitude subjects.

• When compared to previous papers, GATE questions are not very tough but negative marks and some questions may cause tension in candidates.

After the completion of the preparation, read at least two or more objective books.    

GATE Exam Schedule and Notifications$Important Dates :
• Availability of GATE forms: October, 1st week• Last Date for filling up forms: November, 1st week                                                                                                    
Exam Dates 
• Computer based ONLINE Examination for TF paper from 09.30 hrs to 12.30 hrs, usually 2nd Sunday of February of the year of the conduct of exam
• Computer based ONLINE Examination for MN paper from 14.30 hrs to 17.30 hrs 2nd Sunday of February of the year of the conduct of exam
 • OFFLINE Examination for all papers except TF and MN is conducted from 09.30 hrs to 12.30 hrs 3rd Sunday of February of the year of the conduct of exam           
      
Announcement of Results:Mid of the March of the year of the conduct of exam.

•                                                                                                                                                                                                                      

SYLLABUS OF GATE

• • • • • computer science and engineering  

• • • • •      

verbal ability
       English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction. 

Numerical Ability:                                                                 
                   Numerical computation, numerical estimation, numerical reasoning and data interpretation.

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 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, 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 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:                                                                                                                                                                                    
                   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:   HTML, XML, basic concepts of client-server computing.