Engineering Online MCQ Number 0612 – online study, assignment and exam

Multiple choice question for engineering Set 1 1. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________ a) O(E) b) O(V*V) c) O(E+V) d) O(V) [learn_more caption=”View Answer”]Answer: c [Reason:] In an adjacency list for every vertex there is a linked list which…

This content is for Complete Homework, Premium 1 Day Pass, Premium 1 Month, and Premium 6 Months members only.
Log In Visit Now