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
BaLLatris [955]
3 years ago
5

A stomp rocket is a toy consisting of a hose connected to a blast pad (i.e., an air bladder) at one end and to a short pipe moun

ted on a tripod at the other end. A rocket with a hollow body is mounted onto the pipe and is propelled into the air by stomping on the blast pad. Some manufacturers claim that one can shoot a rocket over 200 ft in the air. Neglecting air resistance, determine the rocket’s minimum initial speed such that it reaches a maximum fligh height of 200 ft.

Engineering
1 answer:
lesya [120]3 years ago
8 0

Answer:

Explanation:

The detailed steps is as shown in the attachment.

You might be interested in
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 well-insulated tank in a vapor power plant operates at steady state. Saturated liquid water enters at inlet 1 at a rate of 125
kompoz [17]

Answer:

a. The mass flow rate (in lbm/s) is 135lbm/s

b. The temperature (in o F) is 200.8°F

Explanation:

We assume that potential energy and kinetic energy are negligible and the control volume operates at a steady state.

Given

a. The mass flow rate (in lbm/s) is 135lbm/s

b.

m1 = Rate at inlet 1 = 125lbm/s

m2 = Rate at inlet 2 = 10lbm/s

The mass flow rate (in lbm/s) is calculated as m1 + m2

Mass flow rate = 125lbm/s + 10lbm/s

Mass flow rate = 135lbm/s

Hence, the mass flow rate (in lbm/s) is 135lbm/s

b. To calculate the temperature.

First we need to determine the enthalpy h1 at 14.7psia

Using table A-3E (thermodynamics)

h1 = 180.15 Btu/Ibm

h2 at 14.7psia and 60°F = 28.08 Btu/Ibm

Calculating h3 using the following formula

h3 = (h1m1 + h2m2) / M3

h3 = (180.15 * 125 + 28.08 * 10)/135

h3 = 168.8855555555555

h3 = 168.89 Btu/Ibm

To get the final temperature; we make use of table A-2E of thermodynamics.

Because h3 < h1, it means the liquid is at a compressed state.

The corresponding temperature at h3 = 168.89 is 200.8°F

The temperature (in o F) is 200.8°F

6 0
3 years ago
A vertical cylinder (Fig. P3.227) has a 61.18-kg piston locked with a pin, trapping 10 L of R-410a at 10◦C with 90% quality insi
Whitepunk [10]

Hey! How are you? My name is Maria, 19 years old. Yesterday broke up with a guy, looking for casual sex.

Write me here and I will give you my phone number - *pofsex.com*

My nickname - Lovely

4 0
3 years ago
Suppose there are n chairs in a row. We want to compute the number of ways to put 2 students into seats so that they are not nex
icang [17]

Complete Question

The complete question is shown on the first uploaded image

Answer:

a) f_{(n)} = f_{(n-1)} + n-2

b) g_{(n)} = g_(n+1) + (n-2)

Explanation:

The explanation is shown on the second and third uploaded image

8 0
3 years ago
Which of the following requires formwork?
vekshin1

Answer:

D

Explanation:

Masonry uses stone work, making a stone wall requires perfect masonry.

3 0
3 years ago
Other questions:
  • Which of the following can minimize engine effort in save fuel
    15·2 answers
  • Which tool is used to pull the tapered shaft on a tie-rod end from its mating steering component?
    9·1 answer
  • Before you calculate the moment capacity for a steel beam, you have to determine the classification of beam.
    10·1 answer
  • The goal of the following model is generate a clock waveform that has the clock high 4 time units and low 4 time units, with the
    15·1 answer
  • Which type of load generates a magnetic field?
    12·1 answer
  • The hot-wire anemometer.' A hot-wire anemome ter is essentially a fine wire, usually made of platinum,which is heated electrical
    6·1 answer
  • A pulse-jet baghouse is desired for a finished cement plant. Calculate the number of bags required to filter 500 m3/min of air w
    7·1 answer
  • An open top concrete tank is available to a construction crew to store water. The job site has a daily requirement for 500 gallo
    10·1 answer
  • Air at 403 K and 1 atm enters a convergent nozzle at a velocity of 150
    9·1 answer
  • A wheel spins at a constant angular speed of 24rad/s.How many revolutions will the dosk go through in 5minutes?​
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!