Skip to content

Lab 1 code #26

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
SkylarGalloway wants to merge 13 commits into
base: master
Choose a base branch
from
Open

Lab 1 code #26

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
ccfb575
Update Lab_1.md
SkylarGalloway Jan 25, 2018
e304718
Update Lab_1.md
SkylarGalloway Jan 25, 2018
14abd51
Update Lab_1.md
SkylarGalloway Jan 25, 2018
7f2e082
Update Lab_1.md
SkylarGalloway Jan 25, 2018
955686d
Update Lab_1.md
SkylarGalloway Jan 25, 2018
5bcf296
Update Lab_1.md
SkylarGalloway Jan 25, 2018
2c70aa5
Update Lab_1.md
SkylarGalloway Jan 26, 2018
180d29f
Update Lab_1.md
SkylarGalloway Feb 6, 2018
37219a0
Update Lab_1.md
SkylarGalloway Feb 6, 2018
01aa109
Update Lab_1.md
SkylarGalloway Feb 6, 2018
c12d8ba
Update Lab_1.md
SkylarGalloway Feb 6, 2018
bc57cc8
Update Lab_1.md
SkylarGalloway Feb 6, 2018
b4d0cd1
Rename Lab_1.md to Lab_1 code.md
SkylarGalloway Feb 6, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
356 changes: 356 additions & 0 deletions Lab_1 code.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,356 @@
# Lab 1

## Description and guidelines
You have multiple tasks to complete. You may work with others, however your goal should be on understanding the logic of the flow charts you are creating, and by the end feel comfortable analyzing a problem, breaking it down into steps, and be able to create a flow chart of those ideas. You should also feel comfortable looking at a flow chart and determining if you feel it solves the problem it is for.

With this lab, you will want to use a unispace font. One way to gain this is to put your answers betwwen lines that contain three ~ characters:

~~~
This is a unispace font, notice that
iiii takes up as much space as
wwww.
~~~

To draw the boxes,
* Use hyphens for the top and bottom of the statement boxes (you do not need to worry about the sides).
* Use |, +, - to draw the lines.
* Use <, >, ^, or v for the arrow heads.
* Use / and \ for the borders of conditionals (you only need to show the corners, and these do not need to line up.)
* Have your lines that go up do so to the right of your text.

Example:
~~~
-----------------------
This is the first step <-----+
----------------------- |
| |
V |
/ \ |
/ \ Yes |
/ If something is true \ -----+
\ and the day is /
a Monday
\ /
\ /
|
|No
v
---------------------
The last step
---------------------
~~~

## Flowchart Tasks:

#### Fizzbuzz
* starting at one and incrementing by one to a number that is given, print out either the number, or if the number is divisible by 2, print "Fizz", and if the number is divisible by 3 print "Buzz"
~~~
----------
Start
----------
|
v
----------------------------
Start set initial value at 0
----------------------------
|---------------------------------+
v || ^
---------------------------- ^| |
Increase Value by 1 || |
---------------------------- || |
| |^ |
V
/ \ || |
/ \ || |
/ \ Yes || | ____________
/ Is value divisble by 6 \-----------+|--|----- |Print "FizzBuzz"|
\ / || | |____________ |
\ / || ^
\ / |^ |
|No || |
V || ^
/ \ || |
/ \ || |
/ \ Yes || | ____________
/ Is value divisble by 2 \-----------+|--|----- |Print "Fizz"|
\ / | | |____________|
\ / | ^
\ / ^ |
|No | |
V | |
/ \ | |
/ \ | |
/ \ Yes | ^ ____________
/ Is value divisble by 3 \----------- +--|------>|Print "Buzz"|
\ / | |____________|
\ / |
\ / ^
|No |
v |
------------- |
Print value -->------------------------+
-------------
|
v
-----------
END
------------

