Time Left - 05:00 mins

ISRO Exam CS 2017 Topic-Wise Quiz Algo (Graphs)

Attempt now to get your rank among 890 students!

Question 1

Which of the following is true about the z-buffer Algorithms?

Question 2

Djikstra's algorithm is used

Question 3

Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are

Question 4

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

Question 5

Let Gbe a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes ___________.

890 attempts
9 upvotes
17 comments

Tags :

GATE & PSU CS Algorithms

Apr 7GATE & PSU CS