Consider the following statements: I. Modulus of elasticity of concrete increases with increase in compressive strength of concrete. II. Brittleness of concrete increases with decrease in compressive strength of concrete. III. Shear strength of concrete increases with increase in compressive strength of concrete. Which of the following statements are TRUE?
I and III
Therefore, as compressive strength increases, the modulus of elasticity increases. Brittleness and Compressive Strength Statement II says: "Brittleness of concrete increases with decrease in compressive strength of concrete." Brittleness is the tendency of a material to fracture with little or no prior plastic deformation. Therefore, statements I and III are true.
Important Questions from Introduction
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:
