000			03942nam a22007695i 4500
001			9783110693607
003			DE-B1597
005			20240730161507.0
006			m|||||o||d||||||||
007			cr || ||||||||
008			240130t20212021gw fo d z eng d
020			_a9783110693607
024	7		_a10.1515/9783110693607 _2doi
035			_a(DE-B1597)545598
035			_a(OCoLC)1241451913
040			_aDE-B1597 _beng _cDE-B1597 _erda
041	0		_aeng
044			_agw _cDE
072		7	_aCOM051300 _2bisacsh
100	1		_aDimri, Sushil C., _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _975316
245	1	0	_aAlgorithms : _bDesign and Analysis / _cMangey Ram, Preeti Malik, Sushil C. Dimri.
264		1	_aBerlin ; _aBoston : _bDe Gruyter, _c[2021]
264		4	_c2021
300			_a1 online resource (X, 168 p.)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	0		_aDe Gruyter Textbook
506	0		_arestricted access _uhttp://purl.org/coar/access_right/c_16ec _fonline access with authorization _2star
520			_aAlgorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
530			_aIssued also in print.
538			_aMode of access: Internet via World Wide Web.
546			_aIn English.
588	0		_aDescription based on online resource; title from PDF title page (publisher's Web site, viewed 30. Jan 2024)
650		4	_aAlgorithmen. _975317
650		4	_aDatenstrukturen. _975318
650		4	_aKünstliche Intelligenz. _975263
650		4	_aMaschinelles Lernen. _975264
650		7	_aCOMPUTERS / Programming / Algorithms. _2bisacsh _913132
653			_aAlgorithms.
653			_aComputational Theory.
653			_aComputing.
653			_aTheoretical Computer Science.
700	1		_aMalik, Preeti, _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _975319
700	1		_aRam, Mangey, _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _975320
776	0		_cEPUB _z9783110693751
776	0		_cprint _z9783110693416
856	4	0	_uhttps://doi.org/10.1515/9783110693607?locatt=mode:legacy
856	4	0	_uhttps://www.degruyter.com/isbn/9783110693607
856	4	2	_3Cover _uhttps://www.degruyter.com/document/cover/isbn/9783110693607/original
912			_aEBA_BACKALL
912			_aEBA_CL_CHCOMSGSEN
912			_aEBA_DGALL
912			_aEBA_EBACKALL
912			_aEBA_EBKALL
912			_aEBA_ECL_CHCOMSGSEN
912			_aEBA_EEBKALL
912			_aEBA_ESTMALL
912			_aEBA_STMALL
912			_aGBV-deGruyter-alles
912			_aPDA12STME
912			_aPDA13ENGE
912			_aPDA18STMEE
912			_aPDA5EBK
942			_cEBK
999			_c84392 _d84392