| 000 -LEADER |
|---|
| fixed length control field |
01848nam a2200241 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
vtls001890960 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
MY-SjTCS |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200226121330.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
110218t2000 mau 001 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0201612445 |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201909131539 |
| Level of effort used to assign nonsubject heading access points |
ummi |
| Level of effort used to assign subject headings |
201102181310 |
| Level of effort used to assign classification |
VLOAD |
| -- |
200407271915 |
| -- |
VLOAD |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
519.7 |
| Item number |
BAA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Baase, Sara. |
| 9 (RLIN) |
7462 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Computer algorithms : |
| Remainder of title |
introduction to design and analysis / |
| Statement of responsibility, etc. |
Sara Baase, Allen Van Gelder |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Reading, Mass. : |
| Name of publisher, distributor, etc. |
Addison-Wesley, |
| Date of publication, distribution, etc. |
c2000 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xix, 688 p. ; |
| Dimensions |
25 cm. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Preface. - 1. Analyzing Algorithms and Problems : Principles and Examples. - 2. Data Abstraction and Basic Data Structures. - 3. Recursion and Induction. - 4. Sorting. - 5. Selection and Adversary Arguments. - 6. Dynamic Sets and Searching. - 7. Graphs and Graph Traversals. - 8. Graph Optimization Problems and Greedy Algorithms. - 9. Transitive Closure, All-Pairs Shortest Paths. - 10. Dynamic Programming. - 11. String Matching. - 12. Polynomials and Matrices. - 13. NP-Complete Problems. - 14. Parallel Algorithms. - A. Java Examples and Techniques. - Bibliography. - Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This book is intended for an upper-division or graduate course in algorithms. It has sufficient material to allow several choices of topics. The purpose of the book is threefold. It is intended to teach algorithms for solving real problems that arise frequently in computer applications, to teach basic principles and techniques of computational complexity (worst-case and average behaviour, space usage, and lower bounds on the complexity of a problem), and to introduce the areas of NP-completeness and parallel algorithms. - Preface |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer algorithms. |
| 9 (RLIN) |
5494 |
| 700 2# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Van Gelder, Allen. |
| Relator term |
(j.a) |
| 9 (RLIN) |
102792 |
| 920 ## - Programme |
|---|
| Programme |
UOSC : 560433 |
| 999 ## - SYSTEM CONTROL NUMBERS (KOHA) |
|---|
| Koha biblionumber |
180945 |
| Koha biblioitemnumber |
180945 |
