No more than 3 exams: Difference between revisions

From Computer Science Wiki
(Created page with "right|frame|This a problem set for you to work through <ref>http://www.flaticon.com/</ref> This is a problem set. Some of these are easy, others are far m...")
 
 
(7 intermediate revisions by the same user not shown)
Line 9: Line 9:
== What is this problem set trying to do ==
== What is this problem set trying to do ==


This is example problem set. In this example we are learning about [[lists]], [[conditionals]],  and processing user input.
In this problem set we are really testing your [[computational thinking]].


== The Problem ==
== The Problem ==


At a prestigious international school, we have only 5 administrators, Michael, Carol, Jen,  Constance and TJ. Your program should ask the user to type in their name. If their name matches one of our administrators, your program must output a special greeting. If the user input is any other name (does not match the list of administrators).  
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.  


There is no testing for user input. That is, if a user enters a number, an integer, or nothing, your program should not evaluate the input.
You must:


== Unit Tests ==
* create a list of students
* create a list of classes
* map the students to classes


* '''User Input:''' Name: Bill
* determine if a class has an exam
* '''Expected output:''' Hello Bill
* determine the day of the week the class has the exam


* '''User Input:''' Name: TJ
* 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.
* '''Expected output:''' An administrator! Hello TJ
* '''User Input:''' Name: 123
* '''Expected output:''' Hello 123
 
== Hacker edition ==
 
In the hacker version:
 
* Your program should test for valid user input. The user input should be only allow for strings
 
THIS PART ISNT DONE YET


== How you will be assessed ==
== How you will be assessed ==

Latest revision as of 15:00, 3 November 2018

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!