Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
📂 Aspire Study Library
Which of the following is correct?
(A) In directed graph sum of length of all adjacency list is $|E|$
(B) The adjacency matrix requires $O(V^2)$ memory
(C) In an undirected graph the sum of length of all adjacency list is $|E|$
(D) The memory requirement of adjacency list depends on number of edges in graph
(a) A, B, C
(b) B, C, D
(c) A, B, D
(d) A, C, D
Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.
View More
📲
Ask Your Question or Put Your Review.
