Gate 2017: Computer Science and IT - Algorithms
Gate 2017: Computer Science and IT - Algorithms
- 2nd ed
- New Delhi Made Easy Publications 2016
- 112p
- GATE Computer Science and IT Made Easy Postal Study Course .
Asymptotic Analysis of Algorithms
Recurrence Relations
Divide and Conquer
Greedy Techniques
Graph Based Algorithms
Dynamic Programming
Computer Engineering
004.076 / GAT
Asymptotic Analysis of Algorithms
Recurrence Relations
Divide and Conquer
Greedy Techniques
Graph Based Algorithms
Dynamic Programming
Computer Engineering
004.076 / GAT