Answer:
please mark as brainliest!!
Explanation:
public class SumOfDigits{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); System.out.println("Please enter a number to calculate sum of digits"); int number = sc.nextInt(); // Remember number/10 reduces one digit from number // and number%10 gives you last digit int sum = 0; int input = number; while (input != 0) { int lastdigit = input % 10; sum += lastdigit; input /= 10; } System.out.printf("Sum of digits of number %d is %d", number, sum); // closing Scanner to prevent resource leak sc.close(); } }
Answer:
to compose letters and memos
to create charts and graphs from a table of
values
to deliver a sales presentation to clients
Explanation:
I forget what the reasoning behind them but I know this is the answer
Something like the following. Also you need to give what language you are using. Anyways, you should be able to convert this to your language of choice.
<script type="text/javascript">
function checkGeneration() {
var gen = ["Baby Boomer ","Generation X","Xennials","Generation Y"];
var reversestr = "";
var getyear = window.prompt("Enter a 3 digit number: ");
if (parseInt(getyear) <= 1964) {
alert(gen[0]);
} else if(parseInt(getyear) <= 1979) {
alert(gen[1]);
} else if(parseInt(getyear) <= 1985) {
alert(gen[2]);
} else if(parseInt(getyear) <= 1995) {
alert(gen[3]);
}
}
checkGeneration();
</script>
Answer:
a) AL will contains 0011 1100
Explanation:
In assembly language, shifting bits in registers is a common and important practice. One of the shifting operations is the SHR AL, x where the x specifies that the bits be shifted to the right by x places.
SHR AL, 2 therefore means that the bits contained in the AL should be shifted to the right by two (2) places.
For example, if the AL contains binary 1000 1111, the SHR AL, 2 operation will cause the following to happen
Original bit => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) | (0) |
Notice;
(i) that there are two shifts - one at a time.
(ii) that the bits in bold face are the bits in the AL after the shift. Those that in regular face are those in the carry flag.
(iii) that the new bits added to the AL after a shift are the ones in bracket. They are always set to 0.
