Course - Algorithmic Methods - IDATG2102
IDATG2102 - Algorithmic Methods
About
Examination arrangement
Examination arrangement: School exam
Grade: Letter grades
Evaluation | Weighting | Duration | Grade deviation | Examination aids |
---|---|---|---|---|
School exam | 100/100 | 4 hours | I |
Course content
Build and use data structures as: array, queue, stack, list, tree and graphs. Abstract data types. Advanced algorithms for searching, sorting, traversering. Recursion. Complexity for algorithms, efficiency, use of time and memory.
Learning outcome
Knowledge:
- Become familiar with, explain, apply and to some extent be able to rewrite some standard algorithms such as sorting, searching and graph handling.
- Describe and explain various data structures (arrays/tables, linked lists, queues, stacks, trees and graphs).
- Analyze advanced and complex (non-trivial) issues, and finding the algorithm to solve these.
- Apply recursive approach/method of problem solving and programming.
- Using abstraction in the construction of programs.
Skills:
- Writing reliable and efficient / fast computer programs.
- Write the program code that addresses advanced and complicated issues.
- Manage and handle advanced data structures (with particular emphasis on trees and graphs).
General competence:
- Had developed the ability to think and solve sophisticated and complex problems.
- Finding other/newer knowledge (here: algorithms), results and research in the field.
Learning methods and activities
- Lectures
- Mandatory Works
- Exercises
- Guidance
Mandatory Claims: 4 of 6 mandatory assignments work must be approved. Clearly inadequate work, not independently own work or deadline that is not complied is considered as undelivered.
Compulsory assignments
- Mandatory works
Further on evaluation
Ordinary re-sit examination in August.
Specific conditions
Admission to a programme of study is required:
Computer Science - Engineering (BIDATA)
Digital Infrastructure and Cyber Security (BDIGSEC)
Electrical Engineering (BIELEKTRO)
Programming (BPROG)
Recommended previous knowledge
- PROG1003 Object-Oriented Programming or IDAT2001/IDAT2003 Programming 2
- IMAG1001/IMAG1002 Mathematics or BMA1010 Mathematics
Course materials
Advertised later.
Credit reductions
Course code | Reduction | From | To |
---|---|---|---|
IMT2021 | 7.5 | AUTUMN 2019 | |
IDATA2302 | 7.5 | AUTUMN 2020 |
No
Version: 1
Credits:
7.5 SP
Study level: Intermediate course, level II
Term no.: 1
Teaching semester: AUTUMN 2024
Language of instruction: Norwegian
Location: Gjøvik
- Computer Science
Department with academic responsibility
Department of Computer Science
Examination
Examination arrangement: School exam
- Term Status code Evaluation Weighting Examination aids Date Time Examination system Room *
- Autumn ORD School exam 100/100 I 2024-12-13 09:00 INSPERA
-
Room Building Number of candidates M433-Eksamensrom 4.etg Mustad, Inngang A 77 M438 Eksamensrom 4.etg, Inngang D Mustad, Inngang D 33 M414-Eksamensrom 4.etg Mustad, Inngang A 0 A-atriet-2/3 (A-160) Ametyst 17 - Summer UTS School exam 100/100 I INSPERA
-
Room Building Number of candidates
- * The location (room) for a written examination is published 3 days before examination date. If more than one room is listed, you will find your room at Studentweb.
For more information regarding registration for examination and examination procedures, see "Innsida - Exams"