The maximum compression strain in concrete in axial compression is taken as
0.002
When concrete is subjected to axial compression, it undergoes deformation, which is measured as strain. Strain is defined as the change in length divided by the original length. Concrete can withstand a certain amount of compression before it fails. The maximum compression strain is a critical parameter used in structural design to determine the ultimate capacity of concrete members like columns and walls under axial loads.
Based on experimental data and design code provisions (such as those found in standards like IS 456 for reinforced concrete design in India), the maximum compression strain in concrete at the point of failure under axial compression is typically taken as 0.002.
This value represents the strain at which the concrete reaches its peak compressive stress. Beyond this strain, the stress in the concrete starts to decrease, even though the strain continues to increase until ultimate failure occurs at a higher strain (often around 0.0035, depending on the code and conditions, especially in flexure or flexural compression). However, for pure axial compression, the strain at peak stress is the design limit often considered for maximum usable strain before the material starts significant softening.
The strain value of 0.002 is fundamental in developing the stress-strain relationship for concrete used in structural analysis and design. Design codes define idealized stress-strain curves, where the peak stress corresponds to a strain of 0.002. This point is often considered the limit of usable compressive strain for plain concrete under axial load or for the concrete in compression members at failure.
Let's look at the given options:
Therefore, the value commonly accepted for the maximum compression strain in concrete in axial compression, corresponding to the peak stress, is 0.002.
| Description | Typical Strain Value | Context |
|---|---|---|
| Maximum compression strain at peak stress | 0.002 | Axial compression, Start of descending branch |
| Ultimate compression strain | 0.0035 to 0.005 | Flexural compression failure (depends on code, concrete grade, section shape) |
| Strain at which concrete stress is often assumed zero in design | > 0.0035 or 0.005 | Beyond ultimate limit |
| Term | Value (Typical) | Relevance |
|---|---|---|
| Maximum strain at peak stress (axial compression) | 0.002 | Used in stress-block parameters, defines peak capacity |
| Ultimate strain (flexural compression) | 0.0035 - 0.005 | Defines concrete failure limit in bending |
| Elastic strain limit | Much less than 0.002 | Linear elastic behavior range |
The stress-strain curve for concrete in compression is non-linear. It typically shows an initial nearly linear elastic phase, followed by a curve where the rate of stress increase decreases. The stress reaches a peak value at a strain of approximately 0.002. After the peak, the stress decreases as the strain increases, exhibiting strain softening behavior, until ultimate failure occurs at a higher strain (e.g., 0.0035 in flexure as per some codes like IS 456) accompanied by crushing.
For pure axial compression tests, the strain corresponding to the peak stress is a fundamental material property often characterized around the 0.002 mark. This value is a cornerstone for understanding and modeling concrete behavior under load and is used in the design of reinforced concrete structures.
In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Here, n and m are number of vertices and edges, respectively. Match each algorithm with its time complexity.
| List I | List II | ||
| Standard graph algorithms | Time complexities | ||
| A. | Bellman‐Ford algorithm | I. | O(m*log n) |
| B. | Kruskal’s algorithm | II. | O(n 3) |
| C. | Floyd‐Warshall algorithm | III. | O(n*m) |
| D. | Topological sorting | IV. | O(n + m) |
Choose the correct answer from the options given below :
How many cards must be selected from a standard deck of 52 cards to guarantee that at least three hearts are present among them?
Match List 1 with List 2 and choose the correct answer from the code given below:
List I (Graph Algorithm) | List II (Time Complexity) |
a) Dijkstra’s algorithm | i) Θ(E log E) |
b) Kruskal’s algorithm | ii) Θ(V 3) |
c) Floyd-Warshall algorithm | iii) Θ(V 2) |
d) Topological sorting | iv) Θ(V + E) |
Where V and E are the number of vertices and edges in graph respectively.
The solution of recurrence relation: T(n)=2T(sqrt(n)) + lg(n) is
Modulus of elasticity of concrete, E is calculated using: