Central Processing Unit 1 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Overview
 Intro...
Central Processing Unit 2 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Transfer In...
Central Processing Unit 3 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Transfer In...
Central Processing Unit 4 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Maniplulati...
Central Processing Unit 5 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Manipulatio...
Central Processing Unit 6 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Manipulatio...
Central Processing Unit 7 Lecture 26
CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT
Data Manipulatio...
Upcoming SlideShare
Loading in...5
×

Lecture 26

82

Published on

Published in: Business, Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
82
On Slideshare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
5
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Lecture 26

  1. 1. Central Processing Unit 1 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Overview  Introduction  General Register Organization  Stack Organization  Instruction Formats  Addressing Modes  Data Transfer and Manipulation  Program Control Program Interrupt  Reduced Instruction Set Computer
  2. 2. Central Processing Unit 2 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Transfer Instructions Load LD Store ST Move MOV Exchange XCH Input IN Output OUT Push PUSH Pop POP Name Mnemonic • Typical Data Transfer Instructions
  3. 3. Central Processing Unit 3 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Transfer Instructions Direct address LD ADR AC M[ADR] Indirect address LD @ADR AC  M[M[ADR]] Relative address LD $ADR AC  M[PC + ADR] Immediate operand LD #NBR AC  NBR Index addressing LD ADR(X) AC  M[ADR + XR] Register LD R1 AC  R1 Register indirect LD (R1) AC  M[R1] Autoincrement LD (R1)+ AC  M[R1], R1  R1 + 1 Autodecrement LD -(R1) R1  R1 - 1, AC  M[R1] Mode Assembly Convention Register Transfer • Data Transfer Instructions with Different Addressing Modes
  4. 4. Central Processing Unit 4 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Maniplulation Instructions • Three Basic Types: Arithmetic instructions Logical and bit manipulation instructions Shift instructions
  5. 5. Central Processing Unit 5 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Manipulation Instructions • Arithmetic Instructions Name Mnemonic Increment INC Decrement DEC Add ADD Subtract SUB Multiply MUL Divide DIV Add with Carry ADDC Subtract with Borrow SUBB Negate(2’s Complement) NEG
  6. 6. Central Processing Unit 6 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Manipulation Instructions Clear CLR Complement COM AND AND OR OR Exclusive-OR XOR Clear carry CLRC Set carry SETC Complement carry COMC Enable interrupt EI Disable interrupt DI Name Mnemonic • Logical and Bit Manipulation Instructions
  7. 7. Central Processing Unit 7 Lecture 26 CSE 211, Computer Organization and Architecture Harjeet Kaur, CSE/IT Data Manipulation Instructions Logical shift right SHR Logical shift left SHL Arithmetic shift right SHRA Arithmetic shift left SHLA Rotate right ROR Rotate left ROL Rotate right thru carry RORC Rotate left thru carry ROLC Name Mnemonic • Shift Instructions
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×