1.2.23

Binary Shifts

Test yourself on Binary Shifts

Test your knowledge with free interactive questions on Seneca — used by over 10 million students.

Binary Shifts

A binary shift is a technique for performing multiplication or division on a binary number.

Binary shift

Binary shift

In a binary shift, each digit is moved one column to the left or the right.
Extra 0 bits are added to the start or end of the binary number to fill any missing spaces.

Left binary shift

Left binary shift

In a left binary shift, each digit is moved one place to the left.
- This has the effect of multiplying the number by two.
You must take care, when performing a left shift, that there is no overflow error (where we run out of space to store the last digit of the number).

Right binary shift

Right binary shift

In a right binary shift, each digit is moved one place to the right.
- This has the effect of dividing the number by two.
You must take care when performing a right shift that no data is shifted off the right hand side. This can cause a loss of accuracy.

1

Computer Systems

1.1

Systems Architecture

1.1.1Fetch-Execute Cycle 1.1.2Common CPU Components & Their Function 1.1.3Von Neumann Architecture 1.1.4Factors Affecting CPU Performance 1.1.5Embedded Systems 1.1.6Exam-Style Questions - Von Neumann Architecture 1.1.7Diagnostic Misconceptions - Embedded vs General

1.2

Memory & Storage

1.2.1Types of Memory 1.2.2Flash Memory 1.2.3Properties of Flash Memory 1.2.4Running Out of Memory 1.2.5Virtual Memory 1.2.6Units of Capacity 1.2.7Calculating Capacity Requirements 1.2.8Solid State Storage 1.2.9Properties of Solid State Media 1.2.10Magnetic Storage 1.2.11Properties of Magnetic Media 1.2.12Examples of Magnetic Storage 1.2.13Optical Storage 1.2.14Properties of Optical Media 1.2.15Examples of Optical Storage 1.2.16Types of Optical Disk 1.2.17Number Bases 1.2.18Converting Number Bases 1.2.19Hexadecimal 1.2.20Using Hexadecimal 1.2.21Converting Denary & Hexadecimal 1.2.22Binary Addition 1.2.23Binary Shifts 1.2.24Representing Text 1.2.25ASCII & Unicode 1.2.26Representing Images 1.2.27Converting Binary & Images 1.2.28Representing Sound 1.2.29Data Compression 1.2.30Grade 9 - Storage 1.2.31Exam-Style Questions - Primary Memory 1.2.32Exam-Style Questions - Storage 1.2.33Exam-Style Questions - Data Conversions 1.2.34Diagnostic Misconceptions - RAM vs ROM 1.2.35Diagnostic Misconceptions - Bits, Nibbles & Bytes 1.2.36Diagnostic Misconceptions - Bits Required to Store 1.2.37End of Topic Test - Computer Systems 1.2.38End of Topic Test - Representation

1.3

Computer Networks, Connections & Protocols

1.4

Network Security

1.4.1Forms of Attack 1.4.2Penetration Testing 1.4.3Malware 1.4.4How Malware Spreads 1.4.5Social Engineering 1.4.6Phishing 1.4.7Cracking Passwords 1.4.8Denial of Service Attacks 1.4.9Data Interception 1.4.10Methods of Data Interception 1.4.11SQL Injection 1.4.12Network Administration 1.4.13Network Forensics 1.4.14Protecting Against Malware 1.4.15Firewalls 1.4.16User Access Levels 1.4.17Passwords 1.4.18Encryption 1.4.19End of Topic Test - Networks

1.5

Systems Software

1.5.1System Software 1.5.2Utility Software 1.5.3Operating Systems 1.5.4User Interfaces 1.5.5Memory & Process Management 1.5.6File Management 1.5.7Device Management 1.5.8User Management 1.5.9Encryption Software 1.5.10Defragmentation Software 1.5.11Data Compression Software 1.5.12Backup Software

1.6

Ethical, Legal, Cultural & Environmental Concern

2

Computational Thinking, Algorithms & Programming

2.1

Algorithms

2.1.1Computational Thinking - Abstraction 2.1.2Computational Thinking - Decomposition 2.1.3Algorithmic Thinking 2.1.4Pseudocode 2.1.5Flowchart Diagrams 2.1.6Interpreting Algorithms 2.1.7Correcting Algorithms 2.1.8Completing Algorithms 2.1.9Search Algorithms 2.1.10Binary Search 2.1.11Linear Search 2.1.12Overview of Sort Algorithms 2.1.13Bubble Sort 2.1.14Merge Sort 2.1.15Insertion Sort 2.1.16Exam-Style Questions - Sorting Algorithms

2.2

Programming Fundamentals

2.3

Producing Robust Programs

2.3.1Defensive Design 2.3.2Validation & Sanitisation 2.3.3Authentication & Contingencies 2.3.4Maintainability 2.3.5Purpose of Testing 2.3.6Types of Testing 2.3.7Test Plans 2.3.8Types of Errors 2.3.9End of Topic Test - Programming 2.3.10Exam-Style Questions - Testing

2.4

Boolean Logic

2.4.1Binary Systems 2.4.2Logic Circuits 2.4.3Boolean Logic 2.4.4Boolean Operators 2.4.5Grade 9 - Logic

2.5

Programming Languages & IDEs

2.5.1High-Level vs Low-Level Languages 2.5.2Translation - Compliers & Interpreter 2.5.3Translation - Assemblers 2.5.4Integrated Development Environments 2.5.5Exam-Style Questions - Translation

