All categories

3 years ago

Why is a building considered a type of system?

1 answer:

5 0

Answer: The Construction of building involves a group of departments in framing its physical appearance and outlook.

<u>Explanation:</u>

The system explains a set of individuals or activities working together in a network. The building system is designed to withstand the effect of gravity and impact of winds and stress.

Lateral loads and vertical gravity loads are the effects imparted in this system. This system ensures proper safety, security and resource management of the people.

There are three major types involved in the structural system of a building such as low-rise, high-rise, and long span.

Long span structures are greater than 30 meters high and are column-free spaces.
High rise structures are tall buildings ranges from [23-150m] and are reinforced concrete with steel.

You might be interested in

You are given a rectangular piece of cloth with dimensions X by Y, where X and Y are positive integers, and a list of n products

Bond [772]

The proof that recursion is exponential and that dynamic programming is polynomial is given by the formula;

P(x,y) = max{

P(x,y)

max (1 <= h <= X) { P[h, Y] + P(X - h, Y) }

max (1 <= v <= Y) { P[X, v] + P[X, Y - v] }

}

To prove that the recursion is exponential and that dynamic programming is polynomial. we will do so as follows;

Let us first have the assumption that the cloth is in such a manner that either way, a product can be oriented. This implies that that after a cut, we will now have two pieces of cloth.

Now, we will make a list of the side lengths of the products that can fit in the piece after which we will consider a vertical cut for each of the side length as well as a horizontal cut for each of the side length, then we apply the same algorithm to each of the two resulting pieces.

Thus, after the point above, it is likely true that in some instances, there may be a place to cut that is not at a product side length. However, It might be better for us to make a list of lengths composed of one or more pieces side by side as long as the sum is less than the length of the side being considered.

Lastly, we would note that this recursive approach is not limited to just two -dimensional problems as It could also be applied to a single or more than two dimensions. A useful proof would be to prove it for one dimension, then assuming it is true for n dimensions, prove it is true for n + 1 dimensions.

Thus;

P(x,y) = max{

P(x,y)

max (1 <= h <= X) { P[h, Y] + P(X - h, Y) }

max (1 <= v <= Y) { P[X, v] + P[X, Y - v] }

}

Read more at; brainly.com/question/11665190

3 0

2 years ago

(I really need help ASAP please!! this is for science her is the problem)

grandymaker [24]

Answer:

Explanation:

5 0

3 years ago

Read 2 more answers

Split the timing circuit below into 3 blocks by drawing 2 vertical lines across it, label each of the blocks stating whether it

garik1379 [7]

Answer:

i can Help you but iam using my phone so typing is really hectic. reach me via app on +254743503332

3 0

2 years ago

Create a C language program that can be used to construct any arbitrary Deterministic Finite Automaton corresponding to the FDA

otez555 [7]

Answer:

see the explanation

Explanation:

/* C Program to construct Deterministic Finite Automaton */

#include <stdio.h>

#include <DFA.h>

#include <stdlib.h>

#include <math.h>

#include <string.h>

#include <stdbool.h>

struct node{

struct node *initialStateID0;

struct node *presentStateID1;

};

printf("Please enter the total number of states:");

scanf("%d",&count);

//To create the Deterministic Finite Automata

DFA* create_dfa DFA(){

q=(struct node *)malloc(sizeof(struct node)*count);

dfa->initialStateID = -1;

dfa->presentStateID = -1;

dfa->totalNumOfStates = 0;

return dfa;

}

//To make the next transition

void NextTransition(DFA* dfa, char c)

{

int tID;

for (tID = 0; tID < pPresentState->numOfTransitions; tID++){

if (pPresentState->transitions[tID].condition(c))

{

dfa->presentStateID = pPresentState->transitions[tID].toStateID;

return;

}

dfa->presentStateID = pPresentState->defaultToStateID;

}

//To Add the state to DFA by using number of states

void State_add (DFA* pDFA, DFAState* newState)

{

newState->ID = pDFA->numOfStates;

pDFA->states[pDFA->numOfStates] = newState;

pDFA->numOfStates++;

}

void transition_Add (DFA* dfa, int fromStateID, int(*condition)(char), int toStateID)

{

DFAState* state = dfa->states[fromStateID];

state->transitions[state->numOfTransitions].toStateID = toStateID;

state->numOfTransitions++;

}

void reset(DFA* dfa)

{

dfa->presentStateID = dfa->initialStateID;

}

5 0

3 years ago

Assume a voltampere-base S3b = 100 MVA and a line-to-neutral voltage base Vb = 7.5 kV. Find the current base Ib. Also, by using

Rasek [7]

<u>Explanation:</u>

Let the frequency of the operation "W"ras/s

$\begin{aligned}V(t) &=7.5 \cos (\omega t+\varnothing v) k V \\&=7.5 \cos w t \quad k V \\I(t) &=\cos \left(\omega t+\phi_{i}\right) \quad k A \\&=\cos (\omega t-\pi / 6) \quad k A\end{aligned}$

$$\therefore$ Power, $P(t)=v(t) I(t)$$$\begin{array}{l}=[7.5 \cos \omega t][\cos (\cot -\pi / 6)] \times 10^{6} w \\=7.5 \cos ^{2}(2 \omega t-\pi / 6)+7.5 \cos \left(\pi_{6}\right) MW \\=3.75+7.5 \cos (2 \omega t-\pi / 6) \quad MW\end{array}$$$

$Real powel, $P=\left(7.5 \times 10^{3}\right)\left(10^{3}\right) \cos \left(\varnothing_{v}-\varnothing_{I}\right)$$$\begin{array}{l}=7.5 \cos (-\pi / 6) MW \\=3.75 MW\end{array}$$$

6 0

3 years ago