Design and Analysis of Algorithms - General Questions

How many comparisons does finding both the minimum and maximum of n elements need using the pairwise method?

The fractional knapsack problem is solved optimally by:

Topological sorting of a DAG can be done in:

Dijkstra's algorithm is an example of a: