cs255 Advanced Algorithms CLARK UNIVERSITY Spring 2016

###Goal:
#####To futher understanding of complex algorithms in how to formulate them, proove their correctness, and analyze their time and space efficiencies.

---

Course Material: Reference Slides

• Greedy
• String Sorting
• Tries
• Data Compression
• Complete Search
• Divide and Conquer
• Dynamic Programming
• Network Flow
• P, NP, and NP-Complete

---

Assignments:

Press on the name to go to the problem descriptions or click "here" to go directly to project folder in this repository.

1. Turtle Graphics and Anagrams | click here

2. Burrows-Wheeler Compression | click here

3. UVA 12192 and UVA 124 | click here

4. Book 5.3 and 4.12 | click here

5. Book 6.4, UVA 11516, UVA 108, and UVA 10261 [Code is complete:Reports in progress] | click here

6. Book 6.16, UVA 544, and UVA 11506 | click here

7. Book 7.28, 8.4, and UVA 10937 | click here

8. As a class do 4 of ACM/ICPC 2013 World Finals Problems | click here

9. Individually do ACM/ICPC 2015 World Finals Problems | click here

The book that I refer to is Algorithm Design by Jon Kleinberg and Eva Tardos