Java software structures: designing and using data structures
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston
Pearson
[2014]
|
| Ausgabe: | 4th edition, international edition |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 688 Seiten Ill. |
| ISBN: | 9780273793328 0273793322 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043004758 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 151113s2014 xxua||| |||| 00||| eng d | ||
| 020 | |a 9780273793328 |9 978-0-273-79332-8 | ||
| 020 | |a 0273793322 |9 0-273-79332-2 | ||
| 035 | |a (OCoLC)934737273 | ||
| 035 | |a (DE-599)BVBBV043004758 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-473 | ||
| 050 | 0 | |a QA76.73.J38 | |
| 082 | 0 | |a 005.13/3 |2 22 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 100 | 1 | |a Lewis, John |d 1963- |e Verfasser |0 (DE-588)138867941 |4 aut | |
| 245 | 1 | 0 | |a Java software structures |b designing and using data structures |c John Lewis and Joseph Chase |
| 250 | |a 4th edition, international edition | ||
| 264 | 1 | |a Boston |b Pearson |c [2014] | |
| 264 | 4 | |c ©2014 | |
| 300 | |a 688 Seiten |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Développement de logiciels |2 rasuqam | |
| 650 | 7 | |a Java (Langage de programmation) |2 rasuqam | |
| 650 | 7 | |a Structure de données |2 rasuqam | |
| 650 | 4 | |a Computer software |x Development | |
| 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 |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Chase, Joseph |e Verfasser |0 (DE-588)107877966X |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028429884&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028429884 | ||
Datensatz im Suchindex
| _version_ | 1804175346671550464 |
|---|---|
| adam_text | Contents
Preface 7
Credits 25
Chapter 1 Introduction 27
1.1 Software Quality 28
Correctness 29
Reliability 29
Robustness 30
Usability 30
Maintainability 31
Reusability 31
Portability 32
Efficiency 32
Quality Issues 32
1.2 Data Structures 33
A Physical Example 33
Containers as Objects 36
Chapter 2 Analysis of Algorithms 41
2.1 Algorithm Efficiency 42
2.2 Growth Functions and Big-Oh Notation 43
2.3 Comparing Growth Functions 45
2.4 Determining Time Complexity 48
Analyzing Loop Execution 48
Nested Loops 48
Method Calls 49
13
14 CONTENTS
Chapter 3
Chapter 4
Introduction to Collections - Stacks 55
3.1 Collections 56
Abstract Data Types 57
The Java Collections API 59
3.2 A Stack Collection 59
3.3 Crucial 00 Concepts 61
Inheritance and Polymorphism 62
Generics 65
3.4 Using Stacks: Evaluating Postfix Expressions 64
Javadoc 71
3.5 Exceptions 72
3.6 A Stack ADT 74
3.7 Implementing a Stack: With Arrays 77
Managing Capacity 78
3.8 The ArrayStack Class 79
The Constructors 80
The push Operation 82
The pop Operation 83
The peek Operation 85
Other Operations 85
The EmptyCollectionException Class 85
Other Implementations 86
Linked Structures - Stacks 93
4.1 References as Links 94
4.2 Managing Linked Lists 96
Accessing Elements 96
Inserting Nodes 97
Deleting Nodes 98
4.3 Elements without Links 99
Doubly Linked Lists 99
4.4 Stacks in the Java API 100
CONTENTS
15
Chapter 5
Chapter 6
4.5 Using Stacks: Traversing a Maze 101
4.6 Implementing a Stack: With Links 110
The LinkedStack Class 110
The push Operation 114
The pop Operation 116
Other Operations 117
Queues 123
5.1 A Conceptual Queue 124
5.2 Queues in the Java API 125
5.3 Using Queues: Code Keys 126
5.4 Using Queues: Ticket Counter Simulation 130
5.5 A Queue ADT 135
5.6 A Linked Implementation of a Queue 137
The enqueue Operation 139
The dequeue Operation 141
Other Operations 142
5.7 Implementing Queues: With Arrays 143
The enqueue Operation 147
The dequeue Operation 149
Other Operations 150
5.8 Double-Ended Queues (Deque) 150
Lists 155
6.1 A List Collection 156
6.2 Lists in the Java Collections API 158
6.3 Using Unordered Lists: Program of Study 159
6.4 Using Indexed Lists: Josephus 170
6.5 A List ADT 172
Adding Elements to a List 173
CONTENTS
6.6 Implementing lists with Arrays 178
The remove Operation 180
The contains Operation 182
The add Operation for an Ordered l ist 18.1
Operations Particular to Unordered l ists 185
The addAfter Operation for an Unordered 1 ast 185
6.7 Implementing Lists with Links 186
The remove Operation 187
Chapter 7 Iterators 195
7.1 What s an Iterator? 196
Other Iterator Issues 198
7.2 Using Iterators: Program of Study Revisited 198
Printing Certain Courses 202
Removing Courses 20.1
7.3 Implementing Iterators: With Arrays 205
7.4 Implementing Iterators: With Links 207
Chapter 8 Recursion 213
8.1 Recursive Thinking 214
Infinite Recursion 214
Recursion in Math 215
8.2 Recursive Programming 216
Recursion versus Iteration 219
Direct versus Indirect Recursion 219
8.3 Using Recursion 220
Traversing a Maze 220
The Towers of Hanoi 228
8.4 Analyzing Recursive Algorithms 233
Chapter 9 Searching and Sorting 241
9.1 Searching 242
Static Methods 243
Generic Methods 243
CONTENTS
17
Chapter 10
Chapter 11
Linear Search 244
Binary Search 246
Comparing Search Algorithms 248
9.2 Sorting 249
Selection Sort 252
Insertion Sort 254
Bubble Sort 256
Quick Sort 258
Merge Sort 262
9.3 Radix Sort 265
Trees 275
10.1 Trees 276
Tree Classifications 277
10.2 Strategies for Implementing Trees Computational Strategy for Array 279
Implementation of Trees Simulated Link Strategy for Array 279
Implementation of Trees 279
Analysis of Trees 281
10.3 Tree Traversals 282
Preorder Traversal 282
Inorder Traversal 283
Postorder Traversal 283
Level-Order Traversal 284
10.4 A Binary Tree ADT 285
10.5 Using Binary Trees: Expression Trees 289
10.6 A Back Pain Analyzer 301
10.7 Implementing Binary Trees with Links 305
The find Method 310
The iteratorlnOrder Method 312
Binary Search Trees 319
11.1 A Binary Search Tree 320
CONTENTS
11.2 Implementing Binary Search Trees: With Links 322
The addElement Operation 323
The removeElement Operation .326
The removeAllOccurrences Operation 329
The removeMin Operation 330
Implementing Binary Search frees: With Arrays .3.32
11.3 Using Binary Search Trees: Implementing
Ordered Lists 332
Analysis of the BinarySearchTreeList
Implementation 333
11.4 Balanced Binary Search Trees 336
Right Rotation 3.37
Left Rotation -3.38
Rightleft Rotation 3.39
Leftright Rotation -3.39
11.5 Implementing BSTs: AVL Trees 340
Right Rotation in an AVI. Tree 341
Left Rotation in an AVL Tree 341
Rightleft Rotation in an AVL Tree 341
Leftright Rotation in an AVL Tree 343
11.6 Implementing BSTs: Red/Black Trees 343
Insertion into a Red/Black Tree 344
Element Removal from a Red/Black Tree 347
Chapter 12 Heaps and Priority Queues 357
12.1 A Heap 358
The addElement Operation 360
The removeMin Operation 361
The findMin Operation 362
12.2 Using Heaps: Priority Queues 362
12.3 Implementing Heaps; With Links 366
The addElement Operation 368
The removeMin Operation 370
The findMin Operation 373
CONTENTS
19
Chapter 13
Chapter 14
Chapter 15
12.4 Implementing Heaps: With Arrays 373
The addElement Operation 375
The removeMin Operation 376
The f indMin Operation 378
12.5 Using Heaps: Heap Sort 378
Sets and Maps 385
13.1 Set and Map Collections 386
13.2 Sets and Maps in the Java API 386
13.3 Using Sets: Domain Blocker 389
13.4 Using Maps: Product Sales 392
13.5 Using Maps: User Management 396
13.6 Implementing Sets and Maps Using Trees 401
13.7 Implementing Sets and Maps Using Hashing 401
Multi-Way Search Trees 409
14.1 Combining Tree Concepts 410
14.2 2-3 Trees 410
Inserting Elements into a 2-3 Tree 411
Removing Elements from a 2-3 Tree 413
14.3 2-4 Trees 416
14.4 B-Trees 418
B’1 -Trees 419
B+-Trees 419
Analysis of B-Trees 420
14.5 Implementation Strategies for B-Trees 420
Graphs 427
15.1 Undirected Graphs 428
15.2 Directed Graphs 429
CONTENTS
15.3 Networks 431
15.4 Common Graph Algorithms 432
Traversals 4’֊
Testing for Connectivity 4.16
Minimum Spanning Trees 43X
Determining the Shortest Path 441
15.5 Strategies for Implementing Graphs 441
Adjacency l ists 442
Adjacency Matrices 442
15.6 Implementing Undirected Graphs with
an Adjacency Matrix 443
The addEdge Method 44,S
The addVertex Method 44,S
The expandCapacity Method 444
Other Methods 450
Appendix A UML 455
The Unified Modeling Language (UML) 456
UML Class Diagrams 456
UML Relationships 458
Appendix B Object-Oriented Design 463
B. 1 Overview of Object-Orientation 464
B.2 Using Objects 464
Abstraction 465
Creating Objects 466
B.3 Class Libraries and Packages 468
The import Declaration 468
B.4 State and Behavior 469
B.5 Classes 470
Instance Data 473
CONTENTS
21
B.6 Encapsulation 474
Visibility Modifiers 474
Local Data 476
B.7 Constructors 476
B.8 Method Overloading 477
B.9 References Revisited 478
The Null Reference 478
The this Reference 479
Aliases 481
Garbage Collection 482
Passing Objects as Parameters 483
B.10 The static Modifier 483
Static Variables 484
Static Methods 484
B.11 Wrapper Classes 485
B.12 Interfaces 486
The Comparable Interface 487
B.13 Inheritance 488
Derived Classes 488
The protected Modifier 490
The super Reference 491
Overriding Methods 491
B.14 Class Hierarchies 492
The Object Class 493
Abstract Classes 494
Interface Hierarchies 496
B.15 Polymorphism 496
References and Class Hierarchies 497
Polymorphism via Inheritance 498
Polymorphism via Interfaces 498
B.ló Exceptions 501
Exception Messages 502
The try Statement 502
Exception Propagation 503
The Exception Class Hierarchy 504
CONTENTS
Appendix C Java Graphics 515
C.l Pixels and Coordinates 516
C.2 Representing Color 517
C.3 Drawing Shapes 518
C.4 Polygons and Polylines 527
The Polygon Class 530
Appendix D Graphical User Interfaces 537
D.l GUI Elements 538
Frames and Panels 539
Buttons and Action Events 543
Determining Event Sources 545
D.2 More Components 548
Text Fields 548
Check Boxes 551
Radio Buttons 555
Sliders 559
Combo Boxes 564
Timers 569
D.3 Layout Managers 574
Flow Layout 576
Border Layout 579
Grid Layout 583
Box Layout 586
Containment Hierarchies 589
D.4 Mouse and Key Events 589
Mouse Events 589
Key Events 598
Extending Adapter Classes 604
D.5 Dialog Boxes 605
File Choosers 608
Color Choosers 611
CONTENTS
23
Appendix E
Appendix F
Index
D.6 Some Important Details 612
Borders 612
Tool Tips and Mnemonics 616
D.7 GUI Design 623
Hashing 633
E.l Hashing 634
E.2 Hashing Functions 636
The Division Method 636
The Folding Method 637
The Mid-Square Method 637
The Radix Transformation Method 638
The Digit Analysis Method 638
The Length-Dependent Method 638
Hashing Functions in the Java Language 639
E.3 Resolving Collisions 639
Chaining 639
Open Addressing 642
E.4 Deleting Elements from a Hash Table 646
Deleting from a Chained Implementation 646
Deleting from an Open Addressing
Implementation 647
E.5 Hash Tables in the Java Collections API 648
The Hashtable Class 648
The HashSet Class 650
The HashMap Class 650
The IdentityHashMap Class 651
The WeakHashMap Class 652
LinkedHashSet and LinkedHashMap 653
Regular Expressions 661
665
|
| any_adam_object | 1 |
| author | Lewis, John 1963- Chase, Joseph |
| author_GND | (DE-588)138867941 (DE-588)107877966X |
| author_facet | Lewis, John 1963- Chase, Joseph |
| author_role | aut aut |
| author_sort | Lewis, John 1963- |
| author_variant | j l jl j c jc |
| building | Verbundindex |
| bvnumber | BV043004758 |
| 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 250 |
| ctrlnum | (OCoLC)934737273 (DE-599)BVBBV043004758 |
| dewey-full | 005.13/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/3 |
| dewey-search | 005.13/3 |
| dewey-sort | 15.13 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 4th edition, international edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01987nam a2200505zc 4500</leader><controlfield tag="001">BV043004758</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">151113s2014 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780273793328</subfield><subfield code="9">978-0-273-79332-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0273793322</subfield><subfield code="9">0-273-79332-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)934737273</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043004758</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</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.13/3</subfield><subfield code="2">22</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="100" ind1="1" ind2=" "><subfield code="a">Lewis, John</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138867941</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Java software structures</subfield><subfield code="b">designing and using data structures</subfield><subfield code="c">John Lewis and Joseph Chase</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4th edition, international edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston</subfield><subfield code="b">Pearson</subfield><subfield code="c">[2014]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">688 Seiten</subfield><subfield code="b">Ill.</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="7"><subfield code="a">Développement de logiciels</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Java (Langage de programmation)</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Structure de données</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield><subfield code="x">Development</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="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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">Chase, Joseph</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)107877966X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - 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=028429884&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-028429884</subfield></datafield></record></collection> |
| id | DE-604.BV043004758 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:14:50Z |
| institution | BVB |
| isbn | 9780273793328 0273793322 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028429884 |
| oclc_num | 934737273 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG |
| owner_facet | DE-473 DE-BY-UBG |
| physical | 688 Seiten Ill. |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Pearson |
| record_format | marc |
| spelling | Lewis, John 1963- Verfasser (DE-588)138867941 aut Java software structures designing and using data structures John Lewis and Joseph Chase 4th edition, international edition Boston Pearson [2014] ©2014 688 Seiten Ill. txt rdacontent n rdamedia nc rdacarrier Développement de logiciels rasuqam Java (Langage de programmation) rasuqam Structure de données rasuqam Computer software Development Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd rswk-swf Java Programmiersprache (DE-588)4401313-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Java Programmiersprache (DE-588)4401313-9 s Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s DE-604 Chase, Joseph Verfasser (DE-588)107877966X aut Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028429884&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Lewis, John 1963- Chase, Joseph Java software structures designing and using data structures Développement de logiciels rasuqam Java (Langage de programmation) rasuqam Structure de données rasuqam Computer software Development Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4401313-9 (DE-588)4001183-5 |
| title | Java software structures designing and using data structures |
| title_auth | Java software structures designing and using data structures |
| title_exact_search | Java software structures designing and using data structures |
| title_full | Java software structures designing and using data structures John Lewis and Joseph Chase |
| title_fullStr | Java software structures designing and using data structures John Lewis and Joseph Chase |
| title_full_unstemmed | Java software structures designing and using data structures John Lewis and Joseph Chase |
| title_short | Java software structures |
| title_sort | java software structures designing and using data structures |
| title_sub | designing and using data structures |
| topic | Développement de logiciels rasuqam Java (Langage de programmation) rasuqam Structure de données rasuqam Computer software Development Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Développement de logiciels Java (Langage de programmation) Structure de données Computer software Development Java (Computer program language) Datenstruktur Java Programmiersprache Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028429884&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT lewisjohn javasoftwarestructuresdesigningandusingdatastructures AT chasejoseph javasoftwarestructuresdesigningandusingdatastructures |