|
INF-1101: Data structures and algorithms Work Load
10 credits (ECTS) | Contents
INF-1101 offers theoretical and pragmatic reasoning for the choice and implementation of data structures and algorithms working on them. The lectures will cover how dynamic data structures are applied to represent problems, and methods for searching and sorting, iteration and recursion. | 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
06.06.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, MAT-1005 Discrete mathematics 1 | Recommended reading/syllabus
Available on request. See also link to Details. | Language of instruction
Norwegian | Course overlap
D-110 -1 5 sp
D-130 -1 5 sp | Homepage
http://uit.no/informatikk/inf1101/
| Timetables
http://timeplan.uit.no/emne.php?department=ALLE&module=INF-1101-1 |
Teaching spring 2005
All undervisning gis på Realfagbygget.
Første frammøte tirsdag 11.1.2005 kl 0815, Lille auditorium.
Responsible teacher:F.aman. Weihai Yu | | Forelesning | Teaching period:05.01.2005 to15.06.2005
Tirsdag 08:15 to10:00
B203, Lille Auditorium
Onsdag 12:15 to13:00
B302, Store Auditorium | | Laboratorium | Laboratorieveiledning foregår på Studentlab IFI, Underetasjen, Realfagbygget. |
|
