Which algorithm is used to find the minimum spanning tree by picking edges one by one based on weight?

Kruskal's Algorithm

True or False: Greedy algorithms can always find the optimal solution for every optimization problem.

False. Greedy algorithms do not always guarantee an optimal solution.

Riddle: I build solutions piece by piece, choosing the best immediate benefit, but sometimes I can miss the mark. What am I?

Greedy Algorithm

The greedy choice for the Activity Selection problem involves picking the next activity with the ______ finish time.

Least

Which algorithm is similar to Prim's but used for finding the shortest path from a source vertex to all other vertices?

Dijkstra's Algorithm

In Huffman coding, the most frequent character is assigned the ______ length code.

Least

Fill-in-the-blanks: The ______ algorithm is used to approximate solutions for hard optimization problems like the Traveling Salesman Problem.

Greedy

What is the time complexity of Dijkstra's algorithm when using a priority queue?

O(E log V)

True or False: The Fractional Knapsack problem allows breaking items into smaller parts.

True

Which data structure is typically used in Huffman coding to efficiently build the coding tree?

Min Heap

The number of edges in a minimum spanning tree for a graph with V vertices is ______.

V - 1

Riddle: I can help reduce the total cost of connecting your network, ensuring all points are touched without cycles. What am I?

Minimum Spanning Tree

In Prim's algorithm, which data structure is used to keep track of the minimum weight edges connecting to the set of vertices already included in the MST?

Priority Queue

Fill-in-the-blanks: The ______ algorithm finds strongly connected components in a directed graph.

Kosaraju's

What is the main idea behind the greedy approach in the Fractional Knapsack problem?

Maximize the value-to-weight ratio.

True or False: Dijkstra's algorithm can handle graphs with negative weight edges.

False. It cannot handle negative weight cycles.

Which algorithm uses a two-step process of performing DFS to find strongly connected components?

Kosaraju's Algorithm

When implementing Kruskal's algorithm, what is crucial to check after picking an edge?

Whether it forms a cycle with the spanning tree.

Riddle: I require sorting edges first and then picking the smallest without forming a cycle. What am I?

Kruskal's Algorithm

What is the primary purpose of Huffman coding?

Data compression

Fill-in-the-blanks: The greedy choice for Dijkstra's algorithm is to select the vertex with the ______ distance value.

Minimum

Which approach is used to find an approximation for NP-hard problems via greedy choices?

Greedy Algorithms

True or False: The Minimum Spanning Tree can be used to approximately solve the Traveling Salesman Problem.

True

What is the time complexity of the implementation of the Fractional Knapsack problem?

O(n log n)

To construct a Huffman tree, the first step is to create a ______ for each unique character based on frequency.

Leaf node