G50ALG Introduction to Algorithms - Autumn 2011

Contents

• Overview
• Lectures
• Exercises
• Examination

---

Overview

• Module Convener: Brian Logan
• Lecturer: Neil Sculthorpe
• Syllabus: G50ALG
• Method of assessment: Unseen 2-hour written examination (100%)
• Method and frequency of class:
  • Two lectures per week:
    • Thursdays, 13:00–14:00, B73, Dearing Building, Jubilee Campus
    • Fridays, 12:00–13:00, A08, Business School South, Jubilee Campus
  • One tutorial per week:
    • Fridays, 13:00–14:00, A08, Business School South, Jubilee Campus

---

Lectures

The lecture overview below is tentative. On some topics we may progress slower or faster than scheduled. If so, any references to lecture numbers will always refer to the content listed below, regardless of the date the lecture took place. Also, some topics may change slightly, especially towards the end.

Copies of lecture slides, program code, or any other electronic material used during the lectures, can be found here.

Lecture	Date	Content
1	6th October	Administrative Details and Introduction
2	7th/13th October	Pseudo-code
3	14th October	Recursion
4	20th October	Euclid's Algorithm
5	21st October	Invariants
6	21st October	The Towers of Hanoi
7	27th October	Recap: Recursion and Invariants
8	28th October / 3rd November / 4th November	Lists
9	10th/11th November	Sorting
10	24th/25th November	Divide and Conquer
11	1st/2nd/8th December	Time Complexity
12	9th December	Heuristic Algorithms

---

Exercises

• Set 1: Exercises Solutions Haskell Code Java Code
• Set 1B (optional): Exercises Solutions Haskell Code
• Set 2: Exercises Solutions Haskell Code Java Code
• Set 3: Exercises Solutions
• Set 4: Exercises Solutions Haskell Code
• Set 5: Exercises Solutions
• Set 6: Exercises Solutions
• Set 7: Exercises Solutions

---

Examination

Some basic information about the exam:

• The exam counts for 100% of the module mark.
• Four out of five questions have to be answered, each worth 25% of the overall mark.

---

Last updated 19th January 2012.