Week 13: Exam Overview

Exam Preparation:

• Revisit the lecture contents from week 01 to week 12.
• Working on the exam sample questions.
• Prepare pens with several different colors. You might need them to answer the exam questions clearly.
• Prepare the printed version of the prescribed textbook. You are allowed to bring the printed version of the prescribed textbook in the exam room, but not the digital version.

Marking Scheme:

• Correct Answer: Full Mark
• Precision Error: Half Mark
• Wrong Answer: Zero Mark
• Cheating: Unit Failed

Sample Questions

Week 12: Hash Tables

Learning Resources:

• Prescribed Textbook (sub-chapter 3.4)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Robert Sedgewick)
• Lecture Slide (prepared by Boedy)
• Linear Probing Demo 

Tutorial Content:

• Exercises section from Prescribed Textbook (page 480-482)

Self Study:

• Creative Problems section from Prescribed Textbook (page 483-484)
• Experiments section from Prescribed Textbook (page 485)

Week 11: Balanced Search Trees

Learning Resources:

• Prescribed Textbook (sub-chapter 3.3)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Robert Sedgewick)
• Lecture Slide (prepared by Boedy)
• 2-3 Search Tree Demo
• Red-Black BST Demo

Tutorial Content:

• Exercises section from Prescribed Textbook (page 449-450)

Self Study:

• Creative Problems section from Prescribed Textbook (page 451-455)
• Experiments section from Prescribed Textbook (page 456)

Week 10: Binary Search Trees

Learning Resources:

• Prescribed Textbook (sub-chapter 3.2)
• Prescribed Textbook companion website
• Lecture Slide (prepared by Robert Sedgewick)
• Lecture Slide (prepared by Boedy)
• Binary Search Tree Demo

Tutorial Content:

• Exercises section from Prescribed Textbook (page 416-418)

Self Study:

• Creative Problems section from Prescribed Textbook (page 419-421)
• Experiments section from Prescribed Textbook (page 422-423)