Home Search CS Unplugged: Field guide: Algorithms

CS Unplugged: Field guide: Algorithms

An online resource for teaching Computer Science to students, this chapter focusses on Algorithms. This chapter covers what an algorithm is, and why they are such a fundamental idea in computer science. Find out more about the two most common and important types of algorithms - Searching and Sorting.

Additional details

Year band(s)	1-2, 3-4, 5-6, 7-8, 9-10
Format	Web page
Core and overarching concepts	Algorithms
Australian Curriculum Digital Technologies code(s)	AC9TDI2P02 Follow and describe algorithms involving a sequence of steps, branching (decisions) and iteration (repetition) AC9TDI4P02 Follow and describe algorithms involving sequencing, comparison operators (branching) and iteration AC9TDI4P04 Implement simple algorithms as visual programs involving control structures and input AC9TDI6P02 Design algorithms involving multiple alternatives (branching) and iteration AC9TDI6P05 Implement algorithms as visual programs involving control structures, variables and input AC9TDI8P05 Design algorithms involving nested control structures and represent them using flowcharts and pseudocode AC9TDI8P09 Implement, modify and debug programs involving control structures and functions in a general-purpose programming language AC9TDI10P04 Define and decompose real-world problems with design criteria and by interviewing stakeholders to create user stories AC9TDI10P05 Design algorithms involving logical operators and represent them as flowcharts and pseudocode AC9TDI10P09 Implement, modify and debug modular programs, applying selected algorithms and data structures, including in an object-oriented programming language
Keywords	Professional learning, Algorithms, Computational Thinking, Sorting, Searching
Organisation	University of Canterbury, New Zealand
Copyright	University of Canterbury, New Zealand. Creative Commons BY-NC-SA 4.0.