Integer n =number
for (int i=0,i>=n,i++)
{
if (n%6==0) {
print "Fizz Buzz"
}
else if (n%2==0){
Print "Fizz"
}
else if (n%3==0){
Print "Buzz"
}
else{
Print n
}
}
~~~
#### Determine a students letter grade when given the %.
~~~
----------
Start
----------
|
v
---------------------------------
Enter Students Percentage Grade %
---------------------------------
|
v
/ \
/ \ Yes +------------+
/ Is value greater \ ----->|Print A |
\ than or equal to 90 / +------------+
\ /
\ /
|
|No
v
/ \
/ \ Yes +------------+
/ Is value greater \ ----->|Print B |
\ than or equal to 80 / +------------+
\ /
\ /
|
|No
v
/ \
/ \ Yes +------------+
/ Is value greater \ ----->|Print C |
\ than or equal to 70 / +------------+
\ /
\ /
|
|No
v
/ \
/ \ Yes +------------+
/ Is value greater \ ----->|Print D |
\ than or equal to 60 / +------------+
\ /
\ /
|
|No
v

-------------
Print F
-------------
|
v
-----------
END
------------

gradePerc= grade value
if(gradePerc > 89){
Print "A"
}
else if (gradePerc > 79){
Print "B"
}
else if (gradePerc > 69){
Print "C"
}
else if (gradePerc > 59){
Print "D"
}
else {
Print "F"
}
~~~
#### Convert a tempature from C to F or vice versa.
~~~
----------
Start
----------
|
v
------------------------------
Insert Temperature Value
------------------------------
/ \
/ \ Yes+------------------------+ +----------------- ---+
/ Is value in Celisus \ ----->|Value* multiply(9/5)+32 |----->|Print "New Value" "F"|
\ / +------------------------+ +---------------------+
\ /
\ /
|
|No
v
-------------------------------
Value subtract 32 multiply 5/9
--------------------------------
|
v
--------------------
Print "New Value" "C"
---------------------
|
v
-----------
END
------------

teMp = temperature value
String x = Degrees in Celsius or Fahrenheit
if (x == Celsius){
n=teMp * (9/5)
newTemp= n+32
Print newTemp +"F"
}
else{
w = teMp -32
newteMp = w*(5/9)
}
~~~
#### When given three numbers return the largest of them
~~~
----------
Start
----------
|
v
---------------------------------
Assign first number as a
assign second number as b
assign third number as c
---------------------------------
|
v
/ \
/ \ Yes +------------+
/ Is a greater \ -----> |Print a |
\ than b and / +------------+
greater c
\ /
\ /
|
|No
v
/ \
/ \ Yes +------------+
/ Is b greater \ --------> |Print b |
\ than a and / +------------+
greater c
\ /
\ /
|
|No
v
-------------
Print c
-------------
|
v
-----------
END
------------

a= first number
b= second number
c= third number
if (a>b && a>c){
Print a "Is the largest number"
}
else if (b>a && b>c){
Print b "Is the largest number"
else if (c>a && c>b){
Print c "Is the largest number"
else{
Print "There are numbers that are equal"
}

~~~

#### The game of Nim:
* This game is played between two players.
* There are piles of stones, the number of stones in each pile is known.
* Each turn a player can take any number of stones away from a single pile (they must take at least one.)
* The person who takes the last stone from the last remaining pile looses.

1. Create a flow chart for the optimal move for a player if there is only one pile.
1. Create a flow chart for the optimal move for a player if there are exatly two piles.
1. Can you merge these together to create a flowchart for an optimal move if there are two or less piles? Please do so, if yes.
1. What about if there are any number of piles.

#### Find the sum of the first 100 numbers
1. modify this to find the sum of the next 100 numbers when given a starting value.
~~~
----------
Start
----------
|
v
-----------------------
Insert initial value=n
-----------------------
|<------------------------------+
v ^
---------------------- |
set i=0 |
---------------------- |
| |
v |
--------------- |
increase i by 1 |
--------------- |
/ \ |
/ \ Yes +-------+-----------------------------+
/ Is i less \ -----------> |n+(n+1)=n |
|add initial value to initial value +1|
\ than 100 / +-------------------------------------+

\ /
\ /
|
|No
v
---------------
Print n
---------------
|
v
------------
END
--------------
n=initial value
for (int i=0,i<101,i++){
}
~~~
#### Find the nth fibonaci number
* The 0th and the 1st fibonaci numbers are both 1.
* All other fibonaci numbers equal the sum of the two before it.
So the 2nd fibonaci number is 2, because fib(0)+fib(1) = 1+1
Also the 10th fibonaci number is fib(8)+fib(9)

#### Find the largest prime number less than a given number
Loading