pseudocódigo

I have this algorithm, in a pseudocode: Knowing that n1 gets the value 20. inicio inteiro: n1,n2,n3; leia (n1); n2<- ... ng: N2 (receives result) of n1 * 3 (20 times 3) How to do a table test to find the result of this algorithm above?

I am needing to invert a stack a using another additional stack B and some variables in pseudo-code. So that Stack A is reversed at the end of the algorithm. Can anyone help?

I was reading about algorithms, but every algorithm I read was written in some unknown or non-invented language, but in a way ... at I'm trying to interpret? Is there a syntax defined for this? Can I write as I please, in such a way that I can understand?

I'm having problems with a question to set the result of a question in VisualG, so if the user answers the wrong way the ques ... All this so that the incorrect answer phrase repeats until the user hits the answer so that it stays N for no and S for Yes.

I'm trying to create an algorithm that adds up the numbers from the range 1-100. Further the program prints each element of t ... 87 + 88 + 89 + 90 + 91 + 92 + 93 + 94 + 95 + 96 + 97 + 98 + 99 + 100 + A soma dos inteiros de 1 à 100 é: 5151

Given the values of x real and n natural positive, calculate: S = (x+1)/1! + (x+2)/2! + (x+3)/3! + ... + (x+n)/n! So far ... l2 fim enquanto |sn2 = (x+n)/nFatorial2 |soma = soma + sn2 |sn = sn2 fim enquanto escreva "o valor de S é", soma fim

Make a pseudocode and flowchart that enters with 3 values and generates the equation of 2 degree, check the possible roots. ... “ (-B + RaizQ(D)/ (2*A), “X2 = “ (-B – RaizQ(D)(/2*A) Senão Escreva “ Não há raízes, delta menor que 0. ” Fim_algoritmo