CT assessment levels
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
View only
 
 
ABC
1
Coding skills
2
CODEQ9Student can develop new (sexy) code (d)
3
CODEQ8Student can develop new (sexy) code (c)
4
CODEQ7Student can develop new (sexy) code (b)
5
CODEQ6Student can develop new (sexy) code (a)
6
CODEQ5Student can develop new code (using sexy rules 1, 2, 4)
7
CODEQ4Student can develop new (ugly) code
8
CODEQ3Student can modify existing code / debug
9
CODEQ2Student can accurately copy code
10
CODEQ1Student can demonstrate understanding of sequence
11
12
Solution design skills
13
DESIGN9
Student can describe a new and complex algorithm containing all major constructs, using structured English, flowchart or pseudocode (d)
14
DESIGN8
Student can describe a new and complex algorithm containing all major constructs, using structured English, flowchart or pseudocode (c)
15
DESIGN7
Student can describe a new and complex algorithm containing all major constructs, using structured English, flowchart or pseudocode (b)
16
DESIGN6
Student can describe a new and complex algorithm containing all major constructs, using structured English, flowchart or pseudocode (a)
17
DESIGN5Student can describe a new algorithm containing many major constructs, using structured English, flowchart or pseudocode
18
DESIGN4
Student can describe a new but basic algorithm containing limited constructs, using structured English, flowchart or pseudocode
19
DESIGN3Student can modify an existing algorithm described in structured English, flowchart or pseudocode
20
DESIGN2Student can accurately copy an algorithm described in structured English, flowchart or pseudocode
21
DESIGN1Student can be able to define an algorithm
22
23
Perserverence and resilience when solving problems
24
LIVECTSturdy oakStudent is never defeated.
25
LIVECTBendy branchStudent always gives a valiant effort but does sometimes does not not manage to finish.
26
LIVECTLimp leafStudent easily gives up.
27
28
Problem solving success
29
THINKCTMasterStudent can confidently apply CT principles to successfully solving a problem.
30
THINKCTNinjaStudent provides evidence of using the CT principles to tackle a problem.
31
THINKCTNoviceStudent can recall CT principles but finds it difficult to apply them effectively.
32
33
Computer science knowledge - assessed per topic
34
KNOWITAllStudent has confident retention of detailed theory.
35
KNOWITOKStudent has some retention but lacks detail.
36
KNOWITPoorStudent has very little theory retention.
37
38
Learning beyond the classroom - homework
39
REVISECTGoodStudent completes all homework and it is done well.
40
REVISECTOKStudent completes most homework but there can be improvements in regularity and/or quality.
41
REVISECTPoorStudent completes very little, if any, homework or it is of poor quality.
42
Loading...
Main menu