Data structures and algorithms with object-oriented design patterns in Java / (Record no. 6880)

MARC details
000 -LEADER
fixed length control field 05843cam a22002414a 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780471346135
Terms of availability NA
040 ## - CATALOGING SOURCE
Original cataloging agency MUL
Language of cataloging eng.
Description conventions AACR
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.73 PRE
100 1# - MAIN ENTRY--AUTHOR NAME
Personal name Preiss, Bruno R.
245 10 - TITLE STATEMENT
Title Data structures and algorithms with object-oriented design patterns in Java /
Statement of responsibility, etc Bruno R. Preiss.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication New York :
Name of publisher John Wiley,
Year of publication c2000.
300 ## - PHYSICAL DESCRIPTION
Number of Pages xvii, 635 p. :
Other physical details ill. (some col.) ;
Dimensions 25 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references (p. 624-626) and index.
505 ## - Formatted Contents
Formatted contents note CHAPTER 1 INTRODUCTION<br/> 1 (5)<br/> 1.1 What This Book Is About<br/> 1 (1)<br/> 1.2 Object-Oriented Design<br/> 1 (1)<br/> 1.3 Object Hierarchies and Design Patterns<br/> 2 (1)<br/> 1.4 The Features of Java You Need to Know<br/> 3 (1)<br/> 1.5 How This Book Is Organized<br/> 4 (2)<br/> CHAPTER 2 Algorithm Analysis<br/> 6 (29)<br/> 2.1 A Detailed Model of the Computer<br/> 7 (15)<br/> 2.2 A Simplified Model of the Computer<br/> 22 (10)<br/> Exercises<br/> 32 (1)<br/> Programming Projects<br/> 33 (2)<br/> CHAPTER 3 Asymptotic Notation<br/> 35 (32)<br/> 3.1 An Asymptotic Upper Bound--Big Oh<br/> 35 (12)<br/> 3.2 An Asymptotic Lower Bound--Omega<br/> 47 (3)<br/> 3.3 More Notation--Theta and Little Oh<br/> 50 (1)<br/> 3.4 Asymptotic Analysis of Algorithms<br/> 50 (13)<br/> Exercises<br/> 63 (3)<br/> Programming Projects<br/> 66 (1)<br/> CHAPTER 4 Foundational Data Structures<br/> 67 (28)<br/> 4.1 Arrays<br/> 67 (7)<br/> 4.2 Multi-Dimensional Arrays<br/> 74 (7)<br/> 4.3 Singly-Linked Lists<br/> 81 (11)<br/> Exercises<br/> 92 (1)<br/> Programming Projects<br/> 93 (2)<br/> CHAPTER 5 Data Types and Abstraction<br/> 95 (25)<br/> 5.1 Abstract Data Types<br/> 95 (2)<br/> 5.2 Design Patterns<br/> 97 (19)<br/> Exercises<br/> 116 (2)<br/> Programming Projects<br/> 118 (2)<br/> CHAPTER 6 Stacks, Queues and Deques<br/> 120 (35)<br/> 6.1 Stacks<br/> 120 (15)<br/> 6.2 Queues<br/> 135 (10)<br/> 6.3 Deques<br/> 145 (6)<br/> Exercises<br/> 151 (1)<br/> Programming Projects<br/> 152 (3)<br/> CHAPTER 7 Ordered Lists and Sorted Lists<br/> 155 (39)<br/> 7.1 Ordered Lists<br/> 155 (24)<br/> 7.2 Sorted Lists<br/> 179 (12)<br/> Exercises<br/> 191 (2)<br/> Programming Projects<br/> 193 (1)<br/> CHAPTER 8 Hashing, Hash Tables, and Scatter Tables<br/> 194 (53)<br/> 8.1 Hashing--The Basic Idea<br/> 194 (3)<br/> 8.2 Hashing Methods<br/> 197 (4)<br/> 8.3 Hash Function Implementations<br/> 201 (10)<br/> 8.4 Hash Tables<br/> 211 (7)<br/> 8.5 Scatter Tables<br/> 218 (9)<br/> 8.6 Scatter Table Using Open Addressing<br/> 227 (14)<br/> 8.7 Applications<br/> 241 (3)<br/> Exercises<br/> 244 (2)<br/> Programming Projects<br/> 246 (1)<br/> CHAPTER 9 Trees<br/> 247 (45)<br/> 9.1 Basics<br/> 248 (3)<br/> 9.2 N-ary Trees<br/> 251 (3)<br/> 9.3 Binary Trees<br/> 254 (2)<br/> 9.4 Tree Traversals<br/> 256 (2)<br/> 9.5 Expression Trees<br/> 258 (3)<br/> 9.6 Implementing Trees<br/> 261 (27)<br/> Exercises<br/> 288 (2)<br/> Programming Projects<br/> 290 (2)<br/> CHAPTER 10 Search Trees<br/> 292 (55)<br/> 10.1 Basics<br/> 292 (2)<br/> 10.2 Searching a Search Tree<br/> 294 (2)<br/> 10.3 Average Case Analysis<br/> 296 (6)<br/> 10.4 Implementing Search Trees<br/> 302 (6)<br/> 10.5 AVL Search Trees<br/> 308 (13)<br/> 10.6 M-Way Search Trees<br/> 321 (10)<br/> 10.7 B-Trees<br/> 331 (11)<br/> 10.8 Applications<br/> 342 (1)<br/> Exercises<br/> 343 (2)<br/> Programming Projects<br/> 345 (2)<br/> CHAPTER 11 Heaps and Priority Queues<br/> 347 (44)<br/> 11.1 Basics<br/> 348 (1)<br/> 11.2 Binary Heaps<br/> 349 (10)<br/> 11.3 Leftist Heaps<br/> 359 (9)<br/> 11.4 Binomial Queues<br/> 368 (15)<br/> 11.5 Applications<br/> 383 (4)<br/> Exercises<br/> 387 (2)<br/> Programming Projects<br/> 389 (2)<br/> CHAPTER 12 Sets, Multisets, and Partitions<br/> 391 (36)<br/> 12.1 Basics<br/> 391 (1)<br/> 12.2 Array and Bit-Vector Sets<br/> 392 (9)<br/> 12.3 Multisets<br/> 401 (9)<br/> 12.4 Partitions<br/> 410 (12)<br/> 12.5 Applications<br/> 422 (2)<br/> Exercises<br/> 424 (2)<br/> Programming Projects<br/> 426 (1)<br/> CHAPTER 13 Garbage Collection<br/> 427 (19)<br/> 13.1 What Is Garbage?<br/> 428 (2)<br/> 13.2 Reference Counting Garbage Collection<br/> 430 (4)<br/> 13.3 Mark-and-Sweep Garbage Collection<br/> 434 (3)<br/> 13.4 Stop-and-Copy Garbage Collection<br/> 437 (2)<br/> 13.5 Mark-and-Compact Garbage Collection<br/> 439 (4)<br/> Exercises<br/> 443 (1)<br/> Programming Projects<br/> 443 (3)<br/> CHAPTER 14 Algorithmic Patterns and Problem Solvers<br/> 446 (45)<br/> 14.1 Brute-Force and Greedy Algorithms<br/> 446 (4)<br/> 14.2 Backtracking Algorithms<br/> 450 (9)<br/> 14.3 Top-Down Algorithms: Divide and Conquer<br/> 459 (10)<br/> 14.4 Bottom-Up Algorithms: Dynamic Programming<br/> 469 (8)<br/> 14.5 Randomized Algorithms<br/> 477 (10)<br/> Exercises<br/> 487 (2)<br/> Programming Projects<br/> 489 (2)<br/> CHAPTER 15 Sorting Algorithms and Sorters<br/> 491 (47)<br/> 15.1 Basics<br/> 491 (1)<br/> 15.2 Sorting and Sorters<br/> 492 (2)<br/> 15.3 Insertion Sorting<br/> 494 (5)<br/> 15.4 Exchange Sorting<br/> 499 (11)<br/> 15.5 Selection Sorting<br/> 510 (9)<br/> 15.6 Merge Sorting<br/> 519 (5)<br/> 15.7 A Lower Bound on Sorting<br/> 524 (2)<br/> 15.8 Distribution Sorting<br/> 526 (6)<br/> 15.9 Performance Data<br/> 532 (3)<br/> Exercises<br/> 535 (2)<br/> Programming Projects<br/> 537 (1)<br/> CHAPTER 16 Graphs and Graph Algorithms<br/> 538 (61)<br/> 16.1 Basics<br/> 539 (8)<br/> 16.2 Implementing Graphs<br/> 547 (9)<br/> 16.3 Graph Traversals<br/> 556 (14)<br/> 16.4 Shortest-Path Algorithms<br/> 570 (10)<br/> 16.5 Minimum-Cost Spanning Trees<br/> 580 (9)<br/> 16.6 Application: Critical Path Analysis<br/> 589 (5)<br/> Exercises<br/> 594 (3)<br/> Programming Projects<br/> 597 (2)<br/>APPENDIX A Java and Object-Oriented Programming 599 (22)<br/>A.1 Variables 599 (2)<br/>A.2 Parameter Passing 601 (3)<br/>A.3 Objects and Classes 604 (5)<br/>A.4 Inner Classes 609 (1)<br/>A.5 Inheritance and Polymorphism 610 (9)<br/>A.6 Exceptions 619 (2)<br/>APPENDIX B Class Hierarchy Diagrams 621 (2)<br/>APPENDIX C Character Codes 623 (2)<br/>Bibliography 625 (2)<br/>Index 627
546 ## - LANGUAGE NOTE
Language note eng.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Object-oriented programming (Computer science)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data structures (Computer science)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer algorithms.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://www.loc.gov/catdir/bios/wiley041/99021792.html
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://www.loc.gov/catdir/description/wiley031/99021792.html
856 4# - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://www.loc.gov/catdir/toc/onix01/99021792.html
942 ## - ADDED ENTRY ELEMENTS
Item type Book
Holdings
Withdrawn status Lost status Damaged status Not for loan Permanent Location Current Location Date acquired Source of acquisition Full call number Accession Number Copy number Price effective from Koha item type
        Mzumbe University Main Campus Library Mzumbe University Main Campus Library 12/12/2003 Donated by Agder 005.73 PRE 0047967 1 12/12/2022 Book

Mzumbe University Library
©2022