Reference no: EM13161733
Write a program code to compute and build a table of Reynolds numbers at flow velocities varying from 100 to 1000 ft/sec (at increments of 100) given the following formula:
where
Re is the Reynolds number that is nondimensional (no units)
is the density of air in slug/ft3
v is the velocity of air in ft/sec
l is the characteristic length in ft
is the viscosity of air in slug/ft?sec
Additional data
Density of air = 2.33 × 10-3 slug/ft3
Viscosity of air = 3.8 × 10-7slug/ft?sec
Velocity to vary from 100 to 1000 at increments of 100
Sample input and output (user input in BOLD):
Input the diameter of cylinder as length in ft:
0.025
Index velocity Reynolds number
1. 100.00 15328.95
2. 200.00 30657.90
3.
.
.
.
10. 1000.00 153289.48
(You need to input a length "l" and then it spits out a table of calculated Reynolds numbers)
Write method called median that accepts an array of integer
: Write a method called median that accepts an array of integers as its parameter and returns the median of the numbers in the array.
|
If interest is compounded annually
: If interest is compounded annually, it grows as follows. Suppose P0 is the initial amount and INT is the interest rate per year. If P1 and P2 represent the balance at the end of the first and second year
|
Demonstrate the construction and output of an array
: In fluid mechanics, the Reynolds number (Re) is a dimensionless quantity that is used to help predict similar flow patterns in different fluid flow situations. For example, Reynolds numbers can be computed for different velocities of fluid flow over ..
|
Ask the user how many times you want to run
: c the algorithm. 2. Then choose a word at random from the array of Strings as the target (Use the integer random number generator)
|
Build a table of reynolds numbers at flow velocities
: Write a program code to compute and build a table of Reynolds numbers at flow velocities varying from 100 to 1000 ft/sec (at increments of 100)
|
In psuedocode, design an application
: In psuedocode, design an application that has an array of at least 20 integers. It should call a module that uses the sequential search algorithm to locate one of the values
|
Least number of comparisons needed
: What is the least number of comparisons needed to sort an array of 6 numbers, in the worst case, using any sorting algorithm that sorts with binary comparisons? Explain
|
20 integers saved in a file called "data.txt"
: There are 20 integers saved in a file called "data.txt" (just a random txt file with some numbers) All integers are in the range from 1 to 10
|
All the new strings generated
: Explain why, if on some round, all the new strings generated for any syntactic category are longer than s, and s has not already been generated for L(), then s cannot ever be put in L(). Hint: Use Exercise 11.3.5.
|