| 000 | 00606nam a2200157 4500 | ||
|---|---|---|---|
| 008 | 170424b xxu||||| |||| 00| 0 eng d | ||
| 082 |
_a004.076 _bGAT |
||
| 245 | _aGate 2017: Computer Science and IT - Algorithms | ||
| 250 | _a2nd ed | ||
| 260 |
_aNew Delhi _bMade Easy Publications _c2016 |
||
| 300 | _a112p | ||
| 440 |
_aGATE Computer Science and IT Made Easy Postal Study Course _911623 |
||
| 500 | _aAsymptotic Analysis of Algorithms Recurrence Relations Divide and Conquer Greedy Techniques Graph Based Algorithms Dynamic Programming | ||
| 600 |
_aComputer Engineering _959 |
||
| 942 |
_2ddc _cLB |
||
| 999 |
_c107516 _d107516 |
||