CSC201 Data Structures and Algorithms

Accessibility links

CSC201 Data Structures and Algorithms


Not available until Semester 2 2021 This course covers computational techniques and problem-solving tools that are central to the efficient solving of algorithmic problems. Techniques for designing efficient algorithms and mathematical analysis of time-and space-complexity of algorithms, including worst-case, average-case and best-case complexity, are also discussed. Students will learn efficient techniques to evaluate the use of data structures and algorithms to construct solutions to complex problems. Topics covered include lists, stacks, queues, priority queues, search trees, hash tables, and graphs, as well as recursion, sorting and searching algorithms.

Other information

Semester of offer: *
  • Petrie: Semester 2
Student contribution band:
Band 2
Census date:
Academic Calendar

* Semester of offer is subject to change.

Course outline

The outline for this course is currently unavailable.

Back to top

Pro tip: To search, just start typing - at any time, on any page.

Searching {{ model.SearchType }} for returned more than {{ model.MaxResults }} results.
The top {{ model.MaxResults }} of {{ model.TotalItems }} are shown below.

Searching {{ model.SearchType }} for returned {{ model.TotalItems }} results.

Searching {{ model.SearchType }} for returned no results.