Exploring Spark’s GraphX Quiz Answers – Cognitive Class

Get Exploring Spark’s GraphX Quiz Answers

This course presents a holistic approach to Big Data, taking both a top-down and a bottom-up approach to questions such as: What is Big Data? How do we tackle Big Data? Why are we interested in it? What is a Big Data platform?

The course emphasizes that we study Big Data to gain insight that will be used to get people throughout the enterprise to run the business better and to provide better service to customers. Rather than a implementation of a single open-source systems such as Hadoop, the course recommends that Big Data should be processed in a platform that can handle the variety, velocity, and volume of data by using a family of components that require integration and data governance. Big Data is NoHadoop (“not only Hadoop”) as well as NoSQL (“not only SQL”).

Enroll on Cognitive Class

Module 1 – Introduction To Graph-Parallel

Question: GraphX extends RDDs, which allows users to use GraphX as a collection, but not as a graph!

• True
• False

Question: Which of the following statements is true?

• Graph-Parallel is usually handled by Hadoop and Spark.
• Graph-Parallel focuses on distributing data across different nodes and systems.
• Data-Parallel is usually handled by Pregel, GraphLab and Giraph.
• Data-Parallel focuses on efficiently executing graph algorithms.
• None of the above

Question: GraphX unifies Data-Parallelism and Graph-Parallelism in one library.

• True
• False

Module 2 – Visualizing GraphX and Exploring Graph Operators

Question: The “degree” operator returns a VertexRDD[Int] containing the number of outgoing edges of each vertex.

• True
• False

Question: Which of the following is not an attribute of a Triplet class?

• attr
• id
• srcAttr
• srcId
• None of the above

Question: Other libraries such as Gephi or GraphLab can help GraphX with visualization.

• True
• False

Module 3 – Modifying GraphX

Question: We must run the “partitionBy” function before running the “groupEdges” operator.

• True
• False

Question: Which of following is among the PartitionStrategies provided by GraphX?

• EdgePartition2D
• RandomVertexCut
• EdgePartition1D
• CanonicalRandomVertexCut
• All of the above

Question: To improve efficiency, GraphX reuses portions of the graph which are unaffected by a modifier.

• True
• False

Module 4 – Neighborhood Aggregation and Caching

Question: aggregateMessages is the only neighborhood aggregation function provided by GraphX.

• True
• False

Question: Which of the following is not an attribute of TripletFields?

• TripletFields.None
• TripletFields.DstOnly
• TripletFields.EdgeOnly
• TripletFields.All
• None of the Above

Question: The ClassTag is optional for aggregateMessages if the message is a String.

• True
• False

Final Exam

Question: To instantiate a Graph, you need at LEAST 2 RDDs.

• True
• False

Question: pageRank is a graph algorithm that ranks the edges of the graph by correlating their relation with vertices, in terms of both quality and quantity.

• True
• False

Question: The numEdges operator returns an EdgesRDD[Long].

• True
• False

Question: Which of the following ClassTypes are returned from mapTriplets, assuming Graph[VD, ED] is the original?

• Graph[VD,ED]
• Graph[VD2,ED]
• Graph[VD,ED2]
• Graph[VD2,ED2]
• None of the Above

Question: The reverse operator returns a graph in which the direction of all edges are reversed.

• True
• False

Question: Which of the following ClassTypes are returned from mapTriplets, assuming Graph[VD, ED] is the original?

• Graph[VD,ED]
• Graph[VD2,ED]
• Graph[VD,ED2]
• Graph[VD2,ED2]
• None of the Above

Question: Caching graphs that are only used infrequently can slow computations.

• True
• False

Question: Which of the following is required to define aggregateMessages?

• sendMsg
• mergeMsg
• tripletFields
• sendMsg and mergeMsg
• All of the Above

Question: Triplets are a required parameter when instantiating a Graph.

• True
• False

Question: When defining the merge parameter for groupEdges (Int), which of the following is a valid definition for merge = (Edge1, Edge2)?

• Edge1
• Edge1 * Edge2
• Edge1 – Edge2 / Edge1
• Edge1 + Edge2
• All of the Above

Question: In a tuple, the first parameter returned by the “degrees” operator is the degree info, and the second parameter is the vertexid.

• True
• False

Question: Data-Parallel is usually handled by Pregel, GraphLab, and Giraph.

• True
• False

Question: Which of the following is true about GraphX?

• GraphX does not have built-in visualization functions.
• GraphX is a Graph-Processing library built into Apache Spark.
• GraphX extends the RDD class which allows us to use GraphX as a graph or a collection.
• GraphX is mainly a graph processing library.
• All of the above

Question: By using the mapTriplets function, we are only able to modify the edge attribute.

• True
• False

Question: Which of the following is true about the EdgeContext class?

• It has access to vertex attributes, but not to edge attributes.
• It has access to edge attributes, but not to vertex attributes.
• It has sendToDst, sendToSrc, and sendToAll functions.
• It is the same as the EdgeTriplet Class.
• None of the above

Conclusion:

We hope you know the correct answers to Exploring Spark’s GraphX If Queslers helped you to find out the correct answers then make sure to bookmark our site for more Course Quiz Answers.

If the options are not the same then make sure to let us know by leaving it in the comments below.

Course Review:

In our experience, we suggest you enroll in this and gain some new skills from Professionals completely free and we assure you will be worth it.

This course is available on Cognitive Class for free, if you are stuck anywhere between quiz or graded assessment quiz, just visit Queslers to get all Quiz Answers and Coding Solutions.

More Courses Quiz Answers >>

Building Cloud Native and Multicloud Applications Quiz Answers

Accelerating Deep Learning with GPUs Quiz Answers

Blockchain Essentials Cognitive Class Quiz Answers