Data Structures and Algorithms in Java,
6th Edition Goodrich, Tamassia
Ch 1 to 15
SOLUTIONS MANUAL
, Table of contents
Chapter 1: Java Primer
Chapter 2: Object-Oriented Design
Chapter 3: Fundamental Data Structures
Chapter 4: Algorithm Analysis
Chapter 5: Recursion
Chapter 6: Stacks, Queues, and Deques
Chapter 7: List and Iterator ADTs
Chapter 8: Trees
Chapter 9: Priority Queues
Chapter 10: Maps, Hash Tables, and Skip Lists
Chapter 11: Search Trees
Chapter 12: Sorting and Selection
Chapter 13: Text Processing
Chapter 14: Graph Algorithms
Chapter 15: Memory Management and B-Trees
, Chapter
Java Primer
1
Hints and Solutions
Reinforcement
R-1.1) Hint Use the code templates provided in the Simple Input
and Output section.
R-1.2) Hint You may read about cloning in Section 3.6.
R-1.2) Solution Since, after the clone, A[4] and B[4] are both pointing
to the same GameEntry object, B[4].score is noẇ 550.
R-1.3) Hint The modulus operator could be useful here.
R-1.3) Solution
public boolean isMultiple(long n, long m) {
return (n%m == 0);
}
R-1.4) Hint Use bit operations.
R-1.4) Solution
public boolean isEven(int i) {
return (i & 1 == 0);
}
R-1.5) Hint The easy solution uses a loop, but there is also a formula for
this, ẇhich is discussed in Chapter 4.
R-1.5) Solution
public int sumToN(int n) {
int total = 0;
for (int j=1; j <= n; j++) total +=
j;
return total;
}
,
6th Edition Goodrich, Tamassia
Ch 1 to 15
SOLUTIONS MANUAL
, Table of contents
Chapter 1: Java Primer
Chapter 2: Object-Oriented Design
Chapter 3: Fundamental Data Structures
Chapter 4: Algorithm Analysis
Chapter 5: Recursion
Chapter 6: Stacks, Queues, and Deques
Chapter 7: List and Iterator ADTs
Chapter 8: Trees
Chapter 9: Priority Queues
Chapter 10: Maps, Hash Tables, and Skip Lists
Chapter 11: Search Trees
Chapter 12: Sorting and Selection
Chapter 13: Text Processing
Chapter 14: Graph Algorithms
Chapter 15: Memory Management and B-Trees
, Chapter
Java Primer
1
Hints and Solutions
Reinforcement
R-1.1) Hint Use the code templates provided in the Simple Input
and Output section.
R-1.2) Hint You may read about cloning in Section 3.6.
R-1.2) Solution Since, after the clone, A[4] and B[4] are both pointing
to the same GameEntry object, B[4].score is noẇ 550.
R-1.3) Hint The modulus operator could be useful here.
R-1.3) Solution
public boolean isMultiple(long n, long m) {
return (n%m == 0);
}
R-1.4) Hint Use bit operations.
R-1.4) Solution
public boolean isEven(int i) {
return (i & 1 == 0);
}
R-1.5) Hint The easy solution uses a loop, but there is also a formula for
this, ẇhich is discussed in Chapter 4.
R-1.5) Solution
public int sumToN(int n) {
int total = 0;
for (int j=1; j <= n; j++) total +=
j;
return total;
}
,
