Algorithms & Data Structures

University of Queensland

Course Description

  • Course Name

    Algorithms & Data Structures

  • Host University

    University of Queensland

  • Location

    Brisbane, Australia

  • Area of Study

    Computer Science

  • Language Level

    Taught In English

  • Prerequisites

    CSSE2002 + (MATH1061 or (CSSE2010 + STAT2202))

  • Course Level Recommendations

    Upper

    ISA offers course level recommendations in an effort to facilitate the determination of course levels by credential evaluators.We advice each institution to have their own credentials evaluator make the final decision regrading course levels.

    Hours & Credits

  • Host University Units

    2
  • Recommended U.S. Semester Credits
    4
  • Recommended U.S. Quarter Units
    6
  • Overview

    Course Description
    Data structures & types, mapping of abstract information structures into representations on primary & secondary storage. Analysis of time & space complexity of algorithms. Sequences. Lists. Stacks. Queues. Sets, multisets, tables. Trees. Sorting. Hash tables. Priority queues. Graphs. String algorithms.

     

    Course Introduction
    This course will introduce data structures and algorithms that are important to designing computer programs with performance guarantees, and constitute the basis of complex software systems. The course will also cover a set of analytical techniques that are fundamental for advanced studies in theoretical computer science.

     

    Learning Objectives
    After successfully completing this course you should be able to:


    1. UNDERSTAND THE PRINCIPLES OF DATA STRUCTURES
    1.1  Understand the internal workings of fundamental data structures and algorithms
    1.2  Determine the running time and memory space usage of common algorithms.

    2. DEVELOP ALGORITHMIC SOLUTIONS
    2.1  Adapt or invent new algorithms and data structures for software engineering problems.
    2.2  Analyse the performance of algorithms built on fundamental data structures and algorithms.
    2.3  Select and justify appropriate combinations of data structures and algorithms to solve software engineering problems.

     

    Class Contact
    3 Lecture hours, 1 Tutorial hour

Course Disclaimer

Courses and course hours of instruction are subject to change.

Eligibility for courses may be subject to a placement exam and/or pre-requisites.

Some courses may require additional fees.

Credits earned vary according to the policies of the students' home institutions. According to ISA policy and possible visa requirements, students must maintain full-time enrollment status, as determined by their home institutions, for the duration of the program.