Practice Department Of Computer Science And Engineering (27.1.3) - Mathematical Institute

Practice: Department of Computer Science and Engineering

Lesson 27.1.3Mathematical Institute

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does Dijkstra's algorithm accomplish?
Show hintHide hint
Think about applications like navigation.
Question 2.
What is initialized to infinity in Dijkstra's algorithm?
Show hintHide hint
Consider the starting point's significance.
3Question 3.
What technique does Dijkstra's algorithm use to determine the shortest path?
- Dynamic Programming
- Greedy Strategy
- Brute Force
Show hintHide hint
Think about how Dijkstra prioritizes its choices.
4Question 4.
True or False: Dijkstra's algorithm can handle graphs with negative edge weights.
- True
- False
Show hintHide hint
Consider why the local choices might fail.
Question 5.
Given a graph with both positive and negative weights but no negative cycles, apply Dijkstra's algorithm and explain the steps taken.
Show hintHide hint
Remember to keep track of updates on distances based on the edges from the burnt vertices.
Question 6.
Critique the utility of Dijkstra’s algorithm in real-world applications that involve routes with varied constraints such as tolls (negative weights).
Show hintHide hint
Consider examples where negative weights could change the optimal path drastically.

4 more questions in this section. Enroll free to practise them all.