10 Credits SPRING



Aims/Description: Algorithms and algorithmic problem solving are at the heart of computer science. This module introduces students to the design and analysis of efficient algorithms and data structures. Students learn how to quantify the efficiency of an algorithm and what algorithmic solutions are efficient. Techniques for designing efficient algorithms are taught, including efficient data structures for storing and retrieving data. This is done using illustrative and fundamental problems: searching, sorting, graph algorithms, and combinatorial problems such as finding the shortest paths in networks. 

Restrictions on availability: Essential skills: A-Level Maths

Staff Contact: OLIVETO PIETRO
Teaching Methods: Lectures, Problem solving, Independent Study
Assessment: Formal Exam, Classroom testing

Information on the department responsible for this unit (Computer Science):

Departmental Home Page
Teaching timetable

|

NOTE
The content of our courses is reviewed annually to make sure it's up-to-date and relevant. Individual modules are occasionally updated or withdrawn. This is in response to discoveries through our world-leading research; funding changes; professional accreditation requirements; student or employer feedback; outcomes of reviews; and variations in staff or student numbers. In the event of any change we'll consult and inform students in good time and take reasonable steps to minimise disruption.

URLs used in these pages are subject to year-on-year change. For this reason we recommend that you do not bookmark these pages or set them as favourites.

Teaching methods and assessment displayed on this page are indicative for 2021-22. Students will be informed by the academic department of any changes made necessary by the ongoing pandemic.

Western Bank, Sheffield, S10 2TN, UK