A-level CSc Page ranking algorithm

What is the primary purpose of the PageRank algorithm in search engines?

• To rank pages based on their content
• To evaluate the importance of web pages based on links
• To analyze user behavior on websites
• To determine the number of links on a page

Which of the following best describes the PageRank algorithm's complexity?

• It is only applicable to social media
• It appears complex but is easier with visualization
• It requires advanced programming skills
• It is straightforward and easy to understand

In the context of the PageRank algorithm, what does the size of each circle in a visualization represent?

• The number of external links
• The number of links pointing to it
• The total number of links on the page
• The number of pages linked to it

What is the typical value set for the dampening factor 'd' in the PageRank algorithm?

• 0.95
• 0.65
• 0.85
• 0.75

What is the initial PageRank value set for each page in the algorithm?

• 0.5
• 1
• 2
• 0

Which of the following statements is true regarding self-links in PageRank calculations?

• Pages can link to themselves
• Self-links are weighted more heavily
• Self-links are included in calculations
• Pages do not link to themselves

What is the calculated value for links from page A to B if the formula is applied correctly?

• 0.325
• 0.425
• 0.625
• 0.525

What is the result of 1 minus the dampening factor when 'd' is set to 0.85?

• 0.10
• 0.05
• 0.20
• 0.15

How many iterations does the PageRank algorithm typically require for values to stabilize?

• 50 iterations
• 100 iterations
• 150 iterations
• 200 iterations

After how many iterations do the PageRank values begin to level out significantly?

• 50 iterations
• 5 iterations
• 100 iterations
• 10 iterations