COSC301-Data Structures and Complexity Analysis
- Preliminaries:
- Lecture and Laboratory Material
Week
Lecture Slides
Laboratory Practical
01
Unit 01 - Review of OO Concepts
- Compile and run Unit 01 programs
- Set-up package structure for labs
Unit 02 - Introduction to Design Patterns
Unit 03 - Complexity Analysis I
02Unit 04 -Complexity Analysis II Lab 01 - Introduction to Design Patterns
(Lab Document, Code Files)
Unit 05 - Singly Linked List
Unit 06 - Doubly Linked List
03
Unit 07 - Stack
Lab 02 - More on Design Patterns
(Lab Document, Code Files)
Unit 08 - Queue
Unit 09 - Recursion 1
04
Unit 10 - Recursion 2
Lab 03 - Linked Lists
(Lab Document, Code Files)Unit 11 - Recursion 3
Unit 12 - Analysis of Recurvise Algorithms
05
Unit 13 - Introduction to Trees
Lab 04 - Stacks and Queues
(Lab Document, Code Files)
Unit 14 - Binary Search Trees (BSTs)
Unit 15 - Tree Traversal
06
Unit 16 - Binary Heaps
Lab 05 - Recursion
(Lab Document, Code Files)
Unit 17 - AVL Tree 1
Unit 18 - AVL Tree 2
07
Unit 19 - B-Trees
Lab 06 - Binary and Binary Search Trees
(Lab Document, Code Files)
Unit 20 - Application of Trees: Huffman Coding
Unit 21 - Introduction to Graphs
08
Unit 22 - Graphs Implementation
Lab 07 - Binary Heaps
(Lab Document, Code Files)
Unit 23 - Graph Traversal
Unit 24 - Topological Sort
09
Unit 25 - Graph Connectedness and Cycles
Lab 08 - Huffman Coding
(Lab Document, Code Files)
Unit 26 - Shortest Path Algorithms
Unit 27 - Minimum Spanning Trees
10
Unit 28 - Hashing 1
Lab 09 - Trees
(Lab Document, Code Files)
Unit 29 - Hashing 2
Unit 30 - Hashing 3
11
Unit 31 - Data Compression - LZ78
Lab 10 - Graph
(Lab Document, Code Files)
Unit 32 - Data Compression - LZW
Unit 33 -Garbage Collection
12
Unit 34 - Memory Management
Lab 11 - Graph Algorithms
(Lab Document, Code Files)
Lab 12 - Hashing
(Lab Document, Code Files)
- Sample Past Question Papers
- Download here
- Students' Grades