Java Challenges: 100+ Proven Tasks That Will Prepare You for Anything » książka
topmenu
Java Challenges: 100+ Proven Tasks That Will Prepare You for Anything
ISBN-13: 9781484273944 / Angielski / Miękka / 2021 / 800 str.
Java Challenges: 100+ Proven Tasks That Will Prepare You for Anything
ISBN-13: 9781484273944 / Angielski / Miękka / 2021 / 800 str.
cena 250,57 zł
(netto: 238,64 VAT: 5%)
Najniższa cena z 30 dni: 248,84 zł
(netto: 238,64 VAT: 5%)
Najniższa cena z 30 dni: 248,84 zł
Termin realizacji zamówienia:
ok. 20 dni roboczych.
ok. 20 dni roboczych.
Darmowa dostawa!
Kategorie:
Kategorie BISAC:
Wydawca:
Apress
Język:
Angielski
ISBN-13:
9781484273944
Rok wydania:
2021
Ilość stron:
800
Waga:
1.35 kg
Wymiary:
25.4 x 17.78 x 4.04
Oprawa:
Miękka
Wolumenów:
01
Dodatkowe informacje:
Wydanie ilustrowane
1 Introduction ................................................ 1
1.1 Structure of the chapters ...................................... 1
1.2 Basic structure of the Eclipse project ............................ 3
1.3 Basic framework for unit tests .................................. 4
1.4 Note on programming style .................................... 5
1.5 Trying out the examples and solutions........................... 9I Fundamentals 11
2 Mathematical problems ...................................... 13
2.1 Introduction.................................................. 13
2.1.1 Roman numerals....................................... 17
2.1.2 Number Games ........................................ 18
2.2 Exercises ................................................... 212.2.1 Exercise 1: Basic Arithmetic (★✩✩✩✩) ................... 21
2.2.2 Exercise 2: Number as text (★★✩✩✩) .................... 22
2.2.3 Exercise 3: Perfect numbers (★★✩✩✩) ................... 22
2.2.4 Exercise 4: Prime Numbers (★★✩✩✩) ................... 23
2.2.5 Exercise 5: Prime number pairs (★★✩✩✩) ................ 23
2.2.6 Exercise 6: Checksum (★★✩✩✩) ........................ 23
2.2.7 Exercise 7: Roman numbers (★★★★✩) .................. 24
2.2.8 Exercise 8: Combinatorics (★★✩✩✩) .................... 24
2.2.9 Exercise 9: Armstrong Numbers (★★✩✩✩) ............... 25
2.2.10 Exercise 10: Max Change Calculator (★★★★✩) ........... 25
2.2.11 Exercise 11: Related Numbers (★★✩✩✩)................. 26
2.2.12 Exercise 12: Prime factorization (★★★✩✩)................ 26
2.3 Solutions .................................................... 27
2.3.1 Solution 1: Basic Arithmetic (★✩✩✩✩) ................... 27
2.3.2 Solution 2: Number as text (★★✩✩✩) .................... 30
2.3.3 Solution 3: Perfect numbers (★★✩✩✩) ................... 32
2.3.4 Solution 4: Prime Numbers (★★✩✩✩) .................... 34
2.3.5 Solution 5: Prime number pairs (★★✩✩✩) ................ 36
vi Inhaltsverzeichnis
2.3.6 Solution 6: Checksum (★★✩✩✩) ........................ 40
2.3.7 Solution 7: Roman numbers (★★★★✩) ................... 41
2.3.8 Solution 8: Combinatorics (★★✩✩✩) ..................... 46
2.3.9 Solution 9: Armstrong Numbers (★★✩✩✩) ................ 49
2.3.10 Solution 10: Max Change Calculator (★★★★✩) ............ 52
2.3.11 Solution 11: Related Numbers (★★✩✩✩) ................. 54
2.3.12 Solution 12: Prime factorization (★★★✩✩) ................ 55
3 Recursion .................................................. 59
3.1 Introduction.................................................. 59
3.1.1 Mathematical examples ................................. 59
3.1.2 Algorithmic examples ................................... 63
3.1.3 Steps when multiplying the digits of a number.............. 67
3.1.4 Typical problems ....................................... 68
3.2 Exercises ................................................... 71
3.2.1 Exercise 1: Fibonacci (★★✩✩✩) ......................... 71
3.2.2 Exercise 2: Process digits (★★✩✩✩) ..................... 713.2.3 Exercise 3: GCD (★★✩✩✩) ............................. 72
3.2.4 Exercise 4: Reverse String (★★✩✩✩) .................... 73
3.2.5 Exercise 5: Array Sum (★★✩✩✩) ........................ 73
3.2.6 Exercise 6: Array Min (★★✩✩✩) ......................... 73
3.2.7 Exercise 7: Conversions (★★✩✩✩) ...................... 74
3.2.8 Exercise 8: Exponential Function (★★✩✩✩)............... 75
3.2.9 Exercise 9: Pascal’s triangle (★★✩✩✩) ................... 76
3.2.10 Exercise 10: Number palindromes (★★★★✩).............. 76
3.2.11 Exercise 11: Permutations (★★★✩✩) .................... 77
3.2.12 Exercise 12: Count Substrings (★★✩✩✩) ................. 77
3.2.13 Exercise 13: Ruler (★★✩✩✩) ........................... 78
3.3 Solutions .................................................... 79
3.3.1 Solution 1: Fibonacci (★★✩✩✩) ......................... 79
3.3.2 Solution 2: Process digits (★★✩✩✩) ..................... 81
3.3.3 Solution 3: GCD (★★✩✩✩) ............................. 82
3.3.4 Solution 4: Reverse String (★★✩✩✩) .................... 85
3.3.5 Solution 5: Array Sum (★★✩✩✩) ........................ 86
3.3.6 Solution 6: Array Min (★★✩✩✩) ......................... 87
3.3.7 Solution 7: Conversions (★★✩✩✩)....................... 88
3.3.8 Solution 8: Exponential Function (★★✩✩✩) ............... 92
3.3.9 Solution 9: Pascal’s triangle (★★✩✩✩) ................... 95
3.3.10 Solution 10: Number palindromes (★★★★✩) .............. 98
3.3.11 Solution 11: Permutations (★★★✩✩) ..................... 101
3.3.12 Solution 12: Count Substrings (★★✩✩✩) ................. 104
3.3.13 Solution 13: Ruler (★★✩✩✩) ............................ 108
Inhaltsverzeichnis vii
4 Strings ..................................................... 111
4.1 Introduction.................................................. 111
4.1.1 The class String ..................................... 112
4.1.2 The classes StringBuffer and StringBuilder ........ 113
4.1.3 Class Character ..................................... 114
4.1.4 Examples related to Character and String ............. 115
4.2 Exercises ................................................... 118
4.2.1 Exercise 1: Number conversions (★★✩✩✩) ............... 118
4.2.2 Exercise 2: Joiner (★✩✩✩✩) ............................ 1184.2.3 Exercise 3: Reverse String (★★✩✩✩) .................... 119
4.2.4 Exercise 4: Palindrome (★★★✩✩) ....................... 119
4.2.5 Exercise 5: No Duplicate Chars (★★★✩✩) ................ 120
4.2.6 Exercise 6: Remove Duplicate Letters (★★★✩✩) .......... 120
4.2.7 Exercise 7: Capitalize (★★✩✩✩) ........................ 121
4.2.8 Exercise 8: Rotation (★★✩✩✩) .......................... 122
4.2.9 Exercise 9: Well formed braces (★★✩✩✩) ................ 122
4.2.10 Exercise 10: Anagram (★★✩✩✩) ........................ 123
4.2.11 Exercise 11: Morse Code (★★✩✩✩) ..................... 123
4.2.12 Exercise 12: Pattern Checker (★★★✩✩) .................. 124
4.2.13 Exercise 13: Tennis score (★★★✩✩) ..................... 124
4.2.14 Exercise 14: Version numbers (★★✩✩✩) ................. 125
4.2.15 Exercise 15: Conversion strToLong (★★✩✩✩) ........... 125
4.2.16 Exercise 16: Print Tower (★★★✩✩) ...................... 126
4.3 Solutions .................................................... 127
4.3.1 Solution 1: Number conversions (★★✩✩✩) ............... 127
4.3.2 Solution 2: Joiner (★✩✩✩✩) ............................ 130
4.3.3 Solution 3: Reverse String (★★✩✩✩) .................... 132
4.3.4 Solution 4: Palindrome (★★★✩✩)........................ 134
4.3.5 Solution 5: No Duplicate Chars (★★★✩✩) ................ 137
4.3.6 Solution 6: Remove Duplicate Letters (★★★✩✩) ........... 138
4.3.7 Solution 7: Capitalize (★★✩✩✩) ......................... 140
4.3.8 Solution 8: Rotation (★★✩✩✩) .......................... 1444.3.9 Solution 9: Well formed braces (★★✩✩✩) ................ 145
4.3.10 Solution 10: Anagram (★★✩✩✩) ........................ 147
4.3.11 Solution 11: Morse Code (★★✩✩✩)...................... 148
4.3.12 Solution 12: Pattern Checker (★★★✩✩) .................. 150
4.3.13 Solution 13: Tennis score (★★★✩✩) ..................... 152
4.3.14 Solution 14: Version numbers (★★✩✩✩).................. 156
4.3.15 Solution 15: Conversion strToLong (★★✩✩✩) ........... 158
4.3.16 Solution 16: Print Tower (★★★✩✩)....................... 161
viii Inhaltsverzeichnis
5 Arrays ...................................................... 165
5.1 Introduction.................................................. 165
5.1.1 One-dimensional arrays ................................. 166
5.1.2 Multidimensional arrays ................................. 176
5.1.3 Typical errors .......................................... 183
5.2 Exercises ................................................... 184
5.2.1 Exercise 1: Even before odd numbers (★★✩✩✩) .......... 184
5.2.2 Exercise 2: Flip (★★✩✩✩) .............................. 184
5.2.3 Exercise 3: Palindrome (★★✩✩✩) ....................... 184
5.2.4 Exercise 4: Inplace Rotate (★★★✩✩) .................... 185
5.2.5 Exercise 5: Jewels Board Init (★★★✩✩) .................. 185
5.2.6 Exercise 6: Jewels Board Erase Diamonds (★★★★✩) ...... 187
5.2.7 Exercise 7: Spiral Traversal (★★★★✩) .................... 188
5.2.8 Exercise 8: Add One to Array As Number (★★✩✩✩) ....... 188
5.2.9 Exercise 9: Sudoku Checker (★★★✩✩)................... 189
5.2.10 Exercise 10: Flood-Fill (★★✩✩✩) ........................ 190
5.2.11 Exercise 11: Array Merge (★★✩✩✩) ..................... 191
5.2.12 Exercise 12: Array Min and Max (★★✩✩✩) ............... 191
5.2.13 Exercise 13: Array Split (★★★✩✩) ....................... 192
5.2.14 Exercise 14: Minesweeper Board (★★★✩✩) .............. 1935.3 Solutions .................................................... 195
5.3.1 Solution 1: Even before odd numbers (★★✩✩✩) ........... 195
5.3.2 Solution 2: Flip (★★✩✩✩) .............................. 199
5.3.3 Solution 3: Palindrome (★★✩✩✩)........................ 203
5.3.4 Solution 4: Inplace Rotate (★★★✩✩) ..................... 205
5.3.5 Solution 5: Jewels Board Init (★★★✩✩) .................. 209
5.3.6 Solution 6: Jewels Board Erase Diamonds (★★★★✩) ...... 216
5.3.7 Solution 7: Spiral Traversal (★★★★✩) .................... 225
5.3.8 Solution 8: Add One to Array As Number (★★✩✩✩) ........ 230
5.3.9 Solution 9: Sudoku Checker (★★★✩✩) ................... 232
5.3.10 Solution 10: Flood-Fill (★★✩✩✩) ........................ 238
5.3.11 Solution 11: Array Merge (★★✩✩✩)...................... 242
5.3.12 Solution 12: Array Min and Max (★★✩✩✩) ................ 246
5.3.13 Solution 13: Array Split (★★★✩✩) ....................... 249
5.3.14 Solution 14: Minesweeper Board (★★★✩✩) ............... 254
Inhaltsverzeichnis ix
6 Date processing ............................................ 261
6.1 Introduction.................................................. 261
6.1.1 The enumerations DayOfWeek and Month ................ 261
6.1.2 The classes LocalDate, LocalTime and LocalDateTime 262
6.1.3 The class ZonedDateTime ............................. 264
6.1.4 The class ZoneId ..................................... 265
6.1.5 Class Duration....................................... 266
6.1.6 The class Period ..................................... 267
6.1.7 Date arithmetic ........................................ 268
6.1.8 Formatting and parsing ................................. 270
6.2 Exercises ................................................... 272
6.2.1 Exercise 1: Leap Years (★✩✩✩✩) ....................... 272
6.2.2 Exercise 2: Basic knowledge Date-API (★★✩✩✩).......... 272
6.2.3 Exercise 3: Length of Month (★★✩✩✩) ................... 273
6.2.4 Exercise 4: Time Zones (★★✩✩✩) ....................... 273
6.2.5 Exercise 5: Time Zone Calculation (★★✩✩✩) ............. 273
6.2.6 Exercise 6: Calculations with LocalDate ................. 274
6.2.7 Exercise 7: Calendar output (★★★✩✩) ................... 274
6.2.8 Exercise 8: Weekdays (★✩✩✩✩) ........................ 2756.2.9 Exercise 9: Sundays and leap years (★★✩✩✩) ............ 276
6.2.10 Exercise 10: TemporalAdjuster (★★★✩✩)................. 276
6.2.11 Exercise 11: NthWeekdayAdjuster (★★★✩✩) ............. 277
6.2.12 Exercise 12: Payday-TemporalAdjuster (★★★✩✩) ......... 277
6.2.13 Exercise 13: Formatting and Parsing (★★✩✩✩) ........... 278
6.2.14 Exercise 14: Fault Tolerant Parsing (★★✩✩✩) ............. 278
6.3 Solutions .................................................... 279
6.3.1 Solution 1: Leap Years (★✩✩✩✩) ........................ 279
6.3.2 Solution 2: Basic knowledge Date-API (★★✩✩✩) .......... 280
6.3.3 Solution 3: Length of Month (★★✩✩✩) ................... 281
6.3.4 Solution 4: Time Zones (★★✩✩✩) ....................... 282
6.3.5 Solution 5: Time Zone Calculation (★★✩✩✩).............. 283
6.3.6 Solution 6: Calculations with LocalDate ................. 284
6.3.7 Solution 7: Calendar output (★★★✩✩) ................... 286
6.3.8 Solution 8: Weekdays (★✩✩✩✩) ........................ 289
6.3.9 Solution 9: Sundays and leap years (★★✩✩✩) ............ 292
6.3.10 Solution 10: TemporalAdjuster (★★★✩✩) ................. 294
6.3.11 Solution 11: NthWeekdayAdjuster (★★★✩✩) .............. 295
6.3.12 Solution 12: Payday-TemporalAdjuster (★★★✩✩) .......... 297
6.3.13 Solution 13: Formatting and Parsing (★★✩✩✩) ............ 301
6.3.14 Solution 14: Fault Tolerant Parsing (★★✩✩✩) ............. 302
x Inhaltsverzeichnis
7 Basic data structures: lists, sets, and maps ................... 305
7.1 Introduction.................................................. 305
7.1.1 The interface Collection.............................. 305
7.1.2 Lists and the interface List ......................... 306
7.1.3 Sets and the interface Set .............................. 307
7.1.4 Key-value mappings and the interface map ................ 307
7.1.5 The stack as LIFO data structure ......................... 308
7.1.6 The queue as FIFO data structure........................ 309
7.2 Exercises ................................................... 311
7.2.1 Exercise 1: Set operations (★★✩✩✩) .................... 311
7.2.2 Exercise 2: List Reverse (★★✩✩✩) ...................... 311
7.2.3 Exercise 3: Remove Duplicates (★★✩✩✩) ................ 312
7.2.4 Exercise 4: Maximum Profit (★★★✩✩) ................... 312
7.2.5 Exercise 5: Longest sequence (★★★✩✩) ................. 313
7.2.6 Exercise 6: Own stack (★★✩✩✩) ........................ 313
7.2.7 Exercise 7: Well-formed braces (★★✩✩✩) ................ 313
7.2.8 Exercise 8: Check Magic Triangle (★★★✩✩) .............. 314
7.2.9 Exercise 9: Pascal’s triangle (★★★✩✩) ................... 314
7.2.10 Exercise 10: Most Frequent Elements (★★✩✩✩) .......... 315
7.2.11 Exercise 11: Addition of digits (★★★✩✩) ................. 315
7.2.12 Exercise 12: Compound Key (★★✩✩✩) .................. 316
7.2.13 Exercise 13: List Merge (★★✩✩✩) ....................... 316
7.2.14 Exercise 14: Excel Magic Select (★★✩✩✩) ............... 317
7.3 Solutions .................................................... 318
7.3.1 Solution 1: Set operations (★★✩✩✩) ..................... 318
7.3.2 Solution 2: List Reverse (★★✩✩✩)....................... 323
7.3.3 Solution 3: Remove Duplicates (★★✩✩✩) ................ 326
7.3.4 Solution 4: Maximum Profit (★★★✩✩) .................... 327
7.3.5 Solution 5: Longest sequence (★★★✩✩) ................. 330
7.3.6 Solution 6: Own stack (★★✩✩✩) ........................ 3337.3.7 Solution 7: Well-formed braces (★★✩✩✩) ................ 335
7.3.8 Solution 8: Check Magic Triangle (★★★✩✩)............... 340
7.3.9 Solution 9: Pascal’s triangle (★★★✩✩) ................... 344
7.3.10 Solution 10: Most Frequent Elements (★★✩✩✩) ........... 346
7.3.11 Solution 11: Addition of digits (★★★✩✩) .................. 348
7.3.12 Solution 12: Compound Key (★★✩✩✩) ................... 352
7.3.13 Solution 13: List Merge (★★✩✩✩) ....................... 354
7.3.14 Solution 14: Excel Magic Select (★★✩✩✩)................ 356
Inhaltsverzeichnis xi
II More advanced and tricky topics 361
8 Advanced recursion ......................................... 363
8.1 Memoization ................................................. 363
8.1.1 Memoization for Fibonacci numbers ...................... 363
8.1.2 Memoization for Pascal’s triangle ......................... 365
8.2 Backtracking ................................................. 368
8.2.1 n-queens problem ...................................... 368
8.3 Exercises ................................................... 372
8.3.1 Exercise 1: Towers of Hanoi (★★★✩✩) ................... 372
8.3.2 Exercise 2: Edit Distance (★★★★✩) ..................... 373
8.3.3 Exercise 3: Longest Common Subsequence (★★★✩✩) ..... 373
8.3.4 Exercise 4: Way out of labyrinth (★★★✩✩) ................ 374
8.3.5 Exercise 5: Sudoku Solver (★★★★✩) .................... 375
8.3.6 Exercise 6: Math Operator Checker (★★★★✩) ............ 376
8.3.7 Exercise 7: Water Bucket Problem (★★★✩✩) ............. 377
8.3.8 Exercise 8: All palindrome substrings (★★★★✩) ........... 378
8.3.9 Exercise 9: n-queens problem (★★★✩✩) ................. 378
8.4 Solutions .................................................... 379
8.4.1 Solution 1: Towers of Hanoi (★★★✩✩) ................... 379
8.4.2 Solution 2: Edit Distance (★★★★✩) ...................... 385
8.4.3 Solution 3: Longest Common Subsequence (★★★✩✩) ..... 391
8.4.4 Solution 4: Way out of labyrinth (★★★✩✩) ................ 394
8.4.5 Solution 5: Sudoku Solver (★★★★✩) ..................... 397
8.4.6 Solution 6: Math Operator Checker (★★★★✩) ............. 405
8.4.7 Solution 7: Water Bucket Problem (★★★✩✩) .............. 410
8.4.8 Solution 8: All palindrome substrings (★★★★✩) ........... 4138.4.9 Solution 9: n-queens problem (★★★✩✩).................. 417
9 Binary trees ................................................ 425
9.1 Introduction.................................................. 425
9.1.1 Structure, terminology and examples of use ............... 425
9.1.2 Binary trees ........................................... 426
9.1.3 Binary trees with order: binary search trees ............... 427
9.1.4 Traversals ............................................. 429
9.1.5 Balanced trees and other properties ...................... 432
9.1.6 Trees for the examples and exercises ..................... 434
9.2 Exercises ................................................... 436
9.2.1 Exercise 1: Tree Traversal (★★✩✩✩) ..................... 436
9.2.2 Exercise 2: In-, Pre- und Postorder iterative (★★★★✩)...... 436
9.2.3 Exercise 3: Tree Height (★★✩✩✩) ....................... 436
9.2.4 Exercise 4: Lowest Common Ancestor (★★★✩✩) .......... 437
9.2.5 Exercise 5: Breadth-First (★★★✩✩) ...................... 437
xii Inhaltsverzeichnis
9.2.6 Exercise 6: Level Sum (★★★★✩) ........................ 438
9.2.7 Exercise 7: Tree Rotate (★★★✩✩) ....................... 438
9.2.8 Exercise 8: Reconstruction (★★★✩✩) .................... 439
9.2.9 Exercise 9: Math Evaluation (★★✩✩✩) ................... 439
9.2.10 Exercsie 10: Symmetry (★★✩✩✩) ....................... 440
9.2.11 Exercise 11: Check Binary Search Tree (★★✩✩✩) ......... 441
9.2.12 Exercise 12: Completeness (★★★★★) ................... 441
9.2.13 Exercise 13: Tree Printer (★★★★★) ...................... 443
9.3 Solutions .................................................... 446
9.3.1 Solution 1: Tree Traversal (★★✩✩✩) ..................... 446
9.3.2 Solution 2: In-, Pre- und Postorder iterative (★★★★✩) ...... 448
9.3.3 Solution 3: Tree Height (★★✩✩✩) ....................... 456
9.3.4 Solution 4: Lowest Common Ancestor (★★★✩✩) .......... 457
9.3.5 Solution 5: Breadth-First (★★★✩✩) ...................... 461
9.3.6 Solution 6: Level Sum (★★★★✩) ........................ 463
9.3.7 Solution 7: Tree Rotate (★★★✩✩) ....................... 467
9.3.8 Solution 8: Reconstruction (★★★✩✩) .................... 470
9.3.9 Solution 9: Math Evaluation (★★✩✩✩) ................... 476
9.3.10 Solution 10: Symmetry (★★✩✩✩) ....................... 477
9.3.11 Solution 11: Check Binary Search Tree (★★✩✩✩) ......... 481
9.3.12 Solution 12: Completeness (★★★★★) .................... 483
9.3.13 Solution 13: Tree Printer (★★★★★) ...................... 493
10 Searching and sorting ....................................... 503
10.1 Introduction Search ........................................... 503
10.1.1 Searching in Collections and Arrays ...................... 503
10.1.2 Binary search with binarySearch() .................... 505
10.2 Introduction Sort ............................................. 506
10.2.1 Insertion Sort .......................................... 506
10.2.2 Selection Sort ......................................... 508
10.2.3 Merge Sort ............................................ 51010.2.4 Quick Sort ............................................ 511
10.2.5 Bucket Sort ........................................... 514
10.2.6 Final Thoughts ........................................ 515
10.3 Exercises ................................................... 516
10.3.1 Exercise 1: Contains All (★★✩✩✩)....................... 516
10.3.2 Exercise 2: Partitioning (★★★✩✩) ....................... 516
10.3.3 Exercise 3: Binary Search (★★✩✩✩)..................... 517
10.3.4 Exercise 4: Insertion Sort (★★✩✩✩) ..................... 517
10.3.5 Exercise 5: Selection Sort (★★✩✩✩) ..................... 518
10.3.6 Exercise 6: Quick Sort (★★★✩✩) ........................ 518
10.3.7 Exercise 7: Bucket Sort (★★✩✩✩) ....................... 519
10.3.8 Exercise 8: Search in rotated data (★★★★✩).............. 519
Inhaltsverzeichnis xiii
10.4 Solutions .................................................... 521
10.4.1 Solution 1: Contains All (★★✩✩✩) ....................... 521
10.4.2 Solution 2: Partitioning (★★★✩✩) ........................ 522
10.4.3 Solution 3: Binary Search (★★✩✩✩) ..................... 524
10.4.4 Solution 4: Insertion Sort (★★✩✩✩)...................... 528
10.4.5 Solution 5: Selection Sort (★★✩✩✩) ..................... 529
10.4.6 Solution 6: Quick Sort (★★★✩✩) ........................ 530
10.4.7 Solution 7: Bucket Sort (★★✩✩✩) ....................... 532
10.4.8 Solution 8: Search in rotated data (★★★★✩) .............. 534
11 Conclusion and supplementary literature ..................... 541
11.1 Conclusion .................................................. 541
11.1.1 Lessons learned per chapter ............................ 541
11.1.2 Noteworthy ............................................ 543
11.2 Puzzles ..................................................... 544
11.2.1 Gold bags – detect the fake ............................. 545
11.2.2 Horse race – determine fastest three horses ............... 546
11.3 Supplementary literature ...................................... 549
III Appendix 553
A Quick start JShell ........................................... 555
A.1 Java + REPL => jshell ...................................... 555
B Short introduction JUnit 5 ................................... 561
B.1 Writing and running tests ...................................... 561
B.1.1 Example: A first unit test ................................ 561
B.1.2 Fundamentals of writing and running tests................. 562
B.1.3 Handling expected exceptions with assertThrows() ...... 565
B.2 Parameterized tests with JUnit 5 ............................... 566
C Quick start O-notation ....................................... 569
C.1 Estimations with the O-notation ................................ 569
C.1.1 Complexity classes ..................................... 570
C.1.2 Complexity and program running time .................... 572
Michael Inden is an Oracle-certified Java developer with over 20 years of professional experience designing complex software systems for international companies. There, he has worked in various roles such as SW developer, SW architect, consultant, team leader, CTO, head of academy, and trainer. Currently, he is working as a freelancer.
His special interests are creating high-quality applications with ergonomic GUIs, developing and solving programming puzzles, and coaching. He likes to pass on his knowledge and has led various courses and talks, both internally and externally, as well as at conferences such as JAX/W-JAX, JAX London, and Oracle Code One.
Besides, he is also an author of technical books. His german books, among others "Der Weg zum Java-Profi", Java Challenge", "Python Challenge" are all published by dpunkt.verlag.
Expand your knowledge of Java with this entertaining learning guide, which features 100+ exercises and programming challenges. Java Challenges will prepare you for your next exam or job interview, and covers many practical topics, such as strings, arrays, data structures, recursion, and date and time. The APIs and other material included in this book are Java 17 compatible.
Each topic is addressed in its own separate chapter, starting with an introduction to the basics and followed by multiple exercises of varying degrees of difficulty, helping you to improve your programming skills effectively. Detailed sample solutions, including the algorithms used for all tasks, are included to maximize your understanding of each area.
Author Michael Inden also describes alternative solutions and analyzes possible pitfalls and typical errors. Three appendices round out the book: one covering JShell, which is often helpful for trying out the code snippets and examples in the book, followed by an introduction to JUnit 5 for unit testing and verifying solutions, while the final appendix explains O-notation for estimating performance.
After reading this book, you'll be prepared to take the next step in your career or tackle your next personal project. All source code is freely available for download via the Apress website.
You will:
Czytaj nas na:
1997-2024 DolnySlask.com Agencja Internetowa
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
