| 000 -LEADER |
|---|
| fixed length control field |
a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
220112b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9789811238529 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
518.1 |
| Item number |
KLE |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Klein, Shmuel Tomi |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Basic concepts in algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
World Scientific, |
| Date of publication, distribution, etc |
2021 |
| Place of publication, distribution, etc |
Hoboken : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xix, 343 p. ; |
| Other physical details |
ill., |
| Dimensions |
24 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
58.00 |
| Price type code |
USD |
| Unit of pricing |
79.10 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
|
|---|
| Topical term or geographic name as entry element |
Probabilistic algorithms |
|
|---|
| Topical term or geographic name as entry element |
Cryptography Intractability |
|
|---|
| Topical term or geographic name as entry element |
Spanning trees |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |