CS418-15 Advanced Topics in Algorithms and Complexity

Academic year
22/23
Department
Computer Science
Level
Undergraduate Level 4
Module leader
Igor Carboni Oliveira
Credit value
15
Module duration
10 weeks
Assessment
Multiple
Study location
University of Warwick main campus, Coventry
Introductory description

The module aims to introduce students to modern techniques, methods, and results from the rapidly developing field of algorithms and complexity. The main topic may change year to year.

Module aims

Students will learn the algorithmic, mathematical, and probabilistic foundations underpinning modern design and analysis algorithms.

Outline syllabus

This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.

Typical topics include a mixture of:

Learning outcomes

By the end of the module, students should be able to:

Indicative reading list

"An Introduction to Computational Learning Theory". Umesh Vazirani and Michael Kearns.
"Mathematics + Computation". Avi Wigderson.
"Analysis of Boolean Functions". Ryan O'Donnell.
"Computational Complexity". Sanjeev Arora and Boaz Barak.
"Probability and Computing". Michael Mitzenmacher and Eli Upfal.

Subject specific skills
Transferable skills

Study time

Type Required
Lectures 20 sessions of 1 hour (13%)
Seminars 9 sessions of 1 hour (6%)
Private study 121 hours (81%)
Total 150 hours
Private study description

Private study will consist of:

Costs

No further costs have been identified for this module.

You do not need to pass all assessment components to pass the module.

Students can register for this module without taking any assessment.

Assessment group D2
Weighting Study time
Problem Set 1 10%

Homework assignment 1

Problem Set 2 10%

Homework assignment 2

Problem Set 3 10%

Homework assignment 3

In-person Examination 70%

CS418 examination


  • Answerbook Gold (24 page)
Assessment group R1
Weighting Study time
In-person Examination - Resit 100%

CS418 resit examination.


  • Answerbook Gold (24 page)
Feedback on assessment

Individual written feedback and group feedback in seminars

Past exam papers for CS418

Pre-requisites

This module is only suitable for students familiar with the material from CS260 (Algorithms) and CS301 (Complexity of Algorithms).

Courses

This module is Optional for:

  • Year 5 of UCSA-G504 MEng Computer Science (with intercalated year)
  • UCSA-G503 Undergraduate Computer Science MEng
    • Year 4 of G503 Computer Science MEng
    • Year 4 of G503 Computer Science MEng

This module is Option list A for:

  • Year 4 of UCSA-G4G3 Undergraduate Discrete Mathematics