269016 VU Algorithms and Data Structures (2014S)
Continuous assessment of course work
Labels
Preliminary discussion/Lecture starts on: Thursday, March 6, 2014, at 13:15, Währinger Straße/SR 6Lecture takes place: each Thursday at 13:15-14:45, Währinger Straße/SR 6
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from We 19.02.2014 11:07 to Mo 31.03.2014 23:59
- Deregistration possible until Mo 31.03.2014 23:59
Details
max. 25 participants
Language: English
Lecturers
Classes
Currently no class schedule is known.
Information
Aims, contents and method of the course
The lecture gives an introduction to algorithms and data structures. Topics covered in the lecture are: Complexity and Worst Case Analysis, Lists, Queues, and Stacks, Heaps, Balanced Search Trees, Dynamic Programming, Hash Functions, Divide and Conquer, Sorting Algorithms, Graph Algorithms, LP and ILP, Approximation Algorithms and Greedy Algorithms.
Assessment and permitted materials
There will be two exams (on April 10, 2014 and June 26, 2014) each with a maximum of 50 points. Both exams cover all material covered in class, in the exercise sheets, and in the reading material. There will be five exercise sheets ("homework" - to be solved at home), with 10 points each. The best two of these exercise sheets (yielding a maximum of 20 points) will be taken into account for the final grade. The basis for calculating the final grade is 100 points (exercise points are bonus points). You can miss up to three lectures without reason. Note that, for each additional lecture you will miss, we will subtract 10 points from your points achieved so far.
Minimum requirements and assessment criteria
Students will learn basic concepts in algorithms and data structures.
Examination topics
Reading list
Literature will be announced in the first lecture.
Association in the course directory
CO-INF3
Last modified: Sa 08.07.2023 00:21