Jump to other topics

1

Computer Systems

1.1

Systems Architecture

1.1.1Fetch-Execute Cycle 1.1.2Common CPU Components & Their Function 1.1.3Von Neumann Architecture 1.1.4Factors Affecting CPU Performance 1.1.5Embedded Systems 1.1.6Exam-Style Questions - Von Neumann Architecture 1.1.7Diagnostic Misconceptions - Embedded vs General

1.2

Memory & Storage

1.2.1Types of Memory 1.2.2Flash Memory 1.2.3Properties of Flash Memory 1.2.4Running Out of Memory 1.2.5Virtual Memory 1.2.6Units of Capacity 1.2.7Calculating Capacity Requirements 1.2.8Solid State Storage 1.2.9Properties of Solid State Media 1.2.10Magnetic Storage 1.2.11Properties of Magnetic Media 1.2.12Examples of Magnetic Storage 1.2.13Optical Storage 1.2.14Properties of Optical Media 1.2.15Examples of Optical Storage 1.2.16Types of Optical Disk 1.2.17Number Bases 1.2.18Converting Number Bases 1.2.19Hexadecimal 1.2.20Using Hexadecimal 1.2.21Converting Denary & Hexadecimal 1.2.22Binary Addition 1.2.23Binary Shifts 1.2.24Representing Text 1.2.25ASCII & Unicode 1.2.26Representing Images 1.2.27Converting Binary & Images 1.2.28Representing Sound 1.2.29Data Compression 1.2.30Grade 9 - Storage 1.2.31Exam-Style Questions - Primary Memory 1.2.32Exam-Style Questions - Storage 1.2.33Exam-Style Questions - Data Conversions 1.2.34Diagnostic Misconceptions - RAM vs ROM 1.2.35Diagnostic Misconceptions - Bits, Nibbles & Bytes 1.2.36Diagnostic Misconceptions - Bits Required to Store 1.2.37End of Topic Test - Computer Systems 1.2.38End of Topic Test - Representation

1.3

Computer Networks, Connections & Protocols

1.4

Network Security

1.4.1Forms of Attack 1.4.2Penetration Testing 1.4.3Malware 1.4.4How Malware Spreads 1.4.5Social Engineering 1.4.6Phishing 1.4.7Cracking Passwords 1.4.8Denial of Service Attacks 1.4.9Data Interception 1.4.10Methods of Data Interception 1.4.11SQL Injection 1.4.12Network Administration 1.4.13Network Forensics 1.4.14Protecting Against Malware 1.4.15Firewalls 1.4.16User Access Levels 1.4.17Passwords 1.4.18Encryption 1.4.19End of Topic Test - Networks

1.5

Systems Software

1.5.1System Software 1.5.2Utility Software 1.5.3Operating Systems 1.5.4User Interfaces 1.5.5Memory & Process Management 1.5.6File Management 1.5.7Device Management 1.5.8User Management 1.5.9Encryption Software 1.5.10Defragmentation Software 1.5.11Data Compression Software 1.5.12Backup Software

1.6

Ethical, Legal, Cultural & Environmental Concern

2

Computational Thinking, Algorithms & Programming

2.1

Algorithms

2.1.1Computational Thinking - Abstraction 2.1.2Computational Thinking - Decomposition 2.1.3Algorithmic Thinking 2.1.4Pseudocode 2.1.5Flowchart Diagrams 2.1.6Interpreting Algorithms 2.1.7Correcting Algorithms 2.1.8Completing Algorithms 2.1.9Search Algorithms 2.1.10Binary Search 2.1.11Linear Search 2.1.12Overview of Sort Algorithms 2.1.13Bubble Sort 2.1.14Merge Sort 2.1.15Insertion Sort 2.1.16Exam-Style Questions - Sorting Algorithms

2.2

Programming Fundamentals

2.3

Producing Robust Programs

2.3.1Defensive Design 2.3.2Validation & Sanitisation 2.3.3Authentication & Contingencies 2.3.4Maintainability 2.3.5Purpose of Testing 2.3.6Types of Testing 2.3.7Test Plans 2.3.8Types of Errors 2.3.9End of Topic Test - Programming 2.3.10Exam-Style Questions - Testing

2.4

Boolean Logic

2.4.1Binary Systems 2.4.2Logic Circuits 2.4.3Boolean Logic 2.4.4Boolean Operators 2.4.5Grade 9 - Logic

2.5

Programming Languages & IDEs

2.5.1High-Level vs Low-Level Languages 2.5.2Translation - Compliers & Interpreter 2.5.3Translation - Assemblers 2.5.4Integrated Development Environments 2.5.5Exam-Style Questions - Translation

Practice questions on Binary Shifts

Can you answer these? Test yourself with free interactive practice on Seneca — used by over 10 million students.

1
What is the result of two left binary shifts on 00110100?Multiple choice
2
How can a number be multiplied by eight using binary shifts?Multiple choice
3
When performing binary addition on two 8 bit numbers, an overflow error may occur. Select the reason for this. Multiple choice
4
Perform binary addition on 01001100 and 00000001. Your answer should be represented by the fewest bits possible. Multiple choice
5
Perform binary addition on 11001001 and 10001011.Multiple choice

Answer all questions on Binary Shifts

Unlock your full potential with Seneca Premium

Unlimited access to 10,000+ open-ended exam questions
Mini-mock exams based on your study history
Unlock 800+ premium courses & e-books

Get started with Seneca Premium

Binary Addition

Representing Text