NITH 2012-2013 / Emner / Programming subjects (PG, IPG) / IPG210 Algorithms and Data Structures  

IPG210 Algorithms and Data Structures

Code
IPG210

Subject
Algorithms and Data Structures

ECTS (European Credit Transfer System)
5.00

Course leader
Stein Marthinsen

External examiner
Hermann Fylling, Uio

Date of approval


Aim
The course aims to give a deeper understanding of algorithms and data structures and their importance for creating efficient programs. This will make the students able to assess the use of class libraries such as Java Collections Framework.

Prerequisites
PG110 and PG210 or equivalent basic programming background.

Competence objectives

At completion of the course the students should be able to:

  • account for the concept time complexity and carry out simple analyses of running time for various algorithms;
  • develop and apply various data structures (lists, trees, graphs);
  • develop and assess the use of central algorithms.
  • use recursive programming;
  • program algorithms for searching and sorting;
Structure
Lectures (approx. 50%) and exercises (approx. 50%)

Grading system
Bokstavkarakter / Letter grade

Diploma supplement text
The course teaches how to treat algorithms and data structures, and the importance of these for assessing and creating efficient programs. The course uses Java programming.




Literature:
Title Author Publisher Published ISBN Version Comment Type Litterature
Java Software Structures: Designing and Using Data Structures, 3/E  John Lewis, Virginia Tech, Joseph Chase, Radford University  Addison-Wesley  2010  9780136078586    Bok  Pensum 

Vurdering / Assessment

Percentual weighting (%):
100

Type of assessment:
Skriftlig / Written

Help:
Ingen / None

Duration:
3 timer

Semester:
Høst / Autumn