0% found this document useful (0 votes)
11 views1 page

Week 8-2-3

Uploaded by

many many
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
0% found this document useful (0 votes)
11 views1 page

Week 8-2-3

Uploaded by

many many
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/ 1

C) Incorrect - It ensures that all web pages are indexed equally, regardless of their

content or link structure.


Explanation: PageRank prioritizes pages linked by other significant pages, meaning
not all pages are treated equally.

D) Incorrect - It automatically filters out irrelevant web pages by analyzing their


content and metadata.
Explanation: While content and metadata are considered in some search algorithms,
PageRank primarily operates on link structure.

3.What role does the outerJoinVertices() operator serve in Apache Spark's GraphX?

A) It removes all vertices that are not present in the input RDD.

B) It returns a new graph with only the vertices from the input RDD.

C) It joins the input RDD data with vertices and includes all vertices, whether present in
the input RDD or not.

D) It creates a subgraph from the input RDD and vertices.

Answer:

A) Incorrect - It removes all vertices that are not present in the input RDD.
Explanation: This operator does not exclude vertices; it retains them regardless of
whether they have matching data.

B) Incorrect - It does not return a new graph with only the vertices from the input
RDD.
Explanation: It includes all vertices from the original graph.

C) Correct - It joins the input RDD data with vertices and includes all vertices,
whether present in the input RDD or not.
Explanation: The outerJoinVertices() operator allows for a join between vertex
properties and RDD data, including all vertices in the graph. This is useful when you
want to retain vertices that may not have corresponding data in the input RDD.

D) Incorrect - It does not create a subgraph from the input RDD and vertices.
Explanation: It creates a new graph that retains all vertices from the original graph and
merges them with input data.

You might also like