This is a problem set. Some of these are easy, others are far more difficult. The purpose of these problems sets are:
- to build your skill applying computational thinking to a problem
- to assess your knowledge and skills of different programming practices
What is this problem set trying to do
In this example we are learning about representing a problem, creating a model for the solution, and implementing the solution.
This problem set is used from an old exam question by the IB.
A car park has rules to enforce a short-stay policy. Staying in the car park for up to 2 hours is allowed, and is subject to two possible fees. Staying in the car park for durations longer than two hours is subject to three possible fines, in addition to the original fee, up to a maximum price for each day. Tickets are paid in Euros.
The possible fees and fines are stored in a two-dimensional (2D) array named RULES.
- Staying in the car park for 40 minutes costs 3.00 EUR
- Staying in the car park for 3 hours 3.00 + 15.00 = 18.00 EURO
- Any stay in the car park the exceeds 4 hours costs 30.00 EURO
- A stay that spans two consecutive days, regardless of duration, costs 60.00 EURO
Your task: Construct the steps of an algorithm that calculates the amount that a ticket is to be charged.
How you will be assessed
Your solution will be graded using the following axis:
- To what extent does your code implement the features required by our specification?
- To what extent is there evidence of effort?
- To what extent did your code meet specifications?
- To what extent did your code meet unit tests?
- To what extent is your code free of bugs?
- To what extent is your code written well (i.e. clearly, efficiently, elegantly, and/or logically)?
- To what extent is your code eliminating repetition?
- To what extent is your code using functions appropriately?
- To what extent is your code readable?
- To what extent is your code commented?
- To what extent are your variables well named?
- To what extent do you adhere to style guide?
A possible solution
Click the expand link to see one possible solution, but NOT before you have tried and failed!