Maintaining a graph in memory by means of its adjacency matrix is known as
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. Sequential Representation
Explanation
Storing a graph as an adjacency matrix (an array) is called sequential representation; adjacency lists are the linked representation.More Data Structures and Algorithms questions
- Match List I with List IIList I List II A. Circular Queue I. Print Queue B. Priority Queue II. CPU Scheduling C. Double Ended Queue III. Di…
- The tight asymptotic bound for the recurrence T(n) = 2T(n/4) + √n is
- When developing a dynamic programming algorithm, the sequence of steps followed is: A. Construct an optimal solution from computed informat…
- The correct sequence of constructing a Huffman tree is A. Repeat until root formed B. Create leaf nodes C. Build priority queue D. Combine…
- Choose the correct statement(s) A. A problem which is NP-Complete will have the property that it can be solved in polynomial time iff all o…
- Consider the binary tree: A is the root with left child B and right child C; C has left child D and right child E; E has right child F; F h…