• Course Outline

  In this course objective is to give the student further exposure to the design, analysis, and application of algorithms. This course will also covers major results and current research directions in data structures.

• Taught by:
  • Aritra Banik
• Class Meetings
  • Tuesday 2-3:30
  • Thursday 2 -3:30
• The necessary evil - marks, exam, etc.

  The evaluation for the course will be based on midterm test1 (weightage 25%), midterm test2 (weightage 25%), , final exam (weightage 25%) Presentation (weightage 25%).

• Inverted Lectures

  Problems we will discuss will include both problem-set style problems with known solutions and open research problems that no one knows the answer to, with the goal of publishing papers about whatever we discover.

• Some cautionary notes on tests, assignments and problem sheets

  This course is essentially a problem solving course, and so there will be lots of problems in the form of assignments and practice problems. Anything you hand in is assumed to be done by you on your own. If you had consulted any resource (including books, internet, or other persons), then please mention that in the work you hand in. Copying from any source without acknowledgement will result in unwanted consequences for everyone!

Topics we hope to cover (not necessarily in this order)

1. Interval graphs and friends
2. Dynamic Graphs, A network link went down, or you just added or deleted a friend in a social network. We can still maintain essential information about the connectivity as it changes.
3. Low memory algorithms
4. VC dimension

Assignments

• Graph-theoretic algorithms Lecture notes of a graduate course University of Waterloo