AlgFl04QuizNov29

AlgFl04QuizNov29 - Quiz Algorithms Points 30 (2 per...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
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 Multi-processor scheduling problem does not always find the correct answer. True / False (True) In the bin-packing 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 0-1 Knapsack problem), then the algorithm is called ___________ (Pseudo-polynomial 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
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.

Page1 / 2

AlgFl04QuizNov29 - Quiz Algorithms Points 30 (2 per...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online