Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
What is the assembly language equivalent of each of the binary machine langauage instructions? Assume the format described in fig 6.13 and the numeric op code values shown in fig 6.5. a. 0101001100001100 b. 0011000000000111

What is the assembly language equivalent of each of the binary machine langauage instructions? Assume the format described in fig 6.13 and the numeric op code values shown in fig 6.5. a. 0101001100001100 b. 0011000000000111

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

What is the assembly language equivalent of each of the binary machine langauage instructions? Assume the format described in fig 6.13 and the numeric op code values shown in fig 6.5.

a. 0101001100001100

b. 0011000000000111

### Figure 6.5: Typical Assembly Language Instruction Set This figure presents a typical assembly language instruction set, detailing the binary op codes, corresponding operations, and their meanings. #### Binary Op Code and Operation Meanings: - **0000 - LOAD X** - Meaning: CON(X) → R - Explanation: Load the contents of memory location X into the register. - **0001 - STORE X** - Meaning: R → CON(X) - Explanation: Store the contents of the register into memory location X. - **0010 - CLEAR X** - Meaning: 0 → CON(X) - Explanation: Clear the contents of memory location X by setting it to zero. - **0011 - ADD X** - Meaning: R + CON(X) → R - Explanation: Add the contents of memory location X to the register and store the result back in the register. - **0100 - INCREMENT X** - Meaning: CON(X) + 1 → CON(X) - Explanation: Increment the contents of memory location X by one. - **0101 - SUBTRACT X** - Meaning: R - CON(X) → R - Explanation: Subtract the contents of memory location X from the register and store the result back in the register. - **0110 - DECREMENT X** - Meaning: CON(X) - 1 → CON(X) - Explanation: Decrement the contents of memory location X by one. - **0111 - COMPARE X** - Meaning: - if CON(X) > R then GT = 1, else 0 - if CON(X) = R then EQ = 1, else 0 - if CON(X) < R then LT = 1, else 0 - Explanation: Compare the contents of memory location X with the register and set the status flags (GT, EQ, LT) accordingly. - **1000 - JUMP X** - Meaning: Get the next instruction from memory location X. - Explanation: Unconditionally jump to the instruction at memory location X. - **1001 - JUMPGT X** - Meaning: Get the next instruction from memory location X if GT = 1. - Explanation: Jump to the instruction at memory location X if the GT flag is set to 1. - **1010 - JUMPE
Transcribed Image Text:### Figure 6.5: Typical Assembly Language Instruction Set This figure presents a typical assembly language instruction set, detailing the binary op codes, corresponding operations, and their meanings. #### Binary Op Code and Operation Meanings: - **0000 - LOAD X** - Meaning: CON(X) → R - Explanation: Load the contents of memory location X into the register. - **0001 - STORE X** - Meaning: R → CON(X) - Explanation: Store the contents of the register into memory location X. - **0010 - CLEAR X** - Meaning: 0 → CON(X) - Explanation: Clear the contents of memory location X by setting it to zero. - **0011 - ADD X** - Meaning: R + CON(X) → R - Explanation: Add the contents of memory location X to the register and store the result back in the register. - **0100 - INCREMENT X** - Meaning: CON(X) + 1 → CON(X) - Explanation: Increment the contents of memory location X by one. - **0101 - SUBTRACT X** - Meaning: R - CON(X) → R - Explanation: Subtract the contents of memory location X from the register and store the result back in the register. - **0110 - DECREMENT X** - Meaning: CON(X) - 1 → CON(X) - Explanation: Decrement the contents of memory location X by one. - **0111 - COMPARE X** - Meaning: - if CON(X) > R then GT = 1, else 0 - if CON(X) = R then EQ = 1, else 0 - if CON(X) < R then LT = 1, else 0 - Explanation: Compare the contents of memory location X with the register and set the status flags (GT, EQ, LT) accordingly. - **1000 - JUMP X** - Meaning: Get the next instruction from memory location X. - Explanation: Unconditionally jump to the instruction at memory location X. - **1001 - JUMPGT X** - Meaning: Get the next instruction from memory location X if GT = 1. - Explanation: Jump to the instruction at memory location X if the GT flag is set to 1. - **1010 - JUMPE
### FIGURE 6.13 #### Instruction Format: - **Op Code:** 4 bits - **Address:** 12 bits #### Object Program: | Address | Machine Language Instruction | Meaning | |---------|------------------------------|----------------| | 0000 | 1101 000000000101 | IN X | | 0001 | 1101 000000000110 | IN Y | | 0010 | 0110 000000000101 | LOAD X | | 0011 | 0111 000000000110 | COMPARE Y | | 0100 | 1001 000000101011 | JUMPGT DONE | | 0101 | 1110 000000000001 | OUT X | | 0110 | 1010 000000001010 | JUMP LOOP | | 0111 | 1110 000000000010 | OUT Y | | 1000 | 1111 000000000000 | HALT | | 1001 | 0000 000000000000 | The constant 0 | | 1010 | 0000 000000000000 | The constant 0 | **Caption:** Example of an object program ### Explanation: This table provides a representation of an object program, detailing the machine language instructions and their associated meanings at specific memory addresses. The machine language instructions are split into three sections: 1. **Address:** The memory address of the instruction. 2. **Machine Language Instruction:** The binary representation of each instruction, divided into an opcode (4 bits) and an address field (12 bits). 3. **Meaning:** The human-readable interpretation of the machine language instruction. The opcodes in the instruction set correspond to specific operations: - **1101** for IN - **0110** for LOAD - **0111** for COMPARE - **1001** for JUMPGT (Jump if greater) - **1110** for OUT - **1010** for JUMP - **1111** for HALT The addresses following the opcodes indicate the operands for each operation, represented in 12-bit binary format. For instance, at address 0000, the instruction "1101 000000000101"
Transcribed Image Text:### FIGURE 6.13 #### Instruction Format: - **Op Code:** 4 bits - **Address:** 12 bits #### Object Program: | Address | Machine Language Instruction | Meaning | |---------|------------------------------|----------------| | 0000 | 1101 000000000101 | IN X | | 0001 | 1101 000000000110 | IN Y | | 0010 | 0110 000000000101 | LOAD X | | 0011 | 0111 000000000110 | COMPARE Y | | 0100 | 1001 000000101011 | JUMPGT DONE | | 0101 | 1110 000000000001 | OUT X | | 0110 | 1010 000000001010 | JUMP LOOP | | 0111 | 1110 000000000010 | OUT Y | | 1000 | 1111 000000000000 | HALT | | 1001 | 0000 000000000000 | The constant 0 | | 1010 | 0000 000000000000 | The constant 0 | **Caption:** Example of an object program ### Explanation: This table provides a representation of an object program, detailing the machine language instructions and their associated meanings at specific memory addresses. The machine language instructions are split into three sections: 1. **Address:** The memory address of the instruction. 2. **Machine Language Instruction:** The binary representation of each instruction, divided into an opcode (4 bits) and an address field (12 bits). 3. **Meaning:** The human-readable interpretation of the machine language instruction. The opcodes in the instruction set correspond to specific operations: - **1101** for IN - **0110** for LOAD - **0111** for COMPARE - **1001** for JUMPGT (Jump if greater) - **1110** for OUT - **1010** for JUMP - **1111** for HALT The addresses following the opcodes indicate the operands for each operation, represented in 12-bit binary format. For instance, at address 0000, the instruction "1101 000000000101"
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Computer System
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS