Question

1. Implement an algorithm to convert binary number into an integer. Binary number is represented as a string. Ex. int n = to_int("01010");

int to_int(const std::string& b) {

}

2. Implement an algorithm to convert a decimal number to binary. The return type is string which holds the binary number as string.

std::string to_binary(int n) {

}

3. Implement a function to check if the number is positive or negative. The function should return true if number is positive.

bool is_positive(int n) {

}

4. Implement an algorithm to print all possible values of 32 bit unsigned integer one bit position set.

Output should look like.

1

2

4

8

16

Answer 1

#include <iostream>
#include <string>

using namespace std;

int to_int(const std::string& b) {
    int result = 0;
    for (int i = 0; i < b.length(); ++i) {
        result *= 2;
        result += b[i]-'0';
    }
    return result;
}

std::string to_binary(int n) {
    string ret = "";
    while (n > 0) {
        ret += '0' + (n % 2);
        n /= 2;
    }
    return ret;
}

bool is_positive(int n) {
    return n > 0;
}

void all_values() {
    unsigned int n = 1;
    for (int i = 0; i < 32; ++i) {
        cout << n << endl;
        n <<= 1;
    }
}

int main() {
    cout << to_int("101001") << endl;
    cout << to_binary(41) << endl;
    cout << is_positive(3) << endl;
    cout << is_positive(-5) << endl;
    all_values();
    return 0;
}