How to resolve the algorithm Bitwise operations step by step in the Groovy programming language

Published on 12 May 2024 09:40 PM
#Groovy

How to resolve the algorithm Bitwise operations step by step in the Groovy programming language

Table of Contents

Problem Statement

Write a routine to perform a bitwise AND, OR, and XOR on two integers, a bitwise NOT on the first integer, a left shift, right shift, right arithmetic shift, left rotate, and right rotate. All shifts and rotates should be done on the first integer with a shift/rotate amount of the second integer. If any operation is not available in your language, note it.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Bitwise operations step by step in the Groovy programming language

Source code in the groovy programming language

def bitwise = { a, b ->
    println """
a & b   = ${a} & ${b}   = ${a & b}
a | b   = ${a} | ${b}   = ${a | b}
a ^ b   = ${a} ^ ${b}   = ${a ^ b}
~ a     = ~ ${a}     = ${~ a}
a << b  = ${a} << ${b}  = ${a << b}
a >> b  = ${a} >> ${b}  = ${a >> b}         arithmetic (sign-preserving) shift
a >>> b = ${a} >>> ${b} = ${a >>> b}  logical (zero-filling) shift
"""
}


bitwise(-15,3)

You may also check:How to resolve the algorithm Stack step by step in the Quackery programming language
You may also check:How to resolve the algorithm Read entire file step by step in the Inform 7 programming language
You may also check:How to resolve the algorithm Ethiopian multiplication step by step in the МК-61/52 programming language
You may also check:How to resolve the algorithm Events step by step in the Elixir programming language
You may also check:How to resolve the algorithm Bitmap/Bézier curves/Quadratic step by step in the Factor programming language