COMP3506 content

Lecture notes and revision will be added separately

Lecture	Textbook reading and notes	Tutorials
1	Chapt 3.1, 4. Experimental Studies and Recursion	Tutorial 1
2	Chapt 12.1-12.3, Sorting and Selection	Tutorial 2
3	Linear sorting, Lists and arrays, amortization, linked data structures
4	Stacks, queues, iterators, trees	Tutorial 5
5	Chapter 9, Priority Queues, Chapt 10,1, 10.5 Maps, Distionaries and Sets	Tutorial 6
6	Chapt 10.2, 10.3, Hash Tables and Sorted Maps, Chapt 11.1-11.3 Binary Trees, Balanced Search Trees and AVL Trees	Tutorial 7
7	Balanced Trees (AVL, Splay)	Tutorial 8
8	Graph basics, graph traversal, directed graph algorithms	Tutorial 9
9	Shortest path algorithms, minimum spanning trees	Tutorial 10
10	Strings, patt ern matching, tries
11	Huff man Encoding, Text Compression	Tutorial 12