Product of first n natural numbers-algorithm, Basic Computer Science

Product of first n natural numbers - Algorithm

Working Procedure :

1. Take n = 8
2. Take I = 1
3. Take PROD = 1
4. Compute PROD = PROD * 1
5. add 1 to 1
6. If I≤ n, complete the steps from 4 to 6
7. Else, Print the value of PROD
8. Stop

2271_flow chart2.png

Posted Date: 8/29/2012 4:24:30 AM | Location : United States







Related Discussions:- Product of first n natural numbers-algorithm, Assignment Help, Ask Question on Product of first n natural numbers-algorithm, Get Answer, Expert's Help, Product of first n natural numbers-algorithm Discussions

Write discussion on Product of first n natural numbers-algorithm
Your posts are moderated
Related Questions
A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''''''a''''''''-'''''''

Cathode Ray Tube Monitors (CRT): Monitors display what is going on in your computer. They can run at various resolutions. It is the part of computer which looks like a TV set.

Question 1 Explain any two issues in web design Question 2 Mention the factors considered for good design Question 3 What are the advantages of graphical system?


Shell Scriptiong

Computer Help Inc. is a computer timesharing, and software development and sales company. It has been successful in attracting clients for both sides of its business. Staff count

Question 1 Briefly explain the Stage and the Timeline Question 2 What is Device Central? How it is useful for previewing mobile content? Question 3 Which are the f

Application-Specific Multiprocessors Although this book details a variety of similar architectures, it specializes in the design of such architectures in the perspective of par

Question 1 Define virtualization. Discuss the benefits of virtualization. Discuss the benefits of server virtualization Question 2 What is para virtualization? How para vi

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a