• 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).

• Identify and formulate precisely (if possible) the algorithmic problem underlying in a given programming task.
• Apply the following algorithmic techniques when solving a problem: Greedy, divide and conquer, dynamic programming, reduction to network flow.
• Look up suitable NP hardness results in a compendium, and perform simple reductions from such problems to establish NP hardness.

Teaching consists of a mix of lectures and exercises.

Condensed course: The lectures will run in the first half of the semester week 35-41, at double pace.

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

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

For students on the SDT August 2012 curriculum:
This course is a mandatory backbone course for SDT-SE track.

This course is part of the SDT-DT track specializations Scalable Computing and Data Processing-

For students on SDT curricum before August 2012:

This course is part of the SDT-DT and SDT-SE track 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 Algorithm Design 15 ECTS and Advanced Algorithms.
That means that you cannot take this course, if you have already taken Algorithm Design 15 ECTS or Advanced Algorithms and that you cannot take Algorithm Design 15 ECTS or Advanced Algorithms if you take this course. 

During this course students are required to hand in five mandatory assignments in the form of programming exercises that need to be completed and approved before being eligible to register for the examination. Failure to hand in these mandatory assignments on time will mean that the registration for examination is annulled. These mandatory assignments and their deadlines are announced on the course blog.

The duration of the written examination is 4 hours.

Submission/completion of mandatory activities before Friday 30 November 2012 at 15:00.