Topic 2
5.2 Algorithms and data structure
5.2 Algorithms and data structure learning objectives and workbook content.
0%
Topic
Paper progress
Paper 1
0%
Paper 2
0%
Paper 3
0%
Learning path by learning objective
11.5.2.1
Paper 3
use the technical terms associated with arrays including upper and lower bounds
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.2
Paper 3
select a suitable data structure for a given task (1D or 2D array)
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.3
Paper 3
write program code using 1D and 2D arrays
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.4
Paper 3
write an algorithm / pseudo-code for sorting by insertion and bubble sort
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.5
Paper 3
write a pseudo-code of binary search for the solution of a specific problem
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.6
Paper 3
understand the time-efficiency of algorithms
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
11.5.2.7
Paper 3
understand the space-efficiency of algorithms
Theory
No theory linked to this LO yet.
Workbook
No workbook tasks linked to this LO yet.
Glossary
No glossary terms added yet.