|
INF-2100: Algorithm design and analysis Work Load
10 credits (ECTS) | Contents
Introduces formal techniques used in the design and analysis of algorithms. The focus will be on the underlying mathematical theory and practical considerations of efficiency. Topics include asymptotic complexity bounds, analysis techniques, algorithmic strategies, and introduction to automata theory and its application on language translation. | Form of teaching
Lectures: 30, Colloquium: 30, Laboratory: 30 | Compulsory teaching
Assignments | Assessment
Includes up to 3 written assignments (graded 50%) and a final 4 hours exam (graded 50%). Oral presentation of the assignments and demonstration of a working system can be claimed. Fall and Spring exams. Graded by letter A-F. | Examination semester
Spring | Date(s) of written examination
31.05.2005
The exam date is preliminary and may be subject to change. Definitive exam date will be announced on the notice boards at the faculties in the beginning of May for the spring semester and in the beginning of November for the autumn semester. | Type of course
Theoretical and practical subject. | Level of course/Year of study
Normally first year. | Recommended previous qualifications
INF-1100 Programming fundamentals, INF-1101 Data structures and algorithms, MAT-1005 Discrete mathematics 1 | Recommended reading/syllabus
Available on request. See also link to Details. | Language of instruction
Norwegian | Course overlap
D-130 -1 10 sp | Homepage
http://uit.no/informatikk/inf2100/
| Timetables
http://timeplan.uit.no/emne.php?department=ALLE&module=INF-2100-1 |
Teaching spring 2005
All undervisning gis på Realfagbygget.
Første frammøte tirsdag 11.1.2005 kl 1015, Lille auditorium.
Responsible teacher:F.aman. Tage Stabell-Kulø | | Forelesning | Teaching period:05.01.2005 to15.06.2005
Tirsdag 10:15 to11:00
B203, Lille Auditorium
Onsdag 08:15 to10:00
B203, Lille Auditorium | | Laboratorium | Laboratorieveiledning foregår på Studentlab IFI, Underetasjen, Realfagbygget. |
|
