| Contents [0/1] |
| Homework (Deck of Cards) [1/1] |
(Click here for one slide per page)
| Homework (Deck of Cards) [1/1] |
Read the following from Core Java for the Impatient.
Chapter 3, Sections 3.1 - 3.3 only (Interfaces)
Chapter 4, Sections 4.1 - 4.3 only (Inheritance)
Chapter 6, Sections 6.1 - 6.6 only (Generics)
Read the section on Binary Search in Algorithms, pages 378-386.
Read Section 1.4 (Analysis of Algorithms) in the Algorithms textbook.
Skim Section 2.1 (Elementary Comparison-Based Sorting) in the Algorithms textbook.
There is no quiz due next week.
Do the homework assigned on D2L (See Submissions).
In this homework, you will get exposure to Java enumerations, interfaces, classes, and Comparable/Comparator.
Create a new package in IntelliJ IDEA, called ds1.student.cards. Download the following files and save them to this new package.
Implement all the methods and tests as indicated with the TODO comments in both Card.java and Deck.java. Do not change Suit.java or Rank.java. Start with Card.java first, and then do Deck.java.
Note: There are two main programs for this homework. They are in Card.java and Deck.java. You should be sure to run both of them!