COMP9024

COMP9024 is a 2-in-1 course. It consists of two parts:

1. The C Programming Language

2. Data Structures and Algorithms

Together, we have Data Structures and Algorithms in C.

But, we don’t have the luxury of learning the C programming language through traditional methods (like those used in COMP1511).

It means:

• On one hand, you pay for one course but get the content of two (C + Data Structures and Algorithms).

• On the other hand, COMP9024 has a steep learning curve.

Please work hard in Week 1 and harder after that.

To aid understanding, we have visualized most of the algorithms (e.g., COMP9024/Trees/Ast2Dot) discussed in COMP9024.

Algorithms + Data Structures = Programs

Data structures are about how data is stored inside a computer for effective and efficient use.

An algorithm is a step-by-step process for solving a problem within a finite amount of space and time.

	Examples	In C
Data Structures (data)	arrays, stacks, queues, linked lists, trees, graphs, ...	pointer, array, struct, ...
Algorithms (code)	tree traversal, sorting, searching, graph traversal, ...	expression, statement, function

Week 01

Introduction

COMP9024/C/HelloWorld

COMP9024/Sorting/BubbleSort

Week 02 - 10

COMP9024/Stacks/Recursion

COMP9024/Stacks/Stack_LL

COMP9024/Queues/Queue_LL

COMP9024/C/AccessMemory

COMP9024/C/HowToMake

COMP9024/Trees/BiTree

COMP9024/Trees/Str2Ast

COMP9024/Complexity/Counting

COMP9024/Graphs/Dot2Png

COMP9024/Graphs/DirectedGraph

COMP9024/Graphs/UndirectedGraph

COMP9024/Graphs/DepthFirstSearch

COMP9024/Graphs/Dijkstra

COMP9024/Graphs/BreadthFirstSearch

COMP9024/Graphs/CycleDetection

COMP9024/LargeAssignment

COMP9024/HeapAllocator

COMP9024/Trees/Tree2Dot

COMP9024/Trees/TreeTraversal

COMP9024/Trees/BinarySearchTree

COMP9024/Trees/SelfBalancingBST

COMP9024/Strings/HashMap

COMP9024/Strings/Trie

COMP9024/Strings/FormatString

COMP9024/Randomised/Maze

COMP9024/Randomised/TopologicalSort