Suppose that each user of Facebook has 1000 friends.

Is that graph:

  • A: sparse
  • B: dense
  • C: acyclic
  • D: planar
  • E: k-chromatic

    Answer: A

    A graph is sparse if the number of edges is O(v) where v is the number of vertices. All real-world graphs are sparse unless they are very small.

    In this question, the number of edges is O(1000 * v); that is O(v) even though 1000 is a big number.

    Contents    Page-10    Prev    Next    Page+10    Index