Nios/bits2

A signed (two's complement) number of n bits can represent values between -2^n-1 and +(2^n-1-1), inclusive. Write a function that returns how many bits are needed to represent a given number, in signed binary representation.

unsigned int bits(int num);

Expected solution length: Around 15 lines.

Sample Input

0x1000

Sample Output

r2=14

# A test case to test your function with
.global _start
_start:
    movia r4, 0x1000
    call bits
    br _start        # End of testing code

# Return minimum number of bits to represent first parameter
bits:

Write your solution here

Upload a source file...

nios/bits2

nios/bits1Previous

Nextnios/add64

Nios/bits2

From ASMBits

Sample Input

Sample Output

Write your solution here

Or upload a file

Solution