Scribd
Upload
97 views4 pages

Page Rank Questions

The document contains a series of questions related to the PageRank algorithm, including multiple choice, multiple select, numerical answer, case-based, and programming-based questions. Key topics covered include the damping factor, transition probabilities, handling of sink nodes, and methods for computing PageRank. The questions aim to assess understanding of PageRank's mechanisms and applications in various scenarios.

Uploaded by

Jasvinder Kaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
97 views4 pages

Page Rank Questions

The document contains a series of questions related to the PageRank algorithm, including multiple choice, multiple select, numerical answer, case-based, and programming-based questions. Key topics covered include the damping factor, transition probabilities, handling of sink nodes, and methods for computing PageRank. The questions aim to assess understanding of PageRank's mechanisms and applications in various scenarios.

Uploaded by

Jasvinder Kaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

PAGE RANK QUESTIONS

Multiple Choice Questions (MCQs)

1. What does the damping factor (d) in PageRank represent?


a) The probability of a user randomly jumping to any page
b) The probability of a user following links on the current page
c) The number of inbound links to a page
d) The weight of outbound links

2. Which matrix is used to represent the transition probabilities in PageRank?


a) Adjacency matrix
b) Laplacian matrix
c) Stochastic matrix
d) Identity matrix

3. How does PageRank handle sink nodes (pages with no outbound links)?
a) Ignores them
b) Distributes their rank evenly to all pages
c) Assigns zero rank
d) Uses teleportation via the damping factor

4. What is the primary purpose of teleportation in PageRank?


a) To reduce computational complexity
b) To ensure all pages have a non-zero rank
c) To penalize spam pages
d) To prioritize new pages

5. Which formula represents the PageRank of a page PiPi?

Multiple Select Questions (MSQs)

6. Which components are critical for the PageRank algorithm? (Select 2)


a) Damping factor
b) Web page content
c) Adjacency matrix
d) User location

7. What are valid methods to compute PageRank? (Select 2)


a) Power iteration
b) Breadth-First Search
c) Eigenvalue decomposition
d) Depth-First Search

8. Which scenarios require teleportation in PageRank? (Select 2)


a) Disconnected graphs
b) Sink nodes
c) High-traffic pages
d) Personalized rankings
PAGE RANK QUESTIONS

Numerical Answer Type (NAT)

9. For a damping factor d=0.85d=0.85 and 4 pages, compute the teleportation


probability for any page.

10. In a 3-node graph where Node A links to B and C, Node B links to C, and Node C links
to A, compute the adjacency matrix.

Case-Based Questions

11. Scenario: A newly published research paper has few inbound links and ranks poorly.
Solution: Which PageRank mechanism ensures it still gets a non-zero rank?
a) Damping factor
b) Backlink reinforcement
c) Personalized PageRank

12. Scenario: A directed graph has a sink node (no outbound links).
Analysis: How does PageRank handle this?
a) Redistributes its rank via teleportation
b) Assigns zero rank
c) Distributes its rank uniformly

Programming-Based Questions

13. What does this code compute?

14. Debug the code to handle sink nodes:

15. Derive the PageRank formula for a 2-page system where Page 1 links to Page 2
PAGE RANK QUESTIONS
16. Which function is used to calculate the page rank in the following code

17. What is the output of the following code?

Multiple Choice Questions (MCQs)

18. What is the primary purpose of the damping factor (d) in PageRank?
a) To penalize pages with fewer inbound links
b) To ensure all pages have a non-zero rank
c) To prioritize pages with high outbound links
d) To reduce the computational complexity of the algorithm

19. Which matrix is used to represent the transition probabilities in PageRank?


a) Adjacency matrix
b) Laplacian matrix
c) Stochastic matrix
d) Identity matrix

20. In PageRank, what happens to the rank of a sink node (a page with no outbound
links)?
a) Its rank is set to zero
b) Its rank is distributed evenly to all pages
c) Its rank is distributed only to pages it links to
d) Its rank is ignored

21. What does the Power Iteration method compute in PageRank?


a) The eigenvalues of the adjacency matrix
b) The stationary distribution of the Markov chain
c) The shortest path between two nodes
d) The clustering coefficient of the graph
PAGE RANK QUESTIONS
Multiple Select Questions (MSQs)

22. Which of the following are valid methods to compute PageRank? (Select 2)
a) Power Iteration
b) Breadth-First Search
c) Eigenvalue Decomposition
d) Depth-First Search

23. Which of the following are true about the damping factor (d) in PageRank? (Select 2)
a) It represents the probability of a user randomly jumping to any page
b) It ensures the Markov chain is ergodic
c) It is typically set to 0.85
d) It penalizes pages with high inbound links

24. Which of the following are challenges in computing PageRank for large graphs?
(Select 2)
a) Handling sink nodes
b) Ensuring convergence in a reasonable time
c) Computing eigenvalues for sparse matrices
d) Ignoring low-traffic pages

25. Which of the following are real-world applications of PageRank? (Select 2)


a) Ranking web pages in search engines
b) Detecting communities in social networks
c) Predicting stock market trends
d) Identifying influential users in social networks

You might also like