Data Structures

Education facts

Code: DIT962

The course covers the following topics: abstract data types<br> data structures and algorithms focusing both on imperative, object-oriented and functional languages<br> simple complexity analysis of imperative and functional code<br> differences between lazy and strict evaluation of functional data structures<br> common data structures such as arrays, lists, trees, hash tables and how these can be used to implement abstract data types such as stacks, queues, priority queues, dictionaries and graphs<br> standard algorithms for these data structures and their resource demands<br> iterators<br> sorting algorithms<br> standard libraries for data structures and algorithms

Entry requirements

The requirements for the course is to have successfully completed: - a course in imperative or object-oriented programming, 7.5 hec (e.g., DIT012 Imperative Programming with Basic Object-orientation, or equivalent) - a course in functional programming, 7.5 hec (e.g., DIT440 Introduction to functional programming, or equivalent) - a course or sub-course in discrete mathematics, 7.5 hec (e.g., DIT980 Discret Mathematics for Computer Scientists, the sub-course Introductory Algebra of MMG200 Mathematics 1, or equivalent)

Education offerings

Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.

• Data Structures

  University of Gothenburg

  Start date: 24 March 2025

  End date: 8 June 2025

  Pace of study: 50 %