IP/Host: ---.saix.net
Registered: 18 years ago
Posts: 613
Rating: 0
Although I know there is a list of what will be covered in the exam, while paging through the chapters we covered in the textbook, I'm wondering if we need to know anything about:
1) Application of queues
2) Priority Queues
3) Hashing
4) Heap Sort
5) AVL Height Balanced Trees
6) Graph Implementation
7) Graph Topological Order
IP/Host: ---.unisa.ac.za
Registered: 18 years ago
Posts: 88
Rating: 0
Hi
Anything not part of the syllabus(check out tut letter 101) won't be tested on in the exams. You need to concentrate on what is listed in the exam tutorial letter. None of the stuff listed above will be tested on in the exams.
IP/Host: ---.saix.net
Registered: 18 years ago
Posts: 613
Rating: 0
Don't think that STL is in the exam, not mentioned as one of the sections we must cover and wasn't included in any of the assignments. Thats my thought, I'm not going to worry about that chapter.