Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download 1 - USC
Document related concepts
Computational electromagnetics wikipedia , lookup
Mathematical optimization wikipedia , lookup
Lateral computing wikipedia , lookup
Simplex algorithm wikipedia , lookup
Algorithm characterizations wikipedia , lookup
Selection algorithm wikipedia , lookup
Travelling salesman problem wikipedia , lookup
Computational complexity theory wikipedia , lookup
Dijkstra's algorithm wikipedia , lookup
Expectation–maximization algorithm wikipedia , lookup
Factorization of polynomials over finite fields wikipedia , lookup
Genetic algorithm wikipedia , lookup
Transcript
CSCI 570 Quiz 3. 1. What are the essential characteristics of problems that can be solved by greedy algorithms? 2. The CS department wishes to allocate some courses to SAL 101. The list of courses are: Courses: 101 201 301 402 585 570 551 571 271 Timings: 3-5 2-6 12-3 4-7 1-4 6-9 5-7 3-4 7-9 All the timings are in p.m. Courses are said to be compatible if their timings do not overlap. Outline an algorithm so that the CS department can allocate the maximum set of compatible courses to SAL 101. What is the maximum set of compatible courses in the above case? 3. Assume that you have to solve the 0/1 Knapsack problem. Give a potential greedy algorithm for solving the problem. Will this algorithm always produce an optimum solution? Prove or Disprove.
