Answer:
The decimal value of 101₂² base 2 = 25 base 10
Explanation:
The number 101₂² in decimal value is found as follows;
101₂ × 101₂ = 101₂ + 0₂ + 10100₂
We note that in 101 + 10100 the resultant 2 in the hundred position will have to be converted to a zero while carrying over 1 to the thousand position to give;
101₂ + 0₂ + 10100₂ = 11001₂
Therefore;
101₂² = 11001₂
We now convert the result of the square of the base 2 number, 101², which is 11001₂ to base 10 as follows;
Therefore converting 11001₂ to base 10 gives;
11001₂= 1 × 2⁴ + 1 × 2³ + 0 × 2² + 0 × 2 ¹ + 1 × 2⁰
Which gives;
16 + 8 + 0 + 0 + 1 = 25₁₀.
Answer:
A Program was written to carry out some set activities. below is the code program in C++ in the explanation section
Explanation:
Solution
CODE
#include <iostream>
using namespace std;
int main() {
string name; // variables
int number;
cin >> name >> number; // taking user input
while(number != 0)
{
// printing output
cout << "Eating " << number << " " << name << " a day keeps the doctor away." << endl;
// taking user input again
cin >> name >> number;
}
}
Note: Kindly find an attached copy of the compiled program output to this question.
Answer:
Pseudocode is as follows:
// below is a function that takes two parameters:1. An array of items 2. An integer for weight W
// it returns an array of selected items which satisfy the given condition of sum <= max sum.
function findSubset( array items[], integer W)
{
initialize:
maxSum = 0;
ansArray = [];
// take each "item" from array to create all possible combinations of arrays by comparing with "W" and // "maxSum"
start the loop:
// include item in the ansArray[]
ansArray.push(item);
// remove the item from the items[]
items.pop(item);
ansArray.push(item1);
start the while loop(sum(ansArray[]) <= W):
// exclude the element already included and start including till
if (sum(ansArray[]) > maxSum)
// if true then include item in ansArray[]
ansArray.push(item);
// update the maxSum
maxSum = sum(ansArray[items]);
else
// move to next element
continue;
end the loop;
// again make the item[] same by pushing the popped element
items.push(item);
end the loop;
return the ansArray[]
}
Explanation:
You can find example to implement the algorithm.
In java...
public boolean checkSquare(int n){
int actualNumber = n;
int squareRoot = (int)Math.sqrt(n);
int squaredNumber = Math.pow(squareRoot,2);
if(squaredNumber==actualNumber){
return true;
} else {
return false;
}
}
Answer:
n=5
Explanation:
if n= 5
i. n/5=5/5=1 so it divides completely the remainder is 0
ii. 97 - 6(5) = 97 - 30 = 67, 67 is a prime number.
