Verfügbarkeit: Data structures and algorithms in Java

Data structures and algorithms in Java: [exclusive to this version: revised problem sets, concise coverage, section on range search trees]

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Goodrich, Michael T. 1961- (VerfasserIn), Tamassia, Roberto 1960- (VerfasserIn), Goldwasser, Michael H. 1969- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Singapore [u.a.] Wiley 2015
Ausgabe:	6. ed., internat. student version
Schlagwörter:	Java > Programmiersprache Datenstruktur
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027465065&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XVIII, 699 S. Ill., graph. Darst.
ISBN:	9781118808573

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV042023445
003	DE-604
005	20150709
007	t\|
008	140813s2015 xx ad\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9781118808573 \|c pbk. \|9 978-1-118-80857-3
020			\|z 1118808576 \|9 1118808576
035			\|a (OCoLC)889723753
035			\|a (DE-599)BVBBV042023445
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-91G \|a DE-739 \|a DE-573 \|a DE-188 \|a DE-1051
082	0		\|a 005.73 \|2 23
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a ST 250 \|0 (DE-625)143626: \|2 rvk
084			\|a DAT 362f \|2 stub
084			\|a DAT 455f \|2 stub
084			\|a DAT 530f \|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 \|b [exclusive to this version: revised problem sets, concise coverage, section on range search trees] \|c Michael T. Goodrich ; Roberto Tamassia ; Michael H. Goldwasser
250			\|a 6. ed., internat. student version
264		1	\|a Singapore [u.a.] \|b Wiley \|c 2015
300			\|a XVIII, 699 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Java \|g Programmiersprache \|0 (DE-588)4401313-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|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
700	1		\|a Goldwasser, Michael H. \|d 1969- \|e Verfasser \|0 (DE-588)133831086 \|4 aut
856	4	2	\|m Digitalisierung UB Passau - ADAM Catalogue Enrichment \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027465065&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-027465065

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 455f 2005 A 9211(6)
DE-BY-TUM_katkey	2019462
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040080106503 040080106490
_version_	1821933882049560577
adam_text	Contents Java Programming Basics 1 1.1 Preliminaries............................... 2 1.1.1 Base Types ............................ 4 1.2 Objects and Classes ........................... 5 1.2.1 Creating and Using Objects .................... 6 1.2.2 Defining a Class .......................... 9 1.3 Special Types ............................... 17 1.4 Java Expressions ............................. 23 1.4.1 Literals ............................... 23 1.4.2 Operators ............................. 24 1.4.3 Type Conversions ......................... 28 1.5 Control Flow ............................... 30 1.5.1 The If and Switch Statements .................. 30 1.5.2 Loops ............................... 32 1.5.3 Explicit Control-Flow Statements ................. 36 1.6 Input and Output ............................ 37 1.7 Java Packages .............................. 40 1.8 Writing a Java Program ........................ 42 1.8.1 Design ............................... 42 1.8.2 Pseudocode ............................ 44 1.8.3 Coding ............................... 45 1.8.4 Documentation and Style ..................... 46 1.8.5 Testing and Debugging ...................... 49 1.9 Exercises ................................. 51 Object-Oriented Design 53 2.1 Goals, Principles, and Patterns .................... 54 2.1.1 Object-Oriented Design Goals .................. 54 2.1.2 Object-Oriented Design Principles ................ 55 2.1.3 Design Patterns .......................... 57 2.2 Inheritance ................................ 58 2.2.1 Extending the CreditCard Class .................. 59 2.2.2 Polymorphism and Dynamic Dispatch .............. 62 2.2.3 Inheritance Hierarchies ...................... 63 2.3 Interfaces and Abstract Classes .................... 68 2.3.1 Interfaces in Java ......................... 68 2.3.2 Multiple Inheritance for Interfaces ................ 71 2.3.3 Abstract Classes .......................... 72 2.4 Exceptions ................................ 74 2.4.1 Catching Exceptions ........................ 74 2.4.2 Throwing Exceptions ....................... 77 2.4.3 Java s Exception Hierarchy .................... 78 2.5 Casting and Generics .......................... 80 2.5.1 Casting .............................. 80 . ■ XII Contents хш 2.5.2 Generics.............................. 83 2.6 Nested Classes .............................. 88 2.7 Exercises ................................. 89 3 Arrays and Linked Lists 93 3.1 Practical Uses of Arrays ........................ 94 3.1.1 Storing Game Entries in an Array ................. 94 3.1.2 Sorting an Array .......................... 100 3.1.3 java.util Methods for Arrays and Random Numbers ....... 102 3.1.4 Simple Cryptography with Strings and Character Arrays ..... 104 3.1.5 Two-Dimensional Arrays and Positional Games ......... 107 3.2 Singly Linked Lists ............................ Ill 3.2.1 Implementing a Singly Linked List Class ............. 115 3.3 Circularly Linked Lists .......................... 117 3.3.1 Round-Robin Scheduling ..................... 117 3.3.2 Designing and Implementing a Circularly Linked List ...... 118 3.4 Doubly Linked Lists ........................... 121 3.4.1 Implementing a Doubly Linked List Class ............ 124 3.5 Testing for Equality ........................... 127 3.5.1 Equivalence Testing with Arrays ................. 128 3.5.2 Equivalence Testing with Linked Lists .............. 129 3.6 Copying Data Structures ........................ 130 3.6.1 Cloning Arrays ........................... 131 3.6.2 Cloning Linked Lists ........................ 133 3.7 Exercises ................................. 134 4 Analysis Tools 137 4.1 Empirical Analysis ............................ 139 4.1.1 Moving Beyond Experimental Analysis .............. 142 4.2 Common Mathematical Functions ................... 144 4.2.1 Comparing Growth Rates ..................... 151 4.3 Big-Oh Notation ............................. 152 4.3.1 Defining the Big-Oh Notation ................. 152 4.3.2 Comparative Analysis ....................... 156 4.3.3 Examples of Algorithm Analysis ................. 158 4.4 Proof Methods .............................. 166 4.4.1 By Example ............................ 166 4.4.2 The Contra Attack ....................... 166 4.4.3 Induction and Loop Invariants .................. 167 4.5 Exercises ................................. 170 à Recursion lib 5.1 Foundations of Recursion ........................ 177 5.1.1 The Factorial Function ...................... 177 5.1.2 Drawing an English Ruler ..................... 179 5.1.3 Binary Search ........................... 182 5.1.4 File Systems ............................ 184 xiv Contents 5.2 Recursive Analysis ............................ 188 5.3 Applications of Recursion ........................ 192 5.3.1 Linear Recursion .......................... 192 5.3.2 Binary Recursion ......................... 197 5.3.3 Multiple Recursion ........................ 198 5.4 Using Recursion ............................. 200 5.5 Pitfalls of Recursion ........................... 201 5.5.1 Maximum Recursive Depth in Java ................ 204 5.6 Exercises ................................. 205 6 Stacks and Queues 207 6.1 Stacks ................................... 208 6.1.1 The Stack Abstract Data Type .................. 209 6.1.2 A Simple Array-Based Stack Implementation .......... 212 6.1.3 Implementing a Stack with a Singly Linked List ......... 215 6.1.4 Matching Parentheses and HTML Tags ............. 216 6.2 Queues .................................. 219 6.2.1 The Queue Abstract Data Type ................. 220 6.2.2 Array-Based Queue Implementation ............... 222 6.2.3 Implementing a Queue with a Singly Linked List ......... 226 6.2.4 A Circular Queue ......................... 227 6.3 Double-Ended Queues .......................... 229 6.3.1 The Deque Abstract Data Type ................. 229 6.3.2 Implementing a Deque ...................... 231 6.3.3 Deques in the Java Collections Framework ............ 232 6.4 Exercises ................................. 233 7 List Abstractions 237 7.1 The List ADT .............................. 238 7.2 Array-based Lists ............................ 240 7.2.1 Dynamic Arrays .......................... 243 7.2.2 Implementing a Dynamic Array .................. 244 7.2.3 Amortized Analysis of Dynamic Arrays .............. 245 7.2.4 Java s StringBuilder class ..................... 249 7.3 Position-Based Lists ........................... 250 7.3.1 Positions .............................. 252 7.3.2 The Positional List Abstract Data Type ............. 252 7.3.3 Doubly Linked List Implementation ................ 256 7.4 Iterators .................................. 262 7.4.1 The Iterable Interface and Java s For-Each Loop ........ 263 7.4.2 Implementing Iterators ...................... 264 7.5 The Collections Framework ....................... 268 7.5.1 List Iterators in Java ....................... 269 7.5.2 Comparison to Our Positional List ADT ............. 270 7.5.3 List-Based Algorithms in the Java Collections Framework .... 271 7.6 Exercises ................................. 273 Contents xv 8 Tree Structures 279 8.1 Trees Definitions and Properties .................... 280 8.1.1 The Tree Abstract Data Type .................. 283 8.1.2 Computing Depth and Height ................... 285 8.2 Binary Trees ............................... 288 8.2.1 The Binary Tree Abstract Data Type ............... 290 8.2.2 Properties of Binary Trees .................... 292 8.3 Tree Representations .......................... 294 8.3.1 Linked Structure for Binary Trees ................. 294 8.3.2 Array-Based Representation of a Binary Tree .......... 302 8.3.3 Linked Structure for General Trees ................ 304 8.4 Tree Traversal Algorithms ....................... 305 8.4.1 Preorder and Postorder Traversals of General Trees ....... 305 8.4.2 Breadth-First Tree Traversal ................... 307 8.4.3 Inorder Traversal of a Binary Tree ................ 308 8.4.4 Implementing Tree Traversals ¡n Java .............. 310 8.4.5 Applications of Tree Traversals .................. 314 8.4.6 Euler Tours ............................ 319 8.5 Exercises ................................. 321 9 Heaps and Priority Queues 327 9.1 The Priority Queue Abstract Data Type ............... 328 9.1.1 Priorities .............................. 328 9.1.2 The Priority Queue ADT ..................... 329 9.2 Implementing a Priority Queue .................... 330 9.2.1 The Entry Composite ....................... 330 9.2.2 Comparing Keys with Total Orders ................ 331 9.2.3 The AbstractPriorityQueue Base Class .............. 332 9.2.4 Implementing a Priority Queue with an Unsorted List ...... 334 9.2.5 Implementing a Priority Queue with a Sorted List ........ 336 9.3 Heaps ................................... 338 9.3.1 The Heap Data Structure ..................... 338 9.3.2 Implementing a Priority Queue with a Heap ........... 340 9.3.3 Analysis of a Heap-Based Priority Queue ............. 347 9.3.4 Bottom-Up Heap Construction ík ................ 348 9.3.5 Using the java.util. PriorityQueue Class .............. 352 9.4 Sorting with a Priority Queue ..................... 353 9.4.1 Selection-Sort and Insertion-Sort ................. 354 9.4.2 Heap-Sort ............................. 356 9.5 Adaptable Priority Queues ....................... 358 9.5.1 Location-Aware Entries ...................... 359 9.5.2 Implementing an Adaptable Priority Queue ........... 360 9.6 Exercises ................................. 363 xvi Contents 10 Hash Tables, Maps, and Skip Lists 369 10.1 The Map Abstract Data Type .....................370 10.1.1 The Map ADT .......................... 371 10.1.2 Application: Counting Word Frequencies ............. 373 10.1.3 An Abstract M a p Base Class ................... 374 10.1.4 A Simple Unsorted Map Implementation ............. 376 10.2 Hashing .................................. 378 10.2.1 Hash Functions .......................... 379 10.2.2 Collision-Handling Schemes .................... 385 10.2.3 Load Factors, Rehashing, and Efficiency ............. 388 10.2.4 Java Hash Table Implementation ................. 390 10.3 The Sorted Map Abstract Data Type ................. 396 10.3.1 Sorted Search Tables .......................397 10.3.2 Applications of Sorted Maps ...................401 10.4 Skip Lists .................................402 10.4.1 Search and Update Operations in a Skip List ..........404 10.4.2 Probabilistic Analysis of Skip Lists *...............408 10.5 Sets, Multisets, and Multimaps ....................411 10.5.1 The Set ADT ........................... 411 10.5.2 The Multiset ADT ........................ 413 10.5.3 The Multimap ADT ........................ 414 10.6 Exercises ................................. 417 11 Search Tree Structures 423 11.1 Binary Search Trees ...........................424 11.1.1 Searching Within a Binary Search Tree .............. 425 11.1.2 Insertions and Deletions ...................... 427 11.1.3 Java Implementation ....................... 430 11.1.4 Performance of a Binary Search Tree ............... 434 11.2 Balanced Search Trees ......................... 436 11.2.1 Java Framework for Balancing Search Trees ........... 439 11.3 AVL Trees ................................. 443 11.3.1 Update Operations ........................445 11.3.2 Java Implementation .......................450 11.4 (2,4) Trees ................................452 11.4.1 Multiway Search Trees ......................452 11.4.2 (2,4)-Tree Operations .......................455 11.5 Red-Black Trees .............................462 11.5.1 Red-Black Tree Operations ....................464 11.5.2 Java Implementation .......................474 11.6 Splay Trees ................................477 11.6.1 Splaying .............................. 477 11.6.2 When to Splay ........................... 481 11.6.3 Java Implementation ....................... 483 11.6.4 Amortized Analysis of Splaying ^ ................ 484 11.7 Exercises ................................. 489 Contents xvii 12 Strings and Dynamic Programming 495 12.1 Preliminaries ............................... 496 12.1.1 Notations for Character Strings .................. 497 12.2 Pattern-Matching Algorithms ..................... 498 12.2.1 Brute Force ............................ 498 12.2.2 The Boyer-Moore Algorithm ................... 500 12.2.3 The Knuth-Morris-Pratt Algorithm ................ 504 12.3 Tries .................................... 508 12.3.1 Standard Tries ........................... 508 12.3.2 Compressed Tries ......................... 512 12.3.3 Suffix Tries ............................ 514 12.3.4 Search Engine Indexing ...................... 516 12.4 Text Compression and the Greedy Method ............. 517 12.4.1 The Huffman Coding Algorithm ................. 518 12.4.2 The Greedy Method ........................ 519 12.5 Dynamic Programming ......................... 520 12.5.1 Matrix Chain-Product ....................... 520 12.5.2 DNA and Text Sequence Alignment ............... 523 12.6 Exercises ................................. 527 13 Sorting and Selection 531 13.1 Merge-Sort ................................ 532 13.1.1 Divide-and-Conquer ........................ 532 13.1.2 Array-Based Implementation of Merge-Sort ........... 537 13.1.3 The Running Time of Merge-Sort ................ 538 13.1.4 Merge-Sort and Recurrence Equations ^C ............. 540 13.1.5 Alternative Implementations of Merge-Sort ........... 541 13.2 Quick-Sort ................................ 544 13.2.1 Randomized Quick-Sort ...................... 551 13.2.2 Additional Optimizations for Quick-Sort ............. 553 13.3 Studying Sorting through an Algorithmic Lens ........... 556 13.3.1 Lower Bound for Sorting ..................... 556 13.3.2 Linear-Time Sorting: Bucket-Sort and Radix-Sort ........ 558 13.4 Comparing Sorting Algorithms ..................... 561 13.5 Selection ................................. 563 13.5.1 Prune-and-Search ......................... 563 13.5.2 Randomized Quick-Select ..................... 564 13.5.3 Analyzing Randomized Quick-Select ............... 565 13.6 Exercises ................................. 566 )A Graphs Б73 14.1 Graphs ................................... 574 14.1.1 The Graph ADT .......................... 580 14.2 Data Structures for Graphs ....................... 581 14.2.1 Edge List Structure ........................ 582 14.2.2 Adjacency List Structure ..................... 584 14.2.3 Adjacency Map Structure ..................... 586 xviii Contents 14.2.4 Adjacency Matrix Structure .................... 587 14.2.5 Java Implementation ....................... 588 14.3 Graph Traversals ............................. 592 14.3.1 Depth-First Search ........................ 593 14.3.2 DFS Implementation and Extensions ............... 598 14.3.3 Breadth-First Search ....................... 602 14.4 Transitive Closure ............................ 605 14.5 Directed Acyclic Graphs ........................ 609 14.5.1 Topological Ordering ....................... 609 14.6 Shortest Paths .............................. 613 14.6.1 Weighted Graphs ......................... 613 14.6.2 Dijkstra s Algorithm ........................ 615 14.7 Minimum Spanning Trees ........................ 624 14.7.1 Prim-Jarnik Algorithm ...................... 626 14.7.2 Kruskal s Algorithm ........................ 629 14.7.3 Disjoint Partitions and Union-Find Structures .......... 634 14.8 Exercises ................................. 639 15 AdditionaS Topics 647 15.1 Memory Management .......................... 648 15.1.1 Stacks in the Java Virtual Machine ................ 648 15.1.2 Allocating Space in the Memory Heap .............. 651 15.1.3 Garbage Collection ........................ 653 15.2 Memory Hierarchies and Caching ................... 655 15.2.1 Memory Systems ......................... 655 15.2.2 Caching Strategies ........................ 656 15.3 External Searching and B-Trees .................... 661 15.3.1 (a,b) Trees ............................ 662 15.3.2 B-Trees .............................. 664 15.4 External-Memory Sorting ........................ 665 15.4.1 Multiway Merging ......................... 666 15.5 Range Trees ............................... 667 15.5.1 One-Dimensional Range Searching ................ 668 15.5.2 Two-Dimensional Range Trees .................. 671 15.5.3 Two-Dimensional Range Searching ................ 673 15.5.4 Insertion and Deletion ....................... 675 15.5.5 Priority Search Trees ....................... 677 15.5.6 Priority Range Trees ........................ 682 15.6 Exercises ................................. 684 Bibliography 688 Index 693 Useful Mathematical Facts available at www.wiley.com/go/globai/goodrich
any_adam_object	1
author	Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969-
author_GND	(DE-588)121131181 (DE-588)141557834 (DE-588)133831086
author_facet	Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969-
author_role	aut aut aut
author_sort	Goodrich, Michael T. 1961-
author_variant	m t g mt mtg r t rt m h g mh mhg
building	Verbundindex
bvnumber	BV042023445
classification_rvk	ST 134 ST 250
classification_tum	DAT 362f DAT 455f DAT 530f
ctrlnum	(OCoLC)889723753 (DE-599)BVBBV042023445
dewey-full	005.73
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.73
dewey-search	005.73
dewey-sort	15.73
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
edition	6. ed., internat. student version
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01956nam a2200445 c 4500</leader><controlfield tag="001">BV042023445</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150709 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">140813s2015 xx ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118808573</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-1-118-80857-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1118808576</subfield><subfield code="9">1118808576</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)889723753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042023445</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-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-1051</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.73</subfield><subfield code="2">23</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 362f</subfield><subfield code="2">stub</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="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="b">[exclusive to this version: revised problem sets, concise coverage, section on range search trees]</subfield><subfield code="c">Michael T. Goodrich ; Roberto Tamassia ; Michael H. Goldwasser</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">6. ed., internat. student version</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore [u.a.]</subfield><subfield code="b">Wiley</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 699 S.</subfield><subfield code="b">Ill., 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="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="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="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="700" ind1="1" ind2=" "><subfield code="a">Goldwasser, Michael H.</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133831086</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=027465065&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027465065</subfield></datafield></record></collection>
id	DE-604.BV042023445
illustrated	Illustrated
indexdate	2024-12-20T17:00:20Z
institution	BVB
isbn	9781118808573
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-027465065
oclc_num	889723753
open_access_boolean
owner	DE-91G DE-BY-TUM DE-739 DE-573 DE-188 DE-1051
owner_facet	DE-91G DE-BY-TUM DE-739 DE-573 DE-188 DE-1051
physical	XVIII, 699 S. Ill., graph. Darst.
publishDate	2015
publishDateSearch	2015
publishDateSort	2015
publisher	Wiley
record_format	marc
spellingShingle	Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969- Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees] Java Programmiersprache (DE-588)4401313-9 gnd Datenstruktur (DE-588)4011146-5 gnd
subject_GND	(DE-588)4401313-9 (DE-588)4011146-5
title	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees]
title_auth	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees]
title_exact_search	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees]
title_full	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees] Michael T. Goodrich ; Roberto Tamassia ; Michael H. Goldwasser
title_fullStr	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees] Michael T. Goodrich ; Roberto Tamassia ; Michael H. Goldwasser
title_full_unstemmed	Data structures and algorithms in Java [exclusive to this version: revised problem sets, concise coverage, section on range search trees] Michael T. Goodrich ; Roberto Tamassia ; Michael H. Goldwasser
title_short	Data structures and algorithms in Java
title_sort	data structures and algorithms in java exclusive to this version revised problem sets concise coverage section on range search trees
title_sub	[exclusive to this version: revised problem sets, concise coverage, section on range search trees]
topic	Java Programmiersprache (DE-588)4401313-9 gnd Datenstruktur (DE-588)4011146-5 gnd
topic_facet	Java Programmiersprache Datenstruktur
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027465065&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT goodrichmichaelt datastructuresandalgorithmsinjavaexclusivetothisversionrevisedproblemsetsconcisecoveragesectiononrangesearchtrees AT tamassiaroberto datastructuresandalgorithmsinjavaexclusivetothisversionrevisedproblemsetsconcisecoveragesectiononrangesearchtrees AT goldwassermichaelh datastructuresandalgorithmsinjavaexclusivetothisversionrevisedproblemsetsconcisecoveragesectiononrangesearchtrees

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 455f 2005 A 9211(6) Lageplan
Exemplar 1	Ausleihbar Am Standort
Exemplar 2	Ausleihbar Am Standort