Basic concepts in algorithms (Record no. 567106)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01664 a2200205 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | OSt |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20241014154247.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 240930b xxu||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9798886130164 |
040 ## - CATALOGING SOURCE | |
Transcribing agency | IIT Kanpur |
041 ## - LANGUAGE CODE | |
Language code of text/sound track or separate title | eng |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 518.1 |
Item number | K672b |
100 ## - MAIN ENTRY--AUTHOR NAME | |
Personal name | Klein, Shmuel Tomi |
245 ## - TITLE STATEMENT | |
Title | Basic concepts in algorithms |
Statement of responsibility, etc | Shmuel Tomi Klein |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Name of publisher | World Scientific |
Year of publication | 2024 |
Place of publication | Chennai |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | xix, 343p |
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 | Algorithms |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | Books |
Withdrawn status | Lost status | Damaged status | Not for loan | Collection code | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Cost, replacement price | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
General Stacks | PK Kelkar Library, IIT Kanpur | PK Kelkar Library, IIT Kanpur | 14/10/2024 | 2 | 1596.00 | 518.1 K672b | A186523 | 1995.00 | Books |