Algorithms - ANU Programs and Courses. Programs and Courses Search query Search ANU web, staff & maps Search current site content Search Programs and Courses Courses COMP3600 Course Algorithms An undergraduate course offered by the School of Computing. COMP3600 Academic Year 2023 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 Code COMP3600 Unit Value 6 units Academic Codes Offered by School of Computing ANU College ANU College of Engineering Computing & Cybernetics Course subject Computer Science Areas of interest Computer Science, Software Engineering Academic career UGRD Course convener Dr Ahad N. Zehmakan Mode of delivery In Person Co-taught Course COMP6466 Offered in Second Semester 2023 See Future Offerings Tweet Share on Facebook Wattle Share SELT Survey Results Overview Study Fees Class Code COMP3600 Unit Value 6 units Offered by School of Computing ANU College ANU College of Engineering Computing & Cybernetics Course subject Computer Science Areas of interest Computer Science, Software Engineering Academic career UGRD Course convener Dr Ahad N. Zehmakan Mode of delivery In Person Co-taught Course COMP6466 Offered in Second Semester 2023 See Future Offerings Tweet Share on Facebook Wattle Share SELT Survey Results Algorithms (COMP3600) Introduction Learning Outcomes Indicative Assessment Workload Inherent Requirements Requisite and Incompatibility Prescribed Texts Majors Fees Offerings and Dates http://cs.anu.edu.au/courses/COMP3600/comp3600info.pdf Algorithms are the foundation of Computer Science. They enable advances in Artificial Intelligence, Machine Learning, Cybersecurity, Distributed, Mobile, and Cloud Computing, Computer Graphics and Animation, and many more. These advances have made Computer Science an indispensable part of our everyday life. The main goal of this course is to familiarize students with basic concepts in the design and analysis of algorithms and data structures. It focuses on fundamental computing problems such as sorting and searching. The students will learn how to use different algorithm design methods and data structures to solve such problems efficiently, as well as basic performance measures and analysis techniques. Learning Outcomes Upon successful completion, students will have the knowledge and skills to: Display a solid understanding of classical algorithms for fundamental computing problems such as sorting and searching and their analysis. Demonstrate deep knowledge of various data structures, such as binary search trees and heaps, and their applications. Design efficient algorithms using techniques such as divide-and-concur, greedy approaches, and dynamic programming. Analyse the time and space complexity of algorithms. Indicative Assessment Assignments (30) [LO 1,2,4] Midterm Exam (30) [LO 1,4] Final Exam (40) [LO 2,3,4] The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website. Workload As a third-year course, students are expected to recap and conduct independent studies for as many hours as they need to gain understanding of the materials. To help this learning process, we provide 12 two-hour and 12 one-hour lectures, and 11 two-hour tutorial/laboratory sessions. Inherent Requirements Not applicable Requisite and Incompatibility To enrol in this course you must have completed COMP1110 or COMP1140; and 6 units of 2000-level COMP courses; and 6 units of 2000-level MATH courses or COMP1600. You are not able to enrol in this course if you have successfully completed COMP6466. Prescribed Texts The following textbook will be used for this course: T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press,3rd Ed., 2009. The following reference books are recommended for this course: Anany Levitin, Introduction to the Design and Analysis of Algorithms, 3rd ed. Robert Sedgewick, Algorithms in C (or JAVA), Addison-Wesley, 3rd Edition, 2002. Sara Baase and Allen Van Gelder, Computer Algorithms { Introduction to Design and Analysis, Addison-Wesley, 3rd Edition, 2000. John Kleinberg and Eva Tardos, Algorithms Design, Addison-Wesley, 2005. Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw HillHigher Education, 2008. Alfred V. Aho, John E. Hopcroft and Jerey D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974 Majors Digital Humanities Fees Tuition fees are for the academic year indicated at the top of the page. Commonwealth Support (CSP) Students If you have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). More information about your student contribution amount for each course at Fees. Student Contribution Band: 2 Unit value: 6 units If you are a domestic graduate coursework student with a Domestic Tuition Fee (DTF) place or international student you will be required to pay course tuition fees (see below). Course tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees. Where there is a unit range displayed for this course, not all unit options below may be available. Units EFTSL 6.00 0.12500 Course fees Domestic International Domestic fee paying students Year Fee 2023 $4860 International fee paying students Year Fee 2023 $6180 Note: Please note that fee information is for current year only. Offerings, Dates and Class Summary Links ANU utilises MyTimetable to enable students to view the timetable for their enrolled courses, browse, then self-allocate to small teaching activities / tutorials so they can better plan their time. Find out more on the Timetable webpage. The list of offerings for future years is indicative only. Class summaries, if available, can be accessed by clicking on the View link for the relevant class number. 2023 Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 7515 24 Jul 2023 31 Jul 2023 31 Aug 2023 27 Oct 2023 In Person View Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions Contact ANU Campus Map Copyright Disclaimer Privacy Freedom of Information +61 2 6125 5111 The Australian National University, Canberra CRICOS Provider : 00120C ABN : 52 234 063 906
