MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03024nam a2200241Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20231207123107.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
140908s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781584886730 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
NISER LIBRARY |
| Transcribing agency |
NISER LIBRARY |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
English |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.421 |
| Item number |
LEI-P |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Leiss, Ernst L. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Programmer's companion to algorithm analysis |
| Statement of responsibility, etc. |
/ by Ernst L. Leiss |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc. |
Boca Raton: |
| Name of publisher, distributor, etc. |
Chapman & Hall/CRC, |
| Date of publication, distribution, etc. |
2007 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
255p. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes bibliography, and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
PART 1 THE ALGORITHM SIDE: REGULARITY, PREDICTABILITY, AND ASYMPTOTICS<br/>A Taxonomy of Algorithmic Complexity<br/>Fundamental Assumptions Underlying Algorithmic Complexity<br/>Examples of Complexity Analysis<br/>PART 2 THE SOFTWARE SIDE: DISAPPOINTMENTS AND HOW TO AVOID THEM<br/>Sources of Disappointments<br/>Implications of Nonuniform Memory for Software<br/>Implications of Compiler and Systems Issues for Software<br/>Implicit Assumptions<br/>Implications of the Finiteness of the Representation of Numbers<br/>Asymptotic Complexities and the Selection of Algorithms<br/>Infeasibility and Undecidability: Implications for Software Development<br/>PART 3 CONCLUSION<br/>Appendix I: Algorithms Every Programmer Should Know<br/>Appendix II: Overview of Systems Implicated in Program Analysis<br/>Appendix III: NP-Completeness and Higher Complexity Classes<br/>Appendix IV: Review of Undecidability<br/>BIBLIOGRAPHY<br/>INDEX |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Until now, no other book examined the gap between the theory of algorithms and the production of software programs. Focusing on practical issues, A Programmer's Companion to Algorithm Analysis carefully details the transition from the design and analysis of an algorithm to the resulting software program.<br/><br/>Consisting of two main complementary parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms.<br/><br/>Applying the theory of algorithms to the production of software, A Programmer's Companion to Algorithm Analysis fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Programming (Mathematics) |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Algorithms |
| General subdivision |
Data processing |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Book |
| Source of classification or shelving scheme |
Universal Decimal Classification |
