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 book is not yet in Studia but should appear there in two weeks.
The course covers Chapters 9-13, 16, 20, 24-30 (plus-minus some minor parts to be specified later).
Foreleser (Lecturer): Fedor V. Fomin
Administrator: Orjan Bergmann (Orjan.Bergmann@student.uib.no)
Gruppelederer (Assistents): Arnt-Henning Moberg (firstname.lastname@example.org), Michael Mortensen (email@example.com) and Brage Breivik (firstname.lastname@example.org)
Forelesninger på engelsk (lectures in English):
Oppgavegjennomgang (solutions to exercise):
Gruppeøvinger (plenary workshops):
Første forelesning (starting lecture): 17/8/2004 Siste forelesning (last lecture): 17/11/2004
Office Hours: By appointment (fomin_AT_ii.uib.no)
Exam:: There will be written exam (10/12/2004). 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. Obligatory exercise #1 is now availible. The due date is Thursdag 7th of October. See INF 102 homepage at Studentportal for more info.
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.