course-details-portlet

IDATG2102 - Algorithmic Methods

About

New from the academic year 2020/2021

Examination arrangement

Examination arrangement: Written examination
Grade: Letters

Evaluation form Weighting Duration Examination aids Grade deviation
Written examination 100/100 4 hours F

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:
X of Y 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

Exam registration requires that class registration is approved in the same semester. Compulsory activities from previous semester may be approved by the department.

Admission to a programme of study is required:
Computer Science (BIDATA)
Digital Infrastructure and Cyber Security (BDIGSEC)
Programming (BPROG)

Course materials

Advertised later.

Credit reductions

Course code Reduction From To
IMT2021 7.5 01.09.2019
IDATA2302 7.5 01.09.2020
More on the course

No

Facts

Version: 1
Credits:  7.5 SP
Study level: Intermediate course, level II

Coursework

Term no.: 1
Teaching semester:  AUTUMN 2020

Language of instruction: Norwegian

Location: Gjøvik

Subject area(s)

-

Contact information
Course coordinator:

Department with academic responsibility
Department of Computer Science

Phone:

Examination

Examination arrangement: Written examination

Term Status code Evaluation form Weighting Examination aids Date Time Digital exam Room *
Autumn ORD Written examination 100/100 F
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.
Examination

For more information regarding registration for examination and examination procedures, see "Innsida - Exams"

More on examinations at NTNU