Introduction To Algorithms by Cormen: Special Features of Book
Introduction To Algorithms by Cormen: Special Features of Book
Introduction To Algorithms by Cormen: Special Features of Book
1.1
1 Basics of Algorithms
1.2
2.1
Insertion Sort
2 2.2
4.1 to 4.3
4 Divide & Conquer, Solving Recurrences, Master’s Theorem
4.5
7.1
7.4
10.1
10.4
15.1
15.4
1 1.2-2, 1.2-3
2 2.1-1, 2.1-2, 2.2-1, 2.2-2, 2.3-1, 2.3-3, 2.3-5, 2.3-6, 2.3-7, 2.1, 2.4
4.2-1, 4.2-3, 4.3-1, 4.3-2, 4.3-3, 4.3-6, 4.3-9, 4.4-1, 4.4-2, 4.4-3, 4.4-4,
4
4.4-5, 4.5-1, 4.5-3, 4.5-4, 4.1, 4.3, 4.5, 4.6
6.1-1 to 6.1-7, 6.2-1, 6.2-6, 6.3-1 to 6.3-3, 6.4-1, 6.4-3, 6.5-1, 6.5-7,
6
6.5-9, 6.2, 6.3
8 8.2-1, 8.2-2, 8.3-1, 8.3-2, 8.3-4, 8.4-1, 8.4-2, 8.4-3, 8.2, 8.3
Level-01:
• Read the algorithm.
• Try to understand how it works and implement on a few examples.
• Implement the algorithm code in some programming language if you have time.
• Prefer C language as it is a part of GATE syllabus.
Level-02:
• Read the analysis part and proof of correctness for that algorithm.
• This part is important as GATE questions focus on the analysis aspect of algorithms.
Level-03:
• Try solving the problems at the end of each chapter.
• The problems are of medium and tough difficulty level and requires thorough
knowledge.
Conclusion-
• The book covers all the algorithms in an extensive way focusing equally on the
analysis aspect.
• The exercise questions are intuitive and guide the students to cover topics in depth.
• The exercise questions of this book have been asked directly in GATE.
• Most of the questions are at par with the level of questions asked in GATE.
• This book is a must read for every student who wants to learn algorithms.