Top 50 Indian Engineering Colleges

Engineering Colleges in India

Every year more than a lakh of students appear for the hundreds of engineering entrance exams conducted in India. Be it AIEEE, IIT JEE, MH CET, engineering exams in India divide the top engineering colleges in India on the basis of region, courses offered, regulatory body etc. Separate exams for Engineering Colleges in Tamil Nadu, Engineering Colleges in Pune, Engineering Colleges in Bangalore, Engineering Colleges in Delhi, it becomes difficult for students to actually find out which colleges are worth applying to. Once found the right engineering college the next step is to choose the courses offered by engineering colleges in India and apply for them.

Below is a comprehensive list of top 50 Engineering colleges in India consolidated with reference to the faculty, the facility, the courses offered and the placement records of engineering colleges in India.

Indian Institute of Technology IIT - Kharagpur
Indian Institute of Technology IIT - Kanpur
Indian Institute of Technology IIT - Mumbai
Indian Institute of Technology IIT - Delhi
Indian Institute of Technology IIT - Chennai
BITS - Pilani
Indian Institute of Technology IIT - Roorkee
Indian Institute of Technology IIT - Guwahati
IT-BHU
College of Engg, Anna University
Indian School of Mines University
BIT, Mesra
Jadavpur University , Faculty of Engg & Tech - Calcutta
PSG College of Technology - Coimbatore
Delhi College of Engineering
NIT- National Institute of Technology - Trichy
Thapar Inst of Engineering & Technology - Patiala
NIT- National Institute of Technology - Warangal
NIT- National Institute of Technology - Suratkal
Punjab Engineering College - Chandigarh
Bengal Engineering and Science University - Howrah
Indian Institute of Technology IIT - Hyderabad
Mumbai University Institute of Chemical Technology
Netaji Subhas Institute of Technology - New Delhi
Indian Institute of information Technology - Allahabad
National Institute of Technology - Calicut
Motilal Nehru National Inst. of Technology - Allahabad
Malaviya National Institute of Technology - Jaipur
The National Institute of Technology - Kurukshetra
Visvesvaraya National Institute of Technology - Nagpur
Harcourt Butler Technological Institute - Kanpur
Maulana Azad National Institute of Technology - Bhopal
RV College of Engineering - Bangalore
Sardar Vallabhbhai National Institute of Technology - Surat
Andhra University College of Engineering - Visakhapatnam
College of Engineering - Pune
Veermata Jijabai Technological Institute - Mumbai
National Institute of Technology - Rourkela
Coimbatore Institute of Technology - Coimbatore
Thiagarajar College of Engineering - Madurai
College of Engineering - Thiruvananthapuram
National Institute of Technology - Durgapur
Dhirubhai Ambani Institute of Info & Comm Tech - Gandhinagar
Alagappa Institute of Information Technology - Karaikudi
Vellore Institute of Technology - Vellore
Govt College of Technology - Coimbatore
SSN College of Engineering - Chennai
Sardar Patel College of Engineering - Mumbai
Dr B R Ambedkar National Institute of Technology - Jalandhar
Jawaharlal Nehru Technological University (JNTU) - Hyderabad

Admission Procedure of M.Tech

The individual candidate who wants to take admission in the M.Tech level course of the engineering stream has to appear for a written entrance exam called GATE (Graduation Amplitude Test Examination). The examination is conducted on a yearly basis for those pass out B.Tech candidates who want to spursue higher studies in this field. The candidates who have secured the highest of ranks are allotted seats that are available in various engineering colleges in India.

Also, in some of the colleges, the candidates are given direct admission based on their over all marks in all the eight semesters that span for four years. These institutes are offering this course at a price. The colleges are admitting these candidates after taking donation from them. The students of such stature are known as Management quota students.

The students who have passed the GATE exam are then called for a personal interview. Only the best candidates are called for taking admission in this way. The individual candidates who belong to the scheduled caste and scheduled tribe classes are given reserved seats during the admission process. The candidates who belong to the defense background are also given reserved seats. The candidates who belong to the Other Background Castes are also given reserved seats.

Thus, there is a large section of the candidates who get admission in this format. The candidates who are having special acknowledgement from either of the state or the central government are given reserved seats during the admission process.

Master in Interactive Technology

Interactive technology is one of the most important and essential branches of the modern technology. Interactive technology includes the technologies that are used as a means of interactions. Under this course various means of development in the modes of interactions are developed. Students are taught various ways in which latest technology can be implemented for the convenience of interaction. This course also includes study of various updates on interactive means and hence finds ways to update them with their advance knowledge. Under this course the students are taught means to create more convenience in the interactive means.

One needs to be a graduate in this field in order to be eligible for the course of Master in Interactive technology. The degree of graduation can be of any recognized institute or university of India.

Master in Interactive Technology Course outlook:

The course is generally of 2 years. These 2 years are divided in 2 parts of one year each. However many colleges and university does offers this course for a different duration. Many a places this course is of 1 year only. Hence it depends on the university from where the course is being done.

Master in Interactive Technology Job prospects:

There are plenty of jobs after the successful completion of the degree of master in interactive technology. Companies of various telecommunication and other communications do recruits people with this degree. Part from that various internet companies also recruits these degree holders to improve their means of communication with their clients and customers.

Best Place to Pursue Master in Interactive Technology:

• Jadavpur University

IES Coaching Institutes

The Indian Engineering Service or The IES is a recruitment examination conducted for the entry of engineering graduates into various Public Sector Units, or PSUs, like the Indian Railways, and various Engineering organizations, and Public Engineers in units like various Municipal Corporations etc. Paralleled to Bureaucracy IES, is a premier examination, with a proper government job as well as incentives offered. Since there is a high demand of government jobs in PSUs, so the examination is taken by most of the engineering graduates, and hence carries a lot of competition with it. However, the examination is not so difficult, but owing to the high competition, professional coaching is always helpful.

There are various coaching institutes coaching students and prospective candidates, in order to crack the IES examinations, which is conducted by the Union Public Service Commission or the UPSC, and they are mushrooming in every nook and corner of the country,. Various institutes are present in all major cities of the country. Some of the leading coaching institutes in Delhi are Engineers Institute of India, IES ACADEMY, Shar Study Circle, I.E.S. Made Easy, etc. Various other coaching institutes can be found along with them, having GATE and IES qualified faculties taking their classes.

The fees of these coaching centres vary from institute to institute and also from place to place, depending upon the success rate of the institute and also the faculty. The Engineers Institute of India charges a fee of Rs. 30,500 per annum, for the regular and the weekend classroom courses, and Rs. 8,500 for the correspondence course. The IES Academy also charges similar fees which is more or less equal to that of the Engineers Institute of India.

Further, Institutes like the GATE Forum also train students for the IES, and charge comparatively lesser fees, which is equal to around Rs. 12,000 for the regular classroom course.

Mtech in Microelectronics

