gs gs122 Shortest Paths - Shortest Paths - Quiz No.1

gs gs122 Data Communication and Computer Network Quiz

Online Quizzes Preparation

This quiz belongs to book/course code gs gs122 Data Communication and Computer Network of gs organization. We have 268 quizzes available related to the book/course Data Communication and Computer Network. This quiz has a total of 9 multiple choice questions (MCQs) to prepare and belongs to topic Shortest Paths. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.

NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.

Question 1: Which is the correct technique for finding a maximum matching in a graph?
Question 3: Floyd Warshall Algorithm can be used for finding _____________
Question 4: Bellmann ford algorithm provides solution for ____________ problems.
Question 5: What is the pseudo code to compute the shortest path in Dijkstra’s algorithm?
Question 6: Dijkstra's Algorithm is used to solve _____________ problems.
Question 7: What approach is being followed in Floyd Warshall Algorithm?
Question 8: Which of the following is not an application of Breadth First Search?
Question 9: Chan’s algorithm is used for computing _________


Online Quizzes of gs122 Data Communication and Computer Network

Other NC related online quizzes

Other categories of gs Online Quizzes

Other organizations

Theme Customizer

Gaussian Texture



Gradient Background