|
ITCS 2215 – Section 001, Spring 2003 Design and Analysis of Algorithms Atkins 126, Tuesdays and Thursday |
|
|
Instructor: Benjamin Lok |
TA: Kalyan
Tangirala |
|
Office Kennedy 213 Telephone: 687-6260 Email: bclok@uncc.edu |
Office Kennedy 211 Email: tvkalyan@yahoo.com |
|
Office Hours: Tuesdays Thursdays, Also available by appointment (email) |
Office Hours: Monday and Wednesdays,
|
|
Lessons |
|
Lesson #1 - Data Structure Review |
|
Lesson #2 - Tree/Graph Review |
|
Lesson #3 - Mathematics Review |
|
Lesson #4 - Algorithm Analysis |
|
Lesson #5 - Divide and Conquer |
|
Lesson #6 - Greedy Algorithms |
|
Lesson #7 - Graph Algorithms |
|
Lesson #8 - Probabilistic Algorithms |
|
Lesson #9 – Parallel Algorithms and Computation Complexity |
|
Schedule |
|
January |
|
14th - Class #1. First Day of Class. Syllabus, Survey, Assignment #1 Handed Out |
|
21st - Class #3. Lesson #1 (Data Structure Review). Lesson #2 (Trees/Graphs Review) |
|
23rd - SNOW DAY!!! YEAH!!! |
|
28th - Class #4. Lesson #2 (Trees/Graphs Review). Lesson #3 (Mathematics Review) |
|
30th - Class #5. Lesson #3 (Mathematics Review). Lesson #4 (Algorithm Analysis), Assignment #2 Handed Out |
|
February |
|
4th - Class #6. Lesson #3 (Mathematics Review). Lesson #4 (Algorithm Analysis), Assignment #1 DUE! |
|
13th - EXAM #1, Assignment #2 DUE! |
|
20th - Class #10. Lesson #4 (Algorithm Analysis). Turn in Assignment #2. Hand out Assignment #3. |
|
25th - Class #11. Lesson #4 (Algorithm Analysis). Lesson #5 (Divide and Conquer) |
|
March |
|
4th - Class #13. Lesson #5 (Divide and Conquer). Lesson #6 (Greedy Algorithms). Help on Assignment #3. |
|
6th - Class #14. Lesson #6 (Greedy Algorithms). Help on Assignment #3. |
|
11th - SPRING BREAK |
|
13th - SPRING BREAK |
|
18th - Class #15. Lesson #6 (Greedy Algorithms). Turn in Assignment #3. Hand out Assignment #4. |
|
Assignments |
|
Assignment #1 - Data Structures (Solution – David Stone) |
|
Assignment #2 - Algorithm Analysis (Solution – Allison Bustle) |
|
Assignment #3 - Divide and Conquer (Here are some powerpoint slides for assistance) (Solution – Jerrod Kraftchick) |
|
Assignment #4 - Greedy Algorithms (Solution – Jerrod Kraftchick) |
|
Assignment #5 - Graph Algorithms (Solution – David Stone) |
|
Assignment #6 - Probabilistic Algorithms (Solution – David Stone) |
|
Course Handouts |
|
Important Dates |
|
|
January |
|
|
14th – Tuesday |
First Day of Class |
|
21st – Tuesday |
Drop Class Deadline |
|
February |
|
|
13th – Thursday |
Exam #1 |
|
21st – Friday |
Withdraw from Class – ‘W’ |
|
March |
|
|
10-14th |
SPRING BREAK!!!! |
|
27th - Thursday |
Exam #2 |
|
April |
|
|
May |
|
|
1st - Thursday |
Last Day of Class! J |
|
5th – Monday ( |
FINAL EXAM L |
Catalog Description:
Techniques and tools for the development of correct algorithms. Structured and modular programming efficiency and correctness, testing recursion, complexity, and heuristics
Textbook:
Gilles Brassard and Paul Bratley, Fundamentals of Algorithms, Prentice Hall, 1996. ISBN 0-13-335068-1.