# DEGREE REGULATIONS & PROGRAMMES OF STUDY 2017/2018

 University Homepage DRPS Homepage DRPS Search DRPS Contact
DRPS : Course Catalogue : School of Informatics : Informatics

# Postgraduate Course: Randomness and Computation (INFR11089)

 School School of Informatics College College of Science and Engineering Credit level (Normal year taken) SCQF Level 11 (Year 4 Undergraduate) Availability Available to all students SCQF Credits 10 ECTS Credits 5 Summary This course is about probabilistic methods and their application to computer science. The course introduces basic models and techniques and applies these techniques to the design of various randomized algorithms, data structures, and distributed protocols. Special emphasis will be given on applications of these ideas to other areas of computer science (e.g. networking, machine learning, etc). Course description - Introduction: Las Vegas and Monte Carlo algorithms (Elementary Examples: checking identities, fingerprinting) - Moments, Deviations and Tail Inequalities (Balls and Bins, Coupon Collecting, stable marriage, routing) - Randomization in Sequential Computation (Data Structures, Graph Algorithms) * Randomization in Parallel and Distributed Computation (algebraic techniques, matching, sorting, independent sets) * Randomization in Online Computation (online model, adversary models, paging, k-server) - The Probabilistic Method (threshold phenomena in random graphs, Lovasz Local Lemma) - Random Walks and Markov Chains (hitting and cover times, Markov chain Monte Carlo)
 Pre-requisites It is RECOMMENDED that students have passed Algorithms and Data Structures (INFR10052) Co-requisites Prohibited Combinations Other requirements This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser. A mathematical course with no programming. Basic knowledge of (1) discrete probability and (2) algorithms is required. In particular, the students should have a good understanding of the following concepts: (1) probability spaces and events, conditional probability and independence, random variables, expectations and moments, conditional expectation. (2) asymptotic notation, basic sorting algorithms (Quick-sort, Merge-sort), basic graph algorithms (BFS, DFS, Dijkstra).
 Pre-requisites None High Demand Course? Yes
 Academic year 2017/18, Available to all students (SV1) Quota:  None Course Start Semester 2 Timetable Timetable Learning and Teaching activities (Further Info) Total Hours: 100 ( Lecture Hours 20, Seminar/Tutorial Hours 5, Summative Assessment Hours 2, Programme Level Learning and Teaching Hours 2, Directed Learning and Independent Learning Hours 71 ) Assessment (Further Info) Written Exam 80 %, Coursework 20 %, Practical Exam 0 % Additional Information (Assessment) Exam = 80% of final course mark. Coursework = 20% of final course mark. You should expect to spend approximately 30 hours on the coursework for this course. If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year. Feedback Not entered Exam Information Exam Diet Paper Name Hours & Minutes Main Exam Diet S2 (April/May) 2:00
 On completion of this course, the student will be able to: Apply fundamental tools in discrete probability (e.g. concentration inequalities, probabilistic method, random walks).Know randomized algorithms and data structures for selected combinatorial and graph problems.Be able to analyze error probabilities and expected running time of randomized algorithms. Understand the fundamentals of Markov chains and their algorithmic applications. Apply Monte Carlo methods such as MCMC.
 Probability and Computing: Randomized Algorithms and Probabilistic Analysis, by Michael Mitzenmacher and Eli Upfal. (Required) Randomized Algorithms, by Rajeev Motwani and Prabhakar Raghavan. (Useful)
 Course URL http://course.inf.ed.ac.uk/rc Graduate Attributes and Skills Not entered Keywords Not entered
 Course organiser Dr Mary Cryan Tel: (0131 6)50 5153 Email: mcryan@inf.ed.ac.uk Course secretary Mr Gregor Hall Tel: (0131 6)50 5194 Email: gregor.hall@ed.ac.uk
 Navigation Help & Information Home Introduction Glossary Search DPTs and Courses Regulations Regulations Degree Programmes Introduction Browse DPTs Courses Introduction Humanities and Social Science Science and Engineering Medicine and Veterinary Medicine Other Information Combined Course Timetable Prospectuses Important Information