MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03558nam a2200349 a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
WSP |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20210706120458.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
120727s2012 si a sb 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9789814401166 (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| Cancelled/invalid ISBN |
9814401153 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| Cancelled/invalid ISBN |
9789814401159 |
| 041 ## - LANGUAGE CODE |
|---|
| Language |
English |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
518 |
| Item number |
SOL |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (OCLC) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA9.58 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
S658 2012 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Soltys, Michael. |
| 245 13 - TITLE STATEMENT |
|---|
| Title |
An introduction to the analysis of algorithms |
| Statement of responsibility, etc |
Michael Soltys. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Singapore ; |
| -- |
Hackensack, N.J. : |
| Name of publisher, distributor, etc |
World Scientific Pub. Co., |
| Date of publication, distribution, etc |
c2012. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource (xiii, 197 p.) : |
| Other physical details |
ill. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Contents |
1. Preliminaries. 1.1. Induction. 1.2. Invariance. 1.3. Correctness of algorithms. 1.4. Stable marriage. 1.5. Answers to selected problems. 1.6. Notes -- 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. Further examples and problems. 2.4. Answers to selected problems. 2.5. Notes -- 3. Divide and conquer. 3.1. Mergesort. 3.2. Multiplying numbers in binary. 3.3. Savitch's algorithm. 3.4. Further examples and exercises. 3.5. Answers to selected problems. 3.6. Notes -- 4. Dynamic programming. 4.1. Longest monotone subsequence problem. 4.2. All pairs shortest path problem. 4.3. Simple knapsack problem. 4.4. Activity selection problem. 4.5. Jobs with deadlines, durations and profits. 4.6. Further examples and problems. 4.7. Answers to selected problems. 4.8. Notes -- 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. Answers to selected problems. 5.4. Notes -- 6. Randomized algorithms. 6.1. Perfect matching. 6.2. Pattern matching. 6.3. Primality testing. 6.4. Public key cryptography. 6.5. Further exercises. 6.6. Answers to selected problems. 6.7. Notes. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms. Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms - with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions. While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book's website. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
General Books |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references (p. 187-189) and index. |
| 506 ## - RESTRICTIONS ON ACCESS NOTE |
|---|
| Terms governing access |
Online version restricted to NUS staff and students only through NUSNET. |
| 538 ## - SYSTEM DETAILS NOTE |
|---|
| System details note |
Mode of access: World Wide Web. |
| 538 ## - SYSTEM DETAILS NOTE |
|---|
| System details note |
System requirements: Internet connectivity; World Wide Web browser. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
World Scientific (Firm) |
| 776 1# - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| International Standard Book Number |
9814401153. |
| 776 1# - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| International Standard Book Number |
9789814401159. |
| 956 40 - LOCAL ELECTRONIC LOCATION AND ACCESS (OCLC) |
|---|
| Uniform Resource Identifier |
<a href="http://libproxy1.nus.edu.sg/login?url=http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc">http://libproxy1.nus.edu.sg/login?url=http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc</a> |
