Math and science are the foundation from which drafters work True False

Write a program to calculate the total salary of the employees in an office. The program will first prompt the user to enter the

raketka [301]

Answer:

import java.util.Scanner;

public class Salary

{

public static void main(String[] args) {

int numberOfEmployees;

double payRate, numberOfHours, totalPay = 0;

Scanner input1 = new Scanner(System.in);

Scanner input2 = new Scanner(System.in);

System.out.print("Enter the number of employees: ");

numberOfEmployees = input1.nextInt();

for(int i=1; i<=numberOfEmployees; i++) {

System.out.print("Enter the pay rate for employee " + i + ": ");

payRate = input2.nextDouble();

System.out.print("Enter the number of hours worked: ");

numberOfHours = input2.nextDouble();

totalPay += (payRate * numberOfHours);

}

System.out.println("Total payment is: "+ totalPay);

}

Explanation:

- Declare the variables

- Ask the user the for the number of employees

- Inside the for loop, ask the user for pay rate and hours worked for each employee

- Calculate the total pay

- Outside of the loop, print the total pay

6 0

3 years ago

Read 2 more answers

Which of the following are actions a programmer could take when debugging a segment of code that would most likely lead to findi

Verizon [17]

Answer:

Option B and C are the correct answer for the above question

Explanation:

The above question asked about the work of the programmer to catch an error of the program--

Then the option B states that the programmer needs to prints the value of the various program variable on every line of the program which is the correct solution because it is used to find the error easily. It defines the value of every variable in every place of the program and the programmer caught the error statement in the program if anywhere the variable gets the false value.
The C option states to help from a friend, it is also a good solution because the friend can easily be caught the error of the program by seeing every line of code.
But the other option is not correct because the option A states that the change the name of the variable which is not a result of anything.
And the option D states that the code will be retyped again which is also not justify anything.

6 0

2 years ago

When _______ wordart, you need to consider both the font size of the text and the size of the text box that contains wordart?

padilas [110]

The correct answer is resizing. If you're making a logo and creating wordart. you have to care about resizing because the art needs to be clearly visible and appealing no matter the size. If you place it in a box, you have to care that it doesn't go over the edges of the box or anything similar that might seem appalling.

4 0

3 years ago

You have been tasked with designing an Ethernet network. Your client needs to implement a very high-speed network backbone betwe

lorasvet [3.4K]

Answer:

A and C

Explanation:

From the above scenario, the Ethernet standards that meet the above guidelines are:

A. 1000BaseSX; and

C. 10GBaseSR.

Cheers

3 0

3 years ago

The Sieve of Eratosthenes is an elegant algorithm for finding all the prime numbers up to some limit n. The basic idea is to fir

IRISSAK [1]

Answer:

Check the explanation

Explanation:

#!usr/bin/python

#FileName: sieve_once_again.py

#Python Version: 2.6.2

#Author: Rahul Raj

#Sat May 15 11:41:21 2010 IST

fi=0 #flag index for scaling with big numbers..

n=input('Prime Number(>2) Upto:')

s=range(3,n,2)

def next_non_zero():

"To find the first non zero element of the list s"

global fi,s

while True:

if s[fi]:return s[fi]

fi+=1

def sieve():

primelist=[2]

limit=(s[-1]-3)/2

largest=s[-1]

while True:

m=next_non_zero()

fi=s.index(m)

if m**2>largest:

primelist+=[prime for prime in s if prime] #appending rest of the non zero numbers

break

ind=(m*(m-1)/2)+s.index(m)

primelist.append(m)

while ind<=limit:

s[ind]=0

ind+=m

s[s.index(m)]=0

#print primelist

print 'Number of Primes upto %d: %d'%(n,len(primelist))

if __name__=='__main__':

sieve()

4 0

2 years ago