Students aspiring for an Mtech in Microelectronics should know that the course is a competitive one as it is offered by few institutes in the country. The students can expect to learn about advanced telecommunication networks, devices technology and design interface amongst among other things offered in the two year course.

Eligibility Criterion

Students aspiring to pursue this course must have a Bachelors’ degree in Electronics/Telecom/instrumentation/Computer Science Engineering. Some colleges may even accept an M.sc Physics degree or Electronic Sciences. It is mandatory for students to have appeared and cleared the GATE exam. The candidate is also required to be 21 years of age.

Course Outlook

The course of two years comprises of four semesters. Each semester will have its own new set of theory and practical work. The students are expected to get a minimum of 50% in each semester to be eligible for the unique placement opportunities provided by the institutes. The students are made to work with the best infrastructural facilities so as to prepare them and make them competent.

Job Prospects

The field holds a lot of scope in the field of research and information technology. A number of international companies are hiring fresh graduates for advanced design work. The brightest prospects however lie in the field of telecom as well. The graduates of this course are in highest demand in France.

Best Places to pursue

• Indian Institute of Technology Bombay (IIT Bombay)
• Jaypee Institute of Information Technology
• International institute of Information Technology.

List of Engineering Entrance Examinations

This list will make you familiar with the number of colleges in India which offer bachelor and masters degree in various engineering courses. Engineering is a very broad discipline which is further divided into numerous branches and each specializing in a different field.

