0
Add your answer:
Earn +20 pts
What is the ratio of sand and cement to make mortar?
A typical mixture is three of sand to one of cement. Make a small batch first and check the consistency of it. The wetness of the sand has a lot to do with the consistency. For block and brick work, a bit should squeeze out the side but still support the block or brick with about 3/8 inch above the previous row. Then this side excess is scraped off and pointed with a pointing tool.
What does the ROW function do in Excel?
It gives you the row part of a cell reference. =ROW(D3) This will give the value 3, as that is the row part of the cell reference.
If any array has seven rows how many blocks does it have?
Define 'block'. If 'block' means 'row' then seven.
How do you convert postfix expression to prefix expression using c plus plus?
Let Q be an arithmetic expression written in infix notation. Besides operands and operators, Q may also contain left and right parentheses. We assume that the operators in Q consist only of exponentiations (↑), multiplications (*), divisions (/), additions (+) and subtractions (-), and that they have the usual three levels of precedence as given above. We also assume that operators on the same level, including exponentiations, are performed from left to right unless otherwise indicated by parentheses. (This is not standard, since expressions may contain unary operators and some languages perform the exponentiations from right to left. However, these assumptions simplify our algorithm.) The following algorithm transforms the infix expression Q into its equivalent postfix expression P. The algorithm uses a stack to temporarily hold operators and left parentheses. The postfix expression P will be constructed from left to right using the operands from Q and the operators, which are removed from STACK. We begin by pushing a left parenthesis onto STACK and adding a right parenthesis at the end of Q. The algorithm is completed when STACK is empty. 69 Algorithm: POLISH(Q, P) Suppose Q is an arithmetic expression written in infix notation. This algorithm finds the equivalent postfix expression P. 1. Push "(" onto STACK, and add ")" to the end of Q. 2. Scan Q from left to right and repeat Steps 3 to 6 for each element of Q until the STACK is empty: 3. If an operand is encountered, add it to P. 4. If a left parenthesis is encountered, push it onto STACK. 5. If an operator ⊗ is encountered, then: (a) Repeatedly pop from STACK and add to P each operator (on the top of STACK) which has the same precedence as or higher precedence than ⊗. (b) Add ⊗ to STACK. [End of If structure.] 6. If a right parenthesis is encountered, then: (a) Repeatedly pop from STACK and add to P each operator (on the top of STACK) until a left parenthesis is encountered. (b) Remove the left parenthesis. [Do not add the left parenthesis to P.] [End of If structure.] [End of Step 2 loop.] 7. Exit. The terminology sometimes used for Step 5 is that ⊗ will "sink" to its own level. . 70 EXAMPLE Consider the following arithmetic infix expression Q: Q: A+(B*C- (D/E↑F)*G)*H We simulate the previous algorithm to transform Q into its equivalent postfix expression P. First we push "(" onto STACK, and then we add ")" to the end of Q to obtain: A + ( B * C - ( D / E ↑ F ) * G ) * H ) (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) (13)(14) (15) (16)(17) (18)(19) (20) The elements of Q have now been labeled from left to right for easy reference. Table below shows the status of STACK and of the string P as each element of Q is scanned. Observe that (1) Each operand is simply added to P and does not change STACK. (2) The subtraction operator (-) in row 7 sends * from STACK to P before it (-) is pushed onto STACK. (3) The right parenthesis in row 14 sends j and then I from STACK to P, and then removes the left parenthesis from the top of STACK. (4) The right parenthesis in row 20 sends * and then + from STACK to P, and then removes-the left parenthesis from the top of STACK. After Step 20 is executed, the STACK is empty and P: A B C * D E F ↑ / G * - H * + 71 which is the required postfix equivalent of Q.
How do you write a program to find magic numbers?
#include<stdio.h> unsigned sum_row (unsigned* sq, const unsigned width, const unsigned row) { unsigned sum, col; sum = 0; for (col=0; col<width; ++col) sum += sq[row*width+col]; return sum; } unsigned sum_col (unsigned* sq, const unsigned width, const unsigned col) { unsigned sum, row; sum = 0; for (row=0; row<width; ++row) sum += sq[row*width+col]; return sum; } unsigned sum_diag (unsigned* sq, const unsigned width) { unsigned sum, row, col; sum = 0; for (row=0, col=0; row<width; ++row, ++col) sum += sq[row*width+col]; return sum; } unsigned sum_anti (unsigned* sq, const unsigned width) { unsigned sum, row, col; sum = 0; for (row=0, col=width-1; row<width; ++row, --col) sum += sq[row*width+col]; return sum; } bool is_magic (unsigned* sq, const unsigned width) { unsigned magic, row, col; magic = sum_row (sq, width, 0); for (row=1; row<width; ++row) if (magic!=sum_row(sq, width, row)) return false; for (col=0; col<width; ++col) if (magic!=sum_col(sq, width, col)) return false; if (magic!=sum_diag(sq, width)) return false; if (magic!=sum_anti(sq, width)) return false; return true; } int main () { const unsigned width = 3; unsigned a[width][width] {{2,7,6},{9,5,1},{4,3,8}}; unsigned row, col; printf ("Square:\n\n"); for (row=0; row<width; ++row) { for (col=0; col<width; ++col) { printf ("%d ", a[row][col]); } printf ("\n"); } printf ("\n"); if (is_magic((unsigned*)&a, width)) printf ("The square is magic with a magic constant of %d\n", sum_row((unsigned*)&a, 3,0)); else printf ("The square is not magic\n"); return 0; }
What is the shortest way to figure out how many ways you can stack ten books on a shelf?
Use the factors of the number. Factors of 10 are... 1,2,5 & 10. Therefore they will stack either in 1 row of 10 books or 2 rows of 5.
How do you make 2 rows of 6 using 9 coins?
3 1 1 1 1 1 1 The drawing above, if it is preserved by the formatting, illustrates how. For the first row, put on 4 coins in a row. Stack two additional coins on top of one of the coins. For the second row, make it perpendicular to the first row, and overlapping the stack of 3 coins. You have used a total of 9 coins, with the stack of 3 coins doing double duty for both rows.
A neat line of things side by side?
A neat line of things side by side is called a stack or row.
How much will short stack's 'stack is the new black' album cost in aus?
$50 for the concert and if you wnat the digital album + show its $65 ive got front row tickets :D
What are the vertical cells called in a table?
A vertical stack of cells is called a column. A horizontal line of cells is called a row.
Move just one coin to make two rows of six coins each The rows can be either horizontal or vertical?
Take coin from row with six and stack in on the intersecting row coin.
How many seats in a row in at?
how many seats are in a row at giant stadium
Where is your presentation on the symptoms of being infected by werewolf blood?
In my private library: third stack, north side, fifth row from the bottom, 37th from the east end.
If you have eight coins can you make 2 rows of five coins by just moving one coin?
If you think 2D you can stack one coin on top in a row.
What is the collective noun of table?
There seems to be no standard collective noun for tables. You could have a row of tables, a stack of tables (if they are stackable). Though I prefer a nest of tables.
How many kernals are on a row?
there are 42 kernals in a row :)
How many dimes are in a row?
A row can have as many or as few dimes as you like, it is not a specified amount.
