It tells the amount of materials to be purchased.

"At 195 miles long, and with 7,325 miles of coastline, the Chesapeake Bay is the largest and most complex estuary in the United

Paraphin [41]

Answer:

see explaination

Explanation:

Part a) Width of bay at Potomac River:

Given Data:

· Actual Width at Potomac River = 30 miles

· Bay Model Length Ratio Lr = 1/1000

In fluid mechanics models of real structures are prepared in simulation so that they can be analyzed accurately. A model is known to have simulation if model carries same geometric, kinematic and dynamic properties at a small scale.

Length of any part in model = Actual length x Lr

Hence,

Model Width of bay at Potomac River = 30 x 1/1000 = 0.03 miles

Since 1 mile = 5280 ft

Model Width of bay at Potomac River = 0.03 x 5280 = 158.4 ft

Part b) Model Length of bay bridge in model:

Given Data:

· Actual Length of bay bridge = 4.3 miles

· Bay Model Length Ratio Lr = 1/1000

Model Length = Actual Length x Lr = 4.3 x 1/1000 = 0.0043 miles

Since 1 mile = 5280 ft

Model Length in feet = 0.0043 x 5280 = 22.704 ft

Part c) Model Length of bay bridge in model:

Given Data:

· Model Area = 8 acre

· Bay Model Length Ratio Lr = 1/1000

Model Area = Actual Area x Lr x Lr

8 Model Area :: Actual Area =- (Lp)2 2 = 8,000,000 acre 1000

Since 1 square mile = 640 acre,

Actual Area in square miles = 8,000,000/640 = 12,500 square miles

Part d) Average and maximum depth of model:

Given Data:

· Actual Average depth = 28 ft

· Actual Maximum depth = 174 ft

· Bay Model Length Ratio Lr = 1/1000

Model average depth = Actual average depth x Lr = 28 x 1/1000 = 0.028 feet

Since 1 ft = 12 inch

Model average depth in inch = 0.028 x 12 = 0.336 in

Model maximum depth = Actual maximum depth x Lr = 174 x 1/1000 = 0.174 feet

Since 1 ft = 12 inch

Model maximum depth in inch = 0.174 x 12 = 2.088 in

4 0

3 years ago

C#: Arrays - Ask the user how many students names they want to store. You will create two parallel arrays (e.g. 2 arrays with th

zhenek [66]

Answer:

using System;
public class Program
{
public static void Main()
{
Console.WriteLine("Enter number of students: ");
int num = Convert.ToInt32(Console.ReadLine());
string [] firstName = new string[num];
string [] lastName = new string[num];
for(int i=0 ; i < num; i++){
Console.WriteLine("Enter first name: ");
firstName[i] = Console.ReadLine();
Console.WriteLine("Enter last name: ");
lastName[i] = Console.ReadLine();
}
for(int j=0; j < num; j++){
Console.WriteLine(lastName[j] + "," + firstName[j]);
}
}
}

Explanation:

Firstly, prompt user to enter number of student to be stored (Line 6- 7). Next, create two array, firstName and lastName with num size (Line 8-9).

Create a for-loop to repeat for num times and prompt user to enter first name and last name and then store them in the firstName and lastName array, respectively (Line 11 - 17).

Create another for loop to traverse through the lastName and firstName array and display the last name and first name by following the format given in the question (Line 19 - 21).

4 0

3 years ago

Why do you think the Combination Square is better to use than the tape

Tatiana [17]

Answer:

The correct answer to the following question will be "Because the head acts as a stop".

Explanation:

Since the head serves as either a stopping (especially in comparison to something like a floppy tape clip or hanger), the combination square seems to be more reliable and accurate than those of the tape measure.
And maybe you'll know that certain style outlines are still square to something like the sides or finishes.

So that the above seems to be the right answer.

8 0

3 years ago

Identify the branch of study each student should pursue.

Paha777 [63]

Answer:

Explanation:

i took the test and screenshot it

3 0

3 years ago

Let’s define a new language called dog-ish. A word is in the lan- guage dog-ish if the word contains the letters ’d’, ’o’, ’g’ a

attashe74 [19]

Answer and Explanation:

// code

class Main {

public static void main(String[] args) {

/*

*

* your code

*

*/

System.out.println(inDogish("aplderogad"));

System.out.println(inXish("aplderogad", "dog"));

}

// returns true if the word is in dog-ish

// returns false if word is not in dog-ish

public static boolean inDogish(String word) {

// first find d

if (dogishHelper(word, 'd')) {

// first find string after d

String temp = word.substring(word.indexOf("d"));

// find o

if (dogishHelper(temp, 'o')) {

// find string after o

temp = temp.substring(temp.indexOf("o"));

// find g

if (dogishHelper(temp, 'g'))

return true;

}

The output is attached below

}

return false;

}

// necessary to implement inDogish recursively

public static boolean dogishHelper(String word, char letter) {

// end of string

if (word.length() == 0)

return false;

// letter found

if (word.charAt(0) == letter)

return true;

// search in next index

return dogishHelper(word.substring(1), letter);

}

// a generalized version of the inDogish method

public static boolean inXish(String word, String x) {

if (x.length() == 0)

return true;

if (word.length() == 0)

return false;

if (word.charAt(0) == x.charAt(0))

return inXish(word.substring(1), x.substring(1));

return inXish(word.substring(1), x.substring(0));

}

PS E:\fixer> java Main true true ne on

5 0

3 years ago