Algoritmur og datastrukturar
|Thursday 8th March Monday 12th March||Basics (what is an algorithm and its representation by pseudo code) and Mathematical Induction|
|Thursday 15th March Monday 19th March||Efficiency of algorithms (searching, Big-O notation)|
|Thursday 22nd March Monday 26th March||Polynomial and Exponential algorithms (pattern matching, sorting algorithms, exhaustive search algorithms - Traveling Salesman Problem, Knapsack Problem)|
|Monday 29th March Thursday 12th April||Divide and Conquer technique (mergesort, tower of hanoi, fibonacci number, time complexity analysis via recurrence relations)|
|Monday 16th April Thursday 19th April||Review of graph structures and some basic graph algorithms (undirected and directed graphs and their representations, trees; depth first search, breadth first search)|
|Monday 23rd April Thursday 26th April||Greedy methods (Single-source shortest path problem, Minimum Spanning Tree)|
|Monday 30th April Thursday 3rd May||Dynamic programming technique (Fibonacci number, assembly line scheduling)|
Algorithms and Data Structures
• To introduce the notation, terminology, and techniques underpinning the study of algorithms.
• describe standard algorithms such as sorting algorithms, search algorithms, string matching algorithms, graph traversal algorithms;
Kravda verkætlanarfrágreiðingin og munnlig framløga av frágreiðingini. Galdandi próvtalsstigi verður nýttur.
INTRODUCTION TO THE DESIGN AND ANALYSES OF ALGORITHMS, Anany V. Levitin, Villanova University, 2011 (Third Edition), Addison-Wesley.
Prof. Dr. Qin Xin, QinX@setur.fo
Course Web Page
Link to the course web page:
8th March, 2012
3rd May, 2012
Every Monday and Thursday from 9:15am to 3pm
• Two assessments will be given on 12th April and 19th April respectively and submissions for both of them have to be done before 27th April, 2012.
• 4-hour written examination on Monday 14th May, 2012.