Topics In Computer Science-Quiz 2

A detailed illustration depicting various computer science algorithms, particularly focusing on minimum spanning trees, shortest path algorithms, and their applications in graph theory, with visual elements representing trees and graphs.

Computer Science Algorithms Quiz

Test your knowledge of key concepts and algorithms in computer science with this challenging quiz! Engage with questions designed to assess your understanding of minimum spanning trees, shortest path algorithms, and much more.

  • 11 carefully crafted questions
  • Multiple choice format
  • Ideal for students and enthusiasts
11 Questions3 MinutesCreated by CalculatingWizard473
Please Add your full registration number
Above diagram shows running of which of the following algorithm?
Bucket Algorithm crude form
Wrong Vertices added in bucket
Minimum spanning Tree
Greedy Dijkstra Algorithm
To find the minimum spanning tree, the first vertex chosen to put in to the bucket cannot be chosen arbitrarily
True
False
For the given graph, the time complexity to find the single source shortest path, using lists will be
36
48
216
Which algorithm uses above equation
Minimum Spanning Tree
Shortest Path Spanning Tree
2-edge shortest path algorithm
2 edge, and Shortest Path Spanning Tree both
2 edge path, and Modified Shortest Path Spanning Tree with lesser Time complexity
Which algorithm needs parent table to store information of adjacent vertices?
Minimum Spanning Tree
Shortest Path Spanning Tree
Modified Shortest Path Spanning Tree with lesser Time complexity
If a Tree is Bottle Neck Tree, It definitely be a Minimum Spanning Tree
True
False
Which one of the following algorithm has these steps
BellMan Ford Algorithm
Slow All pair shortest path algorithm
2-edge shortest path algorithm
If there is a graph with a negative weight cycle, and Bell Man ford is run for p-edge long shortest path and gives shortest path value 5, What would have been the possible shortest path value at p-edge long shortest path.
6
3
7
5
If a graph has a negative cycle, our algorithm cannot find a that negative cycle until its loop run for P-times
True
False
Considering the above parent table, which of the following statement is true for converting this table into a tree.?
A is parent of b andf
B and f are parents of a
B and k are parent of c
{"name":"Topics In Computer Science-Quiz 2", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge of key concepts and algorithms in computer science with this challenging quiz! Engage with questions designed to assess your understanding of minimum spanning trees, shortest path algorithms, and much more.11 carefully crafted questionsMultiple choice formatIdeal for students and enthusiasts","img":"https:/images/course7.png"}
Powered by: Quiz Maker