| Level | Undergraduate
|
| ECTS Credits | 10
|
| Duration | Autumn |
| Language | Norwegian
|
| Prerequisite(s) | |
| Aim | The student shall:
- explain, use and to some degree change a lot of standard
algorithms, a.o. sorting, searching and graph handling.
- be able to write reliable and efficient programs.
- find the algorithm for non-trivial problems and write the code
to solve this.
- handle advanced data structures such as lists, threes and
graphs.
- use abstraction in construction of programs.
- use recursion by problem solving. |
| Content | Techniques and algorithms:
- Object orientation
- Abstract datatypes
- Recursion
- Searching
- Sorting
- Hashing
- Compression
- Finite State Machines/Automata
Data Structures:
- Arrays
- Queues
- Stacks
- Pointers and dynamic allocation
- Lists
- Trees
- Graph (connectivity, weigted, directed)
- Network Flow
Efficiency:
- Complexity and O-notation
- Use of time and space
|
| Study Methods | Lectures, Mandatory Assignments, Exercises, Tutoring |
| Assessment | Written Exam, 5 hours |
| Grading System | Alphabetical Scale, A (best) - F (fail)
|
| Course Requirements | Exercises (must have been approved by course assistant) |
