An elementary approach to design and analysis of algorithms (Record no. 72622)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03060nmm a2200373Ia 4500 |
| 001 - CONTROL NUMBER | |
| control field | 000Q0201 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220711214145.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 190531s2019 enka ob 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781786346766 |
| -- | (ebook) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | (hbk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | (hbk.) |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 518/.1 |
| 100 1# - AUTHOR NAME | |
| Author | Vermani, L. R. |
| 245 13 - TITLE STATEMENT | |
| Title | An elementary approach to design and analysis of algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | London : |
| Publisher | World Scientific Publishing Europe Ltd., |
| Year of publication | ©2019. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 online resource (424 p.) : |
| 490 0# - SERIES STATEMENT | |
| Series statement | Primers in electronics and computer science ; |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Algorithms -- 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 ## - SUMMARY, ETC. | |
| Summary, etc | "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."-- |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Study and teaching. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Vermani, Shalini. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://www.worldscientific.com/worldscibooks/10.1142/Q0201#t=toc |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 588 ## - | |
| -- | Title from web page (viewed May 31, 2019). |
| 520 ## - SUMMARY, ETC. | |
| -- | Publisher's website. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms |
No items available.