| 000 -LEADER |
|---|
| fixed length control field |
01379 a2200277 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
Nust |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20170207154019.0 |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2009008593 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0262033844 (hardcover : alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0262533057 (pbk. : alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780262033848 (hardcover : alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780262533058 (pbk. : alk. paper) |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)ocn311310321 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
Nust |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Cormen, Thomas H. |
| 245 00 - TITLE STATEMENT |
|---|
| Title |
Introduction to algorithms (Instructor's manual) - (E-BOOK) |
| Statement of responsibility, etc. |
Thomas H. Cormen ... [et al.]. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Cambridge, Mass. : |
| Name of publisher, distributor, etc. |
MIT Press, |
| Date of publication, distribution, etc. |
c2009. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xix, 1292 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Revision History (Page-1), Getting Started (Page-25), Growth Of Functions (Page-45), Recurrences (Page-75),Probabilistic Analysis And Randomized Algorithms (Page-105), Quicksort (Page-125), Sorting In Linear Time (Page-144), Medians And Order Statistics (Page-170), Hash Tables (Page-188), Binary Search Trees (Page-205), Augmenting Data Structures (Page-240), Greedy Algorithms (Page-290), Data Structures For Disjoint Sets (Page-330), Elementary Graph Algorithms (Page-355),Minimum Spanning Trees (Page-380), Single-Source Shortest Paths (Page-410). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer programming. |
| 651 ## - SUBJECT ADDED ENTRY--GEOGRAPHIC NAME |
|---|
| Geographic name |
E-BOOK |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Cormen, Thomas H. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Koha item type |
Book |
