1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Arada [10]
3 years ago
14

The information on a can of pop indicates that the can contains 360 mL. The mass of a full can of pop is 0.369 kg, while an empt

y can weighs 0.153 N. Determine the specific weight, density, and specific gravity of the pop and compare your results with the corresponding values for water at 20° C. Express your results in SI units.
Engineering
1 answer:
AlekseyPX3 years ago
6 0

Answer

given,

volume of the can = 360 mL  = 360 x 10⁻⁶ m³

mass of the full can of pop = 0.369 kg

weight of the empty can = 0.153 N

temperature of water = 20⁰C

weight of the full can

 W = m g

 W = 0.369 x 9.8 = 3.616 N

Weight of the pop in can

w₂ = W - w₁

w₂ = 3.616 - 0.153

w₂ = 3.463 N

w₂ is weight of the liquid

Specific weight of the liquid

\gamma = \dfrac{weight\ of\ liquid}{volume\ of\ liquid}

\gamma = \dfrac{3.463}{360\times 10^{-6}}

\gamma =9.6\times 10^3\ N/m^3

density of liquid

\rho = \dfrac{\gamma}{g}

\rho = \dfrac{9.6\times 10^3}{9.8}

    ρ = 979.59 Kg/m³

specific gravity of the fluid

SG = \dfrac{density\ of\ liquid}{density\ of\ water}

SG = \dfrac{979.59}{1000}

   SG = 0.979

Specific gravity of pop is equal to 0.979

You might be interested in
If 1 inch equals 10 feet, what would the measured distance be if the line scaled 1 1/2 inches?
Crank

Answer: B. 15 feet

Explanation:

4 0
3 years ago
Read 2 more answers
Yeah order for a firm voltage dividers to operate properly The load resistance value should be at least Times greater than resis
Svetlanka [38]

Answer:

A voltage divider is a simple series resistor circuit. It's output voltage is a fixed fraction of its input voltage. The divide-down ratio is determined by two resistors.

7 0
3 years ago
Implement a quick sort algorithm that will accept an integer array of size n and in random order. Develop or research three diff
Nostrana [21]

Answer:

#include <cstdlib>  

#include <iostream>  

#include <array>  

using namespace std;  

const string APP_NAME = "Quick Sort Algorithm";  

const array<string, 3> MENU_OPTIONS = {  

"Simulate with Random data",  

"Enter data",  

"Exit program"  

};  

void printMenuOptions() {  

cout << endl << "---------------------------" << endl;  

cout << APP_NAME << endl;  

cout << "---------------------------" << endl;  

for (int i=0; i<MENU_OPTIONS.size(); i++) {  

cout << i+1 << ". " << MENU_OPTIONS[i] << endl;  

}  

cout << endl << "Select an option: ";  

}  

int getRandomInt(int min, int max) {  

return min + (static_cast<int>(rand() % (max - min + 1)));  

}  

bool inArray(int value, int* arr, int size) {  

bool found = false;  

for (int i=0; i<size; i++) {  

if (arr[i] == value) {  

found = true;  

}  

}  

return found;  

}  

void generateRandomArrays(int size, int* arr0, int* arr1, int* arr2, int* arr3) {  

int value;  

bool ok = false;  

for (int i=0; i<size; i++) {  

while (!ok) {  

value = getRandomInt(1, size*10);  

if (!inArray(value, arr0, size)) {  

arr0[i] = value;  

arr1[i] = value;  

arr2[i] = value;  

arr3[i] = value;  

ok = true;  

}  

}  

ok = false;  

}  

}  

void print(int* data, int size) {  

for (int i=0; i<size; i++) {  

cout << data[i] << " ";  

}  

}  

int getPivot(int first, int last, int approach) {  

int pivot;  

switch (approach) {  

case 2:  

pivot = first;  

break;  

case 3:  

pivot = last;  

break;  

case 1:  

default:  

pivot = (first + last) / 2;  

}  

return pivot;  

}  

void swap(int* data, int i, int j) {  

int temp = data[i];  

data[i] = data[j];  

data[j] = temp;  

}  

int quickSort(int* data, int first, int last, int approach) {  

int ops = 0;  

int i = first;  

int j = last;  

int pivot = getPivot(i, j, approach);  

while (i <= j) {  

while (data[i] < data[pivot]) {  

i++;  

}  

while (data[j] > data[pivot]) {  

j--;  

}  

if (i <= j) {  

ops++;  

swap(data, i, j);  

i++;  

j--;  

}  

}  

if (j > first) {  

ops += quickSort(data, first, j, approach);  

}  

if (i < last) {  

ops += quickSort(data, i, last, approach);  

}  

return ops;  

}  

void simulate(int size, bool display) {  

int* data0 = new int[size];  

int* data1 = new int[size];  

int* data2 = new int[size];  

int* data3 = new int[size];  

int ops1, ops2, ops3;  

generateRandomArrays(size, data0, data1, data2, data3);  

ops1 = quickSort(data1, 0, size-1, 1);  

ops2 = quickSort(data2, 0, size-1, 2);  

ops3 = quickSort(data3, 0, size-1, 3);  

if (display) {  

cout << "Unsorted Array: ";  

print(data0, size);  

}  

cout << endl << endl << "> QuickSort #1: pivot is at the median" << endl;  

cout << "Swaps done: " << ops1 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data1, size);  

}  

