Reference no: EM133453890

Questions: The limitations of computing imposed by hardware, software, and problems in terms of solutions to computing problems. We learn some methods of comparing algorithms based on criteria such as efficiency, we learn about Big-O notation/order of magnitude as it relates to solving problems, and intractable problems and the role of parallel computing in solving these problems. You will show your knowledge of the topics by answering the following questions.

1. Chapter 18 opens with a discussion of limits on arithmetic with a story that helps to explain how integer numbers can get very big very fast. Explain the error the king made in his choice of payment to the bright young dot-commer in the fable told in the book, The Limits of Computing when the bright young dot-commer gave the king two payment choices. Explain how the story relates to hardware limitations.

2. As it relates to the limitations of computing, this question focuses on the limits on communications. Explain the difference between error-detecting strategies and error-correcting strategies. Discuss the importance of preventing data corruption.

3 Explain the limitations of computers in terms of software errors as well as some of the reasons for these errors. Discuss how software engineering could help to improve the quality of software.

4. Explain why the order of magnitude or Big-O notation is only concerned with what happens when N is large or why it is only important for large values of N.

5. Evaluate the following problem to determine which value of N is the Big-O notation in the problem. In other words, which is the most significant in terms of large values of N such that is increases the fastest. f(N) = N2 + 5N + 20.Explain the reason for your answer.

6. Explain an intractable problem in terms of executing the problem to determine a result. Also, discuss what happens when parallel computers are used with intractable problems in terms of executing the problem to determine a result?