Data Structures and Algorithms

The course covers basic data structures (sequence, list, stack, queue, tree, graph) and related applications.

The course covers a number of algorithms using the above-mentioned data structures: sorting, searching, hashing, and navigating within certain data structures, finding the shortest way between two nodes in a graph, finding the shortest way in a tree structure, detection of cycles, minimum spanning trees, strong components and spanning forests. The concept of heuristics is introduced.

The course introduces the evaluation of algorithms and basic complexity theory.

The course includes both theory and practice. Instruction is in the form of lectures and independent study (reading assignments) as well as exercises and group laboratory sessions.

Progressive specialisation: G1F (has less than 60 credits in first‐cycle course/s as entry requirements)

Education level: Undergraduate level

Admission requirements: Programming Techniques, 7.5 ECTS credits, and Software Development Methodology, 7.5 ECTS credits, or equivalent.

Selection: Selection is usually based on your grade point average from upper secondary school or the number of credit points from previous university studies, or both.

This course is included in the following programme

• Study Programme in IT-Design: Software Design (studied during year 2)
• Master of Science in Computer Engineering (studied during year 2)
• Master of Science in Industrial Engineering and Management (studied during year 3)
• Study Programme in Engineering - Computer Science (studied during year 2)
• Bachelor Programme in Computer Science (studied during year 2)