Computer Science · Graph Theory
Which of the following statements are TRUE regarding graph representations, where |E| represents the number of edges and |V| represents the number of vertices? (A) In a directed graph, the sum of lengths of all adjacency lists is |E|. (B) In an undirected graph, the sum of lengths of all adjacency lists is 2|E|. (C) For a dense graph, an adjacency matrix representation is generally preferable over an adjacency list. (D) The memory requirement of an adjacency matrix depends primarily on the number of edges |E|.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A), (B) and (D) only
- 2(A), (B) and (C) only✓
- 3(A), (B), (C) and (D)
- 4(B), (C) and (D) only
Correct answer
(A), (B) and (C) only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory