Algorithmics | COMP1201 | University of Southampton Skip to main content Open menu The University of Southampton About Visit Alumni Departments News Events Contact Courses Undergraduate Postgraduate taught Postgraduate research Foundation Years Pre-sessional English language courses Exchanges Customise your degree Tuition fees Funding your studies How to apply Clearing Free online learning Continuing professional development Student life Accommodation Our campuses Our cities Student community Sports and gyms Support and money Halls Filter Research Our impact Facilities Centres and institutes Funding Research & Innovation Services Partnerships Commercialising research Researcher support Research integrity Business Why work with us? Collaboration Consultancy Commercialisation Use our facilities Connect with our students How we operate Suppliers Make a business enquiry Global International students International Office Partnerships and initiatives Visiting delegations Visiting fellowships Search the site Search Modules Courses / Modules / COMP1201 Algorithmics Algorithmics When you'll study it Semester 2 CATS points 15 ECTS points 7.5 Level Level 4 Module lead Corina Cirstea Academic year 2021-22 On this page Module overview Aims and Objectives Syllabus Learning and Teaching Assessment Module overview This is a core module for computer science and software engineers. It teaches the basic data structures and algorithms which underpins modern software engineering. Without these algorithms most software would be hopelessly slow to the point of unusability. The course also teaches the principles behind the algorithms and data structures and the software engineering lessons which data structures and algorithms teach us. Linked modules Pre-requisite: COMP1202 Aims and Objectives Aims and Objectives Learning Outcomes Subject Specific Intellectual and Research Skills Having successfully completed this module you will be able to: Understand how to evaluate an algorithm for efficiency Choose an appropriate algorithmic strategy to solve a problem Choose the most appropriate data structure for a particular problem Understand the operation of a number of important computer algorithms using those structures Knowledge and Understanding Having successfully completed this module, you will be able to demonstrate knowledge and understanding of: Understanding of time complexity Knowledge of common data structures and algorithms Understanding of how to code data structures using object oriented methods Transferable and Generic Skills Having successfully completed this module you will be able to: Be able to solve problems algorithmically Module overview Syllabus Syllabus Introduction Data Objects, Data Structures, Complex Data Structures Algorithm Analysis Time Complexity Algorithm Design and Strategies Brute Force, Depth-First, Breadth-First, DFID, Best-first, Greedy Divide and Conquer, Dynamic Programming, Branch and Bound Simple Data Structures List, Stack, Queue, Tree, Tree traversal Sorting Selection Sort, Insertion Sort, MergeSort, QuickSort, Radix sort Searching Sequential Search, Binary Search, Binary Tree Search Advanced Tree Structures AVL Trees, Red-black Trees, B-trees Hash tables Hash table size, Collision resolution, Separate chaining Open addressing, Re-hashing Priority Queues (Heaps) Simple implementations, Binary heaps, Heap sort Graphs Adjacency Matrix and List, Connectivity, Breadth vs Depth first search Shortest path algorithms Minimum Spanning Tree, Prim's algorithm Aims and Objectives Learning and Teaching Learning and Teaching Study time Type Hours Tutorial 12 Revision 10 Follow-up work 18 Lecture 36 Preparation for scheduled sessions 40 Wider reading or practice 34 Total study time 150 Resources & Reading list Textbooks Robert Sedgewick and Kevin Wayne (2011). Algorithms. Addison-Wesley. Weiss MA (2006). Data Structures and Algorithm Analysis in Java. Addison-Wesley. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (2009). Introduction to Algorithms. MIT Press. Syllabus Assessment Assessment Formative This is how we’ll give you feedback as you are learning. It is not a formal test or exam. Set Task Assignment Summative This is how we’ll formally assess what you have learned in this module. Breakdown Method Percentage contribution Final Assessment 100% Referral This is how we’ll assess you if you don’t meet the criteria to pass this module. Breakdown Method Percentage contribution Set Task 100% Repeat An internal repeat is where you take all of your modules again, including any you passed. An external repeat is where you only re-take the modules you failed. Breakdown Method Percentage contribution Set Task 100% Repeat Information Repeat type: Internal & External Learning and Teaching Part of the Russell Group Information For visitors For staff & students For schools & colleges For researchers For employers & recruiters For parents & guardians For international students Contact us Tel: +44(0)23 8059 5000 Fax: +44(0)23 8059 3131 University of Southampton University Road Southampton SO17 1BJ United Kingdom Get directions Connect with us Follow us on Facebook Follow us on Twitter Follow us on Instagram Follow us on Linkedin Follow us on Youtube Download a copy of our prospectus or order a printed copy to be delivered to your door. Get a prospectus © 2022 University of Southampton Site map Accessibility Privacy Data protection & freedom of information Terms & conditions Contact Jobs Back to top Courses Undergraduate Postgraduate taught Postgraduate research Foundation Years Pre-sessional English language courses Exchanges Customise your degree Tuition fees Funding your studies How to apply Clearing Free online learning Continuing professional development Student life Accommodation Halls of residence Archers Road City Gateway Erasmus Park Glen Eyre Highfield Hall Mayflower Wessex Lane Apply for accommodation Guaranteed accommodation Fees and contracts Your accommodation options International and pre-sessional students Postgraduate accommodation Couples and students with children Renting privately Our accommodation areas Privacy notice Terms and conditions Our campuses Avenue Campus Boldrewood Innovation Campus Highfield Campus Southampton General Hospital Waterfront Campus Winchester Campus Our cities Southampton Winchester Student community Sports and gyms Support and money Living costs Your safety Academic and mental health support Part-time work Health services Halls Filter Research Our impact Facilities Centres and institutes Funding Research & Innovation Services Partnerships Commercialising research Researcher support Research integrity Business Why work with us? Collaboration Consultancy Commercialisation Use our facilities Connect with our students How we operate Suppliers Make a business enquiry Global International students International Office Partnerships and initiatives Visiting delegations Visiting fellowships Open days and visits Undergraduate open days Campus open days: what to expect Online subject talks: what to expect Undergraduate applicant subject visits Postgraduate open days and visits What to expect at our postgraduate events Visitor information Clearing Course vacancies How Clearing works Frequently asked questions International Clearing International partner agents Schools and colleges Access to Southampton HE talks & events Subject-specific talks Arrange a school or college visit Contact us Residentials & summer schools UAS school and college placements About Visit Alumni Departments News Events Contact
