# Algorithms and Data Structures

7.5 credits

Syllabus, Bachelor's level, 2IS206

A revised version of the syllabus is available.
Code
2IS206
Education cycle
First cycle
Main field(s) of study and in-depth level
Software Engineering G1F
Fail (U), Pass (G), Pass with distinction (VG)
Finalised by
The Department Board, 3 March 2016
Responsible department
Department of Informatics and Media

## General provisions

The course is included in the following degree programme:

• Server side web programming, 120 credits. Be given also as a freestanding course.

## Entry requirements

Software Engineering 30 credits of which 15 credits in object-oriented programming with Java and Discrete Mathematics 7.5 credits or the equivalent

## Learning outcomes

Regarding knowledge and understanding the student is expected to be able to on completion of the course:

• Describe the concepts complexity and recursion

• Account for basic algorithms and data structures

Regarding competence and skills the student is expected to be able to on completion of the course:

• Implement and adapt data structures and algorithms Regarding judgement and approach the student is expected to be able to on completion of the course:

• Evaluate algorithmic solutions in relation to complexity

• Assess the suitability of data structures and algorithms for a certain problem

## Content

Constructing data structures such as linked list, stack, queue, tree and graph as well as basic algorithms for searching, sorting, compression and recursion implemented in Java. Component 1: Lists, stacks and queues, 1.5 credits The component brings up the basic data structures list, stack and queue as well as operations on these. Component 2: Trees and recursion, 2 credits In this component, trees and operations on these are treated as well as recursion. Component 3: Graphs, 2 credits In this part, graphs and operations on graphs are brought up. Component 4: Sorting, hashing and compression, 2 credits The component deals with sorting algorithms, technologies for hashing as well as compression of text.

## Instruction

The course is given in the form of lectures, practical assignments and laboratory sessions.

## Assessment

The components are examined through written assignments. As grade on component and the course in full are used one of the expressions Passed with distinction, passed or failed. For the grade Pass in the whole course, it is required that all components are passed. To pass with distinction is required furthermore passed with distinction on at least three of the components.

## Other directives

The course is given on Campus Gotland and as a distance course