Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

A)  In adjacency list representation, space is saved for sparse graphs.
B)  Adding a vertex in adjacency list representation is easier than adjacency matrix representation.
C)  DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V^2) time in adjacency matrix representation. Here is V and E are number of vertices and edges respectively.
D)  All of the above

Correct Answer :   All of the above

Top Trending Technologies MCQ's
Machine Learning
Artificial Intelligence
IOT QUIZ
Blockchain
Deep Learning
Data Science
Keras
DevOps
Cyber Security
Ethical Hacking
Microsoft Azure
AWS
Cloud Computing
Quantum Computing
Edge Computing
ChatGPT
RPA
5G Network
Data Analytics
Neural Networks
Natural Language Processing
Networking
Virtual Reality
Augmented Reality
Angular
Node JS
React JS
C-Language
Java
More
Top Trending Technologies Interview Questions
Machine Learning
Artificial Intelligence
IOT QUIZ
Blockchain
Deep Learning
Data Science
LLM
ChatGPT
Metaverse
DevOps
Cyber Security
Ethical Hacking
HyperAutomation
Microsoft Azure
AWS
Cloud Computing
Quantum Computing
Edge Computing
Cognitive Computing
RPA
5G Network
Checkpoint
Neural Networks
Virtual Reality
Augmented Reality
Full Stack Developer
Web Services
Angular
Node JS
React JS
C-Language
CPP (or) C++
More