| Week No. |
NETB201 Topics |
NETB201 Dates |
| 1. |
Chapters 1: C++ Programming [html] (1-56) |
04.10 |
|
2. |
Chapters 2: Оbject Oriented Design [html] (61-96) |
11.10 |
| 3. |
Chapter 3: Analysis
Tools [pdf]
(107-134) Running Time and Pseudo-Code, Analysis of Algorithms, Asymptotic Notation, Asymptotic Analysis [Wiki], [UC Berkeley Video Lecture] |
18.10 |
| 4. |
Chapter 4: Stacks,
Queues, and Recursion [html] (143-202) Stacks, Queues, Linked Lists, Double-Ended Queues |
25.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 |
8.11 |
| 6. |
Test_1 |
15.11 |
| 7. |
Chapter 6:
Trees I [html] (253-272) The Tree Abstract Data Type, Basic Algorithms on Trees |
22.11 |
| 8. |
Chapter 6: Trees II [html] (273-300) Binary Trees, Data Structures for Representing Trees |
29.11 |
| 9. |
Chapter 7: Priority Queues I [html] (311-329) The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence |
6.12 |
| 10. |
Chapter 7: Priority Queues II [html] (330-348) Heaps |
13.12 |
| 11. | Test_2 | 20.12 |
| 12. |
Chapter 8: Dictionaries
I [html] (363-402) The Dictionary Abstract Data Type, Hash Tables, Ordered Dictionaries |
03.01 |
| 13. |
Chapter 9:
Search Trees I [html] (411-436) Binary Search Trees, AVL Trees |
10.01 |
| 14. |
Chapter 9:
Search Trees II [html] (437-467) Multi-Way Search Trees, (2,4) Trees, Red-Black Trees |
17.01 |
| 15. |
Final Test |
23.01 |
|
|
Term exam |
31.01 |