Dale - Computer Science Illuminated 250

Dale - Computer Science Illuminated 250 - Thought Questions...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Thought Questions 223 32. Implement the algorithm in Exercise 31 as an assembly-language program. 33. Write and implement a test plan for the program in Exercise 31. 34. Design and implement an algorithm that reads four values and prints the sum. 35. Is the test plan for a machine language program valid for the same solution written in assembly language? Explain your answer. 36. Distinguish between the pseudocode instructions *’L RK and *W "D . 37. Distinguish between assembly language pseudocode instructions and mnemonic instructions. 38. Distinguish between test plans based on code coverage and data coverage. 39. Explain the meaning of the Pep/7 menu option )x7cuti.n Input . Thought Questions 1. Would you like to do assembly-language programming? Can you think of any personality types that would be suited for such detail work? 2. The translation process has been demonstrated by showing the machine-language program that is the result of the assembly-language program. Look carefully at the solution of Exercise 32. Think about
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online