idiot stil u r my frnd.i mis u all.i want ur phone no.my phone no.9894364834.m in pondicherry.wher pondicherry.wher r d othr guys?i don't hav contact wid any1
GATE 2011 Syllabus for Computer Science and Information Technology is as follows:
General Aptitude (GA) 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, Bi nomial.
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 l inear 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 integ ral 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: 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 publi c key and private key cryptography, digital signature, firewalls.
Do visit GATE study marital to learn about how to use multiple books for GATE preparation. The reference books for GATE CSE and IT students are below.
Mathematical Logic: Propositional Logic; First Order Logic, Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Textbook : ” Discrete Mathematics ” by Tremblay and Manohar .
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Bi nomial. Textbook : ” Probability , statistics and queuing theory ” by S.C.Gupta & V.K.Kapoor
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics. Textbook : ” Intermediate Mathematics ” , S.Chand publications , authors : B.V.Sastry and
K.Venkateswarlu ( if i remember ) ” Higher Engineering Mathematics ” by B.S.Grewal for generating functions and recurrence relations . ( Bessel’s formula , Lagrangian Polynomial ) ” Introduction to algorithms ” – Cormen etal ( CLRS ) for recurrence relations and asymptotics
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism Textbook : ” Intoduction to Graph Theory ” by Narsing Deo
Linear Algebra: Algebra of matrices, determinants, systems of l inear equations, Eigen values and Eigen vectors. Textbook : ” Higher Engineering Mathematics ” by B.S.Grewal
Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non linear l inear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules. Textbook : ” Numerical Methods ” – by S.S.Sastry
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. Textbook :
” Intermediate Mathematics ” , S.chand publications , authors : B.V.Sastry , K.Venkateswarlu ( if i remember )
Formal Languages and Automata Theory: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Un-decidability; Textbook : ” Formal Languages and Automata theory ” , J.D.Ullman etal
Analysis of Algorithms and Computational Complexity: Asymptotic analysis (best, worst, average case) of time and space, Upper and lower bounds on the complexit y of specific problems, NP-completeness. Textbook : ” Introduction to algorithms ” – Cormen etal ( CLRS ) ” Computer Algorithms ” – Horowitz and Sahani A very good textbook on “Algorithms ” coming soon from Dr.M.N.Seetaramanth Dr.M.N.Seetaramanth ( Tata Mc Graw Hill publications )
Digital Logic: Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point); Textbook : ” Digital Logic circuits and Design ” by Morris Mano
Computer Organization: Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, Memory interface, I/O interface (Interrupt and
DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage. Textbook : ” Computer Organisation ” by Morris Mano ” Computer Architecture ” by Briggs and 2 chinese authors ( blue cover pad ) { for pipelining }
Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Textbook : ” Data structures ” Schaumm’s outline series ” Data structures in PASCAL ” by Horowitz and Sahani ” Data structures and Algorithms ” by Weiss etal ” Introduction to algorithms ” – Cormen etal ( CLRS )
Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming
Textbook : ” Programming with C ” – Byron Gottfried , Schaumm’s outline outlin e series ” Principles of Programming Languages ” by Robert W Sebesta , Addison Wesley ” Programming with C++ ” – Balaguruswamy
Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy,
Dynamic Programming, Divide-and-conquer Di vide-and-conquer); ); Textbook : ” Data structures ” Schaumm’s outline series ” Data structures in PASCAL ” by Horowitz and Sahani ” Computer Algorithms ” – Horowitz and Sahani ” Data structures and Algorithms ” by Weiss etal ” Introduction to algorithms ” – Cormen etal ( CLRS )
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic); Textbook : ” Principles of Compiler Design ” , Aho , Ullman etal . ” Systems Programming ” by John . J . Donovan
Operating Systems: Classical concepts (concurrency, (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
Textbook : ” Operating system concepts ” by Abraham Silberschatz and Peter Galvin ” Advanced Unix Programming ” by W. Richard . Stevens ” Advanced Unix Programming ” by N.B.Venkateswarlu , BPB publications
Databases: Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control;
Textbook : ” Database Management systems ” – Raghu RamaKrishnan ” Database system concepts ” – Silberschatz , Korth , Sudarshan ” Database systems ” – C.J.Date { normalisation is very lucidly written } ” Principles of Database Systems ” – J.D.Ullman { This is a very good book }
Computer Networks: ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), TCP/UDP, IP, Basic concepts of switches, gateways, and routers. Textbook : ” Computer Networks ” – Tenenbaum ” Data communications and Networking ” – William Stallings
Some more important books : ” Multiple choice questions ” – Timothy . J . Williams Willi ams , TMH publications ” Gate Question Papers ” – G.K.Publishers { follow it only for questions , answers are all wrong in it } “Aptitude Test” -D Test” -D R Choudhary ” Multiple choice questions ” – Timothy . J . Williams Willi ams , TMH publications ” Gate Question Papers ” – G.K.Publishers
Do not hesitate to drop a comment in case you have a question, suggestion about a book we missed here. Don’t forget to subscribe by email to get updates in email. You can also choose to like Inspire n Ignite on facebook to get updates in facebook.
Wish you all a great luck with your preparation and wish you the best in results.
Top Marks in GATE 2010 2010 JULY 31
by Zahid
tags: Advices , GATE
It was hard for me know the highest hi ghest or top marks scored in GATE during last year and many student asked about it. I decided to record the heights marks scored in GATE exam and make an analysis. This also helped me to make a generalized assumption about highest marks in GATE or marks that would fetch a seat i n IIT.
The highest are marks totally depends and I always suggest GATE 2011 students to target highest marks. Dont be happy, if you are scoring same as highest marks of previous year. Be aware someone is always preparing for highest marks (ie. 100), if he or she make it you will be standing in a risk to get into IITs.
The highest marks in GATE 2010 for all the branches could not be collected. I think marks of student well below 10 gives a good g ood estimate of highest marks for the engineering stream. I gave the rank for which the marks obtained and a guess for top marks in GATE. You can also refer to Total number of student appeared in GATE 2010 and GATE 2010 qualifying Marks for other related information.
Highest marks for GATE 2010
Discipline
Rank
Top Marks
Computer Science and Engineering and IT (CS and IT)
1
85.33
Electronics and Communication Engineering (ECE)
1
79
5
78.67
9
77
Top Marks Guess
~80
4
70.33
5
70
Top Marks Guess
~72
9
67.67
Top Marks Guess
~71
1
76.33
6
61
9
58
4
65.67
9
62
Top Marks Guess
~68
2
59.67
Top Marks Guess
~60
Electrical Engineering (EE)
Mechanical Engineering (ME)
Civil Engineering (CE)
Instrumentation Engineering (IN)
Chemical Engineering
Production and Industrial Engineering (PI)
Physics
1
77.6
This post is from a series of posts related GATE exam preparation, GATE 2011 preparation: A complete Guide. Guide . Hope these will help many students. If you know the candidates appeared in any other stream, please feel free to drop a comment wit h a GATE registration number, I will verify and add it to the list.
Thanks a million to Gokul Siva Sankar for sharing Instrumentation mark with all student community through a comment. comment. I wish someone could give an idea i dea about Biotechnology paper.
Do not forget to subscribe for more detail s about GATE preparation and other related topics. A box is give on the top right side of the page. After subscription do check email for an activation mail and click the activate link given in that.
GATE 2010 Qualifying Marks 2010 JULY 28
by Zahid
tags: Advices , GATE
Knowledge about the maximum affordable risk for achieving any goal is really i mportant in making the safe and powerful strategy. GATE preparation has no exception. It is always better to be aware of minimum marks required to qualify GATE exam, to make sure during practice you are getting well ahead of these scores.
The unfortunate thing is GATE minimum score or qualifying score change year to year. On the same time, it gives gi ves a close estimate of minimum marks required to qualify GATE exam. Minimum marks also differ from one stream to another, as it is calculated based on standard deviation and average marks of all students. Therefore, if the GATE paper is tough qualifying marks will be less and if the GATE paper is easy qualifying marks will be high.
As mentioned in GATE 2010 official site, the qualifying score for general category in each paper is (a + s) or 25, whichever is higher, where a and s are the average and standard deviation of marks of all candidates in a particular paper, with all marks less than zero, converted to zero. The qualifying scores for SC/ST/PD/OBC categories would be 2/3, 2/3, 2/3 and 9/10, respectively, of the general category qualifying score.
The qualifying or minimum marks for a valid GATE score in 2010 for different disciplines are as below.
Discipline/ Course / Stream
General
OBC
SC/ST/PD
Computer Science and Engineering and IT
25
22.50
16.67
Electronics and Communication Engineering
25
22.50
16.67
Electrical Engineering
25.2
22.68
16.80
Mechanical Engineering
25
22.50
16.67
Civil Engineering
25.01
22.50
16.67
Instrumentation Engineering
25
22.50
16.67
Chemical Engineering
25.41
22.87
16.94
Production and Industrial Engineering
25
22.50
16.67
Metallurgical Engineering
33.08
29.77
22.05
Biotechnology
35.52
31.96
23.68
Life Sciences
40.16
36.14
26.77
Chemistry
30.56
27.53
20.39
Physics
27.22
24.50
18.15
Mathematics
25
22.50
16.67
Geology and Geophysics
38.21
34.39
25.48
This a part of the series of articles prepared for GATE 2011 aspirants to help and support them for their preparation for GATE and after GATE process. Please refer to GATE 2011 preparation: A complete guide for more useful articles.
In case of queries, comments and suggestions drop a comment, and don’t forget to subscribe and activate for updates on engineering college rankings, GATE and M.Tech admissions.
Eligibility For GATE 2010 AUGUST 30
by Zahid
tags: GATE
Most of you may not be interested in this, but many other who don’t have Engineering degree are posting lots of questions related to eligibility of GATE exam. And most of these questions are from students, who are from science background. But this will also help friends from engineering background to help others if they doubts about GATE eli gibility.
The following categories of candidates are eligible to appear in GATE :
Bachelor degree holders in Engineering/ Technology/ Architecture Architecture (4 years after 10+2) and those who are in the final or pre-final year of such programmes.
Master degree holders in any branch of Science/ Mathematics/ Statistics/ Computer Applications or equivalent and those who are in the final or pre-final year of such programmes.
Candidates in the second or higher year of the Four-year Integrated Master degree programme (Post-B.Sc.) (Post-B.Sc.) in Engineering/ Technology or in the thi rd or higher year of Five-year Integrated Master degree programme and Dual Degree programme in Engineering/ Technology.
Candidates with qualifications obtained through examinations conducted by professional societies recognized by UPSC/AICTE (e.g. AMIE by IE(I), AMICE(I) by the Institute of Civil Engineers (India)-ICE(I)) as equivalent to B.E./B.Tech. Those
who have completed section A or equivalent of such professional courses are also eligible.
Those criteria are given by GATE official website. Let me elaborate it for students’ by nam e of degrees.
Second and third year MCA students are eligible for GATE. First and Second year MSc students are eligible for GATE. BSc. BCA and BCS (a three years degree) students are not eligible for GATE Exam. BSc. (Tech), a four years degree, third and final year students are eli gible for GATE exam. B.Tech or BE integrated students are eligible from their thi rd year of integrated degree.
If you have any other degrees or have questions related to GATE eligibility, please feel free to drop a comment. This is a part GATE 2011 preparation guide, guide , which more GATE related posts to help students.
How to start preparing for GATE 2010 AUGUST 21
by Zahid
tags: Advises , GATE
Once you are decided to take up GATE exam and read important information related to it, you are ready to go ahead with preparation. I have few suggestions for students who are serious about cracking GATE exam.
I divided the whole process of preparation i n few steps and every individual student who aced the GATE will follow these in i n one or the other way. These are just simple guidelines but the most important thing is i s your dedication and determination. If you read these steps and appreciate them but don’t follow them then these are of no use. Therefore, I recommend every student to be very sincere and give a good try. The steps are as follows.
Buy or get a copy of previous year question papers if possible with solutions. Having a hard copy is very important and we are going to refer it again and again during whole preparation.
Refer to syllabus and analyze the number of questions asked in each subject. As all subjects subjects don’t have equal marks, few subjects are preferred over others. I mean few subject may have more questions asked in exam than others. I don’t have this subject break up for GATE. If you have done this exercise, please share with us to share with many other students and also we can have a discussion over its validity.
Make a priority list of subjects based on marks or p reference given it in previous exams. Marks distribution of subject will help you prioritize and all ocate preparation time to different subjects. If distribution i s not prepared we usually end up i n a random preparation and finally will have tough time dealing with i mportant subjects.
Just for example, in GATE CS and IT paper, around 15~20% is from M athematics, and then Programming and Data Structures, Theory of computation, OS and digital logic.
Allocate realistic time for each subject. And read it all, as there is huge to cover and it’s easy to ask few marks question from anywhere in a subject.
Finish through reading of a chapter of subject, make short notes of i mportant points, this will help you at last l ast moment to revise what you have read.
Once finish a chapter, go back to GATE Question papers and solve the problems from that chapter. These days there lots of question banks available in market for GATE do buy one and practice. Also to try to get Test Series from other friends. Solve all of them. This will help you to assess yourself for level of understanding of the chapter you read. Use a single note book for question answer solution because you may refer it while revising.
Finish detailed reading at least one and half month before. Keep one month for revisions and clearing leftover doubts. Have a look of question you solved during preparation for GATE and remember how you solved them.
Keep last 15 days for fast practice and revision. Solve as many papers and question banks as you can get from any source.
Keep documents related to GATE like, acknowledgment of application, like hall tickets, application number and other details, in a safe place. Give it to mom or someone responsible, who can give that back to you when you need them. This is to avoid last minute tension for obvious things.
I hope these points will help many of to take a start off. Please don’t waste time and take a start. The one who start early and work consistently reach early and hope see IITs for M.Tech. GATE is a simple exam just needs constant effort to crack it. Don’t worry about competition by number of candidates appearing for GATE, make highest marks as your competition.
This post is a part of a series of posts called GATE Preparation: A complete Guide. Guide . You may find many useful articles related to GATE there. This series is made to help students appearing for GATE exam and want to score really high to join IITs and NITs.
Can One Use Calculator in GATE Exam? 2011 JANUARY 11
by Zahid
tags: Advises , GATE
When I look back at the comments on “How “How to Prepare For GATE With One Month to Go” Go ” II find that most of the students are worrying about using c alculators in GATE exam.
The common related questions are, Can we use calculators in GATE Exam? Or are we allowed to USE Calculator in GATE exam? Which scientific calculators are allowed in GATE exam? And which is the best calculator to use in GATE exam? I will wi ll try to answer all these questions in this post.
Let me answer one by one and hope it will help most of you.
Can we use calculators in GATE Exam? Yes of course, students can use calculators (scientific ones too) in GATE exam. To make it clear I have snippet from GATE official FAQs here and I will clear another doubt from that.
What items are not permitted to be brought with me inside the examination venue?
Electronic diary, mobile phone, and any such electronic gadgets, blank papers, clip boards and log-tables will not be allowed all owed in the examination venue. You should, however, bring HB black pencils (to darken the bubbles in the answer sheet), a soft eraser (in case you wish to change an answer) and a black point pen for filling up the candidate’s data in the designated boxes. Also, you can bring a scientific calculator without data connectivity.
It clearly says that scientific calculators are allowed in GATE exam. On the same time also raises a question, what is data connectivity. Here it means that t he calculator should be stand alone and should not have any capabilities of transferring Data to another device.
Which is the best calculator to use in GATE exam? There is not better calculator to use in GATE than the one you used during GATE preparation or regular college days. The one reason for that is one must have become very comfortable with its functions and usage. If you buy a new calculator you will be searching for the desired functions in calculator and may waste time and also end up not getting the correct answers.
With this I hope most of you got the answers to your doubts about using Calculators in GATE exam. If you have further queries or you want to share some i nformation, do drop a comment.
You can share it with friends to help many like you. Do subscribe to updates on email and like Inspire n Ignite on facebook to get updates on your facebook.
Wish you all great luck with GATE and engineering studies.
How Many Times One Can Appear For GATE Exam? 2010 OCTOBER 9
by Zahid
tags: Advices , GATE
This is being asked so many times that I decided to write a post p ost about it. To get a clear answer for this question, please have look at eligibility criteria for appearing for GATE exam.. exam
There is nothing mentioned about number of attempts one can make in GATE exam. That is the best thing and there is no age limit too. As of now, the organizers don’t maintain the database of student taking GATE exam and use it to verify that every time.
The bottom line is you can make as many attempts to GATE exam as you want. There is no limit on number of attempts in i n eligibility for GATE exam.
The next question is about age limit for attempting GATE exam. I think there is no age limit either for appearing in GATE exam. I was referring to the GATE 2011 online application form. Exam seekers born during 1940 to 1995 are eligible to appear for the exam if the fulfill other eligibility conditions mentioned.
The information holds correct until the GATE exam organizers decide to change the eligibility conditions. I will try to update as soon as any modifications comes up in number of attempts to GATE or any changes in age are made.
Do subscribe for email updates and also like Inspire n Ignite on facebook to get updates i n facebook feeds. Do share this information with friend on facebook and other social networking sites, and help many
