If bar AB has a square hole that can freely slide up-and-down on a smooth square post, but is held in static equilibrium by cable BC while subjected to a force F as shown, what is the tension in cable BC? Report your answer in units of lbs. knowing that

Other than point B, where else along the beam is the shear force of the beam exactly zero? Report your answer in units of meters, as measured from point A.

What is the reaction force magnitude at roller B in units of kN?

Select the best answers below for the remaining Cartesian support reaction components at A in {i,j,k}. Each answer should correspond to an unknown in your free body diagram.

I am aware that if I am found violating the UF Student Code of Conduct for Academic Honesty I will receive a zero on this exam.

Select the numbers below only for the TRUE statements. 1. If the net force on a rigid body is zero but the net moment about some arbitrary point is non-zero, the body can still be in static equilibrium. 2. When writing scalar equilibrium equations in 3 D, one can always choose a coordinate system aligned with two non-parallel forces to reduce the number of unknown components. 3. At a point where the internal shear force diagram crosses zero, the corresponding bending moment diagram reaches a local extremum. 4. The moment of inertia of a body about an arbitrary axis is always smaller than its moment of inertia about any axis passing through its centroid. 5. For planar (lamina) bodies, the polar moment of inertia about an axis perpendicular to the plane equals the sum of the planar moments I_x + I_y. 6. The centroid of a composite area can be found by summing the first moments of each sub-area about the reference axes, regardless of whether individual sub-areas overlap. 7. Six independent scalar equations of equilibrium (three force, three moment) are required and sufficient to solve any statically determinate 3-D rigid-body system.

Mark is using a 3-period moving average to forecast the number of filters needed for the fourth quarter. Using the following data, what is the forecasted amount? Quarter Filters 1 43 2 32 3 38 4 37 1 41 2 35 3 40 4 ?

What is the output of the following code? #include int main() { int arr[] = {5, 3, 8, 4}; int pivot = arr[0]; int i = 1, j = 3; while (i

What is the output of the following code? #include #define SIZE 5 int graph[SIZE][SIZE] = { {0, 1, 1, 0, 0}, {0, 0, 0, 1, 0}, {0, 0, 0, 0, 1}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0} }; int visited[SIZE] = {0}; void dfs(int node) { if (visited[node]) return; visited[node] = 1; printf(“%d “, node); for (int i = 0; i < SIZE; i++) { if (graph[node][i] == 1) { dfs(i); } } } int main() { dfs(0); return 0; }

The following program is attempting to generate a binary search tree. The code compiles, but the in-order traversal output is incorrect. Identify the line of the code causing the incorrect output.