Dijkstra's and A* Algorithm Quiz

What is the initial distance set for the source vertex in Dijkstra's Algorithm?

• Infinity

• 0

• 1

• -1

Which of the following is a limit of computation mentioned in the document?

• Memory capacity

• Algorithmic complexity

• Network speed

• User interface

What is an example of a problem that uses heuristic methods?

• Sorting numbers

• Travelling salesman problem (TSP)

• Calculating interest

• Multiplying matrices

What does the A* algorithm use to improve efficiency?

• Random selection

• Heuristic

• Brute force

• Recursion

In the A* algorithm, what does g(x) represent?

• Approximate cost from node(x) to the goal node

• Real cost from the source to a given node

• Total cost of each node

• Heuristic estimate

What is a strength of Dijkstra’s algorithm according to the document?

• Efficient pathfinding with good heuristic

• Guarantees shortest path for all nodes

• Uses heuristic to estimate remaining cost to goal

• Performance depends on heuristic quality

What happens to the A* algorithm if h(x) heuristic is 0?

• It becomes a random search

• It becomes Dijkstra’s algorithm

• It becomes a brute force search

• It becomes a recursive algorithm

Which time complexity is considered to be tractable in solving problems?

• O(n!)

• O(2^n)

• O(n^3)

• O(n^n)

What is a weakness of Dijkstra’s algorithm mentioned in the document?

• Can be slow for large graphs

• Requires a lot of memory

• Difficult to implement

• Not accurate

What is the purpose of heuristic methods?

• To find the exact solution

• To get an approximate answer that is good enough

• To increase complexity

• To decrease efficiency