cout << endl << endl << "> QuickSort #2: pivot is at the start" << endl;  

cout << "Swaps done: " << ops2 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data2, size);  

}  

cout << endl << endl << "> QuickSort #3: pivot is at the end" << endl;  

cout << "Swaps done: " << ops3 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data3, size);  

}  

}  

void enterArray(int size, bool display) {  

// declare some variables  

int* data0 = new int[size];  

int* data1 = new int[size];  

int* data2 = new int[size];  

int* data3 = new int[size];  

int ops1, ops2, ops3;  

int value;  

for (int i=0; i<size; i++) {  

cout << "Enter value " << i+1 << " of " << size << ": ";  

cin >> value;  

data0[i] = value;  

data1[i] = value;  

data2[i] = value;  

data3[i] = value;  

}  

ops1 = quickSort(data1, 0, size-1, 1);  

ops2 = quickSort(data2, 0, size-1, 2);  

ops3 = quickSort(data3, 0, size-1, 3);  

if (display) {  

cout << "Unsorted Array: ";  

print(data0, size);  

}  

cout << endl << endl << "> QuickSort #1: pivot is at the median" << endl;  

cout << "Swaps done: " << ops1 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data1, size);  

}  

cout << endl << endl << "> QuickSort #2: pivot is at the start" << endl;  

cout << "Swaps done: " << ops2 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data2, size);  

}  

cout << endl << endl << "> QuickSort #3: pivot is at the end" << endl;  

cout << "Swaps done: " << ops3 << endl;  

if (display) {  

cout << "Sorted Array: ";  

print(data3, size);  

}  

}  

int main(int argc, char** argv) {  

int choice;  

char option;  

int num;  

bool end = false;  

bool display = false;  

while (!end) {  

printMenuOptions();  

cin >> choice;  

switch (choice) {  

case 1:  

cout << endl << "Enter size of array (elements will be integers randomly generated): ";  

cin >> num;  

if (num > 0) {  

cout << "Values will be randomly generated from 1 to " << num*10 << endl;  

cout << "Do you want to display the sorted arrays? <y/N>: ";  

cin >> option;  

display = (option == 'y') ? true : false;  

simulate(num, display);  

} else {  

cout << endl << "Incorrect size." << endl;  

}  

break;  

case 2:  

cout << endl << "Enter size of array (you will enter the numbers): ";  

cin >> num;  

if (num > 0) {  

cout << "Do you want to display the sorted arrays? <y/N>: ";  

cin >> option;  

display = (option == 'y') ? true : false;  

enterArray(num, display);  

} else {  

cout << endl << "Incorrect size." << endl;  

}  

break;  

case 3:  

end = true;  

break;  

default:  

cout << endl << "Incorrect option. Try again." << endl;  

}  

}  

return 0;  

}

8 0
4 years ago
A projectile is launched horizontally 1m above the ground. If it lands 300m away from the initial launch position, find: a)-the
PIT_PIT [208]

Answer:

(a): The launch velocity is Vx= 666.66 m/s.

(b): The angle wich the projectile contacts the ground is α= 0.38°

Explanation:

h= 1m

g= 9.8 m/s²

h= g*t²/2

t= 0.45 s

Vy= g*t

Vy= 4.42 m/s

d=Vx* t

Vx= 666.66 m/s (a)

α= tg⁻¹ ( Vy/Vx)

α= 0.38° (b)

4 0
3 years ago
A disc brake rotor is being machined. Technician A says that a feed rate of 0.0008 inch per revolution and 150 RPM is where the
erma4kov [3.2K]

Answer:

Technician B only

Explanation:

During rotor reconditioning, which is the process also known as machining and sanding, where sanding is the involves the application of between 120 and 150 grit sandpaper while using a non-excessive force that is applied non-directionally for up to 60 seconds on each side such that the surface roughness meets OE standards. The rotors are then cleaned by washing after they are serviced before they can then be installed.

3 0
3 years ago
Other questions:
  • Using your knowledge of how an ATM is used, develop a set of use-cases that could serve as a basis for understanding the require
    11·1 answer
  • What should you following distance be at night
    6·1 answer
  • A fuel oil is burned with air in a furnace. The combustion produces 813 kW of thermal energy, of which 65% is transferred as hea
    13·1 answer
  • PLLLLLEEESSSEEE IIII NEED ASAP
    12·2 answers
  • Air exits the compressor and enters the combustor of a gas turbine engine with a flow rate of 84 kg/s at 800 K. Ethane (C2H6) at
    12·1 answer
  • What is the amperage rating of an electrical device that uses 12 kilowatts of electricity when operated for 6 hours in a 120-vol
    12·1 answer
  • Madison how do you do this
    10·2 answers
  • 2. Technician A says that the torque converter and transmission change engine revolutions per minute into torque to move the veh
    6·1 answer
  • Write down the three formula to find the three types of slope of curve Q with respect to L.
    5·2 answers
  • the water level in a tank is 20 m above the ground. a hose is connected to the bottom of the tank, and the nozzle at the end of
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!