All categories

3 years ago

This refers to the people involved in the data processing operation.

Computers and Technology

1 answer:

yawa3891 [41]3 years ago

6 0

The people involved in the data processing operation are known as Peopleware.

You might be interested in

Write a program that will predict the size of a population of organisms. The program should ask the user for the starting number

sineoko [7]

Answer:

// using c++ language

#include "stdafx.h";

#include <iostream>

#include<cmath>

using namespace std;

//start

int main()

{

//Declaration of variables in the program

double start_organisms;

double daily_increase;

int days;

double updated_organisms;

//The user enters the number of organisms as desired

cout << "Enter the starting number of organisms: ";

cin >> start_organisms;

//Validating input data

while (start_organisms < 2)

{

cout << "The starting number of organisms must be at least 2.\n";

cout << "Enter the starting number of organisms: ";

cin >> start_organisms;

}

//The user enters daily input, here's where we apply the 5.2% given in question

cout << "Enter the daily population increase: ";

cin>> daily_increase;

//Validating the increase

while (daily_increase < 0)

{

cout << "The average daily population increase must be a positive value.\n ";

cout << "Enter the daily population increase: ";

cin >> daily_increase;

}

//The user enters number of days

cout << "Enter the number of days: ";

cin >> days;

//Validating the number of days

while (days<1)

{

cout << "The number of days must be at least 1.\n";

cout << "Enter the number of days: ";

cin >> days;

}

//Final calculation and display of results based on formulas

for (int i = 0; i < days; i++)

{

updated_organisms = start_organisms + (daily_increase*start_organisms);

cout << "On day " << i + 1 << " the population size was " << round(updated_organisms)<<"."<<"\n";

start_organisms = updated_organisms;

}

system("pause");

return 0;

//end

}

Explanation:

6 0

3 years ago

The following program calculates yearly and monthly salary given an hourly wage. The program assumes a work-hours-per-week of 40

irina [24]

Answer:

The program implemented in Python is as follows:

hourly=float(input("Hourly Wage: "))

print("Annual Rate: "+str(hourly * 40 * 50))

print("Monthly Rate: "+str(round((hourly * 40 * 50/12),2)))

Explanation:

The question is incomplete as the missing code is not given. However, I've written the program from scratch in python.

This prompts the program user for the hourly Wage;

hourly=float(input("Hourly Wage: "))

This calculates and prints the annual rate

print("Annual Rate: "+str(hourly * 40 * 50))

This calculates and prints the monthly rate

print("Monthly Rate: "+str(round((hourly * 40 * 50/12),2)))

Note:

The annual rate is calculated by multiplying the hourly wage to number of hours per week (40) to number of weeks per year (50)

The monthly rate is calculated by $annual\ rate/12$

5 0

3 years ago

2. Imagine you play a game of fetch with the dog. It takes the dog 60 seconds to run a total of 180 meters. What was the dog's a

vodka [1.7K]

180 meters in 60 seconds is an average speed of 180m/60s = 3 m/s.

3 0

4 years ago

Create a function that takes a list of numbers between 1 and 10 (excluding one number)

Luda [366]

def missing_num(lst):

for n in range(1,11):

if n not in lst:

print(n)

lst = (1,3,4,5,6,7,8,9,10)

missing_num(lst)

I hope this helps!

8 0

3 years ago

Whats an effective way to sort linked lists in cpp.

irina [24]

Answer:

Using Merge Sort.

Explanation:

Merge Sort is preferred for sorting the linked list because the the data stored in linked list is not in serial memory address which makes the quick sort algorithm very slow and other sorting algorithms impossible.

Merge Sort is a divide and conquer algorithm.

In this algorithms we divide the linked list into sub parts and sort the sub parts of the linked list and then we merge them in sorted order. It is a very effective approach for linked list sorting.

The time complexity of merge sort is O(NLogN).

6 0

3 years ago