Answer:
At a retirement party, a coworker described Terry as dedicated, hardworking, and dependable. He also said that Terry was a great leader, knew the computer system, and kept the company's finances in order
Answer:
c) can be made with a variety of surface finishes.
Explanation:
The missing options are;
When it comes to concrete work in construction, the concrete can be cast either in-situ or in form of pre-cast concrete.
Now in-situ concrete means concrete done on the construction site being built while pre cast concrete simply means concrete cast outside in a factory or yard and brought to site to mount.
These pre cast concrete could have different surface finishes as required as this is one of it's advantages over in situ because there is a lot of space and room to have the desired concrete finish.
a) are typically manufactured on site and then hoisted into place.
b) cannot be fiber-reinforced.
c) can be made with a variety of surface finishes.
d) never include insulation.
e) often are unreinforced.
D make your car easy to spot in daytime because they do not illuminate a lot
Answer:
distance = 22.57 ft
superelevation rate = 2%
Explanation:
given data
radius = 2,300-ft
lanes width = 12-ft
no of lane = 2
design speed = 65-mph
solution
we get here sufficient sight distance SSD that is express as
SSD = 1.47 ut + 
..............1
here u is speed and t is reaction time i.e 2.5 second and a is here deceleration rate i.e 11.2 ft/s² and g is gravitational force i.e 32.2 ft/s² and G is gradient i.e 0 here
so put here value and we get
SSD = 1.47 × 65 ×2.5 + 
solve it we get
SSD = 644 ft
so here minimum distance clear from the inside edge of the inside lane is
Ms = Rv ( 1 - 
) .....................2
here Rv is = R - one lane width
Rv = 2300 - 6 = 2294 ft
put value in equation 2 we get
Ms = 2294 ( 1 - 
)
solve it we get
Ms = 22.57 ft
and
superelevation rate for the curve will be here as
R = 
..................3
here f is coefficient of friction that is 0.10
put here value and we get e
2300 = 
solve it we get
e = 2%
Answer:
d) Binary
Explanation:
Binary search is a search algorithm that finds the position of a value in an ordered array. It compares the value with the element in the middle of the array, if they are not equal, half in which the value cannot be eliminated and the search continues in the remaining half until the value is found.
