gs gs122 Shortest Paths - Floyd-Warshall Algorithm - 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 10 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: Floyd Warshall’s Algorithm is used for solving ____________
Question 2: Floyd Warshall’s Algorithm can be applied on __________
Question 4: What approach is being followed in Floyd Warshall Algorithm?
Question 5: Floyd Warshall Algorithm can be used for finding _____________
Question 7: Floyd- Warshall algorithm was proposed by ____________
Question 9: Complete the program.

 n=rows[W] D(0)=W for k=1 to n do for i=1 to n do for j=1 to n do ________________________________ return D(n) 
Question 10: What happens when the value of k is 0 in the Floyd Warshall Algorithm?


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