Computer Science GCES AQA
-
Representing Algorithms Aqa4 主题
-
Efficiency Of Algorithms Aqa1 主题
-
Searching Algorithms Aqa3 主题
-
Sorting Algorithms Aqa3 主题
-
Data Types Aqa1 主题
-
Programming Concepts Aqa5 主题
-
Arithmetic Relational And Boolean Operations Aqa1 主题
-
Data Structures Aqa3 主题
-
String Manipulation Aqa1 主题
-
Random Number Generation Aqa1 主题
-
Structured Programming Aqa2 主题
-
Robust And Secure Programming Aqa4 主题
-
Number Bases Aqa2 主题
-
Converting Between Number Bases Aqa3 主题
-
Units Of Information Aqa9 主题
-
Hardware And Software Aqa4 主题
-
Boolean Logic Aqa3 主题
-
Programming Languages And Translators Aqa2 主题
-
Cpu Architecture Performance And Embedded Systems Aqa4 主题
-
Memory Aqa2 主题
-
Secondary Storage Aqa3 主题
-
Fundamentals Of Computer Networks Aqa8 主题
-
Fundamentals Of Cyber Security Aqa1 主题
-
Methods Of Preventing Cyber Security Threats Aqa1 主题
-
Relational Databases Aqa2 主题
-
Ethical Legal And Environmental Impacts Aqa2 主题
Binary Shifts Aqa
Exam code:8525
Binary Shifts
What is a binary shift?
-
A binary shift is how a computer system performs basic multiplication and division
-
Binary digits are moved left or right a set number of times
-
A left shift multiplies a binary number by 2 (x2)
-
A right shift divides a binary number by 2 (/2)
-
A shift can move more than one place at a time, the principle remains the same
-
A left shift of 2 places would multiply the original binary number by 4 (x4)
How do you perform a left shift of 1?
-
Here is the binary representation of the denary number 40
-
To perform a left binary shift of 1, we move each bit 1 place to the left
-
The digit in the 128 column will move left causing an overflow error
-
The 1 column becomes empty so is filled with a 0
-
The original binary representation of denary 40 (32+8) has multiplied by 2 and became 80 (64+16)
How do you perform a left shift of 2?
-
Here is the binary representation of the denary number 28
-
To perform a left binary shift of 2, we move each bit 2 place to the left
-
The digit in the 128 and 64 column will move left causing an overflow error
-
The 1 and 2 column become empty so are filled with a 0
-
The original binary representation of denary 28 (16+8+4) has multiplied by 4 and became 112 (64+32+16)
How do you perform a right shift of 1?
-
Here is the binary representation of the denary number 40
-
To perform a right binary shift of 1, we move each bit 1 place to the right
-
The digit in the 1 column will move right causing an underflow error
-
The 128 column becomes empty so is filled with a 0
-
The original binary representation of denary 40 (32+8) has divided by 2 and became 20 (16+4)
How do you perform a right shift of 2?
-
Here is the binary representation of the denary number 200
-
To perform a right binary shift of 2, we move each bit 2 places to the right
-
The digits in the 1 and 2 columns will move right causing an underflow error
-
The 128 and 64 columns become empty so are filled with a 0
Responses