COT5405 - Homework/Reading Assignments

• HW 1 : Sep 7th (before class).
  • Homework 1 : [PDF]
  • Homework 1 Solution Template : [PDF] [TEX]
  • The implementation part of the homework will be out next week and will have a different due date.
  • More Linear Algebra, if you need it.
• HW 2 : Sep 28th (before class).
  • Complete Reading chapter 7 of the textbook, omit 7.13.
  • Chapter 1: Problem 2, Chapter 2: Problem 5, Chapter 3: Problem 2, Chapter 7: Problem 5,7, 24.
• Project Presentation Date : 29th October
• HW 3 : Nov 2nd (before class).
  • Complete reading chapter 8. Begin reading chapter 11 of the text book
  • Chapter 4 : Problem 1. Chapter 6 : Problem 1. Chapter 8: Problem 1,5,6. Chapter 11: Problem 4.
• HW 4 : Nov 16 (before class).
  • Complete reading chapter 11. Begin reading chapter 13
  • Chapter 5: Problem 2. Chapter 6: Problem 6. Chapter 11: Problem 3. Chapter 13: Problem 1,2.
• Final Project Submission: to be done Before Nov 30th.
  • A minimum two page project report written in Latex (11 point font).
  • If your project had code, a .tar.gz file with README file which clearly explains how to compile and execute your project. You should have some sample data that can be used for testing. We would want you to write tests to make sure your implementation works.
  • Names of your partner (if you have one) and you
  • Description : Specifications of the project including the algorithm description
  • Experimental Results
  • A set of power point slides for presenting your algorithm/project.
  • If you wrote code for the project, one should be able to generate documentation from the code (For example see Doxygen)
• Homework 5: Dec 2nd (before class).
  • Problem 1: Write a linear program that, given a bipartite graph G=(V,E), solves the maximum bipartite matching problem.
  • Problem 2: Give an efficient greedy algorithm that finds an optimal vertex cover for a tree in linear time.
  • Problem 3: The palindromes problem announced in class: Find the longest palindrome in a given string.