Data Structures

Timetable

Week
No.
NETB201
Topics
NETB201
Dates

NETB211
Topics
NETB211
Dates
1.
Chapters 1: C++ Programming [html]
05.10

C++ Revisited 02.10
2.
Chapters 2: Оbject Oriented Design [html] 12.10

C++ Revisited (continued)
10.10
3.
Chapter 3: Analysis Tools [pdf]
Running Time and Pseudo-Code, Analysis of Algorithms, Asymptotic Notation, Asymptotic Analysis [Wiki]
19.10

Analysis of Algorithms 17.10
4.
Chapter 4: Stacks, Queues, and Recursion [html]
Stacks[applet], Queues[applet1, applet2], Linked Lists[applet], Double-Ended Queues
26.10

Big-O notation
24.10
5.
Chapter 5: Vectors, Lists, and Sequences [html]
Vectors, Lists, Sequences, Case Study: Bubble-Sort [applet] on a Sequence, Iterators, A Hierarchy of Sequence ADTs
02.11

Staks and Queues
31.10
6.
Test_1
09.11

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

Exam of Practice_1 14.11
8.
Chapter 6: Trees II [html]
Binary Trees, Data Structures for Representing Trees
23.11

Trees
21.11
9.
Chapter 7: Priority Queues [html]
The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence, Heaps [applet]
30.11

Priority Queue
28.11
10.
Chapter 8: Dictionaries [html]
The Dictionary Abstract Data Type, Hash Tables [applet], Ordered Dictionaries
07.12

Dictionary
05.12
11.
Test_2
14.12

Hash
12.12
12.
Chapter 9: Search Trees [html]
Binary Search Trees [applet]
21.12

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

Binary Search Trees
09.01
14.
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
11.01

MergeSort and QuickSort
16.01
15.
Final Test
18.01

Final Exam of Practice
24.01

Term Exam