Data Structures

Timetable

Week
No.
NETB201
Topics
NETB201
Dates

NETB211
Topics
NETB211
Dates
1.
Chapters 1 and 2: C++ Programming and Object Oriented Design [html]
6.10

C++ Revisited 4.10
2.
Chapter 3: Analysis Tools [html]
Running Time and Pseudo-Code, Analysis of Algorithms, Asymptotic Notation, Asymptotic Analysis
13.10

C++ Revisited (continued) 11.10
3.
Chapter 4: Stacks, Queues, and Recursion [html]
Stacks[applet], Queues[applet], Linked Lists[applet], Double-Ended Queues
20.10

Analysis of Algorithms
18.10
4.
Chapter 5: Vectors, Lists, and Sequences [html]
Vectors, Lists, Sequences, Case Study: Bubble-Sort [applet] on a Sequence, Iterators, A Hierarchy of Sequence ADTs
27.10

Staks and Queues
25.10
5.
Test_1
3.11

Linked Lists
8.11
6.
Chapter 6: Trees I [html]
The Tree Abstract Data Type, Basic Algorithms on Trees
10.11

Exam of Practice_1 15.11
7.
Chapter 6: Trees II [html]
Binary Trees, Data Structures for Representing Trees
17.11

Trees
22.11
8.
Chapter 7: Priority Queues [html]
The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence, Heaps [applet]
24.11

Priority Queue
29.11
9.
Chapter 8: Dictionaries [html]
The Dictionary Abstract Data Type, Hash Tables [applet], Ordered Dictionaries
1.12

Dictionary
6.12
10.
Test_2
15.12

Hash
13.12
11.
Chapter 9: Search Trees I  [html]
Binary Search Trees [applet]
22.12

Exam of Practice_2 20.12
12.
Chapter 9: Search Trees II [html]
Multi-Way Search Trees, (2,4) Trees[applet], Red-Black Trees [applet]
5.01

Binary Search Trees
3.01
13.
Chapter 10: Sorting, Sets, and Selection [html]
The Set ADT, Quick-Sort, A Lower Bound on Comparison-Based Sorting, Bucket-Sort and Radix-Sort, Comparison of Sorting Algorithms, Selection
12.01

MergeSort and QuickSort
10.01
14.
Chapter 12: Graphs [html]
The Graph Abstract Data Type, Data Structures for Graphs
19.01


17.01
15.
Final Test
25.01

Final Exam of Practice
24.01

Term Exam
14.02/13:00


14.02/13:00