Computer Engineering BA (B), Data Structures and Algorithms, 6 credits


Computer Engineering BA (B), Data Structures and Algorithms, 6 credits

General data

  • Code: DT064G
  • Subject/Main field: Computer Engineering
  • Cycle: First cycle
  • Progression: (B)
  • Credits: 6
  • Progressive specialization: G1F - First cycle, has less than 60 credits in first-cycle course/s as entry requirements
  • Answerable department: Information Systems and Technology
  • Answerable faculty: Faculty of Science, Technology and Media
  • Established: 3/15/2007
  • Date of change: 3/11/2021
  • Version valid from: 7/1/2021


No translation available

Course objectives

No translation available


- Introduction to algorithms on the example of the graph-connectivity problem;
- Analysis of algorithm efficiency: asymptotic approach;
- Elementary and advanced data structures: array, linked list, dynamic array, queue, stack, compound containers; notions of abstract data types (ADT), iterators;
- Recursive algorithms and "divide-and-conquer" approach;
- Introduction to dynamic programming;
- Trees, graphs, and traversal algorithms;
- Elementary sorting algorithms, Shell's sorting and key-indexed counting;
- Quicksort, mergesort;
- Heap and priority queue data structures, heapsort;
- Radix sorting: binary quicksort and MSD radix sort;
- Searching and symbol-table ADT (dictionary), binary search trees (BST), balancing BSTs;
- Balanced "2-3-4" search trees, "red-black" BSTs.;
- Hashing search algorithms.

Entry requirements

Computer Engineering BA (A) 18 Credits, including Object based programming, 6 Credits. Mathematics BA (A) 9 Credits, including Discreet Mathematics, 6 Credits.

Selection rules and procedures

The selection process is in accordance with the Higher Education Ordinance and the local order of admission.

Examination form

L102: Labs, 3.0 Credits
Grade scale: Fail (U) or Pass (G)

T101: Written Exam, 3.0 Credits
Grade scale: Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.

Grading criteria for the subject can be found at

The examiner has the right to offer alternative examination arrangements to students who have been granted the right to special support by Mid Sweden University’s disabilities adviser.

If examination on campus cannot be conducted according to decision by the vice-chancellor, or whom he delegated the right to, the following applies: [Written Exam T101], will be replaced with two parts, online examination and follow-up. Within three weeks of the online examination, a selection of students will be contacted and asked questions regarding the examination. The follow-up consists of questions concerning the execution of the on-line exam and the answers that the student have submitted.

Grading system

Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.

Course reading

Required literature

  • Author: Sedgewick
  • Title: Algorithms in C++
  • Edition: (Ny upplaga, om möjligt)
  • Publisher: Addison-Wesley
  • Comment: alternativt: M. Goodrich and R. Tamassia Data Structures and Algorithms in Java, Second edition Wiley, ISBN: 0-471-38367-8

The page was updated 9/2/2014