Algorithms Programming Data Computers & Social Informatics Communication and the Internet Explain how the choice of an Program competently in a least Explain the difference between Explain the use of logic gates Explain the concepts of: algorithm should be influenced two programming languages, data and information. and registers. client/server models; MAC by the data. at least one of which must be addresses, IP addresses and Explain the need for and use of Explain Von Neumann ‘textual’. domain names; and cookies. Be able to explain and use hexadecimal, two’s architecture (CPU, Memory, several key algorithms (e.g. Explain and use programming complement, signed integers, Input/Output). Explain a ‘real protocol’ e.g. sorting, searching, shortest concepts such as selection, and string manipulation. using telnet to interact with an Explain the fetch-execute path). repetition, procedures, HTTP server. Explain the need for data cycle. constants, variables, relational Explain how algorithms can be compression, and be able to Explain routing; redundancy operators, logical operators Explain and use low level improved, validated, tested describe simple compression and error correction; and functions. instruction sets and assembly and corrected. methods. encryption. code. Explain and use truth tables Explain that a single problem Explain the need for analogue and Boolean valued variables. Explain what compilers and Secondary could be solved by more than to digital conversions and how interpreters are and do and one algorithm. Explain and use two this works. give some examples of when dimensional arrays. Explain and show how different Explain the limitations of using they are used. algorithms can have different Explain and use nested binary representations e.g. Explain the main functions of performance characteristics for constructs/loops. rounding errors, sampling operating systems. the same task. frequency and fractional Explain the concept of Specialist numbers. Successfully apply algorithms in procedures that call solving GCSE and A level type procedures. Explain how structured data problems. can be represented in tables in Explain how low level a relational database, and languages work and be able to simple database queries. give simple examples. Explain that a program can be written to satisfy requirements and that they should be corrected if they do not meet these. Successfully apply programming in solving Computing/Computer Science GCSE and A level type problems.
Algorithms Programming Data Computers & Social Informatics Communication and the Internet Explain how the choice of an algorithm should be influenced by the data. Be able to explain and use several key algorithms (e.g. sorting, searching, shortest path). Explain how algorithms can be improved, validated, tested and corrected. Explain that a single problem could be solved by more than one algorithm. Explain and show how different algorithms can have different performance characteristics for the same task. Successfully apply algorithms in solving GCSE and A level type problems. Program competently in a least two programming languages, at least one of which must be ‘textual’. Explain and use programming concepts such as selection, repetition, procedures, constants, variables, relational operators, logical operators and functions. Explain and use truth tables and Boolean valued variables. Explain and use two dimensional arrays. Explain and use nested constructs/loops. Explain the concept of procedures that call procedures. Explain how low level languages work and be able to give simple examples. Explain that a program can be written to satisfy requirements and that they should be corrected if they do not meet these. Successfully apply programming in solving Computing/Computer Science GCSE and A level type problems. Explain the difference between data and information. Explain the need for and use of hexadecimal, two’s complement, signed integers, and string manipulation. Explain the need for data compression, and be able to describe simple compression methods. Explain the need for analogue to digital conversions and how this works. Explain the limitations of using binary representations e.g. rounding errors, sampling frequency and fractional numbers. Explain how structured data can be represented in tables in a relational database, and simple database queries. Explain the use of logic gates and registers. Explain Von Neumann architecture (CPU, Memory, Input/Output). Explain the fetch-execute cycle. Explain and use low level instruction sets and assembly code. Explain what compilers and interpreters are and do and give some examples of when they are used. Explain the main functions of operating systems. Explain the concepts of: client/server models; MAC addresses, IP addresses and domain names; and cookies. Explain a ‘real protocol’ e.g. using telnet to interact with an HTTP server. Explain routing; redundancy and error correction; encryption. Secondary Specialist
Subject%20knowledge%20audit%20for%20Computing%20teachers.docx