Algorithm Design for Mathematicians

Algorithms and data structures are fundamental notions in computer science. Understanding how they can be exploited in combination for better programming implementations in terms of time and space complexity is vital for writing efficient code. This course enables the student to:

• Understand, explain, and implement standard data structures.

• Understand, explain, and implement standard algorithms.

• Apply standard data structures and algorithms to solve programming tasks.

• Analyse and compare implementations with respect to their time and space complexity.

For any Computer Science students reading this, this course is not equivalent to CSE1305 nor equivalent to CSE2310. Although there is an overlap in topics (and course name), the focus of this course differs sufficiently and takes elements from both courses and is thus not a substitute for either. If you have passed both CSE1305 and CSE2310, then you can request an excemption for this course.

The course has two exams, an implementation exam (I) and an analysis exam (A).

Final implementation exam Week 10 (50%)
This exam features several implementation questions that are done on a computer. The exam is about all learning objectives, with a larger emphasis on the material not covered by the midterm exam. The exam is
to take 3 hours. The score for this exam is denoted as I.

Final analysis exam Week 10 (50%)
This exam will feature open questions answered on papers The exam is about all learning objectives, with a larger emphasis on the material not covered by the midterm exam. The exam
is to take 3 hours. The score for this exam is denoted as A.

The final grade for the course is computed as follows:
G = 0.5A + 0.5I
If MIN(A,I) < 5, the final grade is insufficient.
Else the final grade is G.

There are two resits of 3 hours in the exam week. They replace A and I with Ra and Ri respectively, if they increase the final grade.