Algorithms and Data Structures (FND1)

Najaarssemester - Herbstsemester
2008

Tentamens/Klausuren & Assessments

Sheets - Folien

Week/Woche	Info	Sheets NL	Folien DE
1	Introduction	introduction_handout_nl.pdf	introduction_handout_de.pdf
1	Complexity, empirical and analytical studies	complexity_handout_nl.pdf	complexity_handout_de.pdf
2	Data structures 1: arrays and linked lists	datastructures1_handout_nl.pdf	datastructures1_handout_de.pdf
2	Data structures 2: ADT's, stacks and queues	datastructures2_handout_nl.pdf	datastructures2_handout_de.pdf
3	Recursion	recursion_handout_nl.pdf	recursion_handout_de.pdf
3	Tree traversal	treetraversal_handout_nl.pdf	treetraversal_handout_de.pdf
4	Divide and conquer	divide_conquer_handout_nl.pdf	divide_conquer_handout_de.pdf
5	Basic sorting	basic-sorting_handout_nl.pdf	basic-sorting_handout_de.pdf
6	Quicksort	quicksort_handout_nl.pdf	quicksort_handout_de.pdf
6	Heapsort	heapsort_handout_nl.pdf	heapsort_handout_de.pdf
7	Dynamic programming	dynamic_programming_handout_nl.pdf	dynamic_programming_handout_de.pdf

Practicum opgaven - Praktikum Aufgaben

Nr Deadline Assessment Info NL DE

1 thu 18 sep tue 23 sep & thu 25 sep Stacks en Queues - Keller und Warteschlangen Opgave Aufgabe

2 thu 9 okt tue 21 okt & thu 23 okt Bomen - Bäume Opgave Aufgabe

3 fri 31 oct 10:00 h tue 4 nov Sorteren - Sortieren Aufgabe

Nr	Deadline	Assessment	Info	NL	DE
1	thu 18 sep	tue 23 sep & thu 25 sep	Stacks en Queues - Keller und Warteschlangen	Opgave	Aufgabe
2	thu 9 okt	tue 21 okt & thu 23 okt	Bomen - Bäume	Opgave	Aufgabe
3	fri 31 oct 10:00 h	tue 4 nov	Sorteren - Sortieren		Aufgabe

Assessments

Eintelung der Gruppen: here.

Exam solutions (multiple choice part) of 6 November 2008

Solutions: here

Course Information

Course Information: Module Beschreibung DE, Module Beschrijving NL
Course Book: Robert Sedgewick: Algorithms in Java. Vol. 1 (Parts 1-4).Book site.
Addison Wesley, Boston 2005, 3rd edition. (ISBN 0201361205)
(You should have copy of this book.)
The sections from the book that will not be covered in this course can be found here.
GEDEELTELIJK-TEILWEISE-PARTLY: Algorithms in Java. Vol. 2 (Part 5).
(You don't need to buy this book.)

Additional Information

CODE from the book
The classes In.java and Out.java, see appendix of Sedgewick Vol. 1
Alternative code for the Input class using a textfile as input.(See example on the Input.java.txt-file)
You should create an instance, lets say in, of the Input class. The size of the id array is equal to the value of in.getN(). Modify the for loop in the programs of the book in such a way that the program calls in.getInt() exactly two times the value of in.getM() (i.e. the number of input pairs).
Slightly modified Out.java file.

A starter package for the brute-force attack, see Computerlab, connection problem.

If you have any questions concerning ALDA, feel free and contact us

Ferd van Odenhoven Julia Stoll