Page 208 - Getting the Picture Modeling and Simulation in Secondary Computer Science Education

206
Appendices
Sub-domain F4: Security
30. The candidate is able to name some security threats and common socio-technical measures, and relate these to social and human factors.
Optional themes
Domain G: Optional theme Algorithmic, calculability and logic
Sub-domain G1: Algorithm complexity
31. The candidate is able
(havo:) to compare the complexity of certain algorithms, and to recognise and name classical difficult problems.
(vwo:) to explain the difference between exponential and polynomial complexity; to distinguish algorithms based on this difference, and to recognise and name classical difficult problems.
Sub-domain G2: Calculability
32.The candidate is able to characterise and relate calculations on different abstraction levels, and to recognise and name classical incalculable problems.
Sub-domain G3: Logic
33. The candidate is able to express characteristics of digital artefacts in logical formulas.
Domain H: Optional theme Databases
Sub-domain H1: Information modelling
34. The candidate is able to draw up an information model for a simple practical situation and is able to define a database based on this situation.
Sub-domain H2: Database paradigms
35. Apart from the rational paradigm, the candidate is able to describe at least one other database paradigm, and is able to weigh the suitability of the relevant paradigms for a concrete application.
Sub-domain H3: Linked data
36.The candidate is able to link data from different databases (data sources) in an application.