No more than 3 exams

From Computer Science Wiki
Revision as of 15:00, 3 November 2018 by Mr. MacKenty (talk | contribs) (→‎The Problem)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
This a problem set for you to work through [1]

This is a problem set. Some of these are easy, others are far more difficult. The purpose of these problems sets are:

  1. to build your skill applying computational thinking to a problem
  2. to assess your knowledge and skills of different programming practices


What is this problem set trying to do[edit]

In this problem set we are really testing your computational thinking.

The Problem[edit]

There is a rule at our school that students must not have more than 2 major exams in one calendar day. This rule is designed to reduce stress.

You must:

  • create a list of students
  • create a list of classes
  • map the students to classes
  • determine if a class has an exam
  • determine the day of the week the class has the exam
  • loop through the test events and count the test events on one day. If any of the students has more than 2 exams on one day, you must indicate a warning, indicating the conflicting student, class and day.

How you will be assessed[edit]

Your solution will be graded using the following axis:


Scope

  • To what extent does your code implement the features required by our specification?
  • To what extent is there evidence of effort?

Correctness

  • 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?

Design

  • 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?

Style

  • 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?

References[edit]

A possible solution[edit]

Click the expand link to see one possible solution, but NOT before you have tried and failed!

not yet!