| Contents [0/1] |
| Homework [1/1] |
(Click here for one slide per page)
| Homework [1/1] |
Read Algorithms 3.3 and 3.5.
Re-read the Term Project assignment.
I will be reading your project proposals and getting feedback to you before next week's class meeting.
Begin thinking about your design. Your design document is due in two weeks.
The section on Assessment Criteria in the assignment should give you enough information to understand what I'm looking for.
Feel free to create diagrams that illustrate your thinking as part of the design document. A picture tells a thousand words!
Complete the quiz on D2L.
Complete the following methods - and only these methods, in MyIntSET.java. These are the accessor methods.
public void printLeftI() {
public int size() {
public int height() {
public int sizeOdd() {
public int sizeAtDepth(int k) {
public int sizeAboveDepth(int k) {
public int sizeBelowDepth(int k) {
public boolean isPerfectlyBalancedS() {
public boolean isPerfectlyBalancedH() {
public boolean isOddBalanced() {
public boolean isSemiBalanced() {
You will implement the remaining methods as part of next week's homework; only the methods above will be graded as part of this homework.
Optional: Here is an interesting video showing how to derive binary search in a fancy programming environment: