Tentalabbet

TDDE73 · 6 credits · Basic level (G2F) · Datateknik

Programming, Data Structures and Algorithms

Active · next start HT 2026

100%

passed the latest regular sitting

LAB1 · 9 Jan 2026 · 7 students

100%

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

LAB1 · 7 students

This module only reports passing results, so the pass rate does not show how many did not pass.

Part of 1 programme

Hand-in or lab

LAB1 Laboratory work

  • G

Main rounds

100% passed · 7 students

  • 100%7

Later rounds

No sittings with at least 5 students.

    Other modules

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

    Hand-in or lab

    UPG1 Assignments

    • 5
    • 3

    Main rounds

    100% passed · 5 students

    • 100%5

    Later rounds

    No sittings with at least 5 students.

    • Get 5: 60% (5 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.

    • 100%1

    About the course

    Aim

    After the course the student will be able to:

    • use basic language constructs
    • use design principles, methods and techniques used in object-oriented programming to construct programs that solve given problems
    • analyze time- and memory complexity for iterative and recursive algorithms
    • explain and use abstract datatypes and sorting algorithms

    Content

    Students gain skill in C++ programming. The course covers imperative basics followed by object oriented mindset as well as language construct to support that. Contents:

    • Imperative programming in C++ (data types, variablestions, expressions, statements, functions)
    • Test driven development (TDD)
    • Object oriented C++ (classes, special member functions, derived classes, polymorphism, dynamic type conversion).
    • Use of the C++ standard library (input and output, character and string handling, containers)
    • Program environment and tools (compiler, version handling, build tool)
    • Data structures and algorithms (complexity analysis and data structures for efficient algorithms regarding insertion, removal, seaching and sorting)
    Examiner
    Klas Arvidsson
    Scheduled hours
    54 h
    Main field of study
    Datateknik
    Syllabus on Studieinfo ↗