Data Structures and Algorithms (Trimester 1 2013/2014)

1. Data Structures and Algorithms (Course Outline)

2. Data Structures and Algorithms (Lecture Notes from MMLS)
Lecture 01: Principles of Programming and Software Engineering
Lecture 02: Data Abstraction: The Walls, ADT List, ADT Sorted List
Lecture 03: Linked Lists 1
Lecture 04: Advanced C++ Topics and Linked Lists 2
Lecture 05: Stacks
Lecture 06: Queues
Lecture 07a: Recursion: The Mirrors
Lecture 07b: Recursion as a Problem-Solving Technique
Lecture 08: Algorithm Efficiency, Searching & Sorting 1
Lecture 09: Sorting 2 & Hashing
Lecture 10: Trees
Lecture 11a: Heaps (ADT Heap Tree)
Lecture 11b: Trees 2 (Balanced Search Trees)
Lecture 12: Graphs 1
Lecture 13: Graphs 2
Full Version

3. Data Structures and Algorithms (Labs from MMLS)
Take Home Exercise
Lab 01: ADT Calendar
Lab 02: ADT List
Lab 03
Lab 04: Stacks
Lab 05: Queues
Lab 06: Recursion
Lab 07: Sorting 1
Lab 08: Sorting 2 and Hashing
Lab 09: Trees 1
Lab 10: Trees 2
Lab 11: Graphs 1
Lab 12: Graphs 2
Full Version

4. Data Structures and Algorithms (Quiz from Tutorial TC202)
Quiz 1 (Answers)
Quiz 2 (Answers)
Quiz 3 (Answers)
Quiz 4 (Answers)
Quiz 5 (Answers)
Quiz 6 (Answers)
Full Version

5. Data Structures and Algorithms (Assignment)

Return to Bachelor of Computer Science (Hons)