Content Preview

BIG DATA - CHAPTER 6 EXAM 2025 QUESTIONS AND ANSWERS Define the notion of graphs. Why do we consider graphs a big data case? ....ANSWER ...-A graph is defined as G = (V, E), where V is a set of nodes and E is a set of edges connecting them. Graphs can be directed or undirected, cyclic or acyclic, and may include attributes on nodes and edges. Graphs are a big data case because real-world examples like the web or social networks involve billions of elements, making them too large for a single machine. How can we represent a graph? Which representation is considered appropriate for the MapReduce framework? - ....ANSWER ...-Graphs can be represented using adjacency matrices or adjacency lists. An adjacency matrix is an n×n grid where each entry indicates whether an edge exists between nodes. Adjacency lists store each node's neighbors, making them more compact and scalable. MapReduce handles adjacency lists efficiently. It allows grouping by destination node for in-link computations and simplifies graph inversion by emitting edges as (destination, source) pairs. ....COPYRIGHT ©️ 2025 ALL RIGHTS RESERVED...TRUSTED & VERIFIED 1