INF-2101 – Algorithms (fall 2012)

Course information

Course information is here.

Important information will also be sent on the courses mailing list. Make sure that you are subscribed.

Staff

· Lars Ailo Bongo (lars.ailo.bongo@uit.no), Office: A259.

· Simon Engstrøm Nistad (simon.nistad@hotmail.com).

Lecture plan

Date	Topic	Readings
Mon 20/8	Introduction
Thu 23/8	Graphs	Chapter 17
Thu 30/8	Graph search (part1, part2)	Chapter 18
Thu 6/9	Diagraphs and DAGs	Chapter 19
Thu 13/9	No lecture
Thu 20/9	Minimum spanning trees	Chapter 20
Thu 27/9	No lecture
Thu 4/10	Shortest path (lecture notes are in Fronter)	Chapter 21
Thu 11/10	Presentation mandatory assignment 3	None
Thu 18/10	No lecture
Thu 25/10 Thus 1/11	Machine learning (additional resources in Fronter)	TBA
Thu 8/11	Summary
Thu 15/11	No lecture
Fri 23/11	Exam

All lectures are on Thursdays from 10:15-12:00 in Lille Aud unless otherwise noted.

Mandatory assignments

The assignments can be found in Fronter.

Readings (pensum)

Required readings:

· Algorithms in C, Part 5: Graph Algorithms, 3^rd Edition. Robert Sedgewick.

o Chapters 17-21

· Mandatory assignments

Recommended readings:

· Artificial Intelligence: A Modern Approach, 3^rd Edition. Stuart Russell and Peter Norvig.

· Alternatives to the above book (all freely available):

o http://abeautifulwww.com/2009/10/11/guide-to-getting-started-in-machine-learning/

o http://www-stat.stanford.edu/~tibs/ElemStatLearn/

o http://mlr.r-forge.r-project.org/tutorial/

· Game Coding Complete, 4^th Edition. Mike McShaffry and David Graham.