Building Java programs: a back to basics approach
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston
Pearson
[2017]
|
| Ausgabe: | Fourth Edition, global edition |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 1220 Seiten |
| ISBN: | 9781292161686 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV043379056 | ||
| 003 | DE-604 | ||
| 005 | 20170418 | ||
| 007 | t | ||
| 008 | 160219s2017 xxu |||| 00||| eng d | ||
| 010 | |a 015049340 | ||
| 020 | |a 9781292161686 |9 978-1-292-16168-6 | ||
| 035 | |a (OCoLC)992472617 | ||
| 035 | |a (DE-599)BVBBV043379056 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-91G |a DE-473 |a DE-91 |a DE-863 | ||
| 050 | 0 | |a QA76.73.J38 | |
| 082 | 0 | |a 005.13/3 |2 23 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 362f |2 stub | ||
| 100 | 1 | |a Reges, Stuart |e Verfasser |0 (DE-588)1130155986 |4 aut | |
| 245 | 1 | 0 | |a Building Java programs |b a back to basics approach |c Stuart Reges, University of Washington; Marty Stepp, Stanford University |
| 250 | |a Fourth Edition, global edition | ||
| 264 | 1 | |a Boston |b Pearson |c [2017] | |
| 264 | 4 | |c © 2018 | |
| 300 | |a 1220 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Java (Computer program language) | |
| 650 | 0 | 7 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Java |g Programmiersprache |0 (DE-588)4401313-9 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Stepp, Marty |e Verfasser |0 (DE-588)1130156117 |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=028797796&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028797796 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| DE-BY-863_location | 1000 |
|---|---|
| DE-BY-FWS_call_number | 1000/ST 250 J35 R333(4) |
| DE-BY-FWS_katkey | 1030921 |
| DE-BY-FWS_media_number | 083101203133 |
| _version_ | 1806177174746562560 |
| adam_text | Chapter 1 Introduction to Java Programming 27
Chapter 2 Primitive Data and Definite Loops 89
Chapter 3 Introduction to Parameters and Objects 163
Supplement 3G Graphics (Optional) 222
Chapter 4 Conditional Execution 264
Chapter 5 Program Logic and Indefinite Loops 341
Chapter 6 File Processing 413
Chapter 7 Arrays 469
Chapter 8 Classes 556
Chapter 9 Inheritance and Interfaces 613
Chapter 10 ArrayLists 688
Chapter 11 Java Collections Framework 741
Chapter 12 Recursion 780
Chapter 13 Searching and Sorting 858
Chapter 14 Stacks and Queues 910
Chapter 15 Implementing a Collection Class 948
Chapter 16 Linked Lists 991
Chapter 17 Binary Trees 1043
Chapter 18 Advanced Data Structures 1097
Chapter 19 Functional Programming with Java 8 1133
Appendix A Java Summary 1175
Appendix B The Java API Specification and Javadoc Comments 1190
Appendix C Additional Java Syntax 1196
13
Chapter 1 Introduction to Java Programming
27
u Basic Computing Concepts 28
Why Programming? 28
Hardware and Software 29
The Digital Realm 30
The Process of Programming 32
Why Java? 33
The Java Programming Environment 34
1.2 And Now---Java 36
String Literals (Strings) 40
System.out.printIn 41
Escape Sequences 41
print versus println 43
Identifiers and Keywords 44
A Complex Example: DrawFiguresl 46
Comments and Readability 47
1.3 Program Errors 50
Syntax Errors 50
Logic Errors (Bugs) 54
1.4 Procedural Decomposition 54
Static Methods 57
Flow of Control 60
Methods That Call Other Methods 62
An Example Runtime Error 65
1.5 Case Study: DrawFigures 66
Structured Version 67
Final Version without Redundancy 69
Analysis of Flow of Execution 70
Chapter 2 Primitive Data and Definite Loops 89
2.1 Basic Data Concepts 90
Primitive Types 90
15
16 Contents
Expressions 91
Literals 93
Arithmetic Operators 94
Precedence 96
Mixing Types and Casting 99
2.2 Variables 100
Assignment/Declaration Variations 105
String Concatenation 108
Increment/Decrement Operators 110
Variables and Mixing Types 113
2.3 The for Loop 115
Tracing for Loops 117
for Loop Patterns 121
Nested for Loops 123
2.4 Managing Complexity 125
Scope 125
Pseudocode 131
Class Constants 134
2.5 Case Study: Hourglass Figure 136
Problem Decomposition and Pseudocode 137
Initial Structured Version 139
Adding a Class Constant 140
Further Variations 143
Chapter 3 Introduction to Parameters
and Objects 163
3.1 Parameters 164
The Mechanics of Parameters 167
Limitations of Parameters 171
Multiple Parameters 174
Parameters versus Constants 177
Overloading of Methods 177
3.2 MethodsThat Return Values 178
The Math Class 179
Defining Methods That Return Values 182
3.3 Using Objects 186
String Objects 187
Interactive Programs and Scanner Objects 193
Sample Interactive Program 196
Contents
17
3.4 Case Study: Projectile Trajectory 199
Unstructured Solution 203
Structured Solution 205
Supplement 3G Graphics (Optional) 222
3G.I Introduction to Graphics 223
DrawingPanel 223
Drawing Lines and Shapes 224
Colors 229
Drawing with Loops 232
Text and Fonts 236
Images 239
3G.2 Procedural Decomposition with Graphics 241
A Larger Example: DrawDiamonds 242
3G.3 Case Study: Pyramids 245
Unstructured Partial Solution 246
Generalizing the Drawing of Pyramids 248
Complete Structured Solution 249
Chapter 4 Conditional Execution 264
4.1 if /else Statements 265
Relational Operators 267
Nested if/else Statements 269
Object Equality 276
Factoring if/el se Statements 277
Testing Multiple Conditions 279
4.2 Cumulative Algorithms 280
Cumulative Sum 280
Min/Max Loops 282
Cumulative Sum with if 286
Roundoff Errors 288
4.3 Text Processing 291
The char Type 291
char versus int 292
Cumulative Text Algorithms 293
System.out.printf 295
4.4 Methods with Conditional Execution 300
Preconditions and Postconditions 300
Throwing Exceptions 300
Contents
Revisiting Return Values 304
Reasoning about Paths 309
4.5 Case Study: Body Mass Index 311
One-Person Unstructured Solution 312
Two-Person Unstructured Solution 315
Two-Person Structured Solution 317
Procedural Design Heuristics 321
Chapter 5 Program Logic and Indefinite Loops 341
5.1 The while Loop 342
A Loop to Find the Smallest Divisor 343
Random Numbers 346
Simulations 350
do/while Loop 351
5.2 Fencepost Algorithms 353
Sentinel Loops 355
Fencepost with if 356
5.3 The boolean Type 359
Logical Operators 361
Short-Circuited Evaluation 364
boolean Variables and Flags 368
Boolean Zen 370
Negating Boolean Expressions 373
5.4 User Errors 374
Scanner Lookahead 375
Handling User Errors 377
5.5 Assertions and Program Logic 379
Reasoning about Assertions 381
A Detailed Assertions Example 382
5.6 Case Study: NumberGuess 387
Initial Version without Hinting 387
Randomized Version with Hinting 389
Final Robust Version 393
Chapter 6 File Processing 413
6.1 File-Reading Basics 414
Data, Data Everywhere 414
Contents
Files and File Objects
Reading a File with a Scanner
19
6.2
Details ofToken-Based Processing
Structure of Files and Consuming Input
Scanner Parameters
Paths and Directories
A More Complex Input File
6.3 Line-Based Processing
String Scanners and Line/Token Combinations
414
417
422
424
429
430
433
435
436
Advanced File Processing 441
Output Files with PrintStream 441
Guaranteeing That Files Can Be Read 446
Case Study: Zip Code Lookup 449
Chapter 7 Arrays
469
7.1 Array Basics 470
Constructing and Traversing an Array 470
Accessing an Array 474
A Complete Array Program 477
Random Access 481
Arrays and Methods 484
The For-Each Loop 487
Initializing Arrays 489
The Arrays Class 490
7.2 Array-Traversal Algorithms 491
Printing an Array 492
Searching and Replacing 494
Testing for Equality 497
Reversing an Array 498
String Traversal Algorithms 503
Functional Approach 504
7.3 Reference Semantics 505
Multiple Objects 507
7.4 Advanced Array Techniques 510
Shifting Values in an Array 510
Arrays of Objects 514
Command-Line Arguments 516
Nested Loop Algorithms 516
20
Contents
7.5 Multidimensional Arrays 518
Rectangular Two-Dimensional Arrays 518
Jagged Arrays 520
7.6 Arrays of Pixels 525
7.7 Case Study: Benford’s Law 530
Tallying Values 531
Completing the Program 535
Chapter 8 Classes 556
8.1 Object-Oriented Programming 557
Classes and Objects 558
Point Objects 560
8.2 Object State and Behavior 561
Object State: Fields 562
Object Behavior: Methods 564
The Implicit Parameter 567
Mutators and Accessors 569
The toString Method 571
8.3 Object Initialization: Constructors 573
The Keyword this 578
Multiple Constructors 580
8.4 Encapsulation 581
Private Fields 582
Class Invariants 588
Changing Internal Implementations 592
8.5 Case Study: Designing a Stock Class 594
Object-Oriented Design Heuristics 595
Stock Fields and Method Headers 597
Stock Method and Constructor Implementation 599
Chapter 9 Inheritance and Interfaces 613
9.1 Inheritance Basics 614
Nonprogramming Hierarchies 615
Extending a Class 617
Overriding Methods 621
Contents
21
9.2 Interacting with the Superclass 623
Calling Overridden Methods 623
Accessing Inherited Fields 624
Calling a Superclass’s Constructor 626
DividendStock Behavior 628
The Object Class 630
The equals Method 631
The instanceof Keyword 634
9.3 Polymorphism 636
Polymorphism Mechanics 639
Interpreting Inheritance Code 641
Interpreting Complex Calls 643
9.4 Inheritance and Design 646
A Misuse of Inheritance 646
Is-a Versus Has-a Relationships 649
Graphics2D 650
9.5 Interfaces 652
An Interface for Shapes 653
Implementing an Interface 655
Benefits of Interfaces 658
9.6 Case Study: Financial Class Hierarchy 660
Designing the Classes 661
Redundant Implementation 665
Abstract Classes 668
Chapter 10 ArrayLists 688
10.1 ArrayLists 689
Basic ArrayList Operations 690
ArrayList Searching Methods 693
A Complete ArrayList Program 696
Adding to and Removing from an ArrayList 698
Using the For-Each Loop with ArrayLists 702
Wrapper Classes 703
10.2 The Comparable Interface 706
Natural Ordering and compareTo 708
Implementing the Comparable Interface 712
10.3 Case Study: Vocabulary Comparison 718
Some Efficiency Considerations 718
Version 1: Compute Vocabulary 721
22
Contents
Version 2: Compute Overlap
Version 3: Complete Program
724
729
Chapter 11 Java Collections Framework 741
11.1 Lists 742
Collections 742
LinkedList versus ArrayList 743
Iterators 746
Abstract Data Types (ADTs) 750
LinkedList Case Study: Sieve 752
11.2 Sets 755
Set Concepts 756
TreeSet versus HashSet 758
Set Operations 759
Set Case Study: Lottery 761
11.3 Maps 763
Basic Map Operations 764
Map Views (keyset and values) 766
TreeMap versus HashMap 767
Map Case Study: WordCount 768
Collection Overview 771
Chapter 12 Recursion 780
12.1 Thinking Recursively 781
A Nonprogramming Example 781
An Iterative Solution Converted to Recursion 784
Structure of Recursive Solutions 786
12.2 A Better Example of Recursion 788
Mechanics of Recursion 790
12.3 Recursive Functions and Data 798
Integer Exponentiation 798
Greatest Common Divisor 801
Directory Crawler 807
Helper Methods 811
12.4 Recursive Graphics
814
Contents
23
12.5 Recursive Backtracking 818
A Simple Example: Traveling North/East 819
8 Queens Puzzle 824
Solving Sudoku Puzzles 831
12.6 Case Study: Prefix Evaluator 835
Infix, Prefix, and Postfix Notation 835
Evaluating Prefix Expressions 836
Complete Program 839
Chapter 13 Searching and Sorting 858
13.1 Searching and Sorting in the Java Class Libraries 859
Binary Search 860
Sorting 863
Shuffling 864
Custom Ordering with Comparators 865
13.2 Program Complexity 869
Empirical Analysis 870
Complexity Classes 876
13.3 Implementing Searching and Sorting Algorithms 878
Sequential Search 879
Binary Search 880
Recursive Binary Search 883
Searching Objects 886
Selection Sort 877
13.4 Case Study: Implementing Merge Sort 890
Splitting and Merging Arrays 891
Recursive Merge Sort 894
Complete Program 897
Chapter 14 Stacks and Queues 910
14.1 Stack/Queue Basics 911
Stack Concepts 911
Queue Concepts 914
14.2 Common Stack/Queue Operations 915
Transferring Between Stacks and Queues 917
Sum of a Queue 918
Sum of a Stack 919
24
Contents
14.3 Complex Stack/Queue Operations 922
Removing Values from a Queue 922
Comparing Two Stacks for Similarity 924
14.4 Case Study: Expression Evaluator 926
Splitting into Tokens 927
The Evaluator 932
Chapter 15 Implementing a Collection Class 948
15.1 Simple ArraylntList 949
Adding and Printing 949
Thinking about Encapsulation 955
Dealing with the Middle of the List 956
Another Constructor and a Constant 961
Preconditions and Postconditions 962
15.2 A More Complete ArraylntList 966
Throwing Exceptions 966
Convenience Methods 969
15.3 Advanced Features 972
Resizing When Necessary 972
Adding an Iterator 974
15.4 ArrayList E 980
Chapter 16 Linked Lists 991
16.1 Working with Nodes 992
Constructing a List 993
List Basics 995
Manipulating Nodes 998
Traversing a List 1001
16.2 A Linked List Class 1005
Simple LinkedlntList 1005
Appending add 1007
The Middle of the List 1011
16.3 A Complex List Operation 1018
Inch worm Approach 1023
16.4 An IntList Interface 1024
Contents
25
16.5 LinkedList E 1027
Linked List Variations 1028
Linked List Iterators 1031
Other Code Details 1033
Chapter 17 Binary Trees 1043
17.1 Binary Tree Basics 1044
Node and Tree Classes 1047
17.2 Tree Traversals 1048
Constructing and Viewing a Tree 1054
17.3 Common Tree Operations 1063
Sum of a Tree 1063
Counting Levels 1064
Counting Leaves 1066
17.4 Binary Search Trees 1067
The Binary Search Tree Property 1068
B uilding a Binary Search Tree 1070
The Pattern x = change(x) 1074
Searching the Tree 1077
Binary Search Tree Complexity 1081
17.5 SearchTree E 1082
Chapter 18 Advanced Data Structures 1097
18.1 Hashing 1098
Array Set Implementations 1098
Hash Functions and Hash Tables 1099
Collisions 1101
Rehashing 1106
Hashing Non-Integer Data 1109
Hash Map Implementation 1112
18.2 Priority Queues and Heaps 1113
Priority Queues 1113
Introduction to Heaps 1115
Removing from a Heap 1117
Adding to a Heap 1118
Array Heap Implementation 1120
Heap Sort 1124
26
Contents
Chapter 19 Functional Programming
with Java 8 1133
19.1 Effect-Free Programming 1134
19.2 First-Class Functions 1137
Lambda Expressions 1140
19.3 Streams 1143
Basic Idea 1143
Using Map 1145
Using Filter 1146
Using Reduce 1148
Optional Results 1149
19.4 Function Closures 1150
19.5 Highei^Order Operations on Collections 1153
Working with Arrays 1154
Working with Lists 1155
Working with Files 1159
19.6 Case Study: Perfect Numbers N60
Computing Sums 1161
Incorporating Square Root 1164
Just Five and Leveraging Concurrency 1167
Appendix A Java Summary 1175
Appendix B The Java API Specification
and Javadoc Comments 1190
Appendix C Additional Java Syntax 1196
Index 1205
Credits 1219
|
| any_adam_object | 1 |
| author | Reges, Stuart Stepp, Marty |
| author_GND | (DE-588)1130155986 (DE-588)1130156117 |
| author_facet | Reges, Stuart Stepp, Marty |
| author_role | aut aut |
| author_sort | Reges, Stuart |
| author_variant | s r sr m s ms |
| building | Verbundindex |
| bvnumber | BV043379056 |
| 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 |
| classification_tum | DAT 362f |
| ctrlnum | (OCoLC)992472617 (DE-599)BVBBV043379056 |
| 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>01852nam a2200457 c 4500</leader><controlfield tag="001">BV043379056</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170418 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">160219s2017 xxu |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">015049340</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781292161686</subfield><subfield code="9">978-1-292-16168-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992472617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043379056</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-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-863</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">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="100" ind1="1" ind2=" "><subfield code="a">Reges, Stuart</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1130155986</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Building Java programs</subfield><subfield code="b">a back to basics approach</subfield><subfield code="c">Stuart Reges, University of Washington; Marty Stepp, Stanford University</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</subfield><subfield code="b">Pearson</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1220 Seiten</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">Java (Computer program language)</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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stepp, Marty</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1130156117</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=028797796&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-028797796</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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 | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV043379056 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-01T11:33:02Z |
| institution | BVB |
| isbn | 9781292161686 |
| language | English |
| lccn | 015049340 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028797796 |
| oclc_num | 992472617 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-863 DE-BY-FWS |
| owner_facet | DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-91 DE-BY-TUM DE-863 DE-BY-FWS |
| physical | 1220 Seiten |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Pearson |
| record_format | marc |
| spellingShingle | Reges, Stuart Stepp, Marty Building Java programs a back to basics approach Java (Computer program language) Java Programmiersprache (DE-588)4401313-9 gnd |
| subject_GND | (DE-588)4401313-9 (DE-588)4123623-3 |
| title | Building Java programs a back to basics approach |
| title_auth | Building Java programs a back to basics approach |
| title_exact_search | Building Java programs a back to basics approach |
| title_full | Building Java programs a back to basics approach Stuart Reges, University of Washington; Marty Stepp, Stanford University |
| title_fullStr | Building Java programs a back to basics approach Stuart Reges, University of Washington; Marty Stepp, Stanford University |
| title_full_unstemmed | Building Java programs a back to basics approach Stuart Reges, University of Washington; Marty Stepp, Stanford University |
| title_short | Building Java programs |
| title_sort | building java programs a back to basics approach |
| title_sub | a back to basics approach |
| topic | Java (Computer program language) Java Programmiersprache (DE-588)4401313-9 gnd |
| topic_facet | Java (Computer program language) Java Programmiersprache Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028797796&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT regesstuart buildingjavaprogramsabacktobasicsapproach AT steppmarty buildingjavaprogramsabacktobasicsapproach |
Inhaltsverzeichnis
THWS Würzburg Zentralbibliothek Lesesaal
| Signatur: |
1000 ST 250 J35 R333(4) |
|---|---|
| Exemplar 1 | ausleihbar Verfügbar Bestellen |