Eksamen fra ifjor kan lastes ned her.
Merk, pensum er oppdatert.
Til eksamen kan dere ha med kalkulator (selv om dere sansynligvis ikke trenger det). Ingen bok eller notater.
Course Description: The course covers basic algorithmic notions and ideas: Efficiency, recursion, sorting, searching, graph algorithms and related data structures: Sorted lists, stacks, trees, heaps, graphs.
Objectives: The student should acquire a good understanding of basic algorithms and become familiar with the most basic data structures.
Strongly Recommended Qualifications: INF 101, Program Development Methodologies (Programming II)
Lærebok (Textbook): Frank Carrano, Walter Savitch, Data Structures and Abstractions with Java.
The course covers Chapters 9-13, 20, 24-30 (Chp. 28 up to p. 659) Chapters 1-8 and 16 are assumed to be known. In addition all the given exercises and compulsory problems are part of the curriculum.
Foreleser (Lecturer): Fredrik Manne
Administrator: Geir Gundersen (email@example.com)
Gruppelederer (Assistents): Dag Hovland (Mandag 10.15-12), Brage Breivik (Mandag 16.15-18.00) og Karianne Berg (Tirsdag 10.15-12)
Oppgavegjennomgang (solutions to exercise):
Gruppeøvinger (plenary workshops):
Første forelesning (starting lecture): 23/8/2005 Siste forelesning (last lecture): Ikke avklart
Office Hours: Etter avtale (fredrikm_AT_ii.uib.no)
Exam:: There will be written exam (16/12/2005). To be admitted to the exam you should deliver in time solutions to two compulsory homeworks (obligatoriske oppgaver). They will be counted equally (15% each), and will count 30% of the final grade.
Tentative Schedule (changes are possible):
Off stands for no meeting at all, Ch. for lecturing material and Ex. for workshop exercises to be found at the end of each chapter. For example, Ch.1.1-5;2.1,3 would denote a slot with lectures on the first 5 sections of chapter 1 and sections 1 and 3 of chapter 2.
Last modified: Thu, 04 Nov 2004 15:38:28 GMT