Convert to binary from base-10: 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...")
(No difference)

Revision as of 07:56, 24 October 2019

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]

The actual solution to this problem is fairly straight-forward, but imagining how to solve the problem is tricky. As a side note, you must understand how to convert base 10 to base 2.

The Problem[edit]

Ask the user to enter a number in base 10. Then convert the number the user entered into binary. Extra points if you ensure the binary always has 8 digits

Unit Tests[edit]

  • User Input: 1
  • Expected output: 1
  • User Input: 4
  • Expected output: 100
  • User Input: 8
  • Expected output: 1000


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!