Tentalabbet

725G97 · 7.5 credits · Basic level (G1N) · Informatik

Data Structures and Algorithms

Active · next start HT 2026

48%

passed the latest regular sitting

DAT1 · 31 Oct 2025 · 33 students

57%

passed the regular sittings, all sittings over the last 5 years

DAT1 · 186 students

97%

Harder than 97% of courses at basic level

Compared with 874 courses at the same level, ordinary exams over the last three academic years. 73 students.

Part of 1 programme

Other module

DAT1 Examination

  • VG
  • G
  • U

Main rounds

57% passed · 186 students

  • 48%33
  • 33%40
  • 63%40
  • 67%30
  • 74%43

Later rounds

57% passed · 104 students

  • 44%9
  • 42%12
  • 38%8
  • 77%26
  • 33%6
  • 57%14
  • 57%7
  • 44%16
  • 100%6
  • Pass a later round: 57% (104 students), compared with 57% (186 students) on the ordinary exam
  • Get VG: 15% (290 students)
Show small sittings (1)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

  • 33%3

Other modules

Partial exams, hand-ins and labs. They are not part of the figures at the top.

Hand-in or lab

UPG4 Written Assignment

  • G

Main rounds

100% passed · 146 students

  • 100%34
  • 100%40
  • 100%37
  • 100%35

Later rounds

No sittings with at least 5 students.

    Show small sittings (3)

    Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

    • 100%1
    • 100%1
    • 100%1

    Hand-in or lab

    UPG3 Examination

    • G

    Main rounds

    100% passed · 141 students

    • 100%31
    • 100%37
    • 100%38
    • 100%35

    Later rounds

    No sittings with at least 5 students.

      Show small sittings (4)

      Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

      • 100%1
      • 100%1
      • 100%1
      • 100%1

      Hand-in or lab

      LAB2 Laboratory work

      • G

      Main rounds

      100% passed · 138 students

      • 100%34
      • 100%40
      • 100%29
      • 100%35

      Later rounds

      No sittings with at least 5 students.

        Show small sittings (5)

        Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

        • 100%2
        • 100%1
        • 100%2
        • 100%2
        • 100%2

        Hand-in or lab

        LAB1 Laboratory work

        • G

        Main rounds

        100% passed · 41 students

        • 100%41

        Later rounds

        No sittings with at least 5 students.

          Show small sittings (2)

          Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

          • 100%1
          • 100%1

          Hand-in or lab

          UPG2 Examination

          • G

          Main rounds

          100% passed · 40 students

          • 100%40

          Later rounds

          No sittings with at least 5 students.

            Show small sittings (2)

            Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

            • 100%1
            • 100%1

            About the course

            Aim

            Efter avslutad kurs ska den studerande kunna:

            • analysera tids- och rumskomplexitet hos iterativa och enkla rekursiva algoritmer
            • redogöra för och använda de vanligaste abstrakta datatyperna och sorteringsalgoritmerna
            • implementera de vanligaste abstrakta datatyperna med olika datastrukturer och algoritmer
            • beskriva etablerade metoder för design (och analys) av algoritmer i allmänhet

            Content

            I kursen ingår att självständigt konstruera datorprogram som effektivt utnyttjar tid och minne.

            I kursen behandlas:

            • Grundläggande begrepp- Matematiska grunder för algoritmanalys inklusive ordo-notation- Grundläggande abstrakta datatyper och datastrukturer såsom listor, stackar, köer, sökträd, hashtabeller och grafer.- Resursanalys av algoritmer- Sortering och urval- Paradigmer för design av algoritmer
            Examiner
            Filip Strömbäck
            Main field of study
            Informatik
            Syllabus on Studieinfo ↗