1 / 23

Chapter 2: Data Manipulation

Chapter 2: Data Manipulation. Chapter 2: Data Manipulation. 2.1 Computer Architecture 2.2 Machine Language 2.3 Program Execution. Computer Architecture. Central Processing Unit (CPU) or processor Arithmetic/Logic U nit Control U nit Registers General purpose Special purpose Bus

Download Presentation

Chapter 2: Data Manipulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 2:Data Manipulation

  2. Chapter 2: Data Manipulation • 2.1 Computer Architecture • 2.2 Machine Language • 2.3 Program Execution

  3. Computer Architecture • Central Processing Unit (CPU) or processor • Arithmetic/Logic Unit • Control Unit • Registers • General purpose • Special purpose • Bus • Motherboard

  4. Figure 2.1 CPU and main memory connected via a bus

  5. Figure 2.2 Adding values stored in memory

  6. Stored Program Concept Stored program concept the idea of storing programs in main memory A program can be encoded as bit patterns and stored in main memory. From there, the CPU can then extract the instructions and execute them. In turn, the program to be executed can be altered easily.

  7. Terminology • Machine instruction: An instruction (or command) encoded as a bit pattern recognizable by the CPU • Machine language: The set of all instructions recognized by a machine

  8. Machine Language Philosophies • Reduced Instruction Set Computing (RISC) • A minimal set of, simple, efficient, and fast instructions • Examples: PowerPC from Apple/IBM/Motorola and SPARK from Sun Microsystems • Complex Instruction Set Computing (CISC) • Many, convenient, and powerful instructions • Example: Pentium from Intel

  9. Machine Instruction Types • Data Transfer: Copy data from one location to another • Arithmetic/Logic:Use existing bit patterns to compute a new bit patterns • Control:Direct the execution of the program (Branching)

  10. Figure 2.3 Dividing values stored in memory

  11. Figure 2.4 The architecture of the machine described in Appendix C • 16 general-purpose registers (0-15) • 256 (0-255) main memory cells (each with a capacity of 8 bits)

  12. Parts of a Machine Instruction • Op-code: Specifies which operation to execute • Operand: Gives more detailed information about the operation • Interpretation of operand varies depending on op-code

  13. Figure 2.5 The composition of an instruction for the machine in Appendix C

  14. Figure 2.6 Decoding the instruction 35A73 RXY = Store thebit pattern found in the register R int the memory cell whose address is XY

  15. Figure 2.7 An encoded version of the instructions in Figure 2.2

  16. Program Execution • Controlled by two special-purpose registers • Program counter: address of next instruction • Instruction register: current instruction • Machine Cycle • Fetch • Decode • Execute

  17. Figure 2.8 The machine cycle

  18. Figure 2.9 Decoding the instruction B258

  19. Figure 2.10 The program from Figure 2.7 stored in main memory ready for execution

  20. Figure 2.11 Performing the fetch step of the machine cycle

  21. Figure 2.11 Performing the fetch step of the machine cycle (cont’d)

  22. An example What bit pattern is in the memory cell whose address is hexadecimal 17 ?? Program counter=00; Address contents 00 14 01 02 02 34 03 17 04 C0 05 00 1RXY LOAD register R with bit patternfound in mem. Cellwhoseaddress is XY 3RXY STORE bit patternfound in register R in thememorycellwhoseaddress is XY C000 HALT execution

  23. An example Program counter=02; 1402  load register 4 with bit pattern found in memory cell 02  register 4 =34 Program counter=04; 3417  store bit pattern found in register 4 in memory cell 17  memory cell 17=34 Program counter=06; C000  Halt

More Related