Course syllabus for Data structures and algorithms

The course syllabus contains changes
See changes

Course syllabus adopted 2024-01-23 by Head of Programme (or corresponding).

Overview

  • Swedish nameDatastrukturer och algoritmer
  • CodeDAT038
  • Credits7.5 Credits
  • OwnerTKDAT
  • Education cycleFirst-cycle
  • Main field of studyComputer Science and Engineering, Software Engineering
  • DepartmentCOMPUTER SCIENCE AND ENGINEERING
  • GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail

Course round 1

  • Teaching language English
  • Application code 49126
  • Maximum participants320 (at least 10% of the seats are reserved for exchange students)
  • Open for exchange studentsYes
  • Only students with the course round in the programme overview.

Credit distribution

0119 Laboratory 3 c
Grading: UG		0 c3 c0 c0 c0 c0 c
0219 Examination 4.5 c
Grading: TH		0 c4.5 c0 c0 c0 c0 c
  • 16 Jan 2025 pm J
  • 05 Jun 2025 pm L
  • 21 Aug 2025 pm J
  • 30 Okt 2024 pm J

In programmes

Examiner

Go to coursepage (Opens in new tab)

Eligibility

General entry requirements for bachelor's level (first cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

The same as for the programme that owns the course.
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

Knowledge in object oriented programming corresponding to at least 7.5hp, including recursive functions and methods. Basic mathematical concepts, such as sets, functions, relations, graphs, logarithms and proofs by induction.

Aim

Data structures and algorithms are fundamental building blocks in almost all software products. Knowledge and skills in data abstraction, data structures, and algorithms are important in the construction, use, and maintenance of adaptable, reusable, correct, and efficient program components.

The course gives knowledge and skills in the construction and use of algorithms and data structures, an introduction to various techniques for the analysis of algorithms, and insights in the advantages of using data abstraction in program development.

Learning outcomes (after completion of the course the student should be able to)

Knowledge and understanding

  • explain basic abstract data types and data structures, including lists, queues, hash tables, trees, and graphs
  • explain some of the algorithms used to manipulate and query these data structures in an efficient way, and explain why they are correct

Competence and skills

  • apply basic abstract data types and data structures, and algorithms related to these
  • implement and use abstract data types as interfaces, and data structures as classes, in an object-oriented programming language
  • read, specify, and describe algorithms, at a higher level of abstraction than code

Judgement and approach

  • analyse the efficiency of basic algorithms and data structures
  • make informed choices between different data structures and algorithms for different applications

Content

The following topics are covered by the course:
  • abstract data types
  • data structures and algorithms focusing on imperative och object-oriented languages
  • common data structures such as arrays, linked lists, unbalanced and balanced trees, heaps, and hash tables
  • how these can be used to implement abstract data types such as stacks, queues, priority queues, maps, sets, and graphs
  • standard algorithms for these data structures, including their resource demands
  • searching and sorting algorithms
  • using different libraries for data structures and algorithms
  • basic complexity analysis of data structures and algorithms

Organisation

The teaching consists of lectures, exercises and supervised group work.

Literature

See course homepage.

Examination including compulsory elements

The course is examined by an individual written exam (4.5 hec), and assignments carried out in groups (3.0 hec). To pass the course, students must receive a passing grade in both modules. The grade for the entire course will be determined by the written exam.

The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.

The course syllabus contains changes

  • Change made on course round in programme overview:
    • 2024-03-20: Removed [TKTEM, Year 3 rule O] Course round 1 removed by PA