Hints:
• This project is almost impossible without the use of the shift left (<<) and shift right (>>)
C operators. Remember that in C, the right shift operator, >>, behaves differently on
signed and unsigned data types.
• Constants in C are signed ints (32 bits long) by default. To get unsigned long constants,
either use an “UL” suffix, or cast the constant to a long type, e.g. “1UL<<numShift” or
((floatx)1)<<numShift.
• To make a mask field of 1 bits in bit positions 0-n, use the formula we proved as an
inductive theorem when we talked about recursion: 2
(
Hello. How are you .
I have read .
I have strong knowledge in Data structures, Algorithms Design,
Computer Architecture,.
And I'm expert in C/C++ etc.
I'm interested in this project.
Please send me a message so that we can discuss more.
Then I'll be happy.
I wait for your good reply.
Thanks.