Pre-requisite
Â
Students should have a Prerequisite or basic understanding of data structures and programming languages such as C and read Graph theory to solve mathematical problems.
Designing and analyzing algorithms requires the use of discrete mathematics and data structures.
The following discrete mathematics topics are required reading:
1. Counting techniques
2. Calculus Induction
3. Proof techniques
4. Relations of Recurrence
5. Creating Operations
6. Graph Theory
7. Asymptotic analysis
8. data structures
GATE & NET Students should also list the algorithm as an important subject. There are 65 questions in the GATE exam. 10 questions are from the aptitude.Â
Now in computer science there are 10 subjects, out of which 10 questions are from the algorithm.
| GATE | 1 mark | 2 mark |
|---|---|---|
| Design & Analysis of Algorithm | 3 questions | 3-4 questions |
Also, if you are preparing for NET, then algorithm has a lot of weightage.
| NET | 1 mark |
|---|---|
| Design & Analysis of Algorithm | 10 – 13 questions |
Course Objectives
Â
1. Examine an algorithm’s asymptotic performance.
2. Capability to establish recurrence relations and analyse the asymptotic runtime complexity of algorithms.
3. The ability to comprehend and create algorithms employing dynamic programming, the divide-and-conquer method, and the greedy strategy.
4. Show that you are knowledgeable about important algorithms and data structures.
