|
Computer Science 12 (advanced), version 2019 NIS programme. Learning objectives for students Short term planLesson topic. Learning objectives
Theory, Questions, Exercises
Unit 12.1A - Artificial intelligence12.1A Artificial intelligence
12.4.3.1 describe spheres where artificial intelligence is applied: industry, education, medicine, gaming industry, society Theory and Tasks 2023
"Artificial Intelligence" Theory and Tasks 2023
"Virtual and augmented reality" Unit 12.1B - Programming paradigms12.1B Declarative and imperative programming languages
12.5.1.1 compare declarative and imperative programming languages Theory and Tasks 2020
"Declarative and imperative PL" Theory and Tasks 2020
"Expert systems" Theory and Tasks 2024 "Expert systems (Python)" Theory and Tasks 2021 "Expert system (Prolog)" 12.1B Stages of compiler design
12.5.1.3 describe program compilation stages: lexical and syntactic analysis, code generation, and optimization Theory and Tasks 2024
"Stages of compiler design" Unit 12.1C - System testing12.1C Project work: Testing. Types of test data
12.5.3.2 perform testing using normal data 12.5.3.3 perform testing using extreme data 12.5.3.4 perform testing using erroneous data Theory and Tasks 2023
"Testing. Types of test data" Theory and Tasks 2020 "Test plan" 12.1C Types of programming errors
12.5.3.1 describe execution errors at program startup 12.5.3.5 describe a syntax error in a program code 12.5.3.6 describe a logic error in a program code Theory and Tasks 2024
"Types of programming errors" Unit 12.2C - System implementation12.2C Methods of system implementation
12.2.1.7 list system implementation methods Theory and Tasks 2023
"Methods of implementation" 12.2C Project work. Installation. Implementation plan
12.2.1.9 explain the importance of making a system implementation plan Theory and Tasks 2020
"New system installation" Unit 12.2B - User documentation12.2B Creating documentation
12.2.1.1 use a table of contents when documenting a project Theory and Tasks 2020
"Creating documentation" Theory & Exercises 2020 "User manual" Theory & Exercises 2020 "Evaluation" 12.2B Copyright & Plagiarism
12.1.3.5 check documents using antiplagiarism resources Theory and Tasks 2023
"Plagiarism & antiplagiarism resources" Theory and Tasks 2020 "Copyright" Theory and Tasks 2023 "Understanding Copyright Law" Unit 12.2A - Information security12.2A Threats to computer system
12.1.3.2 analyze problems arising due to malware, physical risks Theory & Exercises 2023 Theory & Exercises 2021 Theory & Exercises 2021 Theory & Exercises 2021 12.2A Data protection measures
12.1.2.1 describe protection measures for data and computer systems such as firewalls, encryption, biometrics Theory & Exercises 2020 Theory & Exercises 2020 Theory & Exercises 2020 Theory & Exercises 2020 Theory & Exercises 2020 12.2A Backup and Disk mirroring
12.1.2.2 use data protection measures such as data backup and disk mirroring Theory & Exercises 2020 12.2A Protect data from unauthorized access
12.1.2.3 protect data from unauthorized access Theory & Exercises 2023 12.2A Privacy policies
12.1.3.3 explain privacy policies Theory & Exercises 2024 12.2A E-government
12.1.3.7 use E-gov resources Theory & Exercises 2020 Unit 12.3A - Computer systems12.3A Types of operating system (part II)
12.3.1.1 describe a real-time operating system Theory & Exercises 2024 12.3A User interfaces
12.3.1.4 define the advantages and disadvantages of a graphical user interface (GUI) Theory & Exercises 2025 12.3A Fetch-Decode-Execute cycle
12.3.2.5 explain three operations in a fetch-execute cycle (fetch /decode /execute) Theory & Exercises 2022 Fetch/Execute Cycle (e-book) Fetch-Execute cycle on teach-ict.com
12.3A System bus
12.3.2.4 explain how data is transferred between different components of a computer system through the address bus, data bus, and control bus Theory & Exercises 2021 12.3A Speed clock, word size, bus width
12.3.2.6 explain how the clock speed, word length, and bus width affect the performance Theory & Exercises 2021 12.3A RISC vs CISC
12.3.2.1 describe the RISC architecture Theory & Exercises 2022 12.3A Addressable memory
12.3.4.1 explain the principle of memory addressing 12.3A Memory management. Paging and segmentation.
12.3.4.2 explain the principle of memory organization by segment and page Theory & Exercises 2022 12.3A Virtual machine
12.3.4.3 explain the concept of a virtual machine Theory & Exercises 2021 12.3A Boolean logic
12.3.3.2 build logical structures Theory & Exercises 2022 Build logic circuits online Logic.ly
12.3A Logic laws
12.3.3.3 simplify logical expressions using the laws of logic Theory & Exercises 2022 Unit 12.3B - Data presentation12.3B Number systems. Represent positive decimal numbers in binary.
12.1.1.1 convert a number from one number system to another 12.3B Binary addition and binary multiplication
12.1.1.3 perform the arithmetic operations: addition and multiplication of binary numbers 12.3B Represent positive and negative numbers in two's complement
12.1.1.4 represents positive and negative numbers in two's complement and specifies the range of n bits Theory & Exercises 2021
12.3B Fixed point numbers and Floating point numbers
12.1.1.6 use binary numbers with a fixed point to represent fractional numbers with a given number of bits Theory & Exercises 2021 12.3B Data structures. Queues & Stacks.
12.5.2.1 describe the operation of stack and queue data structures 12.3B Data structures. Binary tree.
12.5.2.2 build a binary tree Theory & Exercises 2020 Unit 12.3C - Communication and networks12.3C Internet, WWW, intranet
12.6.2.1 distinguish features of the Internet, the World Wide Web, and the Intranet Theory & Exercises 2021
12.3C OSI model
12.6.1.2 describe the functions of the OSI network model levels Theory & Exercises 2021
12.3C Packet switching & circuit switching
12.6.1.1 explain the difference between packet switching and circuit switching Theory & Exercises 2021
12.3C MAC address
12.6.2.2 describe the role of MAC addresses in packet routing Theory & Exercises 2021 | |
|
| |
| Просмотров: 3384 | |
| Всего комментариев: 0 | |