What is Adjacency list primarily used for?
Difficulty: Medium
About this MCQ
This Medium Data Structures MCQ checks one syllabus fact.
The question is: “What is Adjacency list primarily used for?”
The accepted answer is A. A way of representing a graph where each vertex stores a list of its neighboring vertices.. Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.
- A. A way of representing a graph where each vertex stores a list of its neighboring vertices. ✓
- B. A probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence.
Why not B: “A probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence.” is not correct. The accepted answer is A. A way of representing a graph where each vertex stores a list of its neighboring vertices.. Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.
- C. An array-like data structure that automatically resizes itself as elements are added or removed.
Why not C: “An array-like data structure that automatically resizes itself as elements are added or removed.” is not correct. The accepted answer is A. A way of representing a graph where each vertex stores a list of its neighboring vertices.. Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.
- D. A collision resolution technique in hashing that searches sequentially for the next open slot in the table.
Why not D: “A collision resolution technique in hashing that searches sequentially for the next open slot in the table.” is not correct. The accepted answer is A. A way of representing a graph where each vertex stores a list of its neighboring vertices.. Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.
Correct answer
A. A way of representing a graph where each vertex stores a list of its neighboring vertices.
Explanation
Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- The concept in which an abstract data structure where each element has a priority, and elements are served acc...
- Identify the correct definition of Priority queue.
- What term describes the following? a data structure that allows insertion and removal of elements from both th...
- In computer science, Dequeue refers to which of the following?
- Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized s...
- Which statement correctly explains Sparse matrix?