| Week No. |
NETB201 Topics |
NETB201 Dates |
| 1. |
Chapters
1: C++
Programming [html] (1-56) (лекцията не се проведе) |
6.10 |
| 1. |
Chapters
1:
C++
Programming [html] (1-56) |
13.10 |
|
2. |
Chapters
2:
Оbject Oriented Design
[html] (61-96) |
20.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] (отучване) |
23.10 |
| 4. |
Chapter
4:
Stacks, Queues, and
Recursion [html] (143-202) Stacks, Queues, Linked Lists, Double-Ended Queues |
27.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 |
3.11 |
| 6. |
Test_1 |
10.11 |
| 7. |
Chapter 6: Trees
I [html] (253-272) The Tree Abstract Data Type, Basic Algorithms on Trees |
17.11 |
| 8. |
Chapter
6:
Trees II [html] (273-300) Binary Trees, Data Structures for Representing Trees |
24.11 |
| 9. |
Chapter
7:
Priority
Queues
I [html] (311-329) The Priority Queue Abstract Data Type, Implementing a Priority Queue with a Sequence |
1.12 |
| 10. |
Chapter
7:
Priority
Queues
II [html] (330-348) Heaps |
15.12 |
| 11. | Test_2 | 22.12 |
| 12. |
Chapter
8:
Dictionaries I [html] (363-402) The Dictionary Abstract Data Type, Hash Tables, Ordered Dictionaries |
5.01 |
| 13. |
Chapter
9: Search
Trees I [html] (411-436) Binary Search Trees, AVL Trees |
12.01 |
| 14. |
Chapter
9: Search
Trees II [html] (437-467) Multi-Way Search Trees, (2,4) Trees, Red-Black Trees (отучване от 08.12.2010 вместо на 26.01.2011) |
16.01 |
| 15. |
Final Test |
19.01 |
|
|
Term
Exam |
16.02 |