Data structures and algorithms in Java:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley
2011
|
| Ausgabe: | 5. ed., internat. student version |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXII, 710 S. graph. Darst. |
| ISBN: | 9780470398807 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036107452 | ||
| 003 | DE-604 | ||
| 005 | 20170724 | ||
| 007 | t | ||
| 008 | 100406s2011 d||| |||| 00||| eng d | ||
| 020 | |a 9780470398807 |9 978-0-470-39880-7 | ||
| 035 | |a (OCoLC)629876888 | ||
| 035 | |a (DE-599)BVBBV036107452 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-526 |a DE-92 |a DE-473 |a DE-29T |a DE-11 |a DE-1050 |a DE-703 |a DE-188 |a DE-83 |a DE-2070s | ||
| 050 | 0 | |a QA76.73.J38 | |
| 082 | 0 | |a 005.133 |2 22 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 455f |2 stub | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a DAT 362f |2 stub | ||
| 100 | 1 | |a Goodrich, Michael T. |d 1961- |e Verfasser |0 (DE-588)121131181 |4 aut | |
| 245 | 1 | 0 | |a Data structures and algorithms in Java |c Michael T. Goodrich ; Roberto Tamassia |
| 250 | |a 5. ed., internat. student version | ||
| 264 | 1 | |a Hoboken, NJ |b Wiley |c 2011 | |
| 300 | |a XXII, 710 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Java (Computer program language) | |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |D s |
| 689 | 0 | 1 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Tamassia, Roberto |d 1960- |e Verfasser |0 (DE-588)141557834 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018997695&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018997695 | ||
Datensatz im Suchindex
| _version_ | 1804141180808593408 |
|---|---|
| adam_text | .Contents
Java Programming Basics
1
1.1
Getting Started: Classes, Types, and Objects
........ 2
1.1.1
Base Types
........................ 5
1.1.2
Objects
.......................... 7
1.1.3
Enum Types
........................ 14
1.2
Methods
............................. 15
1.3
Expressions
............................ 20
1.3.1
Literals
........................... 20
1.3.2
Operators
......................... 21
1.3.3
Casting and Autoboxing/Unboxing in Expressions
.... 25
1.4
Control Flow
........................... 27
1.4.1
The If and Switch Statements
.............. 27
1.4.2
Loops
........................... 29
1.4.3
Explicit Control-Flow Statements
............. 32
1.5
Arrays
............................... 34
1.5.1
Declaring Arrays
...................... 36
1.5.2
Arrays are Objects
..................... 37
1.6
Simple Input and Output
.................... 39
1.7
An Example Program
...................... 42
1.8
Nested Classes and Packages
................. 45
1.9
Writing a Java Program
.................... 47
1.9.1
Design
........................... 47
1.9.2
Pseudo-Code
....................... 48
1.9.3
Coding
........................... 49
1.9.4
Testing and Debugging
.................. 53
1.10
Exercises
............................. 55
Object-Oriented Design
57
2.1
Goals, Principles, and Patterns
................ 58
2.1.1
Object-Oriented Design Goals
.............. 58
2.1.2
Object-Oriented Design Principles
............ 59
2.1.3
Design Patterns
...................... 62
XV
xvi Contents
2.2
Inheritance and Polymorphism
................. 63
2.2.1
Inheritance
......................... 63
2.2.2
Polymorphism
....................... 65
2.2.3
Using Inheritance in Java
................. 66
2.3
Exceptions
............................ 76
2.3.1
Throwing Exceptions
................... 76
2.3.2
Catching Exceptions
.................... 78
2.4
Interfaces and Abstract Classes
................ 80
2.4.1
Implementing Interfaces
.................. 80
2.4.2
Multiple Inheritance in Interfaces
............. 83
2.4.3
Abstract Classes and Strong Typing
........... 84
2.5
Casting and Generics
...................... 85
2.5.1
Casting
.......................... 85
2.5.2
Generics
.......................... 89
2.6
Exercises
............................. 91
3
Arrays, Linked Lists, and Recursion
95
3.1
Using Arrays
........................... 96
3.1.1
Storing Game Entries in an Array
............. 96
3.1.2
Sorting an Array
...................... 103
3.1.3
java.util
Methods for Arrays and Random Numbers
. . . 106
3.1.4
Simple Cryptography with Strings and Character Arrays
. 109
3.1.5
Two-Dimensional Arrays and Positional Games
..... 112
3.2
Singly Linked Lists
........................ 117
3.2.1
Insertion in a Singly Linked List
............. 119
3.2.2
Removing an Element in a Singly Linked List
...... 121
3.3
Doubly Linked Lists
....................... 122
3.3.1
Insertion in the Middle of a Doubly Linked List
..... 125
3.3.2
Removal in the Middle of a Doubly Linked List
..... 126
3.3.3
An Implementation of a Doubly Linked List
....... 127
3.4
Circularly Linked Lists and Linked-List Sorting
........ 130
3.4.1
Circularly Linked Lists and Duck, Duck, Goose
..... 130
3.4.2
Sorting a Linked List
................... 135
3.5
Recursion
............................. 136
3.5.1
Linear Recursion
...................... 142
3.5.2
Binary Recursion
..................... 146
3.5.3
Multiple Recursion
.................... 149
3.6
Exercises
............................. 151
Contents xvii
4
Mathematical Foundations
157
4.1
The Seven Functions Used in This Book
........... 158
4.1.1
The Constant Function
.................. 158
4.1.2
The Logarithm Function
................. 158
4.1.3
The Linear Function
.................... 160
4.1.4
The N-Log-N Function
.................. 160
4.1.5
The Quadratic Function
.................. 160
4.1.6
The Cubic Function and Other Polynomials
....... 162
4.1.7
The Exponential Function
................. 163
4.1.8
Comparing Growth Rates
................. 165
4.2
Analysis of Algorithms
..................... 166
4.2.1
Experimental Studies
................... 167
4.2.2
Primitive Operations
................... 168
4.2.3
Asymptotic Notation
................... 170
4.2.4
Asymptotic Analysis
.................... 174
4.2.5
Using the Big-Oh Notation
................ 176
4.2.6
A Recursive Algorithm for Computing Powers
...... 180
4.2.7
Some More Examples of Algorithm Analysis
....... 181
4.3
Simple Justification Techniques
................ 185
4.3.1
By Example
........................ 185
4.3.2
The Contra Attack
................... 185
4.3.3
Induction and Loop Invariants
.............. 186
4.4
Exercises
............................. 189
5
Stacks and Queues
197
5.1
Stacks
............................... 198
5.1.1
The Stack Abstract Data Type
.............. 199
5.1.2
A Simple Array-Based Stack Implementation
...... 202
5.1.3
Implementing a Stack with a Generic Linked List
.... 207
5.1.4
Reversing an Array Using a Stack
............ 209
5.1.5
Matching Parentheses and HTML Tags
......... 210
5.2
Queues
.............................. 214
5.2.1
The Queue Abstract Data Type
............. 214
5.2.2
A Simple Array-Based Queue Implementation
...... 217
5.2.3
Implementing a Queue with a Generic Linked List
.... 220
5.2.4
Round Robin Schedulers
................. 221
5.3
Double-Ended Queues
...................... 223
5.3.1
The Deque Abstract Data Type
............. 223
5.3.2
Implementing a Deque
.................. 224
5.3.3
Deques in the Java Collections Framework
........ 227
5.4
Exercises
............................. 228
xviii Contents
6
List Abstractions
233
6.1
Array Lists
............................234
6.1.1
The Array List Abstract Data Type
............ 234
6.1.2
The Adapter Pattern
................... 235
6.1.3
A Simple Array-Based Implementation
.......... 236
6.1.4
A Simple Interface and the
java.util.
ArrayList Class
. . . 238
6.1.5
Implementing an Array List Using Extendable Arrays
. . 239
6.2
Node Lists
............................ 243
6.2.1
Node-Based Operations
.................. 243
6.2.2
Positions
.......................... 244
6.2.3
The Node List Abstract Data Type
............ 244
6.2.4
Doubly Linked List Implementation
............ 248
6.3
Iterators
.............................. 254
6.3.1
The Iterator and Iterable Abstract Data Types
...... 254
6.3.2
The Java For-Each Loop
................. 256
6.3.3
Implementing Iterators
.................. 257
6.3.4
List Iterators in Java
................... 259
6.4
List ADTs and the Collections Framework
.......... 260
6.4.1
Lists in the Java Collections Framework
.........260
6.4.2
Sequences
.........................264
6.5
Case Study: The Move-to-Front Heuristic
..........267
6.5.1
Using a Sorted List and a Nested Class
......... 267
6.5.2
Using a List with the Move-to-Front Heuristic
...... 270
6.5.3
Possible Uses of a Favorites List
............. 271
6.6
Exercises
............................. 274
7
Tree Structures
279
7.1
General Trees
...........................280
7.1.1
Tree Definitions and Properties
.............. 281
7.1.2
The Tree Abstract Data Type
.............. 284
7.1.3
Implementing a Tree
................... 285
7.2
Tree Traversal Algorithms
................... 287
7.2.1
Depth and Height
..................... 287
7.2.2
Preorder Traversal
..................... 290
7.2.3
Postorder
Traversal
.................... 293
7.3
Binary Trees
........................... 296
7.3.1
The Binary Tree ADT
................... 298
7.3.2
A Binary Tree Interface in Java
.............. 298
7.3.3
Properties of Binary Trees
................ 299
7.3.4
A Linked Structure for Binary Trees
........... 301
7.3.5
An Array-List Representation of a Binary Tree
...... 310
Contents xix
7.3.6
Traversals
of Binary Trees
................. 312
7.3.7
The Template Method Pattern
.............. 319
7.4
Exercises
............................. 323
8
Priority Queues
333
8.1
The Priority Queue Abstract Data Type
........... 334
8.1.1
Keys, Priorities, and Total Order Relations
........ 334
8.1.2
Entries and Comparators
................. 336
8.1.3
The Priority Queue ADT
................. 338
8.1.4
Sorting with a Priority Queue
............... 339
8.2
Implementing a Priority Queue with a List
.......... 340
8.2.1
A Java Priority Queue Implementation Using a List
. . . 341
8.2.2
Selection-Sort and Insertion-Sort
............. 344
8.3
Heaps
............................... 346
8.3.1
The Heap Data Structure
................. 346
8.3.2
Complete Binary Trees and Their Representation
.... 349
8.3.3
Implementing a Priority Queue with a Heap
....... 354
8.3.4
A Java Heap Implementation
............... 359
8.3.5
Heap-Sort
......................... 362
8.3.6
Bottom-Up Heap Construction ~k
............. 364
8.4
Adaptable Priority Queues
................... 368
8.4.1
Using the
java.util.PriorityQueue
Class
.......... 369
8.4.2
Location-Aware Entries
.................. 370
8.4.3
Implementing an Adaptable Priority Queue
....... 371
8.5
Exercises
............................. 374
9
Maps and Dictionaries
381
9.1
Maps
............................... 382
9.1.1
The Map ADT
...................... 383
9.1.2
A Simple List-Based Map Implementation
........ 385
9.2
Hash Tables
........................... 386
9.2.1
Bucket Arrays
....................... 386
9.2.2
Hash Functions
...................... 387
9.2.3
Hash Codes
........................ 388
9.2.4
Compression Functions
.................. 391
9.2.5
Collision-Handling Schemes
................ 393
9.2.6
A Java Hash Table Implementation
............ 397
9.2.7
Load Factors and Rehashing
............... 401
9.2.8
Application: Counting Word Frequencies
......... 402
9.3
Ordered Maps
.......................... 403
9.3.1
Ordered Search Tables and Binary Search
........ 404
9.3.2
Two Applications of Ordered Maps
............ 408
xx Contents
9.4
Skip Lists
.............................411
9.4.1
Search and Update Operations in a Skip List
......413
9.4.2
A Probabilistic Analysis of Skip Lists
*.........417
9.5
Dictionaries
............................420
9.5.1
The Dictionary ADT
................... 420
9.5.2
Implementations with Location-Aware Entries
...... 422
9.5.3
An Implementation Using the
java.util
Package
..... 423
9.6
Exercises
............................. 426
10
Search Tree Structures
431
10.1
Binary Search Trees
.......................432
10.1.1
Searching
......................... 433
10.1.2
Update Operations
.................... 435
10.1.3
Java Implementation
................... 439
10.2
AVL Trees
............................. 443
10.2.1
Update Operations
....................445
10.2.2
Java Implementation
...................451
10.3
Splay Trees
............................454
10.3.1
Splaying
.......................... 454
10.3.2
When to Splay
....................... 458
10.3.3
Amortized Analysis of Splaying
* ............ 460
10.4 (2,4)
Trees
............................ 465
10.4.1
Multi-Way Search Trees
..................465
10.4.2
Update Operations for
(2,4)
Trees
............471
10.5
Red-Black Trees
.........................477
10.5.1
Update Operations
....................479
10.5.2
Java Implementation
...................492
10.6
Exercises
.............................495
11
Sorting and Selection
501
11.1
Merge-Sort
............................502
11.1.1
Divide-and-Conquer
.................... 502
11.1.2
Merging Arrays and Lists
................. 507
11.1.3
The Running Time of Merge-Sort
............ 510
11.1.4
Java Implementations of Merge-Sort
........... 511
11.1.5
Merge-Sort and Recurrence Equations ~k
......... 514
11.2
Quick-Sort
............................ 515
11.2.1
Randomized Quick-Sort
..................522
11.2.2
Java Implementations and Optimizations
.........524
11.3
Studying Sorting through an Algorithmic Lens
.......527
11.3.1
A Lower Bound for Sorting
................527
11.3.2
Linear-Time Sorting: Bucket-Sort and Radix-Sort
.... 529
Contents xxi
11.3.3
Comparing Sorting Algorithms
.............. 532
11.4
Sets and Union/Find Structures
................ 534
11.4.1
The Set ADT
....................... 534
11.4.2
Mergeable Sets and the Template Method Pattern
. . . 535
11.4.3
Partitions with Union-Find Operations
.......... 539
11.5
Selection
............................. 543
11.5.1
Prune-and-Search
..................... 543
11.5.2
Randomized Quick-Select
................. 544
11.5.3
Analyzing Randomized Quick-Select
........... 545
11.6
Exercises
............................. 546
12
Text Processing
553
12.1
String Operations
........................ 554
12.1.1
The Java String Class
................... 555
12.1.2
The Java StringBuffer Class
............... 556
12.2
Dynamic Programming
..................... 557
12.2.1
Matrix Chain-Product
................... 557
12.2.2 DNA
and Text Sequence Alignment
........... 560
12.3
Pattern Matching Algorithms
................. 564
12.3.1
Brute Force
........................ 564
12.3.2
The Boyer-Moore Algorithm
............... 566
12.3.3
The Knuth-Morris-Pratt Algorithm
............ 570
12.4
Text Compression and the Greedy Method
......... 575
12.4.1
The Huffman Coding Algorithm
............. 576
12.4.2
The Greedy Method
.................... 577
12.5
Tries
................................ 578
12.5.1
Standard Tries
....................... 578
12.5.2
Compressed Tries
..................... 582
12.5.3
Suffix Tries
........................ 584
12.5.4
Search Engines
...................... 586
12.6
Exercises
............................. 587
13
Graphs
593
13.1
Graphs
............................... 594
13.1.1
The Graph ADT
...................... 599
13.2
Data Structures for Graphs
................... 600
13.2.1
The Edge List Structure
.................. 600
13.2.2
The Adjacency List Structure
............... 603
13.2.3
The Adjacency Matrix Structure
............. 605
13.3
Graph
Traversals
......................... 607
13.3.1
Depth-First Search
.................... 607
13.3.2
Implementing Depth-First Search
............. 611
xxii Contents
13.3.3
Breadth-First Search
...................619
13.4
Directed Graphs
.........................622
13.4.1
Traversing a Digraph
................... 624
13.4.2
Transitive Closure
..................... 626
13.4.3
Directed Acyclic Graphs
.................. 629
13.5
Shortest Paths
.......................... 633
13.5.1
Weighted Graphs
..................... 633
13.5.2
Dijkstra s
Algorithm
.................... 635
13.5.3
Implementations of
Dijkstra s
Algorithm
......... 641
13.6
Minimum Spanning Trees
.................... 644
13.6.1
Kruskal s Algorithm
....................646
13.6.2
The Prim-Jarnik Algorithm
................650
13.7
Exercises
.............................653
14
Memory
663
14.1
Memory Management
......................664
14.1.1
Stacks in the Java Virtual Machine
............ 664
14.1.2
Allocating Space in the Memory Heap
.......... 668
14.1.3
Garbage Collection
.................... 670
14.2
External Memory and Caching
................. 672
14.2.1
The Memory Hierarchy
..................672
14.2.2
Caching Strategies
....................673
14.3
External Searching and B-Trees
................678
14.3.1
(a,b) Trees
........................ 679
14.3.2
B-Trees
.......................... 681
14.4
External-Memory Sorting
.................... 682
14.4.1
Multi-way Merging
.................... 683
14.5
Exercises
............................. 684
A Useful Mathematical Facts
687
Bibliography
695
Index
701
|
| any_adam_object | 1 |
| author | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- |
| author_GND | (DE-588)121131181 (DE-588)141557834 |
| author_facet | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- |
| author_role | aut aut |
| author_sort | Goodrich, Michael T. 1961- |
| author_variant | m t g mt mtg r t rt |
| building | Verbundindex |
| bvnumber | BV036107452 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.J38 |
| callnumber-search | QA76.73.J38 |
| callnumber-sort | QA 276.73 J38 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 ST 250 |
| classification_tum | DAT 455f DAT 530f DAT 362f |
| ctrlnum | (OCoLC)629876888 (DE-599)BVBBV036107452 |
| dewey-full | 005.133 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.133 |
| dewey-search | 005.133 |
| dewey-sort | 15.133 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 5. ed., internat. student version |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01870nam a2200469 c 4500</leader><controlfield tag="001">BV036107452</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170724 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100406s2011 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470398807</subfield><subfield code="9">978-0-470-39880-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)629876888</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036107452</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-526</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-2070s</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.73.J38</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.133</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 455f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 362f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goodrich, Michael T.</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121131181</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and algorithms in Java</subfield><subfield code="c">Michael T. Goodrich ; Roberto Tamassia</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">5. ed., internat. student version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 710 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Java (Computer program language)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Java</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4401313-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Java</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4401313-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tamassia, Roberto</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141557834</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018997695&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018997695</subfield></datafield></record></collection> |
| id | DE-604.BV036107452 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:11:47Z |
| institution | BVB |
| isbn | 9780470398807 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018997695 |
| oclc_num | 629876888 |
| open_access_boolean | |
| owner | DE-526 DE-92 DE-473 DE-BY-UBG DE-29T DE-11 DE-1050 DE-703 DE-188 DE-83 DE-2070s |
| owner_facet | DE-526 DE-92 DE-473 DE-BY-UBG DE-29T DE-11 DE-1050 DE-703 DE-188 DE-83 DE-2070s |
| physical | XXII, 710 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Wiley |
| record_format | marc |
| spelling | Goodrich, Michael T. 1961- Verfasser (DE-588)121131181 aut Data structures and algorithms in Java Michael T. Goodrich ; Roberto Tamassia 5. ed., internat. student version Hoboken, NJ Wiley 2011 XXII, 710 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer algorithms Data structures (Computer science) Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd rswk-swf Java Programmiersprache (DE-588)4401313-9 gnd rswk-swf Java Programmiersprache (DE-588)4401313-9 s Datenstruktur (DE-588)4011146-5 s DE-604 Tamassia, Roberto 1960- Verfasser (DE-588)141557834 aut Digitalisierung UB Bamberg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018997695&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Data structures and algorithms in Java Computer algorithms Data structures (Computer science) Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4401313-9 |
| title | Data structures and algorithms in Java |
| title_auth | Data structures and algorithms in Java |
| title_exact_search | Data structures and algorithms in Java |
| title_full | Data structures and algorithms in Java Michael T. Goodrich ; Roberto Tamassia |
| title_fullStr | Data structures and algorithms in Java Michael T. Goodrich ; Roberto Tamassia |
| title_full_unstemmed | Data structures and algorithms in Java Michael T. Goodrich ; Roberto Tamassia |
| title_short | Data structures and algorithms in Java |
| title_sort | data structures and algorithms in java |
| topic | Computer algorithms Data structures (Computer science) Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd |
| topic_facet | Computer algorithms Data structures (Computer science) Java (Computer program language) Datenstruktur Java Programmiersprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018997695&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT goodrichmichaelt datastructuresandalgorithmsinjava AT tamassiaroberto datastructuresandalgorithmsinjava |