Course Description: There are many aspects to the study of data structures, and the algorithms that operate upon them. In this course, you will learn the basic skills and knowledge to develop efficient algorithms to solve computational problems and to make informed choices between different solutions for the same problem.

Prerequisites: Being able to work with basic programming constructs such as linked lists, arrays, loops ... Being able to apply standard proving techniques such as proof by induction, proof by contradiction ... Being familiar with sums and logarithms such as discussed in Chapter 3 and Appendix A of the textbook.

Format:

The course 2IL65 has three different components.

1. Lecture
2. Big tutorial During this tutorial you have the opportunity to work on this week's home work assignment. One of the instructors will be present to answer questions.
3. Small tutorials During these tutorials the instructors will explain the solutions to the homework assignments of the previous week and answer any questions that arise.

1. 7 homework assignments, the best 5 of which each count for 10% of the final grade.
2. A written exam (closed book) which counts for the remaining 50% of the final grade.

If you reach less than 50% of the possible points on the homework assignments, then you are not allowed to participate in the final exam nor in the second chance exam. You will fail the course and your next chance will be next year. If you reach less than 50% of the points on the final exam, then you will fail the course, regardless of the points you collected with the homework assignments. Your grade will be the minimum of 5 and the grade you achieved. However, you are allowed to participate in the second chance exam. The grade of the second chance exam replaces the grade for the first exam, that is, your homework assignments always count for 50% of your grade.

	LaTeX is a document typesetting software package that is widely used by mathematicians, (computer) scientists, and many others that need to typeset technical writing. This article on Wikipedia gives you some background and history.
	Our department has a latex distribution that comes with a nice editing environment. Check this web-page for details.
	To get started with latex, read the "Not so short introduction ..." or check out this Wikibook.
	I highly recommend the (free!) drawing editor Ipe to draw figures for the inclusion in Latex documents.

Academic Dishonesty: All class work has to be done independently. You are of course allowed to discuss the material presented in class, homework assignments, or general solution strategies with me or your classmates, but you have to formulate and write up your solutions by yourself. You must not copy from the internet, your friends, or other textbooks. Problem solving is an important component of this course so it is really in your best interest to try and solve all problems by yourself. If you represent other people's work as your own then that constitutes fraud and will be dealt with accordingly.

Schedule: the course will run from November 16, 2011 to January 19, 2012. Lec2: There is no small tutorial in the first week. Instead, I scheduled the second lecture already in the first week. This will give us a kick-start into algorithms. On the Wednesday of the second week there will be no lecture. January 20 is TU/e open day, and therefore no class. In the last week (Jan 18./19.) I will use the two meetings to give a summary, for a small tutorial on Assignment 7 and a "small tutorial" on exam preparation.

	Lecture			Assignments			Weekdays
Week	Topic	Slides	Material	Due			Wed	Thu	Fri
Nov 16./17./18.	Introduction.		Chapters 1 and 2.	24-11-2011	A1	A1			Lec2
Nov 24./25.	Analysis of algorithms.		Chapters 2, 3, and 4.	30-11-2011	A2	A2
Nov 30., Dec. 1./2.	Heaps.		Chapter 6.	07-12-2011	A3	A3
Dec. 7./8./9.	Sorting in linear time.		Chapter 8.	14-12-2011	A4	A4
Dec. 14./15./16.	Hash tables.		Chapter 11.	21-12-2011	A5	A5
Dec. 21/22./23.	Binary search trees.		Chapter 12.	11-01-2012	A6	A6
Jan 11./12./13.	Elementary Graph Algorithms		Chapter 22.	18-01-2012	A7	A7
Jan 18./19.	Wrap Up

T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein.
Introduction to Algorithms (2nd edition)
MIT Press, 2001.
ISBN 0-262-53196-8 (paperback).

Errata: There is a web page with errata for this book.

T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein.
Introduction to Algorithms (3rd edition)
MIT Press, 2009.

ISBN-10: 0-262-53305-7 (paperback)
ISBN-13: 978-0-262-53305-8 (paperback)

ISBN-10: 0-262-03384-4 (cloth)
ISBN-13: 978-0-262-03384-8 (cloth)

web page for this book.