Intermezzo

For the intermezzo, you will not be working on your usual repository, but on the repository of another team. The repository change match the formula: ((i+1)mod 6)+1

That is: 1 -> 3, 2 -> 4, 3 -> 5, 4 -> 6, 5 -> 1, 6 -> 2.

The security settings on github should have been changed so that you have access to the other team repo, but not yours anylonger. Contact the assistants in case of troubles.

The intermezzo consists of three tasks.

1. Reverse-engineer the main use cases implemented in the application. Create a UML use case diagram and upload it into your wiki under /intermezzo (you don’t have access to the other team wiki). You can use a computer tool or draw it by hand and then scan it. But it must be readable, and digital.

2. Implement a feature. You must implement several stories that correspond to a feature. When you are done, create a git tag intermezzo. The exact stories to implement are described below

3. Write a code review. Write a code review according to the following perspectives: design, coding style, JavaDoc, tests. Here are more Hints for the review. It must be constructive and useful. The review should serve as guidelines to improve the existing code. Upload your review into your wiki under /intermezzo.

The three tasks represent 12 points. The three parts are due in two weeks and the deadline to deliver all three parts is November, 14 at 12:00.

Feature: Auctions

Story 1: Seller put an item for auction

As a seller, I can sell an item for auction, so that I can guarantee a minimal revenue yet maximize my profit.

• Acceptance criteria: Items can be sold in either mode: fixed price or as auction.
• Acceptance criteria: Seller can specify a minimal price.
• Acceptance criteria: Seller can specify an "increment" for the auction.
• Acceptance criteria: Seller can specify an end time for the auction.
• Acceptance criteria: The selling mode, the minimal price, the increment and the end time can be changed as long as not buyer has placed any bid.

Story 2: Buyer bids for an auction

As a buyer, I can bid for an auction up to a maximal price, so that I can win the auction if I've the highest maximal bid yet minimize the actual price to pay.

• Acceptance criteria: To maximal price of the bid must be >= the minimal price defined in the auction.
• Acceptance criteria: The maximal price of the bid can be increased, as long as the auction is not over.
• Acceptance criteria: Two bidders can not have the same maximal price.
• Acceptance criteria: If the n bidders are sorted according to their maximal prices MP1 <= MP2 <= ... <= MPn, the current winner of the auction is the bidder n; the current selling price is defined as MP(n-1)+increment. The current winner and the current selling price is recomputed each time a new bid is placed or increased.
• Acceptance criteria: When the current winner changes, the old winner receives an email.
• Acceptance criteria: At the time the auction terminates, the transaction proceeds accordingly with the current winner and the current selling price. The winner receives a confirmation email.