OurBigBook About$ Donate
 Sign in Sign up

Bit shift

 Ancestors will show here when the tree index is updated
2026-10-13  NaN By others on same topic  0 Discussions Create my own version
A fixed-width left shift discards high bits and inserts low zeros. A logical right shift inserts high zeros; an arithmetic right shift propagates the sign bit. In Java, <<, >>> and >> distinguish these operations. Left shift by k is multiplication by 2k modulo the word modulus.
// Destination: computer-science.bigb

 Incoming links (4)

  • Paging
  • Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 10 / e / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 3 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 5 / 8 / b / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (NaN)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook