Give the definition of the algorithm Describe the general structure of Pseudocod

Question

Give the definition of the algorithm Describe the general structure of Pseudocode Give the definition of time efficiency including equation Give the details definition of big O, big theta and big Ohm Describe the general procedure of the analysis of algorithms (five steps) Compute the following sums sigma_t=3^n+1 1; sigma_t=3^n+1 i; sigma_t=0^n+3 3^t; Compare order of growth log(n) and squareroot (n) n*(n-1)/2 and n^3 Solve the following recurrence relations by forward and backward x(n)=x(n-1)+3 for n>1, x(0)=0; Use the DEFINITION to prove the following: n(n +1)/2 0(n^3); n(n+1)/2 Ohm(n);

Explanation / Answer

1: Give the definition of the Algorithm:

Ans:

Algorithm: Algorithm basically means a set of rules to be followed in calculations or problem-solving operations, espacially by a computer. An algorithm is merely the sequence of steps taken to solve a problem.

2. Describe the general structure of pseudocode:

Ans: Pseudocode is text based tool that is used by programmers to design algorithms. The rules of pseudocode are reasonably straightforward and generally easy to understand. An ideal pseudocode should describe the entire logic of the algorithm so that implementation becomes an easy task of translating line by line into source code. pseudocode is independent of underlying programming language.

The general structure of pseudocode can be represented by six specific programming constructs, these are:

1. SEQUENCE

2. WHILE,

3. IF-THEN-ELSE,

4. REPEAT-UNTIL,

5. FOR and

6. CASE

Sample pseudocode for a program that is supposed to Print Pass or Fail, Pass if student gets more than 50 marks else Fail

If student's grade is greater than or equal to 50

Print "passed"

else

Print "failed"

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.