| Week No. |
NETB201 Topics |
NETB201 Dates |
| 1. |
Chapters
1: C++
Programming [html] (1-56) |
03.10 |
|
2. |
Chapters
2: Оbject Oriented Design
[html] (61-96) |
10.10 |
| 3. |
Chapter
3: Analysis
Tools [pdf] (107-134) Running Time and Pseudo-Code, Analysis of Algorithms, Asymptotic Notation, Asymptotic Analysis [Wiki] |
17.10 |
| 4. |
Chapter
4: Stacks, Queues, and
Recursion [html] (143-202) Stacks, Queues[applet], Linked Lists, Double-Ended Queues |
24.10 |
| 5. |
Chapter
5: Vectors,
Lists, and Sequences [html]
(203-252) Vectors, Lists, Sequences, Case Study: Bubble-Sort [applet] on a Sequence, Iterators, A Hierarchy of Sequence ADTs |
31.10 |
| 6. |
Test_1 |
07.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 [html] (311-348) The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence |
28.11 |
| 10. |
Chapter
7: Priority
Queues [html] (311-348) Heaps [applet] Chapter 8: Dictionaries I [html] (363-371) The Dictionary Abstract Data Type |
05.12 |
| 11. |
Test_2 |
12.12 |
| 12. |
Chapter
8: Dictionaries II [html] (371-402) Hash Tables, Ordered Dictionaries |
19.12 |
| 13. |
Chapter
9: Search
Trees I [html] (411-436) Binary Search Trees [applet], AVL Trees |
09.01 |
| 14. |
Chapter
9: Search
Trees II [html] (437-467) Multi-Way Search Trees, (2,4) Trees[applet], Red-Black Trees [applet] |
16.01 |
| 15. |
Final Test |
23.01.2008 |
|
|
Term
Exam |
5.02, 8:00, 411 I |