Algorithms and Data Structures

COMP26120 Algorithms and Data Structures 20 Full year Undergraduate Level 2 Francisco Lobo Unit coordinator Department of Computer Science 1 FHEQ level (Framework for Higher Education Qualifications) ' Middle part of Bachelors ' European Credit Transfer & Accumulation System Rating : 10.0 This course unit covers fundamental material in Computer Science concerning algorithms and their correctness and performance. It is a two-semester practical course, with core content delivered via video and reading resources. These are supplemented with face-to-face synchronous sessions to consolidate the material, considerable practical experience delivered via both formative and summative coursework, and tutorial/drop-in lab support. The student is expected to seek out material to support work on the course, thus contributing to developing "algorithmic literacy".  SyllabusAlgorithms - what they are and how to express them (in pseudocode and selected programming languages).Practical experience in devising, assessing and using algorithms:•    considerable practice in algorithmic problem solving for realistic problems•    examples from a wide range of application areas•    finding appropriate algorithms and data-structures•    inventing appropriate algorithms and data-structuresPractical experience in 'algorithmic literacy' - knowing how to use the extensive literature on the subject, recognising what algorithms to use in applications and assessing their utility.A range of basic data structures: arrays, lists, trees (including ordered and balanced trees and heaps), and various kinds of graphs. Representations of basic data structures in programming languages.A range of basic algorithms: searching and sorting algorithms, tree traversal and manipulation algorithms, some basic graph algorithms. Other algorithmic areas will be explored through practical examples.An introduction to algorithmic performance: space and time requirements, worst-case, average-case and best case estimates. Practical experience and techniques for measuring and predicting performance: Counting operations.Scaling and some common rates of growth.Reasoning about algorithms - experience in informally reasoning about algorithms to establish correctness.  This course unit covers fundamental material in Computer Science concerning algorithms and their correctness and performance. It is a two-semester practical course, with core content delivered via video and reading resources. These are supplemented with face-to-face synchronous sessions to consolidate the material, considerable practical experience delivered via both formative and summative coursework, and tutorial/drop-in lab support. The student is expected to seek out material to support work on the course, thus contributing to developing "algorithmic literacy".  SyllabusAlgorithms - what they are and how to express them (in pseudocode and selected programming languages).Practical experience in devising, assessing and using algorithms:•    considerable practice in algorithmic problem solving for realistic problems•    examples from a wide range of application areas•    finding appropriate algorithms and data-structures•    inventing appropriate algorithms and data-structuresPractical experience in 'algorithmic literacy' - knowing how to use the extensive literature on the subject, recognising what algorithms to use in applications and assessing their utility.A range of basic data structures: arrays, lists, trees (including ordered and balanced trees and heaps), and various kinds of graphs. Representations of basic data structures in programming languages.A range of basic algorithms: searching and sorting algorithms, tree traversal and manipulation algorithms, some basic graph algorithms. Other algorithmic areas will be explored through practical examples.An introduction to algorithmic performance: space and time requirements, worst-case, average-case and best case estimates. Practical experience and techniques for measuring and predicting performance: Counting operations.Scaling and some common rates of growth.Reasoning about algorithms - experience in informally reasoning about algorithms to establish correctness.  The aims of COMP26120 are:<ol><li>To make students aware of the importance of algorithmic concerns in real-life Computer Science situations.</li><li>To emphasise practical concerns, rather than mathematical analysis.</li><li>To become confident with a range of data structures and algorithms and able to apply them in realistic tasks. </li><li>To make best use of available learning time by encouraging active learning and by transmitting information in the most effective ways. </li></ol> ILO 1: Explain, using examples of real-world applications, standard algorithmic problems coming from sorting and searching on different data structures, operations on graphs, and number theoryILO 2: Analyse problems to identify and implement the most appropriate algorithmic solutionILO 3: Explain the algorithmic techniques such as divide-and-conquer, dynamic programming, greedy algorithms, and linear programming, discuss when they are appropriate, and apply them to solve problemsILO 4: Identify from a set of taught algorithms, which algorithm should apply in a given situation, explain how it should be applied, and compare the solution to possible alternativesILO 5: Define standard notions of asymptotic complexity and use these to reason about the complexity of algorithmsILO 6: Use pseudocode to represent algorithms and informally reason about their correctnessILO 7: Recall the definitions and representations of basic data structures and the complexity of the operations on themILO 8: Recall and explain the notions of tractability and NP-completeness, with a particular focus on classical NP-complete problems, and apply these to demonstrate NP-completeness of new problems Analytical skills Innovation/creativity Problem solving Written communication This course unit covers fundamental material in Computer Science concerning algorithms and their correctness and performance. It is a two-semester practical course, with core content delivered via video and reading resources. These are supplemented with face-to-face synchronous sessions to consolidate the material, considerable practical experience delivered via both formative and summative coursework, and tutorial/drop-in lab support. The student is expected to seek out material to support work on the course, thus contributing to developing "algorithmic literacy".  SyllabusAlgorithms - what they are and how to express them (in pseudocode and selected programming languages).Practical experience in devising, assessing and using algorithms:•    considerable practice in algorithmic problem solving for realistic problems•    examples from a wide range of application areas•    finding appropriate algorithms and data-structures•    inventing appropriate algorithms and data-structuresPractical experience in 'algorithmic literacy' - knowing how to use the extensive literature on the subject, recognising what algorithms to use in applications and assessing their utility.A range of basic data structures: arrays, lists, trees (including ordered and balanced trees and heaps), and various kinds of graphs. Representations of basic data structures in programming languages.A range of basic algorithms: searching and sorting algorithms, tree traversal and manipulation algorithms, some basic graph algorithms. Other algorithmic areas will be explored through practical examples.An introduction to algorithmic performance: space and time requirements, worst-case, average-case and best case estimates. Practical experience and techniques for measuring and predicting performance: Counting operations.Scaling and some common rates of growth.Reasoning about algorithms - experience in informally reasoning about algorithms to establish correctness.  Asynchronous material (directed videos and reading):44 hours in total, 2 hours of study per week Synchronous Q&A Sessions22 in total, 1 per weekLaboratories44 hours in total, 44 1-hour sessions, 2 per week<div>Examinable content is introduced in both asynchronous material and lab exercises</div><div> </div><div>Formative Blackboard quizzes each week provide early feedback on examinable concepts</div> 1 Written exam 70% 8 Practical skills assessment 30% Feedback is via a variety of methods. Immediate feedback is provided in laboratory sessions. There are Blackboard quizzes associated with all material to track understanding. Summative feedback on assessed coursework is provided on individual scripts within Blackboard. COMP16321 Introduction to Programming 1 Pre-Requisite Compulsory COMP16412 Introduction to Programming 2 Pre-Requisite Compulsory COMP16321 and COMP16412 are pre-requisites.COMP16321 and COMP16412 are pre-requisites. Alternative equivalent knowledge of C, Java or Python accepted. N <ol><li>Goodrich, Michael T., author. (2015). Algorithm design and applications. John Wiley Inc. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,9781118335918&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 9781118335918</a>  </li><li>Cormen, Thomas H. (2022). Introduction to algorithms: fourth edition. The MIT Press. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,9780262367509&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 9780262367509</a>  </li><li>Sipser, Michael. (2012). Introduction to the theory of computation (electronic resource). Cengage Learning. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,9781133187813&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 9781133187813</a>  </li><li>Harel, David, 1950-. (2004). Algorithmics: the spirit of computing. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0321117840&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0321117840</a>  </li><li>Knuth, Donald E. (Donald Ervin), 1938-. (1998). The art of computer programming. Vol.3, Sorting and searching. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201896850&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201896850</a>  </li><li>Knuth, Donald E. (Donald Ervin), 1938-. (1998). The art of computer programming. Vol.2, Seminumerical algorithms. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201896842&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201896842</a>  </li><li>Knuth, Donald E. (Donald Ervin), 1938-. (1997). The art of computer programming. Vol.1, Fundamental algorithms. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201896834&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201896834</a>  </li><li>Sedgewick, Robert, 1946-. (1998). Algorithms in C. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201314525&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201314525</a>  </li><li>Sedgewick, Robert, 1946-. (1998). Algorithms in C. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201314525&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201314525</a>  </li><li>Sedgewick, Robert, 1946-. (2003). Algorithms in Java. Addison-Wesley. ISBN:<a href="https://www.librarysearch.manchester.ac.uk/discovery/search?query=isbn,contains,0201361205&search_scope=MyInst_and_CI&sortby=rank&vid=44MAN_INST:MU_NUI&lang=en&mode=advanced&offset=0" target="_blank"> 0201361205</a>  </li><li>Sedgewick, Robert, 1946-. (2004). Algorithms in Java. Addison-Wesley. ISBN:</li></ol> Assessment written exam 4 Lectures 22 Practical classes & workshops 44 0 130