Back to 课程

Computer Science GCES OCR

0% Complete
0/0 Steps
  1. Cpu Architecture Performance And Embedded Systems Ocr
    5 主题
  2. Primary And Secondary Storage Ocr
    6 主题
  3. Data Storage And Compression Ocr
    12 主题
  4. Networks And Topologies Ocr
    6 主题
  5. Wired And Wireless Networks Protocols And Layers Ocr
    6 主题
  6. Identifying And Preventing Threats To Computer Systems And Networks Ocr
    2 主题
  7. Operating Systems And Utility Software Ocr
    2 主题
  8. Ethical Legal Cultural And Environmental Impact Ocr
    2 主题
  9. Computational Thinking Searching And Sorting Algorithms Ocr
    3 主题
  10. Designing Creating And Refining Algorithms Ocr
    5 主题
  11. Programming Fundamentals And Data Types Ocr
    5 主题
  12. Additional Programming Techniques Ocr
    7 主题
  13. Defensive Design And Testing Ocr
    6 主题
  14. Boolean Logic Diagrams Ocr
    2 主题
  15. Programming Languages And Integrated Development Environments Ides Ocr
    3 主题
  16. The Exam Papers Ocr
    2 主题
  17. Structuring Your Responses Ocr
    3 主题
课 Progress
0% Complete

Exam code:J277

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)

  • Binary shifts can cause a loss of precision by discarding bits, which can lead to changes in the numerical value

How do you perform a left shift of 1?

  • Here is the binary representation of the denary number 40

128

64

32

16

8

4

2

1

0

0

1

0

1

0

0

0

  • 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

128

64

32

16

8

4

2

1

 

 

0

1

0

1

0

0

0

= 40

0

1

0

1

0

0

0

0

= 80

  • 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

128

64

32

16

8

4

2

1

0

0

0

1

1

1

0

0

  • 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

128

64

32

16

8

4

2

1

 

 

 

0

1

1

1

0

0

= 28

0

1

1

1

0

0

0

0

= 112

  • 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

128

64

32

16

8

4

2

1

0

0

1

0

1

0

0

0

  • 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

128

64

32

16

8

4

2

1

 

0

0

1

0

1

0

0

 

= 40

0

0

0

1

0

1

0

0

= 20

  • 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

128

64

32

16

8

4

2

1

1

1

0

0

1

0

0

0

  • 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

128

64

32

16

8

4

2

1

Responses

您的邮箱地址不会被公开。 必填项已用 * 标注