Determine maximum moment in the beam if spinned at both ends

Reference no: EM13307069

According to ACI 318 9.2 the required strength U must be calculated using the equation U=1.4(DL)+1.7(LL). If the live load on a 30 foot long beam is 1.2 kip/feet and the dead load is 0.8 kip/feet determine the maximum moment in the beam (kip-ft) if it is pinned at both ends. Assume the weight of the steel is 0.3 kip/feet.

Reference no: EM13307069

Questions Cloud

Simulate standardised sum of independent variates : Fit a linear regression model as in Q5, and plot your estimates for β0 and β1 as N increases, together with a line indicating their true values.

Create a program that functions as simple boolean calculator : Create a program that functions as a simple boolean calculator for 32-bit integers. It should display a menu that asks the user to make a selection from the following list.

How many clock cycles are needed : Indicate data dependency in the above code. Assuming there is no forwarding in the pipeline, how many clock cycles are needed to finish the program? If full forwarding is used, how many clock cycles are needed?

Design an audio amplifier using a jfet : Design an audio amplifier using a JFET and a 20-volt power supply. The amplifier is to have a gain of 50

Determine maximum moment in the beam if spinned at both ends : If the live load on a 30 foot long beam is 1.2 kip/feet and the dead load is 0.8 kip/feet determine the maximum moment in the beam (kip-ft) if it is pinned at both ends. Assume the weight of the steel is 0.3 kip/feet.

Describe the general tree adt : Describe the General Tree ADT. Discuss different ways for implementing general trees, and compare them in terms of the efficiency of search operations.

Obtain the work done by air resistance : A ball (mass 100g) is recorded to have a speed of 2m/s after falling 5m under gravity. What is the work done by air resistance

What kind of a binary tree is the heap : What kind of a binary tree is the heap? Explain different operations of heaps. Compare heaps to binary search trees in term of efficiencies of main operations.

Find the sum of the array elements : Write a program in machine code to use a subroutine to find the sum of the array elements. For simplicity, assume that the sum of the data values is less than $FF. You do not need to use the BCC to check for carry flag. Follow the following ste..

User Account

All Pages