<Li> Rotate: the operand is treated as a circular buffer of bits so its least and most significant bits are effectively adjacent . </Li> <Li> Rotate through carry: the carry bit and operand are collectively treated as a circular buffer of bits . </Li> <P> In integer arithmetic computations, multiple - precision arithmetic is an algorithm that operates on integers which are larger than the ALU word size . To do this, the algorithm treats each operand as an ordered collection of ALU - size fragments, arranged from most - significant (MS) to least - significant (LS) or vice versa . For example, in the case of an 8 - bit ALU, the 24 - bit integer 0x123456 would be treated as a collection of three 8 - bit fragments: 0x12 (MS), 0x34, and 0x56 (LS). Since the size of a fragment exactly matches the ALU word size, the ALU can directly operate on this "piece" of operand . </P> <P> The algorithm uses the ALU to directly operate on particular operand fragments and thus generate a corresponding fragment (a "partial") of the multi-precision result . Each partial, when generated, is written to an associated region of storage that has been designated for the multiple - precision result . This process is repeated for all operand fragments so as to generate a complete collection of partials, which is the result of the multiple - precision operation . </P>

Explain the working of an alu with the help of a diagram