Kenneth Chan
#ATTENDANCE QUIZ FOR LECTURE 13 of Dr. Z.'s Math454(02) Rutgers University

# Please Edit this .txt page with Answers

#Email  ShaloshBEkhad@gmail.com 
#Subject: p13
#with an attachment called
#p13FirstLast.txt
#(e.g. p13DoronZeilberger.txt)

#Right after finishing watching the lecture but no later than Oct. 20, 2020, 8:00pm


THE NUMBER OF ATTENDANCE QUESTIONS WERE:

PLEASE LIST ALL THE QUESTIONS FOLLOWED, AFTER EACH BY THE ANSWER
Attendance Problem 1
Describe the problem that Euler solved regarding 7 bridges
Answer
A city in Prussia was set on both sides of the Pregel River with to islands in the middle.
they were connected to each other by 7 bridges. The problem was to devise a walk through the city
that would cross each of those bridges once and only once. Euler proved that there was no solution.

Attendance Problem 2
Draw it on a piece of paper with a line segment representing every edge.
G=[{2,3},{1,3,4},{1,2,4},{2,3}]:

Attendance Question 2
If you toss a fair coin 2000 times what is the prob. that you get excatly 1000 heads (and exactly 1000
tails)
Answer
.017839

Attendance Question 3
If you roll a fair die 6000 times what is the prob that each of the possible outcomes occurs exactly 1000 times
Answer
not zero but i keep getting zero because of how close to zero it is

Attendance Problem 4
Pic 5 random Facebook Friends
For each of them pick 3 friends
For each of the Friends of Friends pick 3 Friends 
Label the people pick
Write the graph in our data structures 
Answer

Attendance Problem 5
Look at the cities that border Piscatway
and for each of them those that border them
and again until you get to princeton
(i) construct the graph
(ii)find the number of paths from piscataway to princeton 
(a)find the actual set using paths(and list them)
(b) by using Nupaths 
(c) by using GFt