Big Java: Early Objects, 7e

Title Page......Page 3
Copyright Page......Page 4
Preface......Page 5
Contents......Page 17
Chapter 1 Introduction......Page 35
1.1 Computer Programs......Page 36
1.2 The Anatomy of a Computer......Page 37
1.3 The Java Programming Language......Page 39
1.4 Becoming Familiar with Your Programming Environment......Page 41
1.5 Analyzing Your First Program......Page 45
1.6 Errors......Page 48
1.7.1 The Algorithm Concept......Page 49
1.7.2 An Algorithm for Solving an Investment Problem......Page 50
1.7.3 Pseudocode......Page 51
1.7.4 From Algorithms to Programs......Page 52
Chapter Summary......Page 56
Review Exercises......Page 57
Practice Exercises......Page 58
Programming Projects......Page 61
Chapter 2 Using Objects......Page 63
2.1 Objects and Classes......Page 64
2.1.2 Classes......Page 65
2.2.1 Variable Declarations......Page 66
2.2.2 Types......Page 68
2.2.3 Names......Page 69
2.2.5 Assignment......Page 70
2.3.1 The Public Interface of a Class......Page 73
2.3.2 Method Arguments......Page 74
2.3.3 Return Values......Page 75
2.3.4 Method Declarations......Page 76
2.4 Constructing Objects......Page 78
2.5 Accessor and Mutator Methods......Page 80
2.6.1 Browsing the API Documentation......Page 81
2.6.2 Packages......Page 83
2.7 Implementing a Test Program......Page 84
2.8 Object References......Page 86
2.9 Graphical Applications......Page 89
2.9.1 Frame Windows......Page 90
2.9.2 Drawing on a Component......Page 91
2.10.1 Ellipses and Circles......Page 94
2.10.4 Colors......Page 96
Chapter Summary......Page 98
Review Exercises......Page 101
Practice Exercises......Page 102
Programming Projects......Page 105
Worked Examples......Page 109
Chapter 3 implementing Classes......Page 117
3.1.1 Instance Variables......Page 118
3.1.3 Encapsulation......Page 120
3.2.1 Specifying Methods......Page 122
3.2.2 Specifying Constructors......Page 123
3.2.4 Commenting the Public Interface......Page 125
3.3.1 Providing Instance Variables......Page 128
3.3.2 Providing Constructors......Page 129
3.3.3 Providing Methods......Page 131
3.4 Unit Testing......Page 137
3.5 Problem Solving: Tracing Objects......Page 140
3.6 Local Variables......Page 142
3.7 The this Reference......Page 144
3.8 Shape Classes......Page 146
Chapter Summary......Page 153
Review Exercises......Page 155
Practice Exercises......Page 157
Programming Projects......Page 162
Worked Example......Page 165
Chapter 4 Fundamental Data Types......Page 169
4.1.1 Number Types......Page 170
4.1.2 Constants......Page 172
4.2.2 Increment and Decrement......Page 177
4.2.3 Integer Division and Remainder......Page 178
4.2.4 Powers and Roots......Page 179
4.2.5 Converting Floating-Point Numbers to Integers......Page 180
4.3.1 Reading Input......Page 184
4.3.2 Formatted Output......Page 185
4.4 Problem Solving: First Do It By Hand......Page 191
4.5.1 The String Type......Page 192
4.5.2 Concatenation......Page 193
4.5.5 Strings and Characters......Page 194
4.5.6 Substrings......Page 195
Chapter Summary......Page 199
Review Exercises......Page 201
Practice Exercises......Page 205
Programming Projects......Page 209
Worked Examples......Page 215
Chapter 5 Decisions......Page 221
5.1 The if Statement......Page 222
5.2 Comparing Values......Page 227
5.2.1 Relational Operators......Page 228
5.2.3 Comparing Strings......Page 229
5.2.5 Testing for null......Page 231
5.3 Multiple Alternatives......Page 236
5.4 Nested Branches......Page 239
5.5 Problem Solving: Flowcharts......Page 246
5.6 Problem Solving: Selecting Test Cases......Page 249
5.7 Boolean Variables and Operators......Page 251
5.8 Application: Input Validation......Page 256
Chapter Summary......Page 259
Review Exercises......Page 261
Practice Exercises......Page 265
Programming Projects......Page 269
Worked Example......Page 277
Chapter 6 Loops......Page 279
6.1 The while Loop......Page 280
6.2 Problem Solving: Hand-Tracing......Page 287
6.3 The for Loop......Page 291
6.4 The do Loop......Page 298
6.5 Application: Processing Sentinel Values......Page 300
6.6 Problem Solving: Storyboards......Page 305
6.7.1 Sum and Average Value......Page 307
6.7.3 Finding the First Match......Page 308
6.7.5 Maximum and Minimum......Page 309
6.7.6 Comparing Adjacent Values......Page 310
6.8 Nested Loops......Page 314
6.9 Application: Random Numbers and Simulations......Page 317
6.9.1 Generating Random Numbers......Page 318
6.9.2 The Monte Carlo Method......Page 319
6.10 Using a Debugger......Page 321
Chapter Summary......Page 326
Review Exercises......Page 328
Practice Exercises......Page 334
Programming Projects......Page 338
Worked Examples......Page 345
Chapter 7 Arrays and Array Lists......Page 357
7.1.1 Declaring and Using Arrays......Page 358
7.1.2 Array References......Page 361
7.1.4 Partially Filled Arrays......Page 362
7.2 The Enhanced for Loop......Page 366
7.3.4 Element Separators......Page 368
7.3.5 Linear Search......Page 369
7.3.7 Inserting an Element......Page 370
7.3.8 Swapping Elements......Page 372
7.3.9 Copying Arrays......Page 373
7.3.10 Reading Input......Page 374
7.4 Problem Solving: Adapting Algorithms......Page 376
7.5 Problem Solving: Discovering Algorithms by Manipulating Physical Objects......Page 381
7.6.1 Declaring Two-Dimensional Arrays......Page 384
7.6.2 Accessing Elements......Page 385
7.6.3 Locating Neighboring Elements......Page 386
7.6.4 Accessing Rows and Columns......Page 387
7.6.5 Two-Dimensional Array Parameters......Page 388
7.7.1 Declaring and Using Array Lists......Page 391
7.7.2 Using the Enhanced for Loop with Array Lists......Page 394
7.7.4 Wrappers and Auto-boxing......Page 395
7.7.5 Using Array Algorithms with Array Lists......Page 396
7.7.7 Removing Matches......Page 397
7.7.8 Choosing Between Array Lists and Arrays......Page 398
7.8 Regression Testing......Page 400
Chapter Summary......Page 403
Review Exercises......Page 407
Practice Exercises......Page 411
Programming Projects......Page 416
Worked Examples......Page 425
Chapter 8 Designing Classes......Page 433
8.1 Discovering Classes......Page 434
8.2.1 Providing a Cohesive Public Interface......Page 435
8.2.2 Minimizing Dependencies......Page 436
8.2.3 Separating Accessors and Mutators......Page 437
8.2.4 Minimizing Side Effects......Page 438
8.3.1 Keeping a Total......Page 444
8.3.3 Collecting Values......Page 445
8.3.5 Modeling Objects with Distinct States......Page 446
8.3.6 Describing the Position of an Object......Page 447
8.4 Static Variables and Methods......Page 448
8.5 Problem Solving: Solve a Simpler Problem First......Page 453
8.6.1 Organizing Related Classes into Pack ages......Page 457
8.6.2 Importing Packages......Page 458
8.6.4 Packages and Source Files......Page 459
8.7 Unit Test Frameworks......Page 462
Chapter Summary......Page 465
Review Exercises......Page 467
Practice Exercises......Page 470
Programming Projects......Page 473
Chapter 9 Inheritance......Page 481
9.1 Inheritance Hierarchies......Page 482
9.2 Implementing Subclasses......Page 486
9.3 Overriding Methods......Page 490
9.4 Polymorphism......Page 495
9.5.1 Overriding the toString Method......Page 506
9.5.2 The equals Method......Page 508
9.5.3 The instanceof Operator......Page 509
Chapter Summary......Page 514
Review Exercises......Page 515
Practice Exercises......Page 517
Programming Projects......Page 518
Worked Example......Page 523
Chapter 10 Interfaces......Page 527
10.1.1 Discovering an Interface Type......Page 528
10.1.2 Declaring an Interface Type......Page 529
10.1.3 Implementing an Interface Type......Page 531
10.1.4 Comparing Interfaces and Inheritance......Page 533
10.2.1 Converting from Classes to Interfaces......Page 536
10.2.3 Casting from Interfaces to Classes......Page 537
10.3 The Comparable Interface......Page 538
10.4 Using Interfaces for Callbacks......Page 543
10.5 Inner Classes......Page 548
10.6 Mock Objects......Page 549
10.7.1 Listening to Events......Page 551
10.7.2 Using Inner Classes for Listeners......Page 553
10.8 Building Applications with Buttons......Page 556
10.9 Processing Timer Events......Page 559
10.10 Mouse Events......Page 562
Chapter Summary......Page 567
Review Exercises......Page 571
Practice Exercises......Page 573
Programming Projects......Page 575
Worked Example......Page 581
Chapter 11 Input/Output and Exception Handling......Page 583
11.1 Reading and Writing Text Files......Page 584
11.2.1 Reading Words......Page 589
11.2.4 Reading Lines......Page 590
11.2.7 Avoiding Errors When Reading Numbers......Page 592
11.2.8 Mixing Number, Word, and Line Input......Page 593
11.2.9 Formatting Output......Page 594
11.3 Command Line Arguments......Page 596
11.4.1 Throwing Exceptions......Page 603
11.4.2 Catching Exceptions......Page 605
11.4.3 Checked Exceptions......Page 607
11.4.4 Closing Resources......Page 609
11.4.5 Designing Your Own Exception Types......Page 610
11.5 Application: Handling Input Errors......Page 612
Chapter Summary......Page 617
Review Exercises......Page 619
Practice Exercises......Page 620
Programming Projects......Page 623
Worked Example......Page 627
Chapter 12 Object-Oriented Design......Page 631
12.1.1 Discovering Classes......Page 632
12.1.2 The CRC Card Method......Page 633
12.2.1 Dependency......Page 635
12.2.2 Aggregation......Page 636
12.2.3 Inheritance......Page 637
12.3.1 Requirements......Page 640
12.3.2 CRC Cards......Page 641
12.3.4 Method Documentation......Page 644
12.3.5 Implementation......Page 646
Chapter Summary......Page 652
Review Exercises......Page 655
Practice Exercises......Page 656
Programming Projects......Page 657
Worked Example......Page 661
Chapter 13 Recursion......Page 681
13.1 Triangle Numbers......Page 682
13.2 Recursive Helper Methods......Page 690
13.3 The Efficiency of Recursion......Page 691
13.4 Permutations......Page 697
13.5 Mutual Recursion......Page 701
13.6 Backtracking......Page 707
Chapter Summary......Page 713
Review Exercises......Page 715
Practice Exercises......Page 716
Programming Projects......Page 718
Worked Examples......Page 723
Chapter 14 Sorting and Searching......Page 733
14.1 Selection Sort......Page 734
14.2 Profiling the Selection Sort Algorithm......Page 737
14.3 Analyzing the Performance of the Selection Sort Algorithm......Page 740
14.4 Merge Sort......Page 744
14.5 Analyzing the Merge Sort Algorithm......Page 747
14.6.1 Linear Search......Page 751
14.6.2 Binary Search......Page 753
14.7.1 Linear Time......Page 756
14.7.2 Quadratic Time......Page 757
14.7.3 The Triangle Pattern......Page 758
14.7.4 Logarithmic Time......Page 759
14.8.1 Sorting......Page 760
14.8.3 Comparing Objects......Page 761
Chapter Summary......Page 764
Review Exercises......Page 766
Practice Exercises......Page 771
Programming Projects......Page 772
Worked Example......Page 775
Chapter 15 The Java Collections Framework......Page 779
15.1 An Overview of the Collections Framework......Page 780
15.2.1 The Structure of Linked Lists......Page 782
15.2.3 List Iterators......Page 784
15.3.1 Choosing a Set Implementation......Page 788
15.3.2 Working with Sets......Page 790
15.4 Maps......Page 793
15.5.1 Stacks......Page 799
15.5.2 Queues......Page 800
15.5.3 Priority Queues......Page 801
15.6.1 Balancing Parentheses......Page 802
15.6.2 Evaluating Reverse Polish Expressions......Page 803
15.6.3 Evaluating Algebraic Expressions......Page 805
15.6.4 Backtracking......Page 808
Chapter Summary......Page 811
Review Exercises......Page 813
Practice Exercises......Page 815
Programming Projects......Page 818
Worked Examples......Page 821
Chapter 16 Basic Data Structures......Page 831
16.1.1 The Node Class......Page 832
16.1.2 Adding and Removing the First Element......Page 833
16.1.3 The Iterator Class......Page 834
16.1.4 Advancing an Iterator......Page 835
16.1.5 Removing an Element......Page 836
16.1.6 Adding an Element......Page 838
16.1.8 Efficiency of Linked List Operations......Page 839
16.2.1 Getting and Setting Elements......Page 846
16.2.2 Removing or Adding Elements......Page 848
16.2.3 Growing the Internal Array......Page 849
16.3.1 Stacks as Linked Lists......Page 850
16.3.2 Stacks as Arrays......Page 852
16.3.3 Queues as Linked Lists......Page 853
16.3.4 Queues as Circular Arrays......Page 854
16.4.2 Hash Tables......Page 856
16.4.4 Adding and Removing Elements......Page 858
16.4.5 Iterating over a Hash Table......Page 859
Chapter Summary......Page 865
Review Exercises......Page 867
Practice Exercises......Page 869
Programming Projects......Page 871
Worked Example......Page 875
Chapter 17 Tree Structures......Page 889
17.1 Basic Tree Concepts......Page 890
17.2.1 Binary Tree Examples......Page 894
17.2.2 Balanced Trees......Page 896
17.2.3 A Binary Tree Implementation......Page 897
17.3 Binary Search Trees......Page 898
17.3.1 The Binary Search Property......Page 899
17.3.2 Insertion......Page 900
17.3.3 Removal......Page 902
17.3.4 Efficiency of the Operations......Page 903
17.4.1 Inorder Traversal......Page 907
17.4.2 Preorder and Postorder Traversals......Page 909
17.4.3 The Visitor Pattern......Page 910
17.4.4 Depth-First and Breadth-First Search......Page 911
17.4.5 Tree Iterators......Page 912
17.5.1 Basic Properties of Red-Black Trees......Page 913
17.5.2 Insertion......Page 915
17.5.3 Removal......Page 916
17.6 Heaps......Page 920
17.7 The Heapsort Algorithm......Page 930
Chapter Summary......Page 935
Review Exercises......Page 937
Programming Projects......Page 939
Worked Examples......Page 943
Chapter 18 Generic Classes......Page 965
18.1 Generic Classes and Type Parameters......Page 966
18.2 Implementing Generic Types......Page 967
18.3 Generic Methods......Page 970
18.4 Constraining Type Parameters......Page 972
18.5 Type Erasure......Page 975
Chapter Summary......Page 980
Practice Exercises......Page 981
Programming Projects......Page 982
Worked Example......Page 985
Chapter 19 Stream Processing......Page 997
19.1 The Stream Concept......Page 998
19.2 Producing Streams......Page 1000
19.3 Collecting Results......Page 1001
19.4 Transforming Streams......Page 1004
19.5 Lambda Expressions......Page 1006
19.6 The Optional Type......Page 1011
19.7 Other Terminal Operations......Page 1013
19.8.2 Mapping a Primitive-Type Stream......Page 1015
19.8.3 Processing Primitive-Type Streams......Page 1016
19.9 Grouping Results......Page 1017
19.10.1 Filling......Page 1019
19.10.4 Element Separators......Page 1020
19.10.6 Comparing Adjacent Values......Page 1021
Chapter Summary......Page 1025
Practice Exercises......Page 1027
Programming Projects......Page 1029
Worked Examples......Page 1031
Chapter 20 Graphical User Interfaces......Page 1037
20.1.1 Using Layout Managers......Page 1038
20.1.2 Achieving Complex Layouts......Page 1039
20.1.3 Using Inheritance to Customize Frames......Page 1040
20.2.1 Text Fields......Page 1042
20.2.2 Text Areas......Page 1044
20.3.1 Radio Buttons......Page 1047
20.3.3 Combo Boxes......Page 1049
20.4 Menus......Page 1057
20.5 Exploring the Swing Documentation......Page 1064
Chapter Summary......Page 1069
Review Exercises......Page 1071
Practice Exercises......Page 1072
Programming Projects......Page 1073
Worked Example......Page 1075
Chapter 21 Advanced Input/Output......Page 1087
21.1 Readers, Writers, and Input/Output Streams......Page 1088
21.2 Binary Input and Output......Page 1089
21.3 Random Access......Page 1093
21.4 Object Input and Output Streams......Page 1098
21.5.1 Paths......Page 1103
21.5.3 Useful File Operations......Page 1104
21.5.4 Visiting Directories......Page 1105
Review Exercises......Page 1106
Practice Exercises......Page 1107
Programming Projects......Page 1108
Chapter 22 Multithreading......Page 1113
22.1 Running Threads......Page 1114
22.2 Terminating Threads......Page 1119
22.3 Race Conditions......Page 1121
22.4 Synchronizing Object Access......Page 1126
22.5 Avoiding Deadlocks......Page 1128
22.6 Application: Algorithm Animation......Page 1135
Chapter Summary......Page 1143
Review Exercises......Page 1144
Practice Exercises......Page 1145
Programming Projects......Page 1146
Chapter 23 Internet Networking......Page 1149
23.1 The Internet Protocol......Page 1150
23.2 Application Level Protocols......Page 1152
23.3 A Client Program......Page 1155
23.4 A Server Program......Page 1158
23.5 URL Connections......Page 1165
Chapter Summary......Page 1169
Review Exercises......Page 1170
Practice Exercises......Page 1171
Programming Projects......Page 1172
Chapter 24 Relational Databases......Page 1173
24.1.1 Database Tables......Page 1174
24.1.2 Linking Tables......Page 1175
24.1.3 Implementing Multi-Valued Relation ships......Page 1178
24.2 Queries......Page 1181
24.2.1 Simple Queries......Page 1183
24.2.3 Selecting Subsets......Page 1184
24.2.5 Joins......Page 1185
24.2.6 Updating and Deleting Data......Page 1187
24.3 Installing a Database......Page 1188
24.4.1 Connecting to the Database......Page 1192
24.4.2 Executing SQL Statements......Page 1193
24.4.3 Analyzing Query Results......Page 1195
24.4.4 Result Set Metadata......Page 1196
24.5 Application: Entering an Invoice......Page 1199
Chapter Summary......Page 1213
Review Exercises......Page 1215
Practice Exercises......Page 1216
Programming Projects......Page 1217
Chapter 25 XML......Page 1219
25.1.1 Advantages of XML......Page 1220
25.1.2 Differences Between XML and HTML......Page 1221
25.1.3 The Structure of an XML Document......Page 1222
25.2 Parsing XML Documents......Page 1227
25.3 Creating XML Documents......Page 1232
25.4.1 Document Type Definitions......Page 1241
25.4.2 Specifying a DTD in an XML Document......Page 1245
25.4.3 Parsing and Validation......Page 1246
Chapter Summary......Page 1251
Review Exercises......Page 1252
Programming Projects......Page 1254
Appendix A The Basic Latin and Latin-1 Subsets of Unicode......Page 1257
Appendix B Java Operator Summary......Page 1261
Appendix C Java Reserved Word Summary......Page 1263
Appendix D The Java Library......Page 1265
Appendix E Java Language Coding Guidelines......Page 1294
Appendix F Tool Summary......Page 1301
Appendix G Number Systems......Page 1305
Appendix H UML Summary......Page 1313
Appendix I Java Syntax Summary......Page 1316
Appendix J HTML Summary......Page 1327
Glossary......Page 1333
Index......Page 1343
Credits......Page 1373
Quick Reference......Page 1375
End User License Agreement......Page 1377