CSE 114 Study Guide - Final Guide: Welsh Orthography

• School: Stony Brook University
• Department: Computer Science
• Course: CSE 114
• Professor: Michael Tashbook

Document Summary

Be sure to show your code to one of the lab tas before you leave, so that you can receive credit for this lab. You must also upload a copy of all your source code (. java) files through the link on blackboard by 11:59 pm on tuesday, November 14: the fibonacci sequence is a well-known integer sequence that starts with the values 0 and 1 (in that order). Every number after that is the sum of the two previous values in the sequence. For example, 0 and 1 are followed by another 1 (0 plus 1 is just 1), then by 2 (1 plus 1), 3 (1 plus 2), etc. Basically, for all n >= 2, term n is equal to (term n-1 plus term n-2). The first 10 terms of the fibonacci sequence are 0, 1, 1, 2, 3, 5, 8, 13, 21, and 34.