| 000 | 02584nam a22003257a 4500 | ||
|---|---|---|---|
| 003 | IIITD | ||
| 005 | 20240919020004.0 | ||
| 008 | 230923b xxu||||| |||| 00| 0 eng d | ||
| 010 | _a 2019040771 | ||
| 020 | _a9780262539029 | ||
| 040 |
_aDLC _beng _erda _cDLC _dIIITD |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA76.9.A43 _bL668 2020 |
| 082 | 0 | 0 |
_a005.13 _223 _bLOU-A |
| 100 | 1 | _aLouridas, Panos | |
| 245 | 1 | 0 |
_aAlgorithms _cby Panos Louridas. |
| 260 |
_aCambridge : _bMIT Press, _c©2020 |
||
| 300 |
_axxi, 280 p. : _bill. ; _c18 cm. |
||
| 490 | 0 | _aThe MIT Press essential knowledge series. | |
| 504 | _aThis book includes bibliographical references and an index. | ||
| 505 |
_tWhat is an algorithm? _tGraphs _tSearching _tSorting _tPageRank _tDeep learning _tEpilogue |
||
| 520 | _a"This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"-- | ||
| 650 | 0 | _aAlgorithms | |
| 650 | 0 | _aComputer algorithms | |
| 650 | 0 | _aAlgorithms Popular works | |
| 650 | 0 | _aPopular works | |
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 942 |
_2ddc _cBK _07 |
||
| 999 |
_c171693 _d171693 |
||