Data Structures

NETB201 Timetable [2017/2018]

Week No.
Topics
Dates
1.
Chapters 1: C++ Programming [html] (1-56)
Basic C++ Programming Elements, Expressions, Functions, Classes
3.10
2.
Chapters 2: Š˛bject Oriented Design [html] (61-96)
Inheritance and Polymorphism, Templates, Exceptions
10.10
3.
Chapter 3: Analysis Tools [pdf] [html](107-134)
Running Time and Pseudo-Code, Analysis of Algorithms, Asymptotic Notation, Asymptotic Analysis [Wiki],
[UC Berkeley Video Lecture]
17.10
4.
Chapter 4: Stacks, Queues, and Recursion [html] (143-202)
Stacks, Queues, Linked Lists, Double-Ended Queues
24.10
5.
Chapter 5: Vectors, Lists, and Sequences [html] (203-252)
Vectors, Lists, Sequences, Case Study: Bubble-Sort on a Sequence, Iterators, A Hierarchy of Sequence ADTs
31.10
6.
Test 1
7.11
7.
Chapter 6: Trees I [html] (253-272)
The Tree Abstract Data Type, Basic Algorithms on Trees
14.11
8.
Chapter 6: Trees II [html] (273-300)
Binary Trees, Data Structures for Representing Trees
21.11
9.
Chapter 7: Priority Queues I [html] (311-329)
The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence
28.11
10.
Chapter 7: Priority Queues II [html] (330-348)
Heaps, Implementing a Priority Queue as a Heap
5.12
moved
11. Test 2
12.12
12.
Chapter 8: Dictionaries I [html] (363-402)
The Dictionary Abstract Data Type, Hash Tables, Ordered Dictionaries
19.12
13.
Chapter 9: Search Trees [html] (411-436)
Binary Search Trees, AVL Trees
2.01
14.
Chapter 9: Search Trees II [html] (437-467)
Multi-Way Search Trees, (2,4) Trees, Red-Black Trees
9.01
15.
Test 3
16.01

Term exam