000			03060nmm a2200373Ia 4500
001			000Q0201
003			WSP
005			20220711214145.0
007			cr |uu|||uu|||
008			190531s2019 enka ob 001 0 eng
010			_z 2018056450
040			_aWSPC _beng _cWSPC
020			_a9781786346766 _q(ebook)
020			_z9781786346759 _q(hbk.)
020			_z1786346753 _q(hbk.)
050	0	4	_aQA9.58 _b.V47 2019
082	0	4	_a518/.1 _223
100	1		_aVermani, L. R. _q(Lekh R.) _920767
245	1	3	_aAn elementary approach to design and analysis of algorithms _h[electronic resource] / _cLekh Raj Vermani and Shalini Vermani.
260			_aLondon : _bWorld Scientific Publishing Europe Ltd., _c©2019.
300			_a1 online resource (424 p.) : _bill.
490	0		_aPrimers in electronics and computer science ; _vv.4
538			_aMode of access: World Wide Web.
538			_aSystem requirements: Adobe Acrobat Reader.
588			_aTitle from web page (viewed May 31, 2019).
504			_aIncludes bibliographical references and index.
505	0		_aAlgorithms -- Growth of functions -- Backtracking -- Divide and conquer -- Greedy algorithms -- Dynamic programming -- Elementary graph algorithms -- Minimal spanning tree -- Single-source shortest paths -- All pairs shortest paths -- Flow networks -- Polynomial multiplication, FFT and DFT -- String matching -- Sorting networks -- NP-Complete problems.
520			_a"In computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks. As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input. This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology."-- _cPublisher's website.
650		0	_aAlgorithms _xStudy and teaching. _94142
655		0	_aElectronic books. _93294
700	1		_aVermani, Shalini. _920768
856	4	0	_uhttps://www.worldscientific.com/worldscibooks/10.1142/Q0201#t=toc _zAccess to full text is restricted to subscribers.
942			_cEBK
999			_c72622 _d72622