NCEA L3 Externals - Complexity and tractability

Join Tim Bell from University of Canterbury on Thursday 15 May at 4:00pm

This webinar will support you to teach L3 91908 - Analyse an area of computer science - Complexity and tractability. We will look at what the general topic is about, and some specific learning activities that you can use with your students to engage them with the key concepts in the topic. 

This online workshop will be recorded and available if you cannot join us, although you’ll get a lot more out of it if you can be there and interact with the live discussion. 

If you have questions relating to registration, please email secretary@dtta.org.nz

To prepare for this webinar, please look over the content in the CSfieldguide:

https://www.csfieldguide.org.nz/en/chapters/complexity-and-tractability/

as of 19 March 2025, this supplementary guide is needed to cover the material well, but we hope to have it incorporated in the chapter by mid-April, so only mention it if the information is going out before it is done.

Link to NZQA specification for L3 91908

https://www.nzqa.govt.nz/nqfdocs/ncea-resource/specifications/2025/91908-spc-2025.pdf