Novice and Introductory Projects

Hello World

All programmers start off with two simple words: ‘Hello World!’

This is a nice and friendly introduction to the programming environment and language. We can make python say this by doing the following in the python console.

   print("Hello World!")

We can improve upon this by creating a function. This function will do the following:

src.python_fundamentals.hello_world.say_hello(target='World')

Python method that says hello to a target

Parameters: target (str) – A target to direct your greeting. Defaults to ‘World’ if target is not specified
Returns: Prints ‘Hello World!’ in the console.
Return type: None

For this assignment do the following:

Create a method that implements the function described above.
Have your program say hello to the world.
have your program ask who you are.
have your program say hello to you directly.

Solution

Hello World Solution

Weight Calculator

Have the terminal ask how the mass of an object on earth in kilograms. Then calculate how much it would weigh on all planets in the solar system and the moon. Have the program nicely print the results.

Consider creating a method with the following functionality to streamline the process.

src.python_fundamentals.weight_calculator.print_weights(mass: float) → None

Print the weights of the object on each planet for a given mass.

Parameters: mass (float) – mass of the object
Returns: Prints weights on each of the planets and moon.
Return type: None

Gravitational Force on Different Planets
Name	Gravitational Force (G)
Mercury	0.38
Venus	0.9
Earth	1
Moon	0.17
Mars	0.38
Jupiter	2.53
Saturn	1.07
Uranus	0.89
Neptune	1.14

Solution

Weight Calculator Solution

Fibonacci Sequence

Create a function that implements the fibonacci sequence to a number specified by the user. Have your program ask the user how many numbers they wish to calculate and print a list of the numbers.

The fibonacci sequence is as follows:

\[0, 1, 1, 2, 3, 5, 8, ....\]

Which can be represented as:

\[F(n) = F(n-1) + F(n-2)\]

The following methods could be implemented to return the fibonacci sequence.

src.python_fundamentals.fibonacci.fibonacci(index): Calculates the fibonacci number of a given index

src.python_fundamentals.fibonacci.fibonacci_list(max_index)

Method that implements the fibonacci sequence to a given value

Parameters: max_index (int) – the maximum of the for loop for the fibonacci sequence.
Returns: Creates a list of max_index fibonacci numbers.
Return type: list

Note

You may choose to implement the fibonacci method using recursion, a function that calls itself. This is one of many ways to handle this. It is not required to implement a recursive function, but you may find it easier to understand.

Solution

Fibonacci Sequence Solution

Fizz Buzz

Implement the common fizz buzz programming question. Have a program that asks the user for a maximum number for the fizz buzz loop.

Iterate through a loop from 1 to a maximum number.
For each number divisible by three, print ‘Fizz’
For each number divisible by five, print ‘Buzz’
For each number divisible by both three and five, print ‘FizzBuzz’
Otherwise print the index of the loop.

src.python_fundamentals.fizzbuzz.fizzbuzz(max_index)

Method that implements the fizzbuzz problem

Parameters: max_index (int) – the maximum of the for loop for fizzbuzz.
Returns: Prints max_index amount of statements in the console.
Return type: None

Solution

Fizz Buzz Solution