Algorithms -- 2009-2010 -- info.uvt.ro/Laboratory 7

From Wikiversity
Jump to navigation Jump to search

Quick links: front; laboratories agenda, 1, 2, 3, 4, 5, 6, 7, evaluation, tools, references.

Notes[edit]

Exercises[edit]

  • problem 8 (for en) or problem 9 (for ro) from 6'th problem set -- activity scheduling (greedy techniques);
  • problem 4 from 7'th problem set -- editing distance (dynamic programming);

Assignment[edit]

For submission please follow: assignment 5.

Problem 1-2[edit]

  • all the problems from the exercises section (activity scheduling and editing distance);

Problem 3[edit]

  • from the course -- finding the longest strictly increasing sub-sequence of a list;

Problem 4[edit]

  • from the course -- the knapsack problem (the discrete version);

Ciprian Dorin Crăciun, ccraciun@info.uvt.ro