• Perform basic analysis of algorithm correctness and complexity, using invariants and big-O notation.
• Use basic algorithms and data structures when programming (e.g., lists, queues, stacks, search trees, hashing, sorting algorithms, and basic graph algorithms).
• Recognize a proof that a problem is NP-hard.
• Formulate computational problems using propositional logic, constraints, and optimization goals.

• Identify and formulate precisely (if possible) the algorithmic problem hidden in a given programming task.
• Apply the following algorithmic techniques when solving a problem: Greedy, divide and conquer, dynamic programming, reduction to network flow.
• Theoretically analyze the performance of a given algorithmic solution, including the analysis of basic approximation algorithms and basic randomized algorithms.
• Look up suitable NP hardness results in a compendium, and perform simple reductions from such problems to establish NP hardness.
• At a basic level, evaluate theoretically the performance of an algorithm in a parallel or distributed setting, and in situations where there is a massive amount of data.
• Find results in the algorithms research literature relevant to a given problem.

Teaching consists of a mix of lectures and exercises.

The exam is written; a number of mandatory assignments must be approved to qualify for the exam.

---------------------------------------------------------
Information about study structure

This course is part of the SDT specializations Scalable Computing and Data Processing- see the descriptions here:
SDT specializations

------------------------------------

Se hvordan undervisningen er tilrettelagt her:
link til skemaoplysninger
Skemaoplysningerne vil være tilgængelige fra kort før semesterstart.

See the schedule here:
link to the time table
The schedule will be available shortly before the beginning of the term.

-------------------------------------
NB!! Course restriction!!

Please note that there is a course restriction between this course and the course Advanced Algorithms.
That means that you cannot take this course, if you have already taken Advanced Algorithms, and that you cannot take Advanced Algorithms if you take this course. 

During this course students will be required to hand in mandatory assignments (e.g. attendance, papers, exercises, presentations, productions), that need to be completed/approved before being eligible to register for the examination and e.g. being allowed to submit written work for examination. Failure to hand in these mandatory assignments on time will mean that the registration for examination is annulled.

These mandatory assignments are (Deadlines are posted separately, e.g. on the course blog):
* xx assignments (see above)

The duration of the written examination is 4 hour(s).


Submission/completion of mandatory activities before Friday 2. December 2011 at 15:00.