The important Dates for GATE 2012 are
GATE 2012 application form or GATE 2012 Notification: Mid of September 2011
Last Date for submitting GATE 2012 Application Form: End of October 2011
Gate 2012 Exam Date: Mid Sunday of February 2012
GATE 2012 Result Announcement: Mid of March (usually 15) 2012
M.Tech admissions 2012: Mid of March 2012 till July 2012
How to calculate GATE percentile?
As everyone knows GATE scores are used for M.Tech (other master degrees in Engineering) and percentiles tells you where you stand. Please don’t confuse yourself with percentage.
Percentile is a relative term and tells where you stand in a set of people. For example, if you have 99.95 percentile in GATE means that your score or marks are above 99.95% student who took GATE exam.
Whereas, percent is a relative and measured on the scale of 100, it means that how many marks you got out of 100. This is not a measure of GATE performance. Therefore, don’t worry if someone says you that they go 99.9X score and think that it is beyond your capacity. To answer how to find GATE percentile please read the below formula and example carefully.
The GATE percentile is calculated as follows:
P = ( (N- your rank)/ N) x 100
Where P is percentile and N is total number of candidates appeared for exam.
(N- Your rank) indicates the number of candidates who have scored less marks than you.
For example, if total number of candidates are 100 and 90 of them have less marks than you P = (09/100)X100 = 0.9×100 = 90 percentile.
For another example: A guy form Mechanical Engineering have All India Rank (AIR) 99 and total number of student of students appeared for GATE in Mechanical Engineering are 59338 in 2010. Then his percentile would be calculated as
P = ((59338-99)/ 59338) X 100
= (59239/59338) X 100
= (0.9983) X 100
= 99.83
The candidate has 99.83 percentile.
As the competition grown too high, refer to GATE 2010 analysis, percentile not used for admissions anymore. As score is calculated on 1000 scale it gives a bit clear understanding and make admission process easy. Therefore Score is taken into consideration these days. Please refer to what is valid GATE Score to know more about GATE Scores. Do check for more information of GATE and M.Tech Admissions.
Syllabus
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.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.
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.
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.
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.
Do drop your comments and suggestions to improve it. Also don’t forget to share it with friends.
General Information about GATE
The GATE examination consists of a single paper of 3 hours duration.
GATE question paper contains 65 questions except AE and TF.
Maximum of marks a student can score in GATE are 100.
GATE score is calculated on the scale of 1000 based marks obtained by the candidate.
The question paper will consist of only objective questions except AE and TF.
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.
Papers in AE, GG, MN and TF will be carried out Online.
There will be negative marking for each wrong answer, except for the numerical answer type questions.
Each GATE paper shall have a General Aptitude (GA) component carrying 15 marks.
GATE question paper pattern
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.48 – Q.51 (2 pairs) are common data questions.
(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 not attempted, then the answer to the second question in the pair will not be evaluated.)
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).
Negative Marking in GATE
For Q.1 – Q.25 and Q.56 – Q.60, 1/3 mark will be deducted for each wrong answer.
For Q.26 – Q.51 and Q.61 – Q.65, 2/3 mark will be deducted for each wrong answer.
(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, 2/3 mark will be deducted for each wrong answer. There is no negative marking for Q.53 and Q.55.
I hope this covered almost everything about GATE exam. If you feel something is missing or you have something to share please drop a comment.
Do not forget to share it with friends and subscribe for regular updates.
Wish you all a great luck in GATE preparation and Exam
GATE 2012 application form or GATE 2012 Notification: Mid of September 2011
Last Date for submitting GATE 2012 Application Form: End of October 2011
Gate 2012 Exam Date: Mid Sunday of February 2012
GATE 2012 Result Announcement: Mid of March (usually 15) 2012
M.Tech admissions 2012: Mid of March 2012 till July 2012
As everyone knows GATE scores are used for M.Tech (other master degrees in Engineering) and percentiles tells you where you stand. Please don’t confuse yourself with percentage.
Percentile is a relative term and tells where you stand in a set of people. For example, if you have 99.95 percentile in GATE means that your score or marks are above 99.95% student who took GATE exam.
Whereas, percent is a relative and measured on the scale of 100, it means that how many marks you got out of 100. This is not a measure of GATE performance. Therefore, don’t worry if someone says you that they go 99.9X score and think that it is beyond your capacity. To answer how to find GATE percentile please read the below formula and example carefully.
The GATE percentile is calculated as follows:
P = ( (N- your rank)/ N) x 100
Where P is percentile and N is total number of candidates appeared for exam.
(N- Your rank) indicates the number of candidates who have scored less marks than you.
For example, if total number of candidates are 100 and 90 of them have less marks than you P = (09/100)X100 = 0.9×100 = 90 percentile.
For another example: A guy form Mechanical Engineering have All India Rank (AIR) 99 and total number of student of students appeared for GATE in Mechanical Engineering are 59338 in 2010. Then his percentile would be calculated as
P = ((59338-99)/ 59338) X 100
= (59239/59338) X 100
= (0.9983) X 100
= 99.83
The candidate has 99.83 percentile.
As the competition grown too high, refer to GATE 2010 analysis, percentile not used for admissions anymore. As score is calculated on 1000 scale it gives a bit clear understanding and make admission process easy. Therefore Score is taken into consideration these days. Please refer to what is valid GATE Score to know more about GATE Scores. Do check for more information of GATE and M.Tech Admissions.
Syllabus
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 ENGINEERING
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.
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.
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.
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.
what should to know to GATE aspirants?
Do drop your comments and suggestions to improve it. Also don’t forget to share it with friends.
General Information about GATE
The GATE examination consists of a single paper of 3 hours duration.
GATE question paper contains 65 questions except AE and TF.
Maximum of marks a student can score in GATE are 100.
GATE score is calculated on the scale of 1000 based marks obtained by the candidate.
The question paper will consist of only objective questions except AE and TF.
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.
Papers in AE, GG, MN and TF will be carried out Online.
There will be negative marking for each wrong answer, except for the numerical answer type questions.
Each GATE paper shall have a General Aptitude (GA) component carrying 15 marks.
GATE question paper pattern
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.48 – Q.51 (2 pairs) are common data questions.
(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 not attempted, then the answer to the second question in the pair will not be evaluated.)
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).
Negative Marking in GATE
For Q.1 – Q.25 and Q.56 – Q.60, 1/3 mark will be deducted for each wrong answer.
For Q.26 – Q.51 and Q.61 – Q.65, 2/3 mark will be deducted for each wrong answer.
(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, 2/3 mark will be deducted for each wrong answer. There is no negative marking for Q.53 and Q.55.
I hope this covered almost everything about GATE exam. If you feel something is missing or you have something to share please drop a comment.
Do not forget to share it with friends and subscribe for regular updates.
Wish you all a great luck in GATE preparation and Exam
