LearnITWithMrC

Home
Assessment GCSE
Year 9 Year 10 Year 11
3.1 Algorithms
Effective Notetaking Understanding Algorithms Decomposition Abstraction Flowcharts Flowcharts 2 Trace Tables Searching Algorithms Bubble Sort Merge Sort
3.2 Programming
Imperative Languages Variables Data Types Input/Output Arithmetic Operators Comparison Operators Using Selection For - loops While - loops Data Structures String Manipulation Random Numbers File Operations Procedures Program Structure Data Validation Data Authentication Errors and testing high and low level languages
3.3 Data representation
3.3.1 - Number Bases 3.3.2 - Converting Number Bases 1 3.3.4 - Binary Arithmetic 3.3.2 - Converting Number Bases 2 3.3.3 - Units of Information 3.3.5 - Character Encoding 3.3.6 - Representing images 3.3.7 - Representing Sound 3.3.8 - Data Compression 3.3.8 - Huffman Coding
3.4 Computer Systems
Boolean Logic Operating systems Utility Software Computer Architecture CPU Types of Memory Storage Media
3.5 Computer Networks
Networks Overview Network Topologies Network Hardware Network Protocols Network Security Network Layers

Overview

Learning Objectives

0 results forGuest

ID	Skill_name
3.2.2.1	I can understand that the three combining principles (sequence, iteration/repetition and selection/choice) are basic to all high level imperative programming languages.

🏁 Learning Objective Imperative Languages

Imperative languages

Imperative languages are a style of language that are built from commands which state how the program must operate. A command is an instruction that the computer must follow.

Three Principles of Imperative Languages

The three key elements of imperative programming languages are:

Sequence - The order in which commands are executed
Selection - The ability to branch the code depending upon a condition.
Iteration The ability to repeat the code based upon a condition.

The key features of imperative programming languages are:

Variables - A label with an assigned values thats is created to store the value of a data type in memory. A variable can change its value while the program is running.

Constants - Constants are identical to variables, except that the value cannot be changed while the program is running

Assignment Placing a value into a variable.

Mathematical operations The ability to compute calculations using operators such as + - = etc.

Comparison operations Operators Used to compare values and create true or false results such as > < == etc.

Subroutines A piece of code that is defined by its own name and that can be reused by reference to that name. It can return a value and be passed values.

Flowchart examples for the three key elements:
Sequence,Selection and Iteration (repetition)

Update your objectives

Assessment

0 results forGuest

Imperative Languages