Data structures and abstractions with Java:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Munich [u.a.]
Pearson
2016
|
| Ausgabe: | fourth edition, global edition |
| Schriftenreihe: | Always learning
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | 930 S. graph. Darst. |
| ISBN: | 9781292077185 1292077182 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042061475 | ||
| 003 | DE-604 | ||
| 005 | 20220228 | ||
| 007 | t | ||
| 008 | 140905s2016 xxud||| |||| 00||| eng d | ||
| 010 | |a 014025945 | ||
| 020 | |a 9781292077185 |9 978-1-292-07718-5 | ||
| 020 | |a 1292077182 |9 1-292-07718-2 | ||
| 035 | |a (OCoLC)913022233 | ||
| 035 | |a (DE-599)BVBBV042061475 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-91G |a DE-473 |a DE-11 | ||
| 050 | 0 | |a QA76.9.D33 | |
| 082 | 0 | |a 005.13/3 |2 23 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 362f |2 stub | ||
| 084 | |a DAT 455f |2 stub | ||
| 100 | 1 | |a Carrano, Frank M. |e Verfasser |0 (DE-588)1252631545 |4 aut | |
| 245 | 1 | 0 | |a Data structures and abstractions with Java |c Frank M. Carrano ; Timothy M. Henry |
| 250 | |a fourth edition, global edition | ||
| 264 | 1 | |a Boston ; Munich [u.a.] |b Pearson |c 2016 | |
| 300 | |a 930 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Always learning | |
| 500 | |a Includes bibliographical references and index | ||
| 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 |
| 650 | 0 | 7 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | 1 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |D s |
| 689 | 0 | 2 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Henry, Timothy M. |e Verfasser |0 (DE-588)1073836088 |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=027502346&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027502346 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152499935903744 |
|---|---|
| adam_text | Contents
Introduction: Organizing Data 31
Prelude: Designing Classes 35
Encapsulation 36
Specifying Methods 38
Comments 38
Preconditions and Postconditions 39
Assertions 40
Java Interfaces 41
Writing an Interface 42
Implementing an Interface 43
An Interface as a Data Type 45
Extending an Interface 46
Named Constants Within an Interface 47
Choosing Classes 49
Identifying Classes 50
CRC Cards 51
The Unified Modeling Language 51
Reusing Classes 54
Chapter 1 Bags 61
The Bag 62
A Bag s Behaviors 62
Specify ing a Bag 63
An Interface 69
Using the ADT Bag 71
Using an ADT Is Like Using a Vending Machine 75
The ADT Set 77
Java Class Library: The Interface set 77
Java interlude 1 Generics 83
Generic Data Types 83
Generic Types Within an Interface 84
Generic Classes 85
Chapter 2 Bag Implementations That Use Arrays 89
Using a Fixed-Size Array to Implement the ADT Bag 90
An Analogy 90
A G roup of Core Methods 91
Implementing the Core Methods 92
Making the Implementation Secure 99
Test ing the Core Methods 101
Implementing More Methods 103
Methods That Remove Entries 106
Using Array Resizing to Implement the ADT Bag 114
Resizing an Array IN
A New Implementation of a Bag 117
The Pros and Cons of Using an Array to Implement the ADT Bag 120
Table of Contents
Java Interlude 2 F.vccpilous
Ihc Basics
Handling an Inception
Postpone Handling: Ihc throws Clause
Handle It Now The try-catch Blocks
Multiple catch Blocks
Throwing an exception
Chapter J A Baf Implementation That Link* Data
linked Data
Forming a Chain by Adding to Its Beginning
A linked Implementation of the APT Bag
Ihc Private Class Node
An Outline of the Class linkedBag
Defining Some Core Methods
Testing the Core Methods
The Method getFrequencyOf
Ihc Method contains
Removing an Item from a Linked Chain
The Methods remove and clear
A Class Node That Has Set and Get Methods
The Pros and Cons of Using a Chain to Implement the ADT Bag
Chapter 4 The Efficiency of Algorithms
Motivation
Measuring an Algorithm’s Efficiency
Counting Basic Operations
Best, Worst, and Average Cases
Big Oh Notation
Ihc Complexities of Program Constructs
Picturing Efficiency
Ihc Lfficicncy of Implementations of the ADT Bag
An Array-Based Implementation
A Linked Implementation
Comparing the Implementations
Chapter 5
Chapter 6
Stack»
Specifications of the ADT Stack
Using a Stack to Process Algebraic Expressions
A Problem Solved: Checking for Balanced Delimiters in an
Infix Algebraic Expression
A Problem Solved: Transforming an Infix Expression
to a Postfix Expression
A Problem Solved: Evaluating Postfix Expressions
A Problem Solved: Evaluating Infix Expressions
The Program Stack
Java Class library : The Class Stack
Stack Implementations
A Linked Implementation
An Array-Based Implementation
125
126
128
128
129
130
131
133
134
135
137
137
138
139
143
144
145
146
147
151
154
159
160
161
163
165
166
168
170
173
173
175
176
183
184
188
189
194
199
201
203
204
211
211
215
A Vector-Based Implementation 219
Java Class Library: The Class Vector 220
Using a Vector to Implement the ADT Stack 220
Chapter 7 Recursion 227
What Is Recursion? 228
Tracing a Recursive Method 232
Recursive Methods That Return a Value 235
Recursively Processing an Array 237
Recursively Processing a Linked Chain 240
The Time efficiency of Recursive Methods 241
The Time Efficiency of countdown 242
The Time Efficiency of Computing xn 243
A Simple Solution to a Difficult Problem 244
A Poor Solution to a Simple Problem 249
Tail Recursion 251
Indirect Recursion 253
Using a Stack Instead of Recursion 254
Java Interlude 3 More About Generics 265
The Interface Comparable 265
Generic Methods 267
Bounded Type Parameters 268
Wildcards 270
Bounded Wildcards 271
Chapter 8 An Introduction to Sorting 275
Organizing Java Methods That Sort an Array 276
Selection Sort 277
Iterative Selection Sort 278
Recursive Selection Sort 280
The Efficiency of Selection Sort 281
Insertion Sort 281
Iterative Insertion Sort 283
Recursive Insertion Sort 285
The Efficiency of Insertion Sort 287
Insertion Sort of a Chain of Linked Nodes 287
Shell Sort 290
The Algorithm 292
The Efficiency of Shell Sort 293
Comparing the Algorithms 293
Chapter 9 Faster Sorting Methods 301
Merge Sort 302
Merging Arrays 302
Recursive Merge Sort 303
The Efficiency of Merge Sort 305
Iterative Merge Sort 307
Merge Sort in the Java Class Library 307
Quick Sort 308
The Efficiency of Quick Sort 308
Creating the Partition 309
Table of Contents
312
314
314
315
316
316
323
323
327
328
331
332
336
342
345
346
349
350
351
351
353
355
361
362
366
366
369
374
375
380
381
385
391
392
399
403
403
409
410
410
412
420
427
428
428
432
433
Java Interlude 4
Chapter 10
Chapter 11
Chapter 12
Chapter 13
Chapter 14
Implementing Quick Son
Quick Son in the Java Class Library
Radis Sort
Pseudocode for Radix Sort
The Efficiency of Radix Sort
Comparing the Algorithms
More About Exceptions
Programmer-Defined Exception Classes
Inheritance and Exceptions
Ihc finally Block
Queues, Deques, and Priority Queues
Ihc AD I Queue
A Problem Solved: Simulating a Waiting Line
A Problem Solved: Computing the Capital Gain in a Sale of Stock
Java Class l ibrary : The Interface Queue
Ihe ADT Deque
A Problem Solved: Computing the Capital Gain in a Sale of Stock
Java Class Library : Ihc Interface Deque
Java Class Library: The Class ArrayDeque
The ADT Priority Queue
A Problem Solved: Tracking Your Assignments
Java Class Library : The Class Priori tyQueue
Queue, Deque, and Priority Queue Implementations
A Linked Implementation of a Queue
An Array-Based Implementation of a Queue
A Circular Array
A Circular Array with One Unused Location
Circular Linked Implementations of a Queue
A Two-Part Circular Linked Chain
Java Class Library: The Class AbstractQueue
A Doubly Linked Implementation of a Deque
Possible Implementations of a Priority Queue
Lilts
Specifications for the ADT List
Using the ADT List
Java Class Library : The Interface List
Java Class Library: The Class ArrayUst
A Lbt Implementation That Uses an Array
Using an Агтау to Implement the ADT List
An Analogy
The Java Implementation
The Efficiency of Using an Агтау to Implement the ADT List
A Lbt Implementation That Links Data
Operations on a Chain of Linked Nodes
Adding a Node at Various Positions
Remov ing a Node from Various Positions
The Private Method gettodeAt
Beginning the Implementation 434
The Data Fields and Constructor 435
Adding to the End of the List 437
Adding at a Given Position Within the List 438
The Methods i sEmpty and toArray 439
Testing the Core Methods 441
Continuing the Implementation 442
A Refined Implementation 445
The Tail Reference 445
The Efficiency of Using a Chain to Implement the ADT List 448
Java Class Library: The Class LinkedList 450
Java Interlude 5 Iterators 457
What Is an Iterator? 457
The Interface Iterator 459
The Interface Iterable 461
Using the Interface Iterator 461
Iterable and for-each Loops 465
The Interface Listlterator 466
The Interface Li st Revisited 469
Using the Interface Li stlterator 470
Chapter 15 Iterators Tor the ADT List 473
Ways to Implement an Iterator 474
A Separate Class Iterator 474
An Inner Class Iterator 477
A Linked Implementation 478
An Array-Based Implementation 481
Why Are Iterator Methods in Their Own Class? 484
An Array-Based Implementation of the Interface Li stlterator 486
The Inner Class 487
Java Interlude 6 Mutable and Immutable Objects 499
Mutable Objects 500
Immutable Objects 502
Creating a Read-Only Class 502
Companion Classes 504
Chapter 16 Sorted Lists 507
Specifications for the ADT Sorted List 508
Using the ADT Sorted List 511
A Linked Implementation 512
The Method add 513
The Efficiency of the Linked Implementation 520
An Implementation That Uses the ADT List 520
Efficiency Issues 523
Java Interlude 7 Inheritance and Polymorphism 529
Further Aspects of Inheritance 529
When to Use Inheritance 529
Protected Access 530
Abstract Classes and Methods 531
Interfaces Versus Abstract Classes 533
Pnk mnmhkm 5j4
Table of Contents
Table of Contents
Chapter 17 Inheritance and Lists 541
Using Inheritance to Implement a Sorted List 542
Designing a Base Class 544
Creating an Abstract Base Class 549
An Kflicicnt Implementation of a Sorted List 551
The Method add 551
Chapter 18 Searching 557
The Problem OC
Searching an Unsorted Array 558
An Iterative Sequential Search of an Unsorted Array 559
A Recursive Sequential Search of an Unsorted Array 560
The LfTicicncy of a Sequential Search of an Array 562
Searching a Sorted Array 562
A Sequential Search of a Sorted Array 562
A Binary Search of a Sorted Array 563
Java Class Library : The Method binarySearch 568
The efficiency of a Binary Search of an Array 568
Searching an Unsortcd Chain 569
An Iterative Sequential Search of an Unsorted Chain 570
A Recursive Sequential Search of an Unsorted Chain 570
The LfTicicncy of a Sequential Search of a Chain 571
Searching a Sorted Chain 571
A Sequential Search of a Sorted Chain 571
A Binary Search of a Sorted Chain 572
Choosing a Search Method 572
Java Interludes Generics Once Again 579
More Than One Generic Type 579
Chapter 19 Dictionaries 581
Specifications for the ADT Dictionary 582
A Java Interface 586
Iterators 587
Using the ADT Dictionary 588
A Problem Solved: A Directory of Telephone Numbers 589
A Problem Solved: The Frequency of Words 594
A Problem Solved: A Concordance of Words 597
Java Class Library: The Interface Map 600
Chapter 20 Dictionary Implementations 605
Array-Based Implementations 606
An Unsorted Array-Based Dictionary 606
A Sorted Array -Based Dictionary 611
Linked Implementations 616
An Unsorted Linked Dictionary 617
A Sorted Linked Dictionarv 618
Chapter 21 Introducing Hashing 625
What Is Hashing? 626
Hash Functions 6 9
Computing Hash Codes 629
Compressing a Hash Code into an Index for the Hash Table 632
Resolving Collisions 633
Open Addressing with Linear Probing 633
Open Addressing with Quadratic Probing 638
Open Addressing with Double Hashing 639
A Potential Problem with Open Addressing 641
Separate Chaining 642
Chapter 22 Hashing as a Dictionary Implementation 649
The Efficiency of Hashing 650
The Load Factor 650
The Cost of Open Addressing 651
The Cost of Separate Chaining 653
Rehashing 654
Comparing Schemes for Collision Resolution 655
A Dictionary’ Implementation That Uses Hashing 656
Entries in the Hash Table 656
Data Fields and Constructors 657
The Methods getValue, remove, and add 659
Iterators 664
Java Class Library: The Class HashMap 665
Jave Class Library: The Class HashSet 666
Chapter 23 Trees 669
Tree Concepts 670
Hierarchical Organizations 670
Tree Terminology 672
Traversals of a Tree 676
Traversals of a Binary Tree 677
Traversals of a General Tree 679
Java Interfaces for Trees 680
Interfaces for All Trees 680
An Interface for Binary Trees 681
Examples of Binary Trees 682
Expression Trees 683
Decision Trees 684
Binary Search Trees 688
Heaps 690
Examples of General Trees 693
Parse Trees 693
Game Trees 693
Chapter 24 Tree Implementations 703
The Nodes in a Binary Tree 704
A Class of Binary Nodes 705
An Implementation of the ADT Binary Tree 706
Creating a Basic Binary Tree 707
The Method pri vateSetTree 708
Accessor and Mutator Methods 711
Computing the Height and Counting Nodes 711
Traversals 712
An Implementation of an Expression Tree 717
Table of Contents
Table of Contents
Java Interlude 9
Chapter 25
Chapter 26
Chapter 27
General Trees 718
A Node for a General Tree 718
Using a Binary Tree to Represent a General Tree 719
Cloning 727
Cloneablc Objects 727
C loning an Array 733
Cloning a Chain 736
A Sorted List of Clones 739
Cloning a Binary Node 741
A Binary Search Tree Implementation 743
Getting Started 744
An Interface for the Binary Search Tree 745
Duplicate Entries 747
Beginning the Class Definition 748
Searching and Retrieving 749
Traversing 750
Adding an 1՛ ntry 751
A Recursive Implementation 752
An Iterative Implementation 755
Removing an Entry 756
Removing an Iintry Whose Node Is a Leaf 757
Removing an Knlry Whose Node Has One Child 757
Removing an Untry Whose Node Has Two Children 758
Removing an Սուգ in the Root 761
A Recursive Implementation 762
An Iterative Implementation 765
The l .fficiency of Operations 769
The Importance of Balance 770
Hie Order in W hich Nodes Arc Added 770
An Implementation of the AD I Dictionary 770
A Heap Implementation 783
Reprise: The ADT Heap 784
U sing an Array to Represent a Heap 784
Adding an iintry 787
Removing the Root 790
Creating a Heap 793
Heap Sort 796
Balanced Search Trees 805
AVI. Trees 806
Single Rotations 806
Double Rotations 809
Implementation Details 813
2-5 Trees 817
Searching a 2-3 Tree 818
Adding Entries to a 2-3 Tree 819
Splitting Nodes During Addition 821
2-1 Trees 822
Adding Entries to a 2-t Tree 823
Comparing AVI.. 2-3. and 2-4 Trees 825
Red-Black Trees 826
Properties of a Red-Black Tree 827
Adding Entries to a Red-Black Tree 828
Java Class Library: The Class TreeMap 834
B-Trees 834
Chapter 28 Graphs 841
Some Examples and Terminology 842
Road Maps 842
Airline Routes 845
Mazes 845
Course Prerequisites 846
Trees 846
Traversals 847
Breadth-First Traversal 848
Depth-First Traversal 849
Topological Order 851
Paths 854
Finding a Path 854
The Shortest Path in an Unweighted Graph 854
The Shortest Path in a Weighted Graph 857
Java Interfaces for the ADT Graph 860
Chapter 29 Graph Implementations 871
An Overview of Two Implementations 872
The Adjacency Matrix 872
The Adjacency List 873
Vertices and Edges 874
Specifying the Class Vertex 875
The Inner Class Edge 877
Implementing the Class Vertex 878
An Implementation of the ADT Graph 881
Basic Operations 881
Graph Algorithms 884
Appendix A Documentation and Programming Sty le 891
Naming Variables and Classes 891
Indenting 892
Comments 892
Single-Line Comments 893
Comment Blocks 893
When to Write Comments 893
Java Documentation Comments 893
Appendix B Java Basics (online)
Introduction
Applications and Applets
Objects and Classes
A First Java Application Program
Elements of Java
Identifiers
Reserved Words
Variables
Table of Contents
Table of Contents
Primitive Type*
Constants
Assignment Statements
Assignment Compatibilities
Typecasting
Arithmetic Operators and repressions
Parentheses and Precedence Rules
Increment and Decrement Operators
Special Assignment Operators
Named Constants
The Class Math
Simple Input and Output Using the Keyboard and Screen
Screen Output
Keyboard Input Using the Class Scanner
The 1f-else Statement
Boolean repressions
Nested Statements
Multiwav if ֊else Statements
«
The Conditional Operator Optional)
The switch Statement
Enumerations
Scope
Loops
The while Statement
The for Statement
The do-while Statement
Additional Loop Information
The Class String
Characters Within Strings
Concatenation of Strings
String Methods
11k Class StrtngBuilder
Using Scanner to Extract Pieces of a String
Arrays
Arras Parameters and Returned Values
Initializing Arrays
Arras Index Out of Bounds
Use of - and — with Amass
Amass and the For-Each Loop
Multidimensional Arrays
Wrapper Classes
Appendix C Java Classes (online)
Objects and Classes
Using the Methods in a Jasa Class
References and Aliases
Defining a Java Class
Method Definitions
Arguments and Parameters
Passing Arguments
A Definition of the Class H»m
Constructors
The Method toString
Methods That Call Other Methods
Methods That Return an Instance of Their Class
Static Fields and Methods
Overloading Methods
Enumeration as a Class
Packages
The Java Class Library
Appendix D Creating Classes from Other Classes 899
Composition 900
Adapters 902
Inheritance 903
Invoking Constructors from Within Constructors 906
Private Fields and Methods of the Superclass 907
Overriding and Overloading Methods 908
Multiple Inheritance 913
Type Compatibility and Superclasses 913
The Class Object 914
Appendix E File Input and Output (online)
Preliminaries
Why Files?
Streams
The Kinds of Files
File Names
Text Files
Creating a Text File
Reading a Text File
Changing Existing Data in a Text File
Defining a Method to Open a Stream
Binary Files
Creating a Binary File of Primitive Data
Reading a Binary File of Primitive Data
Strings in a Binary File
Object Serialization
Glossary (online)
index
919
Table of Contents
|
| any_adam_object | 1 |
| author | Carrano, Frank M. Henry, Timothy M. |
| author_GND | (DE-588)1252631545 (DE-588)1073836088 |
| author_facet | Carrano, Frank M. Henry, Timothy M. |
| author_role | aut aut |
| author_sort | Carrano, Frank M. |
| author_variant | f m c fm fmc t m h tm tmh |
| building | Verbundindex |
| bvnumber | BV042061475 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D33 |
| callnumber-search | QA76.9.D33 |
| callnumber-sort | QA 276.9 D33 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 250 |
| classification_tum | DAT 362f DAT 455f |
| ctrlnum | (OCoLC)913022233 (DE-599)BVBBV042061475 |
| 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 | fourth edition, global edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02183nam a2200541 c 4500</leader><controlfield tag="001">BV042061475</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140905s2016 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">014025945</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781292077185</subfield><subfield code="9">978-1-292-07718-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1292077182</subfield><subfield code="9">1-292-07718-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)913022233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042061475</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D33</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/3</subfield><subfield code="2">23</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="100" ind1="1" ind2=" "><subfield code="a">Carrano, Frank M.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1252631545</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and abstractions with Java</subfield><subfield code="c">Frank M. Carrano ; Timothy M. Henry</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">fourth edition, global edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich [u.a.]</subfield><subfield code="b">Pearson</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">930 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="490" ind1="0" ind2=" "><subfield code="a">Always learning</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</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="650" ind1="0" ind2="7"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Henry, Timothy M.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1073836088</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=027502346&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-027502346</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV042061475 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:11:42Z |
| institution | BVB |
| isbn | 9781292077185 1292077182 |
| language | English |
| lccn | 014025945 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027502346 |
| oclc_num | 913022233 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-11 |
| owner_facet | DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-11 |
| physical | 930 S. graph. Darst. |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Pearson |
| record_format | marc |
| series2 | Always learning |
| spelling | Carrano, Frank M. Verfasser (DE-588)1252631545 aut Data structures and abstractions with Java Frank M. Carrano ; Timothy M. Henry fourth edition, global edition Boston ; Munich [u.a.] Pearson 2016 930 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Always learning Includes bibliographical references and index 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 Abstrakter Datentyp (DE-588)4120827-4 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Datenstruktur (DE-588)4011146-5 s Abstrakter Datentyp (DE-588)4120827-4 s Java Programmiersprache (DE-588)4401313-9 s 1\p DE-604 Henry, Timothy M. Verfasser (DE-588)1073836088 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=027502346&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Carrano, Frank M. Henry, Timothy M. Data structures and abstractions with Java Data structures (Computer science) Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4401313-9 (DE-588)4120827-4 (DE-588)4151278-9 |
| title | Data structures and abstractions with Java |
| title_auth | Data structures and abstractions with Java |
| title_exact_search | Data structures and abstractions with Java |
| title_full | Data structures and abstractions with Java Frank M. Carrano ; Timothy M. Henry |
| title_fullStr | Data structures and abstractions with Java Frank M. Carrano ; Timothy M. Henry |
| title_full_unstemmed | Data structures and abstractions with Java Frank M. Carrano ; Timothy M. Henry |
| title_short | Data structures and abstractions with Java |
| title_sort | data structures and abstractions with java |
| topic | Data structures (Computer science) Java (Computer program language) Datenstruktur (DE-588)4011146-5 gnd Java Programmiersprache (DE-588)4401313-9 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd |
| topic_facet | Data structures (Computer science) Java (Computer program language) Datenstruktur Java Programmiersprache Abstrakter Datentyp Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027502346&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT carranofrankm datastructuresandabstractionswithjava AT henrytimothym datastructuresandabstractionswithjava |