#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 1
#The problem was to devise a walk through the city that would cross each of those bridges once and only once

#Attendance problem 2
#Draw it on a piece of paper with a line segment from 
#Answer 2
# vertex 1 is connected to vertices 2 and 3
# vertex 2 is connected to vertices 1,3, and 4
# vertex 3 is connected to vertices 1,2, and 4
# vertex 4 is connected to vertices 2 and 3

#Attendance question 3
#If you roll a fair die 6000 times what is the prob that each of the possible outcomes (1,2,3,4,5,6) occurs exactly 1000 times 
#Answer 3
#the probability is 1/6

#Attendance question 4
#5 random facebook friends 
#fr each of them pick 3 friends 
#for each of the friends of friends pick 3 friends 
#label the people picked 1,2,...,n
#write the graph in our data structure 
#Attendance answer
[{4,5,6},{7,8,9},{10,11,12},{1,13,14,15},{1,16,17,18},{1,19,20,21},{2,21,22,23},{2,24,25,26},{2,27,28,29},{3,30,31,32},{3,33,34,35},{3,36,37,38},{4},{5},{6},{7},{8},{9},{10},{11},{12}]

#Attendance question 5
#Look at the cities that border piscataway and for each of those that border them and again until you to princeton
#construct the graph 
#find the number of paths from piscataway to Princeton 
#find the actual set using paths and list them
#by using NuPaths 
#by using Got

#Answer 
#Highland Park, Edison, New Brunswick, Metuchen 
#princeton -> new brunswick-> piscataway