Quiz
Algorithms
CSE 4081/5211
Fall 2004
Points 30 (2 per question)
Topological sort is a greedy algorithm. True / False (True)
Quicksort exchanges elements, including the equal elements, which are on the wrong side
of pivot’s correct position.
True / False (True)
The greedy algorithm for the Multiprocessor scheduling problem does not always find
the correct answer. True / False (True)
In the binpacking problem each bin is presumed to be of size ____. (one/equal)
The greedy algorithm for the Rational knapsack problem does not always find the correct
result. True / False (False)
If a polynomial algorithm has its asymptotic time complexity as a function of an input
value (e.g., the dynamic programming algorithm of the 01 Knapsack problem), then the
algorithm is called ___________ (Pseudopolynomial algorithm)
A Theta(n log n) algorithm is more efficient than a Theta(n^2) algorithm for solving the
same problem.
True / False (True)
A graph with only one odd degree node (all other nodes have even degree) can have a
Euler circuit starting with that node. True / False
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '12
 Dmitra
 Algorithms, Dynamic Programming, Sort, Greedy algorithm, Computational complexity theory, Djikstra, n^2

Click to edit the document details