CS2124 programs

Design & Analysis of Algorithms

A course where students learn to develop efficient algorithms for solving computational problems and analyze their performance. Through theoretical study and practical exercises, students gain insights into algorithm design paradigms, complexity analysis, and strategies for solving various types of problems, preparing them to tackle real-world challenges in computer science and related fields.

–
Average rating
Rate a teacher to start
6
ECTS
180
hours in a term
4
class hours a week
From the Spring 2026 syllabus

What you will learn

  • •Demonstrate the knowledge of Characterization of Running Times
  • •Demonstrate the knowledge of the Divide-and-Conquer Paradigm
  • •Demonstrate the knowledge of the Probabilistic Analysis and Randomized Algorithms
  • •Demonstrate the knowledge of the Sorting and Order Statistics Algorithms
  • •Demonstrate the knowledge of Dynamic Programming and its Applications

How it is graded

50%
Midterm Exam
Week 8
50%
Final Exam
Week 16

Workload

180 hours in a term, about 12 a week
In-Class Time 56 hIndependent Study 90 hExaminations 4 hIndividual Development 30 h

Week by week

Books

Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Fourth edition
required
Algorithm Design
Jon M. Kleinberg and Eva Tardos
recommended

Where it fits

Requirements come from syllabi. Check with your advisor.

Who teaches it

Not in the timetable this term.

Files

syllabus
CS212 Syllabus Spring 2026
Design & Analysis of Algorithms · Spring 2026
Open

What Anonymous says

Anonymous posts, unverified. Press F never edits them and every card links to the original.