A syllabus example uses Spark for PageRank-style scoring of linked civic web pages. What capability does that highlight without requiring code memorization?
Select an answer to reveal the explanation.
Short Explanation
PageRank-style scoring is the “keep refining the rankings” workout—and Spark is built to sweat those iterative loops. You do not need to memorize the sample code; remember that iteration on graphs is a Spark sweet spot. COBOL-on-tape-only rules are not the lesson.
Full Explanation
PageRank exemplifies iterative graph algorithms that benefit from Spark’s in-memory and iterative capabilities. The exam-relevant idea is that strength, not memorizing sample code. Claims that Spark allows only one map step, that scores must be COBOL-on-tape only, or that RDDs forbid iteration are incorrect.