263-0006-00L  Algorithms Lab

SemesterAutumn Semester 2019
LecturersA. Steger
Periodicityyearly recurring course
Language of instructionEnglish
CommentOnly for master students, otherwise a special permission by the student administration of D-INFK is required.



Courses

NumberTitleHoursLecturers
263-0006-00 PAlgorithms Lab4 hrs
Mon17:15-19:00CAB H 56 »
17:15-19:00CAB H 57 »
17:15-19:00HG E 26.1 »
Tue15:15-17:00ML H 34.3 »
Wed17:15-19:00HG F 7 »
Thu15:15-17:00ML H 34.3 »
Fri15:15-17:00ML H 34.3 »
18.09.17:15-19:00ETF C 1 »
20.09.15:15-17:00CAB G 61 »
11.10.15:15-17:00CAB G 61 »
23.10.17:15-19:00HG E 7 »
A. Steger
263-0006-00 AAlgorithms Lab
Project Work, no fixed presence required.
3 hrsA. Steger

Catalogue data

AbstractStudents learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials.
ObjectiveThe objective of this course is to learn how to solve algorithmic problems given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them (using C/C++, STL, CGAL, and BGL).
LiteratureT. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990.
J. Hromkovic, Teubner: Theoretische Informatik, Springer, 2004 (English: Theoretical Computer Science, Springer 2003).
J. Kleinberg, É. Tardos: Algorithm Design, Addison Wesley, 2006.
H. R. Lewis, C. H. Papadimitriou: Elements of the Theory of Computation, Prentice Hall, 1998.
T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum, 2012.
R. Sedgewick: Algorithms in C++: Graph Algorithms, Addison-Wesley, 2001.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits8 credits
ExaminersA. Steger
Typesession examination
Language of examinationEnglish
RepetitionThe performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examinationwritten 360 minutes and 360 minutes
Additional information on mode of examinationEvery student who completes all three assessments (read: shows up at the specified time and completes the process by giving feedback to the assistant in the electronic system) receives a bonus in form of a quarter-grade (+0.25) on their grade from the final exam.
Written aidsNo documentation is allowed during the exam except what is provided by the system itself.
Online examinationThe examination may take place on the computer.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

No public learning materials available.
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

Places300 at the most
PriorityRegistration for the course unit is until 26.09.2019 only possible for the primary target group
Primary target groupCyber Security MSc (260000)
Cyber Security MSc (EPFL) (260100)
Data Science MSc (261000)
Computer Science MSc (263000)
Waiting listuntil 30.09.2019

Offered in

ProgrammeSectionType
Cyber Security MasterInterfocus CoursesWInformation
Data Science MasterCore ElectivesWInformation
Computer Science MasterInterfocus CoursesOInformation