Difference between revisions of "Fibonacci"

From CSE231 Wiki
Jump to navigation Jump to search
(Created page with "=Background= The fibonacci sequence is a mathematical concept often used in computer science as a means to demonstrate iteration and recursion. Although you should be familia...")
 
Line 4: Line 4:
  
 
=Where to Start=
 
=Where to Start=
 +
You will need to return the number associated with a given position in the fibonacci sequence. For example, if 0 was fed in, the method should return 0. 1 should return 1, 2 should return 1, 3 should return 2, and so on.
 +
==JUnit Test Suite==
 +
<code>FibonacciTestSuite</code>
  
'''UNDER CONSTRUCTION'''
+
==Studio (Required)==
 +
===RecurrenceRelationSequentialFibonacciCalculator===
 +
===RecurrenceRelationParallelFibonacciCalculator===
 +
===MemoizationSequentialFibonacciCalculator===
 +
===MemoizationParallelFibonacciCalculator===
 +
===DynamicIterativeSequentialFibonacciCalculator===
  
==FibonacciStudio==
+
==Fun (Optional)==
 
+
===DynamicRecursiveSequentialFibonacciCalculator===
You will need to return the number associated with a given position in the fibonacci sequence. For example, if 0 was fed in, the method should return 0. 1 should return 1, 2 should return 1, 3 should return 2, and so on. You should use iteration to arrive at this value and you must use memoization to accomplish this. In other words, store and overwrite values.
+
===LinearRecurrenceSequentialFibonacciCalculator===
 +
===RoundPhiToTheNOverSqrt5SequentialFibonacciCalculator===

Revision as of 08:39, 20 September 2017

Background

The fibonacci sequence is a mathematical concept often used in computer science as a means to demonstrate iteration and recursion. Although you should be familiar with it from CSE 131, we will use the fibonacci sequence to demonstrate memoization and dynamic programming. Follow these links for a quick recap on memoization, dynamic programming, and the fibonacci sequence.

Where to Start

You will need to return the number associated with a given position in the fibonacci sequence. For example, if 0 was fed in, the method should return 0. 1 should return 1, 2 should return 1, 3 should return 2, and so on.

JUnit Test Suite

FibonacciTestSuite

Studio (Required)

RecurrenceRelationSequentialFibonacciCalculator

RecurrenceRelationParallelFibonacciCalculator

MemoizationSequentialFibonacciCalculator

MemoizationParallelFibonacciCalculator

DynamicIterativeSequentialFibonacciCalculator

Fun (Optional)

DynamicRecursiveSequentialFibonacciCalculator

LinearRecurrenceSequentialFibonacciCalculator

RoundPhiToTheNOverSqrt5SequentialFibonacciCalculator