Week 12
8 Dec–11 Dec 2026 · Artificial intelligence and data structures
Tuesday 8 Dec · CSE101
13:30–16:30 · Z23
Principles
AI history, symbolic search, expert systems, machine learning, neural networks and generative models; evaluation and limitations.
Application & programming
Trace linked lists and their pointer operations; compare stacks, queues and tree representations. Guided implementation remains focused on the supplied singly linked list.
Weekly PPTX, code and recordings: in preparation.
Learning focus
Guided singly linked-list work with supplied allocation/cleanup. AI and broader structures remain conceptual; no extra implementation unit.
D: do independently · M: explain and modify a worked example · R: recognize, trace and compare.
Revisit: Connect struct fields and addresses before following links.
Wednesday 9 Dec · Recitation
Draw node links and diagnose a familiar pointer defect. Keep search and tree comparisons short; no graph lab preparation.
Start time tentatively 16:30; room to be announced.
Friday 11 Dec · CSE107
Lab 11: Linked lists & debugging
Traverse or modify a provided singly linked list and diagnose a defect. Use prepared records; live Arduino is optional. No graph tasks in prelab, lab or report.
Attend your assigned two-hour group. Handout in preparation.
Preparation & submissions
No assignment has been released for this page yet. Requirements, permitted assistance and deadlines will appear in the published brief.