Answer:
2^32 times as many values can be represented
Explanation:
32-bit. This means that the number is represented by 32 separate one’s and zero’s. 32 bits of 2 possible states = 2^32=4,294,967,296 possible values.
Integer meaning that only whole multiples of one are accepted.
Signed meaning that negative values are accepted. This halves the number of possible positive values (roughly), so the largest number you can represent is 2^31–1=2,147,483,647, but instead of 0, the smallest number you can represent is -2,147,483,648. An unsigned 32-bit integer, by contrast, can represent anything from 0 to 4,294,967,295.
Answer:
b=0
c=0
lol=list()
while True:
salary=input("Enter your salary: ")
if salary=="e" or salary=="E":
print("Thankyou!!")
break
else:
a=int(salary)
if a>=300000 and a<=400000:
c=c+1
if a<0 or a>400000:
print("Your salary is either too small or too big ")
if a>0 and a<=400000:
a=a-(25/100*a)-(5/100*a)-(2/100*a)
lol.append(a)
b=b+1
if a>=300000:
c=c+1
print(lol)
print("The number of salaries entered is: "+ str(b))
print("The number of salaries that exceeded 300000 is: "+str(c))
One shortcoming of rapid application development (RAD) is a narrow focus, which might limit future development.
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
class NestedLoops {
public static void main (String [] args) {
int numRows = 4;
int numCols = 5;
int i,j;
char ch = 'A';
// Note: You'll need to declare more variables
/* Your solution goes here */
for ( i = 0; i < numRows; i++) { // Outer loop runs for numRows times
for ( j = 0; j < numCols; j++) { // Inner loop runs for numCols times
System.out.print(i+1);
System.out.print((char)(ch+j));
System.out.print(" ");
}
}
System.out.println("");
return;
}
}
