Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Filter by Categories
nmims post
Objective Type Set
Online MCQ Assignment
Question Solution
Solved Question
Uncategorized

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) 2. For some sparse graph an adjacency list is more space efficient against an adjacency matrix. a) True…

This content is for Premium 1 Month, Premium 1 Year and Premium 3 Months members only.
Log In Buy Now
.woocommerce-message { background-color: #98C391 !important; }