For the first one its NOW, I'm not sure about the 2nd, the 3rd I think is penal code cases but i could be wrong, and the 4th one sounds like voting is the most logical answer.
Answer:
B. 11110111
Explanation:
Binary representation of number 9 = 00001001
Binary representation of -9 would involve calculating the twos complement representation of 00001001
First we compute the ones complement of this number by reversing the bits.
00001001 => 11110110
Next we calculate the twos complement representation by adding 1 to the ones complement.
11110110+1 = 11110111
So the final representation is 11110111.
Sometimes I just meet some Unintelligen ppl
Answer:
void countUp(int num)
{
if(num==0) //base case.
return;
countUp(num-1);//Recursive call.
cout<<num<<" "; //printing the number.
}
for input num=25
Output:-1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Explanation:
I have used recursion to print the numbers the function is in c++ language.In every recursive call we are decreasing num by 1.As the base case is reached.Then it will backtrack from 1 to num and then we are printing while backtracking.
