Algorithmics

University of Glasgow

Course Description

Algorithmics

• Host University

University of Glasgow

• Location

Glasgow, Scotland

• Area of Study

Computer Science

• Language Level

Taught In English

• Course Level Recommendations

Upper

ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators.We advice each institution to have their own credentials evaluator make the final decision regrading course levels.

Hours & Credits

• SCQF Credits

10
• Recommended U.S. Semester Credits
2.5 - 3
• Recommended U.S. Quarter Units
3 - 5
• Overview

Short Description
To develop the student's skills in the design and analysis of algorithms;
To study algorithms for a range of important standard problems;
To introduce the student to the theory of NP-completeness together with its practical implications;
To make the student aware of fundamental concepts of computability.
Timetable
Two one-hour lectures and one one-hour tutorial per week.

Course Aims
- To develop the student's skills in the design and analysis of algorithms;
- To study algorithms for a range of important standard problems;
- To introduce the student to the theory of NP-completeness together with its practical implications;
- To make the student aware of fundamental concepts of computability.

Intended Learning Outcomes of Course
By the end of the course the student will be able to:
1. Recognise, and be able to use, standard algorithmic design methods;
2. Apply the basic principles of algorithm analysis;
3. Demonstrate an understanding of the concepts of balanced trees and digital trees, and the algorithms for manipulating these structures;
4. Code standard efficient sorting algorithms;
5. Code fundamental graph algorithms - for search and traversal, shortest paths, minimum spanning trees, and topological sorting;
6. Describe classical algorithms for string searching, string comparison, and text compression;
7. Expound on the basic principles, and the practical implications of, the theory of NP-completeness;
8. Follow NP-completeness proofs for particular problems;
9. Deploy various strategies for dealing with computational problems that are apparently intractable;
10. Provide examples of the computability and unsolvability, and know some standard examples of unsolvable problems.

Course Disclaimer

Courses and course hours of instruction are subject to change.

Credits earned vary according to the policies of the students' home institutions. According to ISA policy and possible visa requirements, students must maintain full-time enrollment status, as determined by their home institutions, for the duration of the program.

ECTS (European Credit Transfer and Accumulation System) credits are converted to semester credits/quarter units differently among U.S. universities. Students should confirm the conversion scale used at their home university when determining credit transfer.

Please note that some courses with locals have recommended prerequisite courses. It is the student's responsibility to consult any recommended prerequisites prior to enrolling in their course.

This site uses cookies to store information on your computer. Some are essential to make our site work; others help us improve the user experience. By using the site, you consent to the placement of these cookies.