Advanced Data Structure II
SWE 245 · Semester 4
5 credits · 30 learning units
Lessons
5 of 30 learning units provide interactive tutorials with worked examples, diagrams, knowledge checks and subject mastery questions. Each check draws five questions from the available bank; question counts vary by unit. The remaining units provide preparation, guided practice or an independent project.
Subunit titles retain the curriculum’s original language.
Start here
Build understanding
- Lesson 2Abstract data types and invariants
- Lesson 3Pointers, ownership and lifetime
- Lesson 4Dynamic arrays and capacity
- Lesson 5Records and file formats
- Lesson 6Reading files and malformed input
- Lesson 7Saving, reopening and recovery
- Lesson 8Singly linked nodes and traversalInteractive tutorial
- Lesson 9Linked list insertionInteractive tutorial
- Lesson 10Linked list deletion and cleanupInteractive tutorial
- Lesson 11Doubly linked listsInteractive tutorial
- Lesson 12Circular lists and sentinelsInteractive tutorial
- Lesson 13Stack operations and expression matching
- Lesson 14Queues and circular buffers
- Lesson 15Deques and container selection
- Lesson 16Tables, keys and dictionary contracts
- Lesson 17Hash functions and bucket selection
- Lesson 18Hash collisions and chaining
- Lesson 19Open addressing and deletion markers
- Lesson 20Load factor and rehashing
- Lesson 21Tree vocabulary and recursive structure
- Lesson 22Binary search trees and lookup
- Lesson 23Tree traversals and deletion
- Lesson 24Degenerate trees and balancing
- Lesson 25Heaps and priority queues
- Lesson 26Graph representations
- Lesson 27Breadth-first and depth-first traversal
- Lesson 28Comparing structures with workload evidence
Put it into practice
Work independently
Curriculum source
HND Computer Engineering Software Engineering Curriculum.pdf · SWE 245 · Course table: p. 11 · Outline pages: 47