School of Computing · ANU College of Systems and Society
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.
Assignments
Learning outcomes 1, 2, 4
Midterm assessments
Learning outcomes 1, 4
Final Exam
Learning outcomes 1, 2, 3, 4
Students are expected to recap and conduct independent studies for as many hours as they need to gain an understanding of the materials. To help this learning process, we provide lectures and tutorial/laboratory sessions. The total workload is expected to be 130 hours. (130 hours)
Recommended resources will be mentioned on our webpage and/or Wattle.T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein. Introduction to Algorithms. MIT Press, 3rd Ed., 2009.