Answer:
- numberRed = numberBlue = FALSE
- numberBlue > numberGreen = FALSE
- numberGreen < numberRed = FALSE
- numberBlue = wordBlue = ILLEGAL
- numberGreen = "Green" = FALSE
- wordRed = "Red" = FALSE
- wordBlue = "Blue" = FALSE
- numberRed <= numberGreen = TRUE
- numberBlue >= 200 = TRUE
- numberGreen >= numberRed + numberBlue = TRUE
- numberRed > numberBlue AND numberBlue < numberGreen = FALSE
- numberRed = 100 OR numberRed > numberBlue = TRUE
- numberGreen < 10 OR numberBlue > 10 = FALSE
- numberBlue = 30 AND numberGreen = 300 OR numberRed = 200 = FALSE
Explanation:
THESE RESULTS ARE VERIFIRED.....
Answer:
import java.util.Scanner; public class Salesman2 {
public static void main(String[] args) { // TODO Auto-generated method stub double CommissionRate;
double TotalSales, Commission;
Scanner Read = new Scanner (System.in); System.out.println("Please enter total sales "); TotalSales=Read.nextDouble();
if (TotalSales<500)
CommissionRate=0.0;
else if (TotalSales>=500 && TotalSales <1000) CommissionRate=0.05;
else
CommissionRate=0.08;}
Commission = CommissionRate * TotalSales;
System.out.println("The Commision is: "+ Commission); }
}
}
Answer:
A) Number of bits for byte = 6 bits
B) number of bits for index = 17 bits
C) number of bits for tag = 15 bits
Explanation:
Given data :
cache size = 64 kB
block size = 32 -byte
block address = 32 -bit
number of blocks in cache memory
cache size / block size = 64 kb / 32 b = 2^11 hence the number of blocks in cache memory = 11 bits = block offset
A) Number of bits for byte
= 6 bits
B) number of bits for index
block offset + byte number
= 11 + 6 = 17 bits
c ) number of bits for tag
= 32 - number of bits for index
= 32 - 17 = 15 bits