Dale - Computer Science Illuminated 215

Dale - Computer Science Illuminated 215 - 188 Chapter 7...

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

View Full Document Right Arrow Icon
188 Chapter 7 Low-Level Programming Languages Goals After studying this chapter, you should be able to ± list the operations that a computer can perform. ± discuss the relationship between levels of abstraction and the determina- tion of concrete algorithm steps. ± describe the important features of the Pep/7 virtual machine. ± distinguish between immediate mode addressing and direct addressing. ± convert a simple algorithm into a machine-language program. ± distinguish between machine language and assembly language. ± describe the steps in creating and running an assembly-language program. ± convert a simple algorithm into an assembly-language program. ± distinguish between instructions to the assembler and instructions to be translated. ± describe two approaches to testing. ± design and implement a test plan for a simple assembly-language program. 7.1 Computer Operations Both our notations for expressing algorithms and the programming languages we use to implement algorithms must mirror the types of opera-
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