Guess is a string. By default the input function returns string types.
Import java.util.Scanner;
public class MinutesConversion {
private static Scanner inputDevice;
public static void main(String[] args) {
int minutes, hours;
float days; // float for decimal point
inputDevice = new Scanner(System.in);
System.out.println("Please enter minutes for conversion >> ");
minutes = inputDevice.nextInt();
hours = minutes / 60;
days = hours / 24.0f;
System.out.println(+ minutes + " minutes is " + hours + " hour(s) or" + days " days");
}
}
Answer:
The correct answer to the following question is option b.)sends messages involving products of companies previously sued under the CAN-SPAM Act.
Explanation:
This act is an act of Controlling the Assault of Non-Solicited Marketing And Other things.
It is the law that establish the rules for the commercial message and the commercial e-mails, gives recipients right to have the business stops emailing them, and they outline the penalties incurred for those person who has violated the law.
Answer:
Explanation:
The Hexa-decimal numbers have base 16 and includes numbers:
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F
The given steps are performed to convert a decimal number to hexa-decimal number, here to convert decimal number 35 to hexa-decimal number:
- Divide 35 by 16
- Note the remainder, r which is 3 here and quotient which is 2
- Again divide 2 (quotient) by 16 and note the remainder, r' which is 2 and quotient is 0
- We will stop here as the quotient is now 0. Usually division by 16 is repeated until we get quotient = 0
- Now arrange the remainder in reverse order to get the hexa-decimal number as r'r
- The hexa-decimal number is
Answer:
import sys
import turtle
import random
def n_pointed_star(total_points):
if total_points <= 4:
raise ValueError('Not enough total_points')
area = 150
for coprime in range(total_points//2, 1, -1):
if greatest_common_divisor(total_points, coprime) == 1:
start = turtle.position()
for _ in range(total_points):
turtle.forward(area)
turtle.left(360.0 / total_points * coprime)
turtle.setposition(start)
return
def greatest_common_divisor(a, b):
while b != 0:
a, b = b, a % b
return a
turtle.reset()
n_pointed_star(5)
Explanation:
- Inside the n_pointed_star function, check whether the total no. of points are less than or equal to 4 and then throw an exception.
- Loop through the total_points variable and check whether the result from greatest_common_divisor is equal to 1 or not and then set the starting position of turtle and move it.
- Create the greatest_common_divisor which takes two parameters a and b to find the GCD.
- Finally reset the turtle and call the n_pointed_star function.
