Add numbers in a collection

From Computer Science Wiki
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]

This problem set is helping you learn pseudocode.

The Problem[edit]

Given a collection with 10 numbers write a pseudocode algorithm to add them together and output an answer. You may only use methods available to a collection.

Those methods are:

  • addItem()
  • getNext()
  • resetNext()
  • hasNext()
  • isEmpty()

Please carefully study page four in this pseudo guide.

numbers_to_add = [12,13,14,15,16,17,18,19,20,21]

# Your pseudocode here. 

print("The answer is: ", answer")


Unit Tests[edit]

  • Input: A collection named "numbers_to_add
  • Expected output: "The answer is: 165"

Hacker Version[edit]

In addition to adding the numbers, average them. In this case, your output will be 16.5. Please remember, you can only use methods available to a collection.


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!