CS100 Quiz: Assignment 6 Solutions
16 Oct 2015
School
Department
Course
Professor
Document Summary
30 marks: use the graph and the tentative probabilities shown below to answer questions 1-4. Create the adjacency matrix for the above graph by completing the table that has been prepared for your convenience [5 marks] *auto grading* 2: assume that the probability of jumping is 0. What is the probability of being on page e after one iteration? (show your calculation, not just the final value) [3 marks] Final answer: (0. 25)*(1/3) + (0. 15)*(1/3) = 0. 133 b) Assume that the probability of jumping is 0. Final answer: (0. 25)*(1/3) + (0. 15)*(1/3) + (0. 25)*(1/2) = 0. 258 c) Final answer: (0. 1/5) + [(0. 9)*(0. 05)*(1)] + [(0. 9)*(0. 25)*(1/2)] + Still assuming that the probability of crawling is 90% and the probability of jumping is 10%, calculate the probability of being on page d after 1 iteration. Final answer: (0. 1/5) + [(0. 9)*(0. 15)*(1/3)] = 0. 065: assume the following graph showing the connections between various pages:
