Data structures and algorithm analysis in Java / (Record no. 11287)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03089cam a22002414a 4500 |
| 001 - CONTROL NUMBER | |
| control field | 14164534 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200617083034.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 051103s2007 maua b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0321370139 (alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788131760635 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | DLC |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.133 |
| Edition number | 22 |
| Item number | W4291 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Weiss, Mark Allen. |
| 245 10 - TITLE STATEMENT | |
| Title | Data structures and algorithm analysis in Java / |
| Statement of responsibility, etc | Mark Allen Weiss. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | New Delhi : |
| Name of publisher, distributor, etc | Peason , |
| Date of publication, distribution, etc | 2011 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xviii, 555 p. : |
| Other physical details | ill. ; |
| Dimensions | 25 cm. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Java (Computer program language) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data structures (Computer science) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Books |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Chapter 1 Introduction1.1 What's the Book About?1.2 Mathematics Review1.3 A Brief Introduction to Recursion 1.4 Implementing Generic Components Pre Java 5 1.5 Implementing Generic Components Using Java 5 Generics1.6 Function Objects Chapter 2 Algorithm Analysis 2.1 Mathematical Background 2.2 Model 2.3 What to Analyze 2.4 Running Time Calculations Chapter 3 Lists, Stacks, and Queues 3.1 Abstract Data Types (ADTs) 3.2 The List ADT 3.3 Lists in the Java Collections API 3.4 Implementation of ArrayList 3.5 Implementation of LinkedList 3.6 The Stack ADT 3.7 The Queue ADT Chapter 4 Trees 4.1 Preliminaries 4.2 Binary Trees 4.3 The Search Tree ADT-Binary Search Trees 4.4 AVL Trees 4.5 Splay Trees 4.6 Tree Traversals (Revisited) 4.7 B-Trees 4.8 Sets and Maps in the Standard Library 4.9 Summary Chapter 5 Hashing 5.1 General Idea 5.2 Hash Function 5.3 Separate Chaining 5.4 Hash Tables Without Linked Lists 5.5 Rehashing 5.6 Hash Tables in the Standard Library 5.7 Extendible Hashing Chapter 6 Priority Queues (Heaps) 6.1 Model 6.2 Simple Implementations 6.3 Binary Heap 6.4 Applications of Priority Queues 6.5 d-Heaps 6.6 Leftist Heaps 6.7 Skew Heaps 6.8 Binomial Queues6.9 Priority Queues in the Standard Library Chapter 7 Sorting 7.1 Preliminaries 7.2 Insertion Sort 7.3 A Lower Bound for Simple Sorting Algorithms 7.4 Shellsort 7.5 Heapsort 7.6 Mergesort 7.7 Quicksort 7.8 A General Lower Bound for Sorting 7.9 Bucket Sort 7.10 External Sorting Chapter 8 The Disjoint Set Class 8.1 Equivalence Relations 8.2 The Dynamic Equivalence Problem 8.3 Basic Data Structure 8.4 Smart Union Algorithms 8.5 Path Compression 8.6 Worst Case for Union-by-Rank and Path Compression 8.7 An Application Chapter 9 Graph Algorithms 9.1 Definitions 9.2 Topological Sort 9.3 Shortest-Path Algorithms 9.4 Network Flow Problems 9.5 Minimum Spanning Tree 9.6 Applications of Depth-First Search 9.7 Introduction to NP-Completeness Chapter 10 Algorithm Design Techniques 10.1 Greedy Algorithms 10.2 Divide and Conquer 10.3 Dynamic Programming 10.4 Randomized Algorithms 10.5 Backtracking Algorithms Chapter 11 Amortized Analysis 11.1 An Unrelated Puzzle 11.2 Binomial Queues 11.3 Skew Heaps 11.4 Fibonacci Heaps 11.5 Splay Trees Chapter 12 Advanced Data Structures and Implementation12.1 Top-Down Splay Trees 12.2 Red-Black Trees 12.3 Deterministic Skip Lists 12.4 AA-Trees 12.5 Treaps 12.6 k-d Trees 12.7 Pairing Heaps |
| Withdrawn status | Damaged status | Not for loan | Home library | Current library | Date acquired | Source of acquisition | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| UE-Central Library | UE-Central Library | 23.10.2018 | U.E.25479 | 005.133 W4291 | T10401 | 23.10.2018 | 23.10.2018 | Books | |||
| UE-Central Library | UE-Central Library | 23.10.2018 | U.E.25483 | 005.133 W4291 | T10405 | 17.02.2020 | 23.10.2018 | Books | |||
| UE-Central Library | UE-Central Library | 23.10.2018 | U.E.25482 | 005.133 W4291 | T10404 | 23.10.2018 | 23.10.2018 | Books | |||
| UE-Central Library | UE-Central Library | 23.10.2018 | U.E.25480 | 005.133 W4291 | T10402 | 23.10.2018 | 23.10.2018 | Books | |||
| UE-Central Library | UE-Central Library | 23.10.2018 | U.E.25481 | 005.133 W4291 | T10403 | 23.10.2018 | 23.10.2018 | Books |