1. All India Engineering Entrance Examination (AIEEE)
2. NERIST Entrance Examination (NEE)
3. Karunya University Entrance Exam [ BTech, BE ]
4. Kalinga Institute of Industrial Technology Entrance Exam (KIITEE) [ BTech, MTech
5. SRM Engineering Entrance Exam (SRMEEE) [ BTech, MTech ]
6. All India Common Entrance Test (AICET)
7. IIT Joint Entrance Examination (IIT JEE)
8. Birla Institute of Technology and Science Examination (BITSAT)
9. Delhi Combined Entrance Examination CEE
10. Netaji Subhas Institute of Technology (NSIT)
11. National Institute of Technology (NIT)
12. National Aptitude Test in Architecture (NATA)
13. Madhya Pradesh Pre Engineering Test (MP PET)
14. Vellore Institute of Technology Engineering Entrance Exam (VITEEE)
15. Vinayaka Missions University Engineering Entrance Exam
16. Tolani Maritime Institute - Birla Institute of Technology and Science
17. School of Planning and Architecture
18. Rajasthan Pre Engineering Test
19. Jawaharlal Nehru University Engineering Entrance Exam (JNU EEE)
20. JNTU Planning and Architecture Common Entrance Test (PACET)
21. Jamia Milia Islamia (JMI) Entrance Exam
22. International Institute of Information Technology -Post Graduate Entrance Exam (IIIT PGEE)
23. Graduate Aptitude Test in Engineering (GATE)
24. Engineering Common Entrance Test for Diploma Holders (ECET-FDH)
25. Dr.D.Y.Patil Institute All India Entrance Test
26. Dhirubhai Ambani Institute Of Information and Communication Technology
27. Central Institute of Plastic Engineering & Technology Entrance Exam (CIPET)
28. Bharath University Engineering Entrance Exam (BIHER)
29. Bharati Vidyapeeth Engineering Entrance Exam
30. Bureau of Energy Efficiency (BEE)
31. Admission Test for IcfaiTech
32. Amrita Schools of Engineering BTech Entrance Exam
33. Annamalai University Engineering Entrance Exam
34. Associate Membership of Institute of Electronics and Telecommunication Engineers (AMIETE)
35. Associate Membership of Institution of Engineers (AMIE)
36. All India Competitive Examination (AICE) for Admissions to Master’s Degree Programmes
37. Avinashilingam University for Women Entrance Exam 2008
38. Indian Institute of Maritime Studies (IIMS) Entrance Exam
39. Marine Engineering & Research Institute (MERI) Entrance Exam

The scope of engineering is not limited to its own domain but it also very much linked with sciences, art, medicine and biology. the list will be updated as soon as i find more information about engineering entrance examinations.

ECE GATE Exam Books Downloads

The Graduate aptitude test in Engineering is one of the toughest exams and this prepares the individuals to undertake a master level in the aforesaid course. The individual candidates have to carry an intricate and in-depth knowledge of the subject of Electronics as well as Communications. The candidates have to also cover books that contains practical examples as various questions have been asked based on the experiments rather than theoretical concepts only.

There are different kinds of books that covers portions of questions that have already appeared in the previous years question papers. Then there are books that relate to the probable questions that may appear in the exams. These books are very helpful and the candidates should study them with great care. Various Multiple Choice Questions based books are also available in the market for the aforesaid exam that covers the entire syllabus with lucid examples and along with solved problems and carry an in-depth coverage of the entire syllabus.

Here is a list of books which can play a key role in your success.

Analog Circuit

Integrated Electronics-Millman and Halkies

Microelectronics Circuits with solution Manual- Sedra & Smith

Electronic Devices and Circuit Theory- Robert L Bovlestad

Electromagnetic Theory

Engineering Electromagnetics- William Havt

Communications

Communication System- Simon Hawkins

Principle of Communication System- Taub & Schillings

These books come with complete exercise problems and important notes. Students should solve the exercise problems again and again so that they may write the saga of success and hold superior rank in the final exam to attain a high grade college to pursue their respective degree.

Best GATE Exam Coaching Institutes

raduate Aptitude Test in Engineering or GATE is an All India Exam, generally aiming at entrance to the Post Graduate Masters in Technology from elite engineering institutes all over India, including the IITs, the NITs, and other Regional Engineering Colleges. Most of the private engineering colleges also accept GATE scores for the admission into their engineering master’s course, and also GATE scores are sometimes used in order to give jobs to the prospective engineers. So GATE is an examination attempted by most of the engineering graduates, and around 1 lakh students in each stream roughly appear for this exam. And hence due to stiff competition of a few hundred seats in elite colleges, professional coaching is helpful to crack GATE. Hence various coaching institutes are mushrooming in different parts of the country.

Top GATE Exam Coaching institutes includes the GATE Forum, Brilliant Tutorials, FIITJEE, and Narayana IIT Academy. They have world class faculty and study materials for the purpose of preparing GATE aspirants to face the GATE examination in the most tactful and extract the most out of it, such that a good score and a good rank, can fetch you a renowned institute to complete your masters.

The Fees for the various programs in Best GATE coaching institutes vary from institute to institute to institute. While GATE Forum charges around 12,000 for a 6 months course, the Brilliant Tutorials, and FIITJEE may charge double the amount for the same duration. The correspondence course however is relatively cheaper, which is priced around 3,500 for a 6 months correspondence. Eligibility in order to get admission into these coaching institutes is 3rd year B.Tech, and an admission test or direct admission based on your semester results are the mode to get into one of these institutes.

Preparation for GATE must begin at least 6 months before the exam in order to gain proper control and power over the subject. Professional coaching helps a lot to prepare for the final battle, but it is always the will power and good examination techniques that puts you into right direction.

Download GATE Mechanical Engineering Papers

One of the toughest exams of India for postgraduate courses in engineering streams is the GATE. The exam is held every year. The duration of the GATE MECHANICAL ENGINEERING PAPER is 3 hours. The paper contains multiple choice type questions, 65 in numbers. The questions have four different options with only one correct answer. The pattern of the questions is given below:

Question numbers 1 to 25 are 1 mark questions. They have a negative marking of 1/3 mark.

Question numbers 26 to 55 are 2 marks questions. They have a negative marking of 2/3 mark.

Four questions, number 52, 53 and 54, 55 are the linked questions as the answer of the second question of the paper depends on the answer of the first question.

The second answer of the pair will be evaluated only when the first one is answered correct. The negative marking is for the first question only as the next question is not going to be evaluated only.

Question numbers 56 to 60 are from general aptitude. They are all 1 mark questions and a negative marking of 1/3 mark.

The last questions are also from general aptitude but they are 2 marks questions. They have a negative marking of 2/3 mark.

Links to Download GATE Mechanical Engineering Papers:

GATE Electrical Engineering Books Downloads

Graduate aptitude test in engineering exam is one of the excellent opportunities for the engineers to give a new direction to the life. This is one of the toughest exams in comparison of the other. Many books are available in the market but only few of them boost up the confidence of the student. These books not only prepare a platform for the preparation but also hike the confidence level of the student, which is a key to the success.

If the students wish to prepare themselves for GATE exam without going for any coaching classes they can use these book. As it knows to all of you, the success in any field depends on dedicated practice and good efforts to achieve the desired results particularly when it comes to education needs of regular practice. Along with the books students should also go through the previous year questions, this gives an idea of asking questions. Anyone who is intent to crack the GATE exam needs of an excellent collection of books and a positive approach for the sums. Day by day question pattern is changing so they should pay attention towards it.

Here there is a list of Electrical Engineering books, which students should follow from the beginning to the end.

1. The performance a design of alternating current machine

2. Electrical engineering [GATE solved paper]

3. Integral electronics: Analog and digital circuit and system

4. Microelectronic Circuit

5. Electronic devices and circuits

6. Op-Amps and linear integrated circuits

7. Physics of semiconductor devices

8. Communication system 4th addition

9. Communication system

10. Modern digital and analog communication system

11. Electric machine

12. Engineering circuit analysis

These books come with a comprehensive review of all the material on the exam and test taking strategies to help maximize their score so that they can achieve their goal. Repeated practice of these books helps them to write the saga of the success.

Download GATE Electronics and Communication Engineering Papers

The duration of the GATE Electronics and Communication Engineering is three hours. The code of the paper is EC. There are 65 questions in the paper. All the questions are objective types. They are given four options but only one is correct. The detailed description of the paper is given below:

Question 1 to 25 is of 1 mark each. The negative marking for these questions is 1/3 mark.

Question 26 to 55 is of 2 marks each. The negative marking for these questions is 2/3 mark.

Question 48 to 51 is known as common data questions. The negative markings in this case is also 2/3 mark.

Question 52 & Question 53 and Question 54 & Question 55 are the linked questions. It means the answer of the first question forms the basis of that of the second one of the pair.

The evaluation of the next question of the paper depends on whether the first question is answered correctly or not.

If the first question is answered wrong, negative marking will be there for it, but not for the second answer.

Question number 56 to 60 is general aptitude questions carrying one mark each. Negative marking is there for wrong answer.

The last five questions are also aptitude questions carrying two marks each with negative marking being 2/3 mark.

The EC paper consists of questions from Mathematics of 15 marks.

Post Download GATE Electronics and Communication Engineering Papers Links:

GATE Mining Engineering Papers Downloads

GATE is considered to be one of the toughest examinations for admission to various postgraduate courses offered at the premier institutes of India. The full form of GATE is Graduate Aptitude Test in Engineering. The exam is conducted on an all-India basis. The conducting body of the exam is the GATE committee. This committee comprises of members from the reputed institutions of our country like the Indian Institute of Science, and the IITs. The exam is held on the behalf of National Coordinating Board - GATE, Department of Education, Ministry of Human Resources Development.

The exam is held online for the subject Mining Engineering. It is a computer based exam. The marks carried by the test are 100 and it consists of 65 questions. It will be a three hour duration exam. The questions are all multiple choice type ones. There are four alternative answer options given with each question. You have to select one out of the four. Negative marking is also there in the exam. One third of the marks allotted for the questions are deducted in case the question is answered wrong. The questions are from the prescribed syllabus. Last 10 questions are from general aptitude. First five of these 10 are 1 mark questions and the next five carry 2 marks each.

GATE Mining Engineering Papers Download Links:

http://gate.iitm.ac.in/gateqps/2008/mn.pdf

http://gate.iitm.ac.in/gateqps/2007/mn.pdf

http://gate.iitm.ac.in/gateqps/2009/mn.pdf

GATE Chemistry Papers Downloads

GATE is a very popular and a prestigious exam of our country. The full form of the exam is Graduate Aptitude Test in Engineering. There are many subjects in which the exam can be taken. Chemistry is one such subject. The questions are all objective in nature with four options for each question. Candidates have to darken the circle corresponding to their answer. Circles are to be marked on the OMR sheet provided. Wrong answers attract a penalty of 25% marks deduction. The pattern of the Chemistry exam is given below:

Questions carry 150 marks in total and they are divided in groups.

The first 20 questions are in group 1. This group contains the 1 mark questions. The total of these questions is 20.

The next 55 questions are 2 marks questions. The total of these questions is 110 marks.

After this questions 76 to 85 are the 2 marks questions with the peculiarity of being linked answer type questions. The total of this group is 20. The answer of the second question is based on the answer of the first one. If the first answer is answered wrong the second will not be evaluated. However, negative marking is not there for these questions.

GATE Chemistry Papers Downloads

http://way2freshers.com/tag/gate-chemistry-papers

http://www.scribd.com/doc/18285494/GATE-Chemistry-MCQ-Question-Paper-2009

http://www.scribd.com/doc/8410367/GATE-2008-CHEMISTRY-MCQ-Question-Paper

http://gate.iitm.ac.in/gateqps/2009/cy.pdf

http://gate.iitm.ac.in/gateqps/2008/cy.pdf

Download GATE Instrumentation Engineering Papers

Students who want to pursue master degree courses in various disciplines of engineering have to take the GATE. It is regarded as one of the most difficult exams of the country. There are many streams which the candidates can take the test in. Instrumentation Engineering is one such stream. The paper code is IN. the duration of the test is 3 hours and the number of questions is 65. The questions are all multiple choice types. There are four options with each question but only one of them is correct. The detailed description of the test is given below:

Questions 1-25 carry 1 mark. The negative marking is 1/3 mark.

Questions 26-55 carry 2 marks. The negative marking is 2/3 mark.

Question numbers 52, 53 and 54, 55 are linked answer questions. The second answer of the pair depends on the first one.

In case the first answer is not correct, the second one will not be evaluated. So negative marking is only for the first answer.

The next five questions are aptitude questions, each carrying 1 mark. The negative marking is 1/3 mark. The last questions are also aptitude questions. These questions carry 2 marks each and the negative marking is 2/3 mark.

Download GATE Instrumentation Engineering Papers:

Download GATE Physics Papers

The Graduate Aptitude Test in Engineering is popularly known as GATE. There are only Multiple Choice Questions in the paper. All the questions have four alternative answers but only one of them is correct. You have to darken the circle corresponding to your answer on the OMR sheet. For every wrong answer 25% of the marks of the question are deducted as penalty. The pattern of the questions is given below.

The paper is of a total of 150 marks. The questions are divided in the following groups.

The first group consists of questions 1 to 20. All of them carry 1 mark each. Thus this group carries 20 marks.

The second group consists of questions 21 to 75, carrying 2 marks each. These 55 questions carry 110n marks.

Question numbers 76 to 85 are also 2 marks questions. The sub total is 20 marks. The questions in this group are known as linked answer type of questions. So there are five pairs of linked answer type questions. The second question has its answer dependent on the first answer. The evaluation of the second question also depends on the correctness of the first answer. Negative marking is not there for these questions.

Questions 76 to 85 also carry 2 marks each and the sub total is 20 marks. These questions are the linked answer type questions. There are five pairs of questions in this group. The answer of the second answer of the pair depends on that of the first question. If the first question of the pair is answered incorrectly the next question will not be evaluated. There is no negative marking for the linked questions.

Download GATE Physics Papers:

Download GATE Electrical Engineering Papers

GATE Electrical Engineering paper is of duration of three hours. It consists of 65 questions. the questions are all multiple choice types. all the questions have four options out of which only one is correct. The correct answer is to be marked on an OMR sheet. The details of the question paper are given below:

Question 1 to Question 25, carry 1 mark each. For every incorrect answer 1/3 mark will be deducted.

Question 26 to Question 55, carry 2 marks each. For every incorrect answer 2/3 mark will be deducted.

Question 48 to Question 51 (2 pairs) are common data questions. For every incorrect answer 2/3 mark will be deducted.

Question 52, Question 53 and Question 54, Question 55 are linked answer type questions. the answer of the second question is dependent on that of the first question of the pair.

If the first question of the linked pair is not answered correctly then the next question will not be evaluated.

Negative marking is there for incorrect answer of the first question of the pair only. No negative marking is there for the second question of the pair.

Question 56 to Question 60, are questions from general aptitude. They carry one mark each. There is a negative marking for each incorrect answer.

Question 61 to 65 are also from general aptitude but they carry 2 marks each and the negative marking is of 2/3 marks.

The EE paper also has some questions from Engineering Mathematics. They carry 15 marks.

Post Download links for GATE Electrical Engineering Papers.

GATE Civil Engineering Papers Download

GATE is considered to be one of the toughest exams for the post graduate courses in various disciplines of engineering. The GATE CIVIL ENGINEERING PAPER is of three hours duration. The paper code is CE and it contains 65 questions all of which are multiple choice types. The questions have four alternative options but only one of them is correct. The details of the questions are given below:

Question 1- Question 25: 1 mark. Negative marking: 1/3 mark.

Question 26- Question 55: 1 mark. Negative marking: 2/3 mark.

Question 48- question 51: common data questions. Negative marking: 2/3 mark.

Question pair 52 and 53 and question pair 54 and 55 are known as linked questions. The first answer is the basis of the second answer.

If the first answer of the pair is correct then only the next answer will be evaluated. So negative marking will be for the first answer only, if answered wrong, since the next answer will not be evaluated at all.

The next four questions-56 to 60 are general aptitude questions, marks carried being 1. Negative marking is 1/3 mark.

The last five questions are also general aptitude questions, marks carried being 2. Negative marking is 2/3 mark.

Here you can post the links for Downloading GATE Civil Engineering Papers

GATE Mathematics Exam Papers Download

The GATE Mathematics examination consists of only objective questions. The questions are given four optional answers out of which only one is correct. Candidates are required to darken the correct bubble corresponding to the answer on the Objective Response Sheet. Negative marking is also there in the test. For every wrong answer 25% of the marks allotted to the question will be deducted.

The total marks carried by the paper are 150. The marks are divided in three groups.

Questions 1 to 20 are in the first group. They are all 1 mark question. The sub total of this group is 20 marks.

Questions 21 to 75 are the questions of the second group. They are all 2 marks question. So the 55 questions carry 110 marks in total.

Questions 76 to 85 also carry 2 marks each and the sub total is 20 marks. These questions are the linked answer type questions. There are five pairs of questions in this group. The answer of the second answer of the pair depends on that of the first question. If the first question of the pair is answered incorrectly the next question will not be evaluated. There is no negative marking for the linked questions.

GATE Mathematics Exam Papers Download Links:

http://way2freshers.com/gate-preparation/gate-the-pattern.html

http://gate.jumbotests.com/tests/gate-maths-question-papers

http://www.gateforum.com/gatepapers/EC2008.pdf

http://www.gateforum.com/gatepapers/CS2008.pdf

Download GATE exam model papers

The Graduate Aptitude Test in Engineering (GATE) is an all-India examination with an objective to identify meritorious students to admission to Post Graduate Courses in Engineering, Technology, Architecture and Pharmacy, in reputed institutes of the country. It is conducted by the GATE Committee in eight zones all over the country. The Committee comprises of faculty from seven Indian Institutes of Technology, and Indian Institute of Science, Bangalore, on behalf of Department of Education, Ministry of Human Resources Development (MHRD), Government of India.

Details of the Exam:

The examination is of three hours duration and consists of a single paper. The paper is divided in two sections. The first section is objective type and caries 75 marks. The second section is problem type and also carries 75 marks. So the total is 150 marks.

The subject of the choice is to be opted and prepared according to the syllabus given the GATE brochure. There are many subjects including Computer Science and Engineering, Electronics & Communication Engineering., Electrical Engineering and Instrumentation Engineering and also subjects like Physics, Mathematics etc.

The students who qualify will get an all India rank and their percentile score will be indicated. Candidates scoring below 70 percentile will not get any score card.

GATE scores are valid for 2 years. One may reappear in the exam if one is not satisfied with the score and the new score, if it is better than the old one, will be used for admission purpose.

From 2010, GATE exam will be conducted online also.

Download GATE exam model Papers:

GATE Books for Theory of Computation

Theory of Computation
OR
Automata

John C Martin
http://www.mediafire.com/?3qrnmhgzwzm

TCS_Hopcroft_Motwani_Ullman
http://www.mediafire.com/file/z2zmi224rny/TCS_Hopcroft_Motwani_Ullman_1.pdf
http://www.mediafire.com/file/oryynzt1tnn/TCS_Hopcroft_Motwani_Ullman_2.pdf
http://www.mediafire.com/file/kffgjymdq2t/TCS_Hopcroft_Motwani_Ullman_3.pdf
http://www.mediafire.com/file/omf2jikmymm/TCS_Hopcroft_Motwani_Ullman_4.pdf

GATE Books for Data Structure

Data Structure

Fundamentals of Data Structures - Ellis Horowitz Sahani
http://www.mediafire.com/?mmtgyzdzynn

GATE Books for Database

Database

DBMS Slides -- SilberschatZ Korth
http://www.mediafire.com/?tmktnztddjt

DBMS_Korth
http://www.mediafire.com/?ilnmnjzm0na

DBMS_TheCompleteBook_ULLMAN_Part1.pdf
http://www.mediafire.com/?nijwtmzio1m

DBMS_TheCompleteBook_ULLMAN_Part2
http://www.mediafire.com/?0mewttj3mdi

GATE Books for Computer Networks

Computer Networks

DataandComputerCommunications_WilliamStallings
http://www.mediafire.com/?5nogfywkz5e

Fourazan_4th_edition
http://www.mediafire.com/?xwiiyywjz1z

GATE Books for C Programming

C Programming

c_programming_schaums_outline_byron
http://www.mediafire.com/?ogvtod4mwiz

GATE Books for C Programming

C Programming

c_programming_schaums_outline_byron
http://www.mediafire.com/?ogvtod4mwiz

GATE Books for Algorithms

Algorithms

Introduction to Algorithms by Thomas H Cormen
http://www.mediafire.com/?wdzmhyumkur

GATE Books for C Language

C Language
http://www.ziddu.com/download/6870701/CompletereferenceC.pdf.html

GATE Books for Compiler Books

http://www.ziddu.com/download/6873189/Compiler_Aho_Ullman_Sethi.pdf.html
http://www.ziddu.com/download/6873254/Compiler_complete_Imp_ppt.rar.html

GATE Books for Computer Architecture

William Stallings
http://www.ziddu.com/download/6873859/COA6ebyWilliamStallings.pdf.html

Tanenbaum
http://www.ziddu.com/download/6873866/Tanenbaum_StructuredComputerOrganization.pdf.html

Hennessy Patterson
http://www.ziddu.com/download/6873928/COA_Patterson_Hennessy.pdf.html

GATE Books for Operating System

Galvin 5th edition
http://www.ziddu.com/download/6870470/Galvin5th.pdf.html

William Stalling
http://www.ziddu.com/download/6870557/OS_WilliamStalling.pdf.html

Tanenbaum
http://www.ziddu.com/download/6870651/ModernOperatingSystems-Tanenbaum.chm.html

Gate Mathematics Books collection

Just click on the link below to download mathematics books.

Following books of mathematics are in djvu file format, to read this book u have to download djvu reader so i give u one link to download djvu reader. if u got any problem then comment here.

Discrete Mathematics :

AdvancedEngineeringMaths-Kreyzig
http://www.mediafire.com/?otwlggu5mio

ROSEN
Discrete mathematics and it's applications 6th Edition
http://www.mediafire.com/?yjudngmmjmo

Graph.Theory Narisng Deo
http://www.mediafire.com/?jnaqnmmmyay

Schaum's Outline of Differential Equations
http://www.mediafire.com/?nym4jjnkzzg

Differential calculus schaum series
http://www.mediafire.com/?oznjzkhnann

Schaum outline DiscretMath
http://www.mediafire.com/?ieyl5glnazu

DJVU reader....
http://rapidshare.com/files/266198459/djvu_reader.rar

Algorithms and Data Structures

A

absolute performance guarantee
abstract data type
(a,b)-tree
accepting state
Ackermann's function
active data structure
acyclic directed graph: see directed acyclic graph
acyclic graph
adaptive heap sort
adaptive Huffman coding
adaptive k-d tree
adaptive sort
address-calculation sort
adjacency-list representation
adjacency-matrix representation
adjacent
admissible vertex
ADT: see abstract data type
adversary
Aho-Corasick
algorithm
algorithm BSTW
algorithm FGK
algorithmically solvable: see decidable problem
all pairs shortest path
all simple paths
alphabet
Alpha Skip Search algorithm
alternating path
alternating Turing machine
alternation
American flag sort
amortized cost
ancestor
and
ANSI
antichain
antisymmetric
Apostolico-Crochemore
Apostolico-Giancarlo algorithm
approximate string matching: see string matching with errors
approximation algorithm
arborescence
arc: see edge
arithmetic coding
array
array index
array merging
array search
articulation point: see cut vertex
assignment problem
association list: see dictionary
associative
associative array
asymptotically tight bound
asymptotic bound
asymptotic lower bound
asymptotic space complexity
asymptotic time complexity
asymptotic upper bound
augmenting path
automaton
average case
average-case cost
AVL tree
axiomatic semantics

B

backtracking
bag
balance
balanced binary search tree
balanced binary tree
balanced k-way merge sort
balanced merge sort
balanced multiway merge
balanced multiway tree: see B-tree
balanced quicksort
balanced tree
balanced two-way merge sort
BANG file
Batcher sort: see bitonic sort
Baum Welch algorithm
BB(α) tree
BBP algorithm
BDD
BD-tree
Bellman-Ford algorithm
Benford's law
best case
best-case cost
best-first search
biconnected component
biconnected graph
bidirectional bubble sort
big-O notation
binary function
binary GCD
binary heap
binary insertion sort
binary knapsack problem: see knapsack problem
binary priority queue
binary relation
binary search
binary search tree
binary tree
binary tree representation of trees
bingo sort
binomial heap
binomial tree
bin packing problem
bin sort: see bucket sort
bintree
bipartite graph
bipartite matching
bisector
bitonic sort
bit vector
Bk tree
blind sort
blind trie
block
block addressing index
blocking flow
block search: see jump search
Bloom filter
blossom
bogosort
boolean
boolean expression
boolean function
border
Boruvka's algorithm
bottleneck traveling salesman
bottom-up tree automaton
boundary-based representation
bounded error probability in polynomial time: see BPP
bounded queue
bounded stack
Boyer-Moore
Boyer-Moore-Horspool
bozo sort
B+-tree
BPP
Bradford's law
branch and bound
breadth-first search
Bresenham's algorithm
brick sort
bridge
British Museum technique
brute force
brute force string search
brute force string search with mismatches
BSP-tree
B*-tree
B-tree
bubble sort
bucket
bucket array
bucketing method
bucket sort
bucket trie
buddy system
buddy tree
build-heap
Burrows-Wheeler transform
busy beaver
BV-tree
BWT: see Burrows-Wheeler transform
Byzantine generals

C

cactus stack
Calculus of Communicating Systems
calendar queue
candidate consistency testing
candidate verification
canonical complexity class
capacitated facility location
capacity
capacity constraint
cartesian tree: see randomized binary search tree
cascade merge sort
Caverphone
CCS
cell probe model
cell tree
cellular automaton
centroid
certificate
chain
chaining
child
Chinese postman problem
Chinese remainder theorem
Christofides algorithm
chromatic index
chromatic number
circuit
circuit complexity
circuit value problem
circular list
circular queue
clique
clique problem
clustering
clustering free
coalesced chaining
coarsening
cocktail shaker sort: see bidirectional bubble sort
codeword
coding tree
Collatz problem
collective recursion
collision
collision resolution scheme
Colussi
combination
comb sort
Commentz-Walter
Communicating Sequential Processes
commutative
compact DAWG
compact trie
comparison sort
competitive analysis
competitive ratio
complement
complete binary tree
complete graph
completely connected graph
complete tree
complexity
complexity class
computable
concave function
concurrent flow
concurrent read, concurrent write
concurrent read, exclusive write
confluently persistent data structure
conjunction
connected components
connected graph
constant function
continuous knapsack problem: see fractional knapsack problem
Cook reduction
Cook's theorem
CORDIC
counting sort
covering
CRC: see cyclic redundancy check
CRCW: see concurrent read, concurrent write
CREW: see concurrent read, exclusive write
critical path problem
CSP
CTL
cube root
cuckoo hashing
cut
cutting plane
cutting stock problem
cutting theorem
cut vertex
cycle
cyclic redundancy check

D

D-adjacent
DAG: see directed acyclic graph
DAG shortest paths
data structure
DAWG: see directed acyclic word graph
decidable language
decidable problem
decimation: see prune and search
decision problem
decomposable searching problem
degree
dense graph
depoissonization
depth
depth-first search
deque
derangement
descendant
deterministic
deterministic algorithm
deterministic finite automata string search
deterministic finite automaton: see deterministic finite state machine
deterministic finite state machine
deterministic finite tree automaton
deterministic pushdown automaton
deterministic tree automaton
Deutsch-Jozsa algorithm
DFA: see deterministic finite state machine
DFS: see depth-first search
DFS forest
DFTA: see deterministic finite tree automaton
diagonalization
diameter
dichotomic search
dictionary
diet: see discrete interval encoding tree
difference
digital search tree
digital tree
digraph: see directed graph
Dijkstra's algorithm
diminishing increment sort
dining philosophers
direct chaining
directed acyclic graph
directed acyclic word graph
directed graph
discrete interval encoding tree
discrete p-center
disjoint set
disjunction
distributional complexity
distribution sort
distributive partitioning sort
divide and conquer
divide and marriage before conquest
division method
domain
dominance tree sort
don't care
Doomsday rule
double-direction bubble sort: see bidirectional bubble sort
double-ended priority queue
double hashing
double left rotation
double metaphone
double right rotation
doubly-chained tree: see binary tree representation of trees
doubly-ended queue: see deque
doubly linked list
DPDA: see deterministic pushdown automaton
D-tree
dual
dual linear program
Dutch national flag
dyadic tree: see binary tree
dynamic
dynamic array
dynamic hashing
dynamic Huffman coding: see adaptive Huffman coding
dynamic programming
dynamization transformation

E

easy split, hard merge
edge
edge coloring
edge connectivity
edge crossing
edge-weighted graph: see weighted graph
edit distance: see Levenshtein distance
edit operation
edit script
efficiency
8 queens
elastic-bucket trie
element uniqueness
end-of-string
enfilade
ERCW: see exclusive read, concurrent write
EREW: see exclusive read, exclusive write
Euclidean algorithm: see Euclid's algorithm
Euclidean distance
Euclidean Steiner tree
Euclidean traveling salesman problem
Euclid's algorithm
Euler cycle
Eulerian graph
Eulerian path: see Euler cycle
exact string matching: see string matching
EXCELL
exchange sort: see bubble sort
exclusive or: see xor
exclusive read, concurrent write
exclusive read, exclusive write
exhaustive search
existential state
expandable hashing
expander graph
exponential
extended binary tree
extended Euclid's algorithm
extended k-d tree
extendible hashing
external chaining: see separate chaining
external index
external memory algorithm
external memory data structure
external merge
external node: see leaf
external quicksort
external radix sort
external sort
extrapolation search: see interpolation search
extremal
extreme point

F

facility location
factor: see substring
factorial
fast fourier transform
fathoming
feasible region
feasible solution
feedback edge set
feedback vertex set
Ferguson-Forcade algorithm
FFT: see fast fourier transform
Fibonaccian search
Fibonacci heap
Fibonacci number
Fibonacci tree
FIFO: see queue
filial-heir chain: see binary tree representation of trees
Find
find kth least element: see select kth element
finitary tree
finite Fourier transform
finite state automaton: see finite state machine
finite state machine
finite state machine minimization
finite state transducer
first child-next sibling binary tree: see binary tree representation of trees
first come, first served
first-in, first-out
Fisher-Yates shuffle
fixed-grid method
flash sort
flow
flow conservation
flow function
flow network
Floyd-Warshall algorithm
Ford-Bellman: see Bellman-Ford algorithm
Ford-Fulkerson method
forest
forest editing problem
formal language: see language
formal methods
formal verification
forward index
fractional knapsack problem
fractional solution
free edge
free tree
free vertex
frequency count heuristic
full array
full binary tree
full inverted index
fully dynamic graph problem
fully persistent data structure
fully polynomial approximation scheme
function
functional data structure: see active data structure

G

Galil-Giancarlo
Galil-Seiferas
gamma function
GBD-tree
GCD: see greatest common divisor
geometric optimization problem
global optimum
gnome sort
graph
graph coloring
graph concentration
graph drawing
graph isomorphism
graph partition
Gray code
greatest common divisor
greedy algorithm
greedy heuristic
grid drawing
grid file
Grover's algorithm

H

halting problem
Hamiltonian cycle
Hamiltonian path
Hamming distance
hard split, easy merge
hashbelt
hash function
hash heap
hash table
hash table delete
Hausdorff distance
hB-tree
head
heap
heapify
heap property
heapsort
heaviest common subsequence: see longest common subsequence
height
height-balanced binary search tree
height-balanced tree
heuristic
hidden Markov model
highest common factor: see greatest common divisor
histogram sort
HMM: see hidden Markov model
homeomorphic
horizontal visibility map
Horner's rule
Horspool: see Boyer-Moore-Horspool
hsadelta
Huffman coding
huge sparse array
Hungarian algorithm: see Munkres' assignment algorithm
hybrid algorithm
hyperedge
hypergraph

I

ideal merge
ideal random shuffle
implication
implies
inclusion-exclusion principle
inclusive or: see or
incompressible string
incremental hashing: see linear hashing
in-degree
independent set
index file
information theoretic bound
in-order traversal
in-place sort
insertion sort
integer linear program
integer multi-commodity flow
integer polyhedron
interactive proof system
interior-based representation
internal node
internal sort
interpolation search
interpolation-sequential search
interpolation sort: see histogram sort
intersection
interval tree
intractable
introsort: see introspective sort
introspective sort
inverse Ackermann function
inverse suffix array
inverted file index
inverted index
irreflexive
isomorphic
iteration

J

Jaro-Winkler
Johnson's algorithm
Johnson-Trotter
JSort
J sort
jump list
jump search

K

Karnaugh map
Karp-Rabin
Karp reduction
k-ary heap
k-ary Huffman coding
k-ary tree
k-clustering
k-coloring
k-connected graph
k-d-B-tree
k-dimensional
K-dominant match
k-d tree
key
KMP: see Knuth-Morris-Pratt algorithm
KmpSkip Search
knapsack problem
knight's tour
Knuth-Morris-Pratt algorithm
Königsberg bridges problem: see Euler cycle
Kolmogorov complexity
Kraft's inequality
Kripke structure
Kruskal's algorithm
kth order Fibonacci numbers
kth shortest path
kth smallest element: see select kth element
KV diagram: see Karnaugh map
k-way merge
k-way merge sort
k-way tree: see k-ary tree

L

labeled graph
language
last-in, first-out
Las Vegas algorithm
lattice
layered graph
LCM: see least common multiple
LCS
leaf
least common multiple
leftist tree
left rotation
Lempel-Ziv-Welch
level-order traversal
Levenshtein distance
lexicographical order
LIFO: see stack
linear
linear congruential generator
linear hash
linear hashing
linear insertion sort: see insertion sort
linear order: see total order
linear probing
linear probing sort
linear product
linear program
linear quadtree
linear search
link
linked list
list
list contraction
little-o notation
Lm distance
load factor
local alignment
locality-sensitive hashing
local optimum
logarithmic
longest common subsequence
longest common substring
Lotka's law
lower bound
lower triangular matrix
lowest common ancestor
l-reduction
lucky sort
LZW compression: see Lempel-Ziv-Welch

M

Malhotra-Kumar-Maheshwari blocking flow
Manhattan distance
many-one reduction
map: see dictionary
Markov chain
Marlena
marriage problem: see assignment problem
Master theorem
matched edge
matched vertex
matching
matrix
matrix-chain multiplication problem
max-heap property
maximal independent set
maximally connected component
Maximal Shift
maximum bipartite matching: see bipartite matching
maximum-flow problem
MAX-SNP
MBB: see minimum bounding box
Mealy machine
mean
median
meld
memoization
merge
merge sort
metaheuristic
metaphone
midrange
Miller-Rabin
min-heap property
minimal perfect hashing
minimax
minimum bounding box
minimum cut
minimum path cover
minimum spanning tree
minimum vertex cut
Minkowski distance: see Lm distance
mixed integer linear program
mode
model checking
model of computation
moderately exponential
MODIFIND
monotone priority queue
monotonically decreasing
monotonically increasing
Monte Carlo algorithm
Moore machine
Morris-Pratt algorithm
move: see transition
move-to-front heuristic
move-to-root heuristic
MST: see minimum spanning tree
multi-commodity flow
multigraph
multikey Quicksort
multilayer grid file
multiplication method
multiprefix
multiprocessor model
multi-set: see bag
multi suffix tree
multiway decision
multiway merge
multiway search tree
multiway tree
Munkres' assignment algorithm

N

naive string search: see brute force string search
nand
n-ary function
NC many-one reducibility
nearest neighbor
negation
network flow: see flow function
network flow problem: see maximum-flow problem
next state
NFA: see nondeterministic finite state machine
NFTA: see nondeterministic finite tree automaton
NIST
node
nonbalanced merge
nonbalanced merge sort
nondeterministic
nondeterministic algorithm
nondeterministic finite automaton: see nondeterministic finite state machine
nondeterministic finite state machine
nondeterministic finite tree automaton
nondeterministic polynomial time: see NP
nondeterministic tree automaton
nondeterministic Turing machine
nonterminal node: see internal node
nor
not
Not So Naive
NP
NP-complete
NP-complete language
NP-hard
n queens
nullary function: see 0-ary function
null tree
NYSIIS

O

O: see big-O notation
OBDD
objective function
oblivious algorithm
occurrence
octree
off-line algorithm
offset
omega
omicron
one-based indexing
one-dimensional
on-line algorithm
open addressing
optimal
optimal cost: see best-case cost
optimal hashing: see perfect hashing
optimal merge
optimal mismatch
optimal polygon triangulation problem
optimal polyphase merge
optimal polyphase merge sort
optimal solution
optimal triangulation problem
optimal value
optimization problem
or
oracle set
oracle tape
oracle Turing machine
order
ordered array
ordered binary decision diagram: see OBDD
ordered linked list
ordered tree
order-preserving hash: see linear hash
order-preserving Huffman coding
order-preserving minimal perfect hashing
oriented acyclic graph: see directed acyclic graph
oriented graph: see directed graph
oriented tree: see rooted tree
orthogonal drawing
orthogonal lists
orthogonally convex rectilinear polygon
oscillating merge sort
out-degree

P

P
packing
padding argument
pagoda
pairing heap
PAM: see point access method
parallel computation thesis
parallel prefix computation
parallel random-access machine
parametric searching
parent
partial function
partially decidable problem
partially dynamic graph problem
partially ordered set: see poset
partially persistent data structure
partial order
partial recursive function
partition
passive data structure
path
path cover
path system problem
Patricia tree
pattern
pattern element
P-complete
PCP: see Post's correspondence problem
PDA: see pushdown automaton
Pearson's hash
perfect binary tree
perfect hashing
perfect k-ary tree
perfect matching
perfect shuffle
performance guarantee
performance ratio: see relative performance guarantee
permutation
persistent data structure
phonetic coding
pigeonhole sort
pile
pipelined divide and conquer
planar graph
planarization
planar straight-line graph
PLOP-hashing
point access method
pointer jumping
pointer machine
poissonization
polychotomy
polyhedron
polylogarithmic
polynomial
polynomial approximation scheme
polynomial hierarchy
polynomial time
polynomial-time reduction
polyphase merge
polyphase merge sort
polytope
poset
postfix traversal: see postorder traversal
Post machine
postman's sort
postorder traversal
Post's correspondence problem
potential function
PRAM: see parallel random-access machine
predicate
prefix
prefix code
prefix computation
prefix sums: see scan
prefix traversal: see preorder traversal
preorder traversal
primary clustering
primitive recursive
Prim-Jarnik algorithm
principle of optimality
priority queue
prisoner's dilemma
PRNG: see pseudo-random number generator
probabilistic algorithm
probabilistically checkable proof
probabilistic Turing machine
probe sequence
procedure
process algebra
proper
proper binary tree: see full binary tree
proper coloring
proper subset
property list: see dictionary
prune and search
pseudo-random number generator
PTAS: see polynomial approximation scheme
pth order Fibonacci numbers: see kth order Fibonacci numbers
P-tree
purely functional language
pushdown automaton
pushdown transducer
p-way merge sort: see k-way merge sort

Q

qm sort
q sort
quadratic probing
quadtree
quadtree complexity theorem
quad trie
quantum computation
queue
quick search
quicksort

R

Rabin-Karp: see Karp-Rabin
radix sort
radix tree: see Patricia tree
ragged matrix
Raita
random access machine
randomization
randomized algorithm
randomized binary search tree
randomized complexity
randomized polynomial time: see RP
randomized rounding
randomized search tree
Randomized-Select
random number generator
random sampling
random search
range
range sort
rank
rapid sort
Ratcliff/Obershelp pattern recognition
RBST: see randomized binary search tree
reachable
rebalance
recognizer
rectangular matrix
rectilinear
rectilinear Steiner tree
recurrence equations: see recurrence relation
recurrence relation
recursion
recursion termination
recursion tree
recursive
recursive data structure
recursive doubling: see pointer jumping
recursive language: see decidable language
recursively enumerable language
recursively solvable: see decidable problem
red-black tree
reduced basis
reduced digraph
reduced ordered binary decision diagram
reduction
reflexive
regular decomposition
rehashing: see double hashing
relation
relational structure
relative performance guarantee
relaxation
relaxed balance
repeated squaring
rescalable
reservoir sampling
restricted universe sort
result cache
Reverse Colussi
Reverse Factor
R-file
Rice's method
right rotation
right-threaded tree
RNG: see random number generator
ROBDD: see reduced ordered binary decision diagram
Robin Hood hashing
root
root balance: see balance
rooted tree
rotate left: see left rotation
rotate right: see right rotation
rotation
rough graph
RP
R+-tree
R*-tree
R-tree
run time

S

saguaro stack: see cactus stack
SAM: see spatial access method
saturated edge
SBB tree
scan
scapegoat tree
scatter storage: see hash table
Schorr-Waite graph marking algorithm
search
search tree
search tree property
secant search
secondary clustering
segment
Select
select and partition
selection problem: see select kth element
selection sort
select kth element
select mode
self-loop
self-organizing heuristic
self-organizing list
self-organizing sequential search: see transpose sequential search
semidefinite programming
separate chaining
separation theorem
sequential search: see linear search
set
set cover
set packing
shadow heap
shadow merge
shadow merge insert
shaker sort: see bidirectional bubble sort
Shannon-Fano coding
shared memory
Shell sort
Shift-Or
Shor's algorithm
shortcutting: see pointer jumping
shortest common supersequence
shortest common superstring
shortest path
shortest spanning tree: see minimum spanning tree
shuffle: see permutation
shuffle sort
sibling
sieve of Eratosthenes
sift up
signature
Simon's algorithm
simple merge
simple path
simple uniform hashing
simplex
simulated annealing
simulation theorem
single-destination shortest-path problem
single-pair shortest-path problem: see shortest path
single program multiple data
single-source shortest-path problem
singly linked list: see linked list
singularity analysis
sink
sinking sort: see bubble sort
skd-tree
skew symmetry
skip list
skip search
slope selection
Smith algorithm
Smith-Waterman algorithm
smoothsort
solvable
sort
sorted array
sorted list
sort in place: see in-place sort
soundex
source
space-constructible function
space ordering method
spanning tree
sparse graph
sparse matrix
sparsification
sparsity
spatial access method
spiral storage
splay tree
SPMD: see single program multiple data
square matrix
square root
SST: see minimum spanning tree
stable
stack
stack tree
star encoding
star-shaped polygon
start state
state
state machine
state transition: see transition
static
static Huffman coding: see Huffman coding
s-t cut
st-digraph
Steiner point
Steiner ratio
Steiner tree
Steiner vertex
Steinhaus-Johnson-Trotter: see Johnson-Trotter
Stirling's approximation
Stirling's formula
stooge sort
straight-line drawing
strand sort
strictly decreasing
strictly increasing
strictly lower triangular matrix
strictly upper triangular matrix
string
string editing problem
string matching
string matching on ordered alphabets
string matching with errors
string matching with mismatches
string searching: see string matching
strip packing
strongly connected component
strongly connected graph
strongly NP-hard
stupid sort
subadditive ergodic theorem
subgraph
subgraph isomorphism
sublinear time algorithm
subsequence
subset
substring
subtree
suffix
suffix array
suffix automaton
suffix tree
superimposed code
superset
supersink
supersource
symmetric
symmetrically linked list: see doubly linked list
symmetric binary B-tree: see red-black tree
symmetric set difference
symmetry breaking

T

taco sort
tail
tail recursion
target
temporal logic
terminal
terminal node: see leaf
ternary search tree
text
text searching: see string matching
theta: see Θ
threaded binary tree
threaded tree
three-dimensional
three-way merge sort
three-way radix quicksort: see multikey Quicksort
time-constructible function
time/space complexity
top-down radix sort
top-down tree automaton
topological order
topological sort
topology tree
total function
totally decidable language: see decidable language
totally decidable problem: see decidable problem
totally undecidable problem
total order
tour: see Hamiltonian cycle
tournament
tournament sort
towers of Hanoi
tractable
transition
transition function
transitive
transitive closure
transitive reduction
transpose sequential search
traveling salesman
treap
tree
tree automaton
tree contraction
tree editing problem
treesort (1)
treesort (2)
tree traversal
triangle inequality
triconnected graph
trie
trinary function
tripartition
TSP: see traveling salesman
TST: see ternary search tree
Turbo-BM
Turbo Reverse Factor
Turing machine
Turing reduction
Turing transducer
twin grid file
2-choice hashing
two-dimensional
2-left hashing
two-level grid file
2-3-4 tree
2-3 tree
Two Way algorithm
two-way linked list: see doubly linked list
two-way merge sort

U

UB-tree
UKP: see unbounded knapsack problem
unary function
unbounded knapsack problem
uncomputable function
uncomputable problem
undecidable language
undecidable problem
undirected graph
uniform circuit complexity
uniform circuit family
uniform hashing
uniform matrix
union
union of automata
universal B-tree
universal hashing
universal state
universal Turing machine
universe
unlimited branching tree
UnShuffle sort
unsolvable problem
unsorted list
upper triangular matrix

V

van Emde-Boas priority queue
vehicle routing problem
Veitch diagram: see Karnaugh map
Venn diagram
vertex
vertex coloring
vertex connectivity
vertex cover
vertical visibility map
virtual hashing
visibility map
visible
Viterbi algorithm
Vitter's algorithm
VRP: see vehicle routing problem

W

walk
weak-heap
weak-heap sort
weight-balanced tree: see BB(α) tree
weighted, directed graph
weighted graph
window
witness
work
work-depth model
work-efficient
work-preserving
worst case
worst-case cost
worst-case minimum access

X

xor

Y

Yule distribution: see Zipfian distribution

Z

Zeller's congruence
0-ary function
0-based indexing
0-1 knapsack problem: see knapsack problem
Zhu-Takaoka
Zipfian distribution
Zipf's law
zipper
ZPP