 Create Quiz

# Graph Algorithms Quiz

## Graphs Algorithms MCQ - Quiz give you a good mix of easy questions and tough questions. Computer Science Engineering​

You can mute/unmute sounds from here

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

In adjacency list representation, space is saved for sparse graphs.
DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V^2) time
All of the above

O(n)
O(nLogn)
O(n ^ (3/2))
O(n^3)

E
2E
V
2V

n(n-l)/2
2^n
n!
2^(n(n-1)/2)

P Only
Q Only
Both P and Q
Neither P nor Q

## Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles ?

1/8
1
7
8

Currently, we have no comments. Be first to comment on this quiz.

SIMILAR QUIZZES
Quiz: Microbiology Biology.
This quiz contains information about Microbiology Biology.
The Office Quiz For True Fans! Quiz 17
The Office Quiz For True Fans!
AP Environmental Science Natural Resources And Energy Exam quiz 18
AP Environmental Science Natural Resources And Energy Exam
Quiz: Java Programming Mock Tests on Functions.
This quiz contains information about Java Programming Functions.

## Graph Algorithms Quiz : Test Trivia

Ultimate impossible quiz game

Embed This Quiz
Copy the code below to embed this quiz