Basics of programming:

• Variables, Data types and Operators 
• Control structures and loops 
• Strings

Algorithmic basic concepts:

• Notation and analysis of algorithms
• Notation of Data Structures
• Complexity Analysis

Search and Sort:

• Selected algorithms
• Analysis of search and sorting methods

Recursion:

• Selected recursive algorithms
• Recursive/ dynamic data types

Tree Structures:

• Terms and concepts
• Binary Trees
• Selected algorithms (Traversal, Search, insertion, and Deletion)

Hash Procedures:

• Basics and Procedures
• Collisions
• Analysis of Hash Procedures

Basic Theoretical Understanding:

• Knowledge of the most important basic concepts of algorithms.
• The implementation of these concepts in a concrete programming language.
• Selected algorithms for solving fundamental problems in computer science (e.g. search and sorting methods) and their implementation in a programming language. 

Analyzing and understanding algorithms::

• The ability to evaluate and critically compare algorithms in terms of their efficiency;
• Collect, understand, and analyze programs created by third parties. 

Design of programs:

• The ability to independently formulate basic algorithms for solving a specific problem, with the help of
  • Natural language,
  • Pseudocode,
  • or a programming language.

• Attendance at the course is compulsory and will be monitored (attendance list). The minimum attendance for an assessment is 70% of the units. Any absence must be reported in a timely manner and a reason for absence must be provided.
• Attendance at the first and main examination dates is mandatory for students and is exempt from the above-mentioned exception to compulsory attendance.
• An unjustified and excused absence in the first unit may result in loss of place.
• The possibility of taking a substitute exam at a later date only exists if the main exam was missed for a reason and with an excuse.
• It is recommended that everyone participate in the course as fully as possible in order to achieve the learning objectives.

NOTE: The programming language used in this course is Java and the instruction is in English

The "Algorithmic Thinking and Programming" (ADP) course is divided into five content blocks::

• Introduction: Basics of Programming
• Search algorithms
• Sorting algorithms and data structures
• Recursion
• Hash tables and hash functions

Tutorials

Each course session is accompanied by an in-person teaching tutorial on the WU campus. Attendance is not mandatory but is strongly recommended. The teaching tutorial is aimed at those new to programming, as well as those wishing to apply and deepen their understanding of the course topics through practical work.

The scheduled times are as follows (Wednesdays, 10:30–12:00):

Tutorial dates:

• 14.10.2026
• 21.10.2026
• 11.11.2026
• 18.11.2026
• 25.11.2026
• 02.11.2026
• 09.12.2026
• 16.12.2026
• 13.01.2027
• 20.01.2027

The quizzes are considered partial performances in addition to the final exam:

In class quiz questions will be based on the content covered in the class, the reading material, and the self study exercises. 

Compulsory Subject:

• 3 out of 4 in class quizzes: 30 points (10 + 10 + 10)
• Final exam: 70 points

Compulsory Subject Grading Scheme:

• Very Good (1): 90 - 100
• Gut (2): 76 - 89
• Satisfactory (3): 63 - 75
• Sufficient (4): 50 - 62
• Insufficient (5): 0 - 49

Elective Subject:

• 3 out of 4 in class quizzes: 30 points (10 + 10 + 10)
• 1 project: 20 points
• Final exam: 70 points

Elective Subject Grading Scheme:

• Very Good (1): 108 - 120
• Gut (2): 92 - 107
• Satisfactory (3): 76 - 91
• Sufficient (4): 60 - 75
• Unsatisfactory (5): 0 - 59

The quizzes count as partial assessments alongside the final exam. The quiz questions cover all content presented in the course up to and including the quiz (even within the same unit) (e.g., slide sets, textbook, Java programs, Jupyter Notebooks, Java handouts), as well as all self-study materials distributed up to the unit preceding the one containing the quiz (all types of Jupyter Notebooks with and without solutions, with and without autocorrect) .

The final examination (compulsory or elective course) can be retaken once (see WU examination regulations) if the overall assessment is failing and at least 10% of the maximum possible points for the final examination have been awarded. To take advantage of this retake opportunity, students must actively register for the course review session by emailing  adp@ai.wu.ac.at well in advance of the respective session . The maximum overall grade achievable through a retake is "Satisfactory" (3).

Students who achieve a passing grade in all components (quizzes, final exam, elective: programming project) may be awarded bonus points, up to 10% of the total possible points across all components, for demonstrably independently developed self-study units and/or practice examples within the framework of the teaching tutorials. However, there is no entitlement to these bonus points.

Registration procedure:

• Initially, 25 students can register for the course within the registration period; the rest will be placed on a waiting list in the order in which they register.
• After the official registration period has ended, the Study and Examination Office will move 20 additional students from the waiting list based on their individual study progress and include them in the course.
• If you remain on the waiting list, this does not mean that someone else will not drop out before the first appointment, either from those registered or from the waiting list.
• Accordingly, it is important
  • that you deregister in time - if possible within the registration/deregistration period - if you do not attend the course;
  • to be there at the first appointment , because those who are not present will be deregistered and new participants will be registered from the waiting list.

Please log in with your WU account to use all functionalities of read!t. For off-campus access to our licensed electronic resources, remember to activate your VPN connection connection. In case you encounter any technical problems or have questions regarding read!t, please feel free to contact the library at readinglists@wu.ac.at.

During the lecture and based on individual appointments. To request an appointment send an email to the lecturers with the subject prefix “[1649 ADP]”.

The Tutorial dates are:

Dates will be announced