sumapatil, what are you stuck? Try probing around and looking at the context help for these functions to figure them out. If you are still stuck, tell us where you are stuck and then we can better help.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions Unofficial Forum Rules and Guidelines "Not that we are sufficient in ourselves to claim anything as coming from us, but our sufficiency is from God" - 2 Corinthians 3:5
The Rotate function is a BIT shift. The shift is to the left (to MSb). So if the number of bits to shift is negative, it is really a shift to the right (to LSb). Since we are using the Rotate (and not the plain old shift), the bits that fall off get put back at the end.
Now since we are rotating by 4 bits (ie 1 hexidecimal character), a single hex character is just moved to the other end of the number.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions Unofficial Forum Rules and Guidelines "Not that we are sufficient in ourselves to claim anything as coming from us, but our sufficiency is from God" - 2 Corinthians 3:5
Can't say I've actually used rotate. I use shift all the time though with various protocols I have had to use. I'm sure there's algorithms out there that use rotate.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions Unofficial Forum Rules and Guidelines "Not that we are sufficient in ourselves to claim anything as coming from us, but our sufficiency is from God" - 2 Corinthians 3:5
We do alot of bit manipulation (spliting, joining, rotating, shifting, etc. etc.) in the FPGA world, I think the only time we do similar at Windows or RT level is when processing the data coming back from FPGA.
Thanks crosseulz , I was struggling to figure out how think about this in a CLAD exam context. Shifting a hex character is the way to think about this question.