000			00971nam a22001937a 4500
999			_c784 _d784
005			20200903144441.0
008			190121b ||||| |||| 00| 0 eng d
020			_a9789350141359
040			_c0
082			_a004.421 _bBHO
100			_aBiswaijit, R Bhowmik
245			_aDesign and analysis of algorithms
260			_aNew Delhi : _bS. K. Kataria & Sons, _c2012.
300			_axxx, 456 pages : _bill.; _c24 cm.
505			_tIntroduction to Algorithms _tAsymptotic Notations _tRecursion Vs Recurrence _tDivide and Conquer Paradigm _tDynamic Programming _tGreedy Approach _tBacktracking _tBranch and Bound _tLower bound theory _tDisjoint set manipulation _tGraph traversals _tMatrix manipulation algorithms _tNotion of NP-Completeness _tApproximation algorithms _tLarge Integers multiplication _tFile Compression _tBiconnectivity _tStrongly connected components _tTopological Sorting _tDijkstra's Algorithm
650			_aSoftware engineering
650			_aAlgorithms
942			_2ddc _cBK