MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02949cam a2200265 a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
4928782 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230806134402.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
960304s1996 nyua b 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0070278938 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
BUL |
| Transcribing agency |
BUL |
| Modifying agency |
BUL |
| Language of cataloging |
eng |
| Description conventions |
rda |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.73 |
| Item number |
HET |
| Edition number |
22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Heileman, Gregory L. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Data structures, algorithms, and object-oriented programming / |
| Statement of responsibility, etc. |
Gregory L. Heileman. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
New York ; |
| -- |
St.louis |
| -- |
San francisco : |
| Name of publisher, distributor, etc. |
McGraw-Hill, |
| Date of publication, distribution, etc. |
c1996. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 446 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 440 #0 - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
McGraw-Hill series in computer science. |
| Name of part/section of a work |
Fundamentals of computing and programming |
| 500 ## - GENERAL NOTE |
|---|
| General note |
PART ONE : FUNDAMENTALS <br/>1 Background <br/>1.1 Abstract data types <br/>1.2 Pueudocode<br/>1.3 A model of computer memory <br/>Exercises <br/>Chapter notes<br/><br/>2 Algorithms <br/>2.1 Efficiency of algorithms <br/>2.2 Algorithmic analysis <br/>2.3 Algorithmic techniques<br/>Exercises <br/>Chapter notes <br/><br/>3 Data structure and C programs <br/>3,1 The pre-processor <br/>3.2 Variable and storage classes <br/>3.3 Pointers <br/>Exercises <br/>Chapter notes <br/>etc <br/><br/>4 Object oriented programming and C++<br/>4.1 Fundamental concepts <br/>4.2 The C++ programming and polymorphism <br/>4.3 A extended example : Matrix ADT implementation in C++<br/>Exercises <br/>Chapter notes <br/><br/>PART 11 BASIC DATA STRUCTURE <br/>5 Lists <br/>5.1 The list ADT<br/>5.2 Sequential mapping <br/>5.3 Linked lists <br/>Exercises <br/>Chapter notes <br/><br/>6 Stacks and Queues <br/>6.1 The stack and queue ADTs<br/>6.2 Stacks and expression evaluation <br/>6.3 Stacks and recursion <br/>Exercises <br/>Chapter notes <br/><br/>7. Binary search trees<br/>7.1 Definitions <br/>7.2 Dynamic set operation <br/>7.3 Binary search tree implementation <br/>Exercises<br/>Chapter notes <br/><br/>8. Hashing <br/>8.1 Hash tables<br/>8.2 Hash functions <br/>8.3 Collision resolution strategies <br/>Exercises <br/>Chapter notes <br/><br/>9 Priority queues <br/>9.1 The priority queues ADT<br/>9.2 Balanced trees<br/>9.3 Binary heaps <br/>Exercises <br/>Chapter notes<br/><br/>PART THREE : ADVANCEED DATA STRUCTURE <br/>10 Amortized analysis <br/>10.1 An overview<br/>10.2 Accounting method <br/>10.3 Potential method <br/>Exercises <br/>Chapter notes <br/><br/>11, Balanced search trees <br/>11.1 Rotation <br/>11.2 AVL trees <br/>11.3 Red balck trees <br/>Exercises <br/>Chapter notes <br/><br/>12 : Heaps <br/>12.1 Meldable priority queue ADT <br/>12.2 Non amortized data structure <br/>12.3 Amortized data structure <br/>Exercises <br/>Chapter notes <br/><br/>13 Dynamic sets special operations <br/>13.1 Range searching <br/>13.2 Multidimentianal searching <br/>13.3 The disjoint set ADT <br/>13.4 An extended example <br/><br/>14 Graphs <br/>14.1 Graph problems <br/>14.2 Graph representation <br/>14.3 Basic search techniques <br/>Exercises <br/>Chapter notes <br/><br/> |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical : p.433-438 and index : p.439-446 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Data structures (Computer science) |
| 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 |
Object-oriented programming (Computer science) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Book Closed Access |
| Classification part |
005.73 |
| Item part |
1 |
| Call number prefix |
HEI |
| Call number suffix |
005.73 HEI |
