Computer instructions

Jan 26, 2013Download as PPS, PDF30 likes34,217 views

An instruction format consists of bits that specify an operation to perform on data in computer memory. The processor fetches instructions from memory and decodes the bits to execute them. Instruction formats have operation codes to define operations like addition and an address field to specify where data is located. Computers may have different instruction sets.

COMPUTER
INSTRUCTIONS

MANINDER KAUR
professormaninder@gmail.com

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 1

INSTRUCTION FORMAT
An instruction format or instruction code is a
group of bits used to perform a particular
operation on the data stored in computer.

Processor fetches an instruction from memory
and decodes the bits to execute the instruction.

Different computers may have their own
instruction set.

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 2

INSTRUCTION FORMAT
Instruction code is divided into two parts
namely operation code and address of
data.

 Operation code consisting group of bits
to define an operation such as add,
subtract, multiply etc.

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 3

INSTRUCTION FORMAT
In an instruction format:
 First 12 bits (0-11) specify an address.
 Next 3 bits specify operation code (opcode).
 Left most bit specify the addressing mode I
I = 0 for direct address
I = 1 for indirect address

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 4

TYPES OF INSTRUCTIONS

The basic computer has three 16-bit
instruction code formats:

1. Memory Reference Instructions
2. Register Reference Instructions
3. Input/Output Instructions

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 5

Memory Reference Instructions
In Memory reference instruction:
 First 12 bits(0-11) specify an address.
 Next 3 bits specify operation code (opcode).
 Left most bit specify the addressing mode I
I = 0 for direct address
I = 1 for indirect address

(Opcode = 000 through 111)
Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 6

Memory Reference Instructions
In Memory reference instruction:

 first 12 bits (0-11) specify an address.
 The address field is denoted by three x’s (in hexadecimal notation)
and is equivalent to 12-bit address.
 The last mode bit of the instruction represents by symbol I.
 When I = 0, the last four bits of an instruction have a hexadecimal
digit equivalent from 0 to 6 since the last bit is zero (0).
 When I = 1 the last four bits of an instruction have a hexadecimal
digit equivalent from 8 to E since the last bit is one (1).

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 7

Memory Reference Instructions
Hexadecimal code
Symbol I=0 I=1 Description
AND 0xxx 8xxx AND memory word to AC
ADD 1xxx 9xxx ADD memory word to AC
LDA 2xxx Axxx LOAD Memory word to AC
STA 3xxx Bxxx Store content of AC in
memory
BUN 4xxx Cxxx Branch unconditionally
BSA 5xxx Dxxx Branch and save return address

ISZ 6xxx Exxx Increment and Skip if zero

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 8

Register Reference Instructions
In Register Reference Instruction:

 First 12 bits (0-11) specify the register operation.
 The next three bits equals to 111 specify opcode.
 The last mode bit of the instruction is 0.
 Therefore, left most 4 bits are always 0111 which is equal to
hexadecimal 7.

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 9

Register Reference Instructions
Symbol Hexadecimal code Description

CLA 7800 Clear AC
CLE 7400 Clear E
CMA 7200 Complement AC
CME 7100 Complement E
CIR 7080 Circulate right AC and E
CIL 7040 Circulate left AC and E
INC 7020 Increment AC
SPA 7010 Skip next instruction if AC positive
SNA 7008 Skip next instruction is AC is negative

SZA 7004 Skip next instruction is AC is 0
SZE 7002 Skip next instruction is E is 0
HLT 7001 Halt computer
Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 10

I/O Reference Instructions
In I/O Reference Instruction:

 First 12 bits (0-11) specify the I/O operation.
 The next three bits equals to 111 specify opcode.
 The last mode bit of the instruction is 1.
 Therefore, left most 4 bits are always 1111 which is equal to
hexadecimal F.

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 11

I/O Reference Instructions
Symbol Hexadecimal code Description
INP F800 Input character to AC

OUT F400 Output character from AC

SKI F200 Skip on input flag

SKO F100 Skip on Output flag

ION F080 Interrupt on

IOF F040 Interrupt off

Maninder Kaur
professormaninder@gmail.com www.eazynotes.com 12

This document provides an introduction to propositional logic and rules of inference. It defines an argument and valid argument forms. Examples are given to illustrate valid argument forms using propositional variables. Common rules of inference like modus ponens and disjunction introduction are explained. The resolution principle for showing validity of arguments is described. Examples are provided to demonstrate applying rules of inference to build arguments and use resolution to determine validity. The document also discusses fallacies and rules of inference for quantified statements like universal and existential instantiation and generalization.

ppt Ohm's lawdjariru

1) Ohm's Law states that the current through a conductor is directly proportional to the voltage applied across it. It is represented by the equation V=IR, where V is the voltage, I is the current, and R is the resistance. 2) In a series circuit, the current is the same through all components as there is only one path for current to flow. The total resistance is the sum of the individual resistances. 3) In a parallel circuit, the voltage is the same across all branches as there are multiple paths for current to flow forming closed loops. The total resistance is lower than any single resistance.

Computer instructionSanjeev Patel

1. The document discusses the topics of computer instructions, timing and control, and the instruction cycle for a basic computer. 2. It describes the three instruction code formats used - memory reference, register reference, and input/output. Memory reference instructions use bits to specify an address and addressing mode. Register reference instructions specify an operation on the accumulator register. 3. The instruction cycle consists of four phases - fetch an instruction, decode the instruction, read the effective address if needed, and execute the instruction.

ADDRESSING MODESSadaf Rasheed

The document discusses addressing modes in computers. It defines addressing modes as the different ways of specifying the location of an operand in an instruction. It describes 10 common addressing modes including implied, immediate, register, register indirect, auto increment/decrement, direct, indirect, relative, indexed, and base register addressing modes. It provides examples of instructions for each addressing mode and explains how the effective address is calculated. Addressing modes allow for versatility in programming through features like pointers, loop counters, data indexing, and program relocation while reducing the number of bits needed in instruction addresses.

Direct memory access (dma)Zubair Khalid

Direct memory access (DMA) allows certain hardware subsystems to access computer memory independently of the central processing unit (CPU). During DMA transfer, the CPU is idle while an I/O device reads from or writes directly to memory using a DMA controller. This improves data transfer speeds as the CPU does not need to manage each memory access and can perform other tasks. DMA is useful when CPU cannot keep up with data transfer speeds or needs to work while waiting for a slow I/O operation to complete.

Computer architecture instruction formatsMazin Alwaaly

Trees Gaditek

This document discusses trees and their applications in discrete mathematics. It begins with an introduction to trees, including defining different types of trees such as rooted trees, m-ary trees, and binary trees. It then covers applications of trees such as binary search trees, decision trees, and game trees. Next, it discusses different tree traversal algorithms like preorder, inorder, and postorder traversal and how they can be used to represent expressions. Finally, it provides examples of evaluating expressions represented as trees.

Job sequencing with DeadlinesYashiUpadhyay3

The document describes the job sequencing problem with deadlines and presents a greedy algorithm to solve it. The problem involves scheduling a set of jobs on a single processor to maximize total profit where each job has a deadline and profit. The greedy algorithm sorts jobs by decreasing profit and schedules each job as late as possible while meeting its deadline. This approach always finds the optimal solution that maximizes total profit. Pseudocode and a C++ program implementing the algorithm are also provided.

Stack organizationchauhankapil

This document discusses stack organization and operations. A stack is a last-in, first-out data structure where items added last are retrieved first. It uses a stack pointer to track the top of the stack. Common operations are push, which adds an item to the top of the stack, and pop, which removes an item from the top. Stacks can be implemented with registers, using a stack pointer and data register. Reverse Polish notation places operators after operands, making it suitable for stack-based expression evaluation.

Instruction codeDr. Abhineet Anand

The document discusses different types of instruction codes used in computers. It explains that instruction codes contain operation codes and operands. The operation code specifies the operation to be performed, like addition, subtraction, etc. The operands specify the data on which the operation will be performed, which can be stored in memory or registers. The document outlines three main types of instruction codes - memory reference instructions, register reference instructions, and input-output instructions. It describes the format of each type of instruction and how they are interpreted by the computer.

Operating system services 9myrajendra

The operating system provides several key services to programs and users, including user interface, program execution, input/output operations, file system management, communications, error detection and handling, resource allocation, accounting, protection, command interpretation, and resource management. These services allow for running programs, performing input/output, creating and managing files, connecting between processes, detecting and handling errors, tracking usage for billing, protecting processes from each other, interpreting user commands, and optimizing resource usage.

Instruction codespradeepa velmurugan

An instruction code consists of an operation code and operand(s) that specify the operation to perform and data to use. Operation codes are binary codes that define operations like addition, subtraction, etc. Early computers stored programs and data in separate memory sections and used a single accumulator register. Modern computers have multiple registers for temporary storage and performing operations faster than using only memory. Computer instructions encode an operation code and operand fields to specify the basic operations to perform on data stored in registers or memory.

Register transfer language is used to describe micro-operation transfers between registers. It represents the sequence of micro-operations performed on binary information stored in registers and the control that initiates the sequences. A register is a group of flip-flops that store binary information. Information can be transferred between registers using replacement operators and control functions. Common bus systems using multiplexers or three-state buffers allow efficient information transfer between multiple registers by selecting one register at a time to connect to the shared bus lines. Memory transfers are represented by specifying the memory word selected by the address in a register and the data register involved in the transfer.

Computer Organization and Architecture.CS_GDRCST

Virtual memory pptPunjab College Of Technical Education

The document discusses virtual memory, including its needs, importance, advantages, and disadvantages. Virtual memory allows a computer to use more memory for programs than is physically installed by storing unused portions on disk. This allows processes to exceed physical memory limits. Page replacement algorithms like FIFO, LRU, and OPT are used to determine which pages to swap in and out between memory and disk.

Page replacement algorithmsPiyush Rochwani

This document discusses various page replacement algorithms used in operating systems. It begins with definitions of paging and page replacement in virtual memory systems. There are then overviews of 12 different page replacement algorithms including FIFO, optimal, LRU, NRU, NFU, second chance, clock, and random. The goal of page replacement algorithms is to minimize page faults. The document provides examples and analyses of how each algorithm approaches replacing pages in memory.

instruction cycle pptsheetal singh

The document discusses the instruction cycle in a computer system. The instruction cycle retrieves program instructions from memory, decodes what actions they specify, and carries out those actions. It has four main steps: 1) fetching the next instruction from memory and storing it in the instruction register, 2) decoding the encoded instruction, 3) reading the effective address for direct or indirect memory instructions, and 4) executing the instruction by passing control signals to relevant components like the ALU to perform the specified actions. The instruction cycle is the basic operational process in which a computer executes instructions.

Computer registersDeepikaT13

This document discusses computer registers and their functions. It describes 8 key registers - Data Register, Address Register, Accumulator, Instruction Register, Program Counter, Temporary Register, Input Register and Output Register. It explains what each register stores and its role. For example, the Program Counter holds the address of the next instruction to be executed, while the Accumulator is used for general processing. The registers are connected via a common bus to transfer information between memory and registers for processing instructions.

Computer architecture pipeliningMazin Alwaaly

InterruptsUrwa Shanza

The document discusses interrupts in a computer system. It defines an interrupt as a signal that breaks the normal sequence of program execution to handle an event that requires immediate attention, like input from a device. There are two main types of interrupts: hardware interrupts caused by external devices, and software interrupts caused by exceptional conditions in a program like division by zero. The document outlines how interrupts work, including how the processor saves the state of the interrupted program, services the interrupt, and then restores the original program context. It also discusses interrupt priorities and how interrupts can be disabled or deferred based on priority.

Computer architecture input output organizationMazin Alwaaly

Memory OrganizationKamal Acharya

Instruction Execution Cycleutsav_shah

The document discusses instruction execution in a computer processor. It describes how a processor executes instructions by fetching them from memory using the program counter. The instruction is placed in the instruction register and decoded by the control unit. The control unit then selects components like the ALU to carry out operations. Common components involved in instruction execution are the program counter, memory address register, instruction register, memory buffer register, control unit, arithmetic logic unit, and accumulator. The execution cycle involves fetching the instruction from memory address, decoding it, and then executing the instruction.

Input output organizationabdulugc

The document discusses various aspects of I/O organization in a computer system. It describes the input-output interface that provides a method for transferring information between internal storage and external I/O devices. It discusses asynchronous data transfer techniques like strobe control and handshaking. It also covers asynchronous serial transmission, different modes of data transfer like programmed I/O, interrupt-initiated I/O, and direct memory access (DMA).

Queue pptSouravKumar328

The document discusses different types of queues, including simple, circular, priority, and double-ended queues. It describes the basic queue operations of enqueue and dequeue, where new elements are added to the rear of the queue and existing elements are removed from the front. Circular queues are more memory efficient than linear queues by connecting the last queue element back to the first, forming a circle. Priority queues remove elements based on priority rather than order of insertion. Double-ended queues allow insertion and removal from both ends. Common applications of queues include CPU and disk scheduling, synchronization between asynchronous processes, and call center phone systems.

ArraysSARITHA REDDY

The document discusses arrays in data structures using C programming language. It defines what an array is and describes different types of arrays like one-dimensional, two-dimensional, and multi-dimensional arrays. It also explains array operations such as insertion, deletion, traversal, reversing, sorting, and searching. Additionally, it covers merging of arrays, arrays of pointers, and using arrays to represent polynomials.

Disk schedulingNEERAJ BAGHEL

This document discusses various disk scheduling algorithms: - FCFS handles requests sequentially but suffers from the global zigzag effect. - SSTF selects the request with the minimum seek time, reducing total head movement but risking starvation. - SCAN and C-SCAN move the disk arm back and forth, providing more uniform wait times. - LOOK and C-LOOK only move as far as the last request in each direction before reversing. Circular versions like C-SCAN are more fair but have larger total seek times. The optimal algorithm depends on disk load and request patterns.

Types of instructionsihsanjamil

Types of instructions can be categorized into data transfer, arithmetic, and logical/program control instructions. Data transfer instructions like MOV copy data between registers and memory. Arithmetic instructions include INC/DEC to increment/decrement values, ADD/SUB for addition/subtraction, and MUL/DIV for multiplication/division. Logical instructions perform bitwise operations while program control instructions manage program flow.

Chapter 3 INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMINGFrankie Jones

More Related Content

What's hot (20)

Stack organizationchauhankapil

Instruction codeDr. Abhineet Anand

Operating system services 9myrajendra

Instruction codespradeepa velmurugan

Computer Organization and Architecture.CS_GDRCST

Virtual memory pptPunjab College Of Technical Education

Page replacement algorithmsPiyush Rochwani

instruction cycle pptsheetal singh

Computer registersDeepikaT13

Computer architecture pipeliningMazin Alwaaly

InterruptsUrwa Shanza

Computer architecture input output organizationMazin Alwaaly

Memory OrganizationKamal Acharya

Instruction Execution Cycleutsav_shah

Input output organizationabdulugc

Queue pptSouravKumar328

ArraysSARITHA REDDY

Disk schedulingNEERAJ BAGHEL

Stack organizationchauhankapil

Instruction codeDr. Abhineet Anand

Operating system services 9myrajendra

Instruction codespradeepa velmurugan

Computer Organization and Architecture.CS_GDRCST

Virtual memory pptPunjab College Of Technical Education

Page replacement algorithmsPiyush Rochwani

instruction cycle pptsheetal singh

Computer registersDeepikaT13

Computer architecture pipeliningMazin Alwaaly

InterruptsUrwa Shanza

Computer architecture input output organizationMazin Alwaaly

Memory OrganizationKamal Acharya

Instruction Execution Cycleutsav_shah

Input output organizationabdulugc

Queue pptSouravKumar328

ArraysSARITHA REDDY

Disk schedulingNEERAJ BAGHEL

Viewers also liked (20)

Types of instructionsihsanjamil

Chapter 3 INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMINGFrankie Jones

Instruction codes and computer registersSanjeev Patel

The document discusses instruction codes and computer registers. Instruction codes are made up of an opcode and address that tell the computer what operation to perform. Computer registers store important data and instructions, including the program counter, address register, instruction register, temporary register, data register, accumulator, input register, and output register. These registers perform functions like holding memory operands, instructions, temporary data, addresses, and input/output characters.

Instruction cycleshweta-sharma99

The instruction cycle describes the process a computer follows to execute each machine language instruction. It involves 4 phases: 1) Fetch - the instruction is fetched from memory and placed in the instruction register. 2) Decode - the instruction is analyzed and decoded. 3) Execute - the processor executes the instruction by performing the specified operation. 4) The program counter is then incremented to point to the next instruction, and the cycle repeats. Each phase involves transferring data between the program counter, instruction register, memory, and other components via a common bus under the control of a timing unit. The instruction specifies the operation to be performed, such as a memory reference, register operation, or I/O access.

Instruction formatSanjeev Patel

An instruction format specifies an operation code and operands. There are three main types of instruction formats: three address instructions specify memory addresses for two operands and one destination; two address instructions specify two memory locations or registers with the destination assumed to be the first operand; and one address instructions use a single accumulator register for all data manipulation. Addressing modes further specify how the address field of an instruction is interpreted to determine the effective address of an operand. Common addressing modes include immediate, register, register indirect, auto-increment/decrement, direct, indirect, relative, indexed, and base register addressing.

Memory reference instructionSanjeev Patel

The document discusses memory reference instructions in a processor. It explains that bits 12-14 in the instruction register determine the memory reference instruction type, which can be AND to AC, ADD to AC, LDA, STA, BUN, BSA, or ISZ. It then describes the operation of each instruction type, including which decoder line is activated and the timing signals used to access memory and update registers.

Instruction cycleKumar

The document describes the phases of the instruction cycle in a CPU. It discusses the following phases: 1) Fetch - the next instruction is fetched from memory and stored in the instruction register using the program counter; 2) Decode - the instruction inside the register is decoded; 3) Execute - the control unit passes signals to function units like the ALU to perform the required actions like arithmetic or logic operations. It also describes common circuits used in a CPU like the program counter, memory address register, and instruction register.

Timing and-control-unitAnuj Modi

The document discusses the control unit of a CPU. It describes the functions of the control unit, which include generating timing signals, controlling data flow between the processor and memory/peripherals, and directing the computer to carry out instructions. The control unit can be implemented using either a hardwired or microprogrammed design. A hardwired control unit uses logic circuits to generate signals, while a microprogrammed unit executes a stored program of microinstructions.

Basic Computer Organization and Designmekind

This document discusses the basic concepts of computer architecture and organization. It describes the components of a basic computer including the CPU, memory, and I/O. It explains instruction formats, addressing modes, and the operation of a hardwired control unit. The control unit uses a sequence counter, instruction register, and decoders to generate control signals for instruction fetch, decode, and execution cycles. Interrupts are handled through an interrupt service routine stored in memory.

Assembly Language BasicsEducation Front

This document outlines the basics of assembly language, including basic elements, statements, program data, variables, constants, instructions, translation to assembly language, and program structure. It discusses statement syntax, valid names, operation and operand fields. It also covers common instructions like MOV, ADD, SUB, INC, DEC, and NEG. Finally, it discusses program segments, memory models, and how to define the data, stack, and code segments.

Assembly Language Lecture 1Motaz Saad

Part I:Introduction to assembly languageAhmed M. Abed

Computer organiztion5Umang Gupta

The document provides details about the basic computer organization and design based on Mano's simple processor model called the Basic Computer. It describes the components of the Basic Computer including its memory size, word size, registers, instruction format, addressing modes, instruction set, and instruction cycle. The Basic Computer has 4096 words of 16-bit memory, uses 12-bit and 16-bit registers, and its instruction format includes a 3-bit opcode and 12-bit address field. It executes instructions in a fetch-decode-execute cycle controlled by timing signals.

Basic Computer Organization and DesignKamal Acharya

Interruptsguest2e9811e

Interrupts allow external events to suspend and later resume processes running on a computer. They improve processor utilization by allowing the operating system to interrupt running processes to respond to external events like user input or I/O device completion. There are different types of interrupts including program-generated, timer, I/O, and hardware failure interrupts. When an interrupt occurs, the CPU saves its context and executes an interrupt handling routine that calls the appropriate interrupt service routine to handle the interrupt before resuming the original process.

Fetch execute cyclecachs_computing

This document provides an overview of the fetch execute cycle and the central processing unit (CPU). It explains that the CPU is located on the motherboard and is responsible for executing programs. The CPU has a control unit that coordinates operations and an arithmetic logic unit that performs calculations. The fetch execute cycle involves four steps - fetch, decode, execute, and store. It fetches instructions from memory, decodes them, executes the requested action, and stores results.

Assembly Language Lecture 2Motaz Saad

This document discusses assembly language fundamentals and MS-DOS functions using software interrupts. It covers the INT instruction, interrupt vector table, common interrupts like INT 10h for video and INT 21h for MS-DOS services. It provides examples of using INT 21h functions for input/output, including reading/writing characters and strings, reading the date/time, and displaying the date and time. The document is intended as an overview and introduction to assembly language and MS-DOS function calls.

Hardwired controlSiddique Ibrahim

Instruction Set ArchitectureDilum Bandara

The document discusses instruction set architecture (ISA), which is part of computer architecture related to programming. It defines the native data types, instructions, registers, addressing modes, and other low-level aspects of a computer's operation. Well-known ISAs include x86, ARM, MIPS, and RISC. A good ISA lasts through many implementations, supports a variety of uses, and provides convenient functions while permitting efficient implementation. Assembly language is used to program at the level of an ISA's registers, instructions, and execution order.

Microprogram Control Anuj Modi

A microprogrammed control unit stores control signals for executing instructions in a control memory rather than using dedicated logic. It has four main components: 1) a control memory that stores microinstructions specifying microoperations, 2) a control address register that selects microinstructions, 3) a sequencer that generates the next address, and 4) a pipeline register that holds the selected microinstruction. Microprograms are sequences of microinstructions that are executed to carry out machine-level instructions. Microinstructions can implement conditional branching to alter the control flow.

Types of instructionsihsanjamil

Chapter 3 INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMINGFrankie Jones

Instruction codes and computer registersSanjeev Patel

Instruction cycleshweta-sharma99

Instruction formatSanjeev Patel

Memory reference instructionSanjeev Patel

Instruction cycleKumar

Timing and-control-unitAnuj Modi

Basic Computer Organization and Designmekind

Assembly Language BasicsEducation Front

Assembly Language Lecture 1Motaz Saad

Part I:Introduction to assembly languageAhmed M. Abed

Computer organiztion5Umang Gupta

Basic Computer Organization and DesignKamal Acharya

Interruptsguest2e9811e

Fetch execute cyclecachs_computing

Assembly Language Lecture 2Motaz Saad

Hardwired controlSiddique Ibrahim

Instruction Set ArchitectureDilum Bandara

Microprogram Control Anuj Modi

Similar to Computer instructions (20)

Instructionformatreport 110419102141-phpapp02Shivani Gautam

The document discusses different types of instruction formats used in computers. There are three main types: memory reference instructions, register reference instructions, and I/O reference instructions. Memory reference instructions use bits to specify an operation code and memory address. Register reference instructions use bits to specify register operations. I/O reference instructions use bits to specify input/output operations.

computer-instructions-130126022653-phpapp01.pptxAshokRachapalli1

1) Computer instructions are encoded in binary formats called instruction codes that specify operations like addition, subtraction, etc. to perform on stored data. 2) Instruction codes are divided into an operation code and address of data. The operation code specifies the operation and the address points to the data. 3) Different computer architectures may have different instruction set formats, like memory reference, register reference, and I/O instructions that specify operations using bits in the instruction code.

Computer instruction(dp&co)GowriLatha1

The document describes three types of computer instructions: memory reference instructions, register reference instructions, and input/output instructions. Memory reference instructions use 12 bits to specify an address and 1 bit for addressing mode. Register reference instructions use 12 bits for the register operation and have a opcode of 111. Input/output instructions use 12 bits for the I/O operation and have an opcode of 111 and last bit of 1.

Instruction formatchauhankapil

This document discusses different types of instruction formats used in computer processors. It describes three main types: memory reference instructions, register reference instructions, and input/output instructions. Memory reference instructions use bits to specify an operation code and memory address. Register reference instructions use bits to specify a register and operation. Input/output instructions use bits to specify an I/O operation. The document provides details on the bit patterns used to encode each type of instruction.

Computer designPradeep Kumar TS

The computer system has a program counter, memory address register, memory buffer register, and instruction register that work together to fetch and execute instructions. It stores instructions in a 4-bit format and uses registers like the accumulator and sequence register to perform operations. Memory reference instructions include AND, ADD, STO, and branch instructions while register instructions modify the accumulator. Input/output instructions allow skipping on flags or reading/writing from ports. The fetch cycle reads instructions from memory into the instruction register before executing them in the execute cycle.

Programming with 8085.pptxSachinKupade

This document provides information about assembly language programming basics for the 8085 microprocessor. It begins with definitions of assembly language and its advantages over machine language. It then describes the basic features of a PC's hardware including registers, memory sizes and data types. The next sections cover binary and hexadecimal number systems and binary arithmetic operations. The remaining sections provide details about the different instruction sets of the 8085 including data transfer, logical, branching and arithmetic instructions as well as the various addressing modes.

Unit2pptx__2021_12wqeqw_27_08_56_15 (1).pptxrutvikrathod2324

To understand computer organization and architecture, it's essential to grasp both basic and advanced concepts that define how computers function and are structured. Basic Concepts of Computer Organization and Architecture 1. Definition and Importance Computer architecture refers to the design and structure of a computer system, encompassing the hardware components, instruction sets, and data formats. It provides a framework for how these elements interact to perform tasks effectively14. 2. Key Components Central Processing Unit (CPU): Often termed the "brain" of the computer, the CPU executes instructions from programs. It consists of: Arithmetic Logic Unit (ALU): Performs arithmetic and logical operations. Control Unit (CU): Directs operations within the CPU and coordinates activities between other components24. Memory: This includes various types of storage such as: RAM: Temporary storage for active processes. Cache Memory: A smaller, faster type of volatile memory that provides high-speed data access to the CPU1. Input/Output Devices: These are peripherals that allow interaction with the computer, such as keyboards, mice, and monitors. Storage Devices: Include hard drives and SSDs for long-term data storage12. 3. Basic Architectural Models Von Neumann Architecture: A foundational model where both data and program instructions are stored in the same memory space, utilizing a single bus for data transfer between memory and CPU1. Advanced Concepts of Computer Organization and Architecture 1. Instruction Set Architecture (ISA) ISA defines the set of instructions that a CPU can execute. It is crucial for understanding how software communicates with hardware, impacting performance and efficiency14. 2. Advanced CPU Features Modern CPUs may implement techniques such as pipelining (overlapping instruction execution) and superscalar architecture (multiple instruction issue), enhancing processing speed6. 3. Memory Hierarchy Understanding the hierarchy from registers to cache to main memory to secondary storage is vital for optimizing performance. Each level has different speed and size characteristics, influencing how data is accessed and processed34. 4. Multiprocessing and Multithreading These concepts involve using multiple processors or threads to perform tasks concurrently, significantly improving computational efficiency for complex applications35. 5. Performance Metrics Key metrics include throughput, latency, and efficiency. Techniques such as benchmarking help assess system performance under various workloads6. 6. System Design Principles Focus on scalability, reliability, and maintainability in designing computer systems. This includes considerations for hardware redundancy, error detection/correction mechanisms, and modular design45. By mastering both basic and advanced topics in computer organization and architecture, one can gain a comprehensive understanding of how computers work at both a functional and structural

Coa presentation1rickypatel151

This document provides information about the course AIT 204 Computer Organization and Architecture. Some key details include: - The course is worth 3 credits and is taught by Dr. Y R Ghodasara and Prof. K. C. Kamani at the College of Agricultural Information Technology, Anand Agricultural University, Anand. - Unit I explains the booting process of a computer in 6 steps from powering on to loading the operating system. - Other topics covered include digital vs analog, hardware vs software vs firmware, number systems, data representation, logic gates, Boolean algebra and circuit simplification.

CAAL_CCSU_U1.pdfsalabhmehrotra

The document provides an overview of the basic computer organization and design. It describes the components of a basic computer including memory, registers, instruction formats, addressing modes, and basic instruction set. The computer has 4096 words of memory, 12 registers including the program counter, accumulator, and address register. Instructions are 16 bits long and specify an opcode and address. The instruction cycle and timing are also explained along with the design of the hardware components and control logic.

Chapter 2 Part2 Aececourse

This document discusses how computers represent and manipulate data at the lowest levels. It covers: 1) How integers are represented in binary and how signed and unsigned integers work with 2's complement representation. 2) Data types like integers, real numbers, characters that are mapped to binary representations. Issues like byte ordering and memory addressing are also covered. 3) How instructions are encoded in binary machine code and the different instruction formats used in MIPS, including the R-format and I-format. Logical operations like shifting, AND, and OR that manipulate bits are also introduced.

Data representation _SwatiHans10

Part 1.pptxzoubeirAungnoo

The document discusses machine instruction characteristics and representation. It covers the following key points: 1) Machine instructions contain an operation code that specifies the operation to be performed, as well as references to source and result operands. 2) Each instruction is represented by a sequence of bits divided into fields corresponding to the instruction elements. 3) Common data types that can be used as operands include numbers, characters, and logical data represented as bit strings. Numeric formats can be integer, floating point, or packed decimal.

COMPUTER ORGANIZATION NOTES Unit 2Dr.MAYA NAYAK

This document discusses machine instructions and how programs are executed at the machine level. It covers number systems, data representation, memory addressing, instruction types, instruction execution, and addressing modes. Binary numbers are used in computers and represented as vectors. Negative numbers can be represented using sign-and-magnitude, one's complement, or two's complement methods. Memory is made up of addresses that store bits, bytes, and words of data. Instructions perform operations like data transfer, arithmetic, and program flow control. Programs are executed through sequential instruction fetch and execution, using techniques like looping and conditional branching. Addressing modes specify how operands are accessed in instructions.

Coding Schemes related dld lecture it is dldshayan03239

Mcs 012 soved assignment 2015-16Indira Gnadhi National Open University (IGNOU)

The document discusses performing arithmetic operations using 2's complement binary notation for 8-bit integers. It provides examples of adding -128 and 120, subtracting 124 from -99, and adding 64 and 61. Overflow is detected in the addition problems as the results are larger than can be represented with 8 bits. The subtraction problem is solved by converting the numbers to 2's complement and performing the operation.

Lecture 7 Data Representation (1).pptx for computer organization and architec...nungogerald

Binary codesGargiKhanna1

This document discusses various coding schemes including: - Binary coded decimal (BCD) which assigns a weight to each digit position to represent decimal numbers. Other positively weighted codes and negatively weighted codes are also discussed. - Gray code which minimizes the number of bit changes between adjacent values represented. This is useful for applications like thumbwheels. - Character encoding standards like ASCII, EBCDIC, and Unicode which can represent larger character sets with more bits per character. - Floating point number representation with sign, exponent and mantissa fields.

Instruction format UJJWAL MATOLIYA.pptxujjwalmatoliya

3 bit is used for opcode part. Memory reference instruction uses 12 bit for addressing part. 1 bit for addressing mode. For direct address most significant bit is set to zero and for indirect address MSB is set to one Zero address instructions One address instructions Two address instructions Three address instructions IT does not use any address field in the computational instruction ADD and MUL instruction don’t use any address field of the stack (set of memory location); however, address field is necessary for PUSH and POP instruction THE instruction with one address format use only one address field. IT use accumulator (AC) register for all types of data manipulation THE instructions with two address format uses two address fields. Each address field can specify a register or a memory location. example are: ADD, MOV , CMP, BIS etc. The various formats for specifying operand are called addressing modes. Immediate/Implied addressing mode Register addressing mode Register Indirect Auto Increment / Auto decrement Direct addressing mode Indirect addressing mode Relative addressing mode Index addressing mode Immediate/Implied addressing mode Register addressing mode Register Indirect Auto Increment / Auto decrement Direct addressing mode Indirect addressing mode Relative addressing mode Index addressing mode Base Register addressing mode

Microprocessor instructionshepzijustin

Digital logic degin, Number systemAshish Kumar Thakur

This document discusses various number systems and character encoding schemes used in digital circuits and computing including: 2's complement representation, binary coded decimal, Gray codes, and ASCII character encoding. It also discusses data storage in binary registers and processing data using digital logic circuits. The key topics covered are number representation, character encoding, data storage, and digital logic processing.

Instructionformatreport 110419102141-phpapp02Shivani Gautam

computer-instructions-130126022653-phpapp01.pptxAshokRachapalli1

Computer instruction(dp&co)GowriLatha1

Instruction formatchauhankapil

Computer designPradeep Kumar TS

Programming with 8085.pptxSachinKupade

Unit2pptx__2021_12wqeqw_27_08_56_15 (1).pptxrutvikrathod2324

Coa presentation1rickypatel151

CAAL_CCSU_U1.pdfsalabhmehrotra

Chapter 2 Part2 Aececourse

Data representation _SwatiHans10

Part 1.pptxzoubeirAungnoo

COMPUTER ORGANIZATION NOTES Unit 2Dr.MAYA NAYAK

Coding Schemes related dld lecture it is dldshayan03239

Mcs 012 soved assignment 2015-16Indira Gnadhi National Open University (IGNOU)

Lecture 7 Data Representation (1).pptx for computer organization and architec...nungogerald

Binary codesGargiKhanna1

Instruction format UJJWAL MATOLIYA.pptxujjwalmatoliya

Microprocessor instructionshepzijustin

Digital logic degin, Number systemAshish Kumar Thakur

More from Anuj Modi (18)

Android TechnologyAnuj Modi

This document provides an overview of the Android operating system, including its history and versions. It is owned by Google and is an open-source, Linux-based OS used primarily in mobile devices. The document outlines the major versions of Android from 1.0 in 2008 to the current version, 4.4 KitKat. It also discusses topics like Android rooting, advantages and disadvantages of the OS, market share of smartphones using Android, and the future of Android.

Virtual memoryAnuj Modi

The document discusses the concept of virtual memory. Virtual memory allows a program to access more memory than what is physically available in RAM by storing unused portions of the program on disk. When a program requests data that is not currently in RAM, it triggers a page fault that causes the needed page to be swapped from disk into RAM. This allows the illusion of more memory than physically available through swapping pages between RAM and disk as needed by the program during execution.

Synchronous and-asynchronous-data-transferAnuj Modi

Synchronous data transfer involves sharing a common clock between a CPU and I/O interface so that data transfer is coordinated. Asynchronous transfer has independent clocks, so handshaking methods like strobe control and handshaking are used. Strobe control uses a single strobe pulse to indicate valid data. Handshaking adds a second control signal for acknowledgment between units. This ensures the source knows data was received and the destination knows data is available.

Registers and-common-busAnuj Modi

Ram and-rom-chipsAnuj Modi

RAM is the main memory that allows bidirectional transfer of data via its data bus. It has a capacity of 128 bytes addressed by a 7-bit address. ROM can only read and can store more data than RAM in the same size chip. A memory address map assigns addresses to RAM and ROM chips. RAM uses address lines 1-7 and is selected by address lines 8-9 through a decoder. ROM uses address lines 1-9 and is selected by address line 10.

MemoryAnuj Modi

The document discusses computer memory and its types. It explains that memory is required to store data and instructions before, during, and after processing by the CPU. There are two main types of memory: primary and secondary. Primary memory (RAM and ROM) is high-speed volatile memory that is used for temporary storage and processing. Secondary memory (hard disks, optical disks, magnetic tapes, etc.) is non-volatile storage for long-term storage and retrieval of data. The document provides details about different types of primary and secondary storage, their characteristics, uses, and examples.

Cache memoryAnuj Modi

Cache memory is a small, fast memory located between the CPU and main memory. It stores copies of frequently used instructions and data to accelerate access and improve performance. There are different mapping techniques for cache including direct mapping, associative mapping, and set associative mapping. When the cache is full, replacement algorithms like LRU and FIFO are used to determine which content to remove. The cache can write to main memory using either a write-through or write-back policy.

HTML Lesson 5-insert-and-align-graphicsAnuj Modi

HTML Lesson 2-format-pages-and-textAnuj Modi

HTML Lesson 1-create-a-home-pageAnuj Modi

Introduction to-dbmsAnuj Modi

Data is a collection of raw facts and figures that can be processed by computing machines. Information is data that has been converted into a more useful form to help with decision making. A database is an organized collection of related information that can be easily accessed, managed, and updated. Common database operations include inserting, updating, deleting, and retrieving stored information. Manual databases are less efficient than computerized databases as the number of records increases due to issues like redundancy, inconsistency, isolation, security, speed of access and recovery of data.

DBAAnuj Modi

The document discusses the role and responsibilities of a database administrator (DBA). A DBA has centralized control over the database and is responsible for its creation, modification, and maintenance. Key responsibilities of a DBA include deciding the database's content and storage structure, providing support to users, defining backup and recovery strategies, setting security and integrity checks, and monitoring performance and making adjustments in response to changing requirements.

Data modelsAnuj Modi

This document discusses different types of data models, including object based models like entity relationship and object oriented models, physical models that describe how data is stored, and record based logical models. It specifically mentions hierarchical, network, and relational models as examples of record based logical data models. The purpose of data models is to represent and make data understandable by specifying rules for database construction, allowed data operations, and integrity.

Architecture of-dbms-and-data-independenceAnuj Modi

The document discusses the architecture of a database management system (DBMS). It describes the three levels of DBMS architecture: the external, conceptual, and internal views. The external view represents how individual users see the data. The conceptual view presents a common view of data for all users. The internal view describes the physical storage and organization of data. This three-level architecture provides data independence, where each level is isolated from changes in the other levels.

Central Processing Unit User ViewAnuj Modi

This document summarizes the central processing unit (CPU) and its organization. The CPU has three main parts: the register set, arithmetic logic unit (ALU), and control unit. It describes two common CPU organizations: general register organization and stack organization. General register organization uses multiple registers and a register set with a register file and ALU. The stack organization uses a last-in, first-out stack and stack pointer register. It also discusses addressing modes that provide programming versatility and reduce the number of bits in instruction addresses.

Graphs In Data StructureAnuj Modi

A graph G is composed of vertices V connected by edges E. It can be represented using an adjacency matrix or adjacency lists. Graph search algorithms like depth-first search (DFS) and breadth-first search (BFS) are used to traverse the graph and find paths between vertices. DFS recursively explores edges until reaching the end of a branch before backtracking, while BFS explores edges in levels starting from the starting vertex.

Graphs In Data StructureAnuj Modi

B trees in Data StructureAnuj Modi

B-Trees are tree data structures used to store data on disk storage. They allow for efficient retrieval of data compared to binary trees when using disk storage due to reduced height. B-Trees group data into nodes that can have multiple children, reducing the height needed compared to binary trees. Keys are inserted by adding to leaf nodes or splitting nodes and promoting middle keys. Deletion involves removing from leaf nodes, borrowing/promoting keys, or joining nodes.

Android TechnologyAnuj Modi

Virtual memoryAnuj Modi

Synchronous and-asynchronous-data-transferAnuj Modi

Registers and-common-busAnuj Modi

Ram and-rom-chipsAnuj Modi

MemoryAnuj Modi

Cache memoryAnuj Modi

HTML Lesson 5-insert-and-align-graphicsAnuj Modi

HTML Lesson 2-format-pages-and-textAnuj Modi

HTML Lesson 1-create-a-home-pageAnuj Modi

Introduction to-dbmsAnuj Modi

DBAAnuj Modi

Data modelsAnuj Modi

Architecture of-dbms-and-data-independenceAnuj Modi

Central Processing Unit User ViewAnuj Modi

Graphs In Data StructureAnuj Modi

B trees in Data StructureAnuj Modi

Computer instructions

1. COMPUTER INSTRUCTIONS MANINDER KAUR [email protected] Maninder Kaur [email protected] www.eazynotes.com 1

2. INSTRUCTION FORMAT An instruction format or instruction code is a group of bits used to perform a particular operation on the data stored in computer. Processor fetches an instruction from memory and decodes the bits to execute the instruction. Different computers may have their own instruction set. Maninder Kaur [email protected] www.eazynotes.com 2

3. INSTRUCTION FORMAT Instruction code is divided into two parts namely operation code and address of data.  Operation code consisting group of bits to define an operation such as add, subtract, multiply etc. Maninder Kaur [email protected] www.eazynotes.com 3

4. INSTRUCTION FORMAT In an instruction format:  First 12 bits (0-11) specify an address.  Next 3 bits specify operation code (opcode).  Left most bit specify the addressing mode I I = 0 for direct address I = 1 for indirect address Maninder Kaur [email protected] www.eazynotes.com 4

5. TYPES OF INSTRUCTIONS The basic computer has three 16-bit instruction code formats: 1. Memory Reference Instructions 2. Register Reference Instructions 3. Input/Output Instructions Maninder Kaur [email protected] www.eazynotes.com 5

6. Memory Reference Instructions In Memory reference instruction:  First 12 bits(0-11) specify an address.  Next 3 bits specify operation code (opcode).  Left most bit specify the addressing mode I I = 0 for direct address I = 1 for indirect address (Opcode = 000 through 111) Maninder Kaur [email protected] www.eazynotes.com 6

7. Memory Reference Instructions In Memory reference instruction:  first 12 bits (0-11) specify an address.  The address field is denoted by three x’s (in hexadecimal notation) and is equivalent to 12-bit address.  The last mode bit of the instruction represents by symbol I.  When I = 0, the last four bits of an instruction have a hexadecimal digit equivalent from 0 to 6 since the last bit is zero (0).  When I = 1 the last four bits of an instruction have a hexadecimal digit equivalent from 8 to E since the last bit is one (1). Maninder Kaur [email protected] www.eazynotes.com 7

8. Memory Reference Instructions Hexadecimal code Symbol I=0 I=1 Description AND 0xxx 8xxx AND memory word to AC ADD 1xxx 9xxx ADD memory word to AC LDA 2xxx Axxx LOAD Memory word to AC STA 3xxx Bxxx Store content of AC in memory BUN 4xxx Cxxx Branch unconditionally BSA 5xxx Dxxx Branch and save return address ISZ 6xxx Exxx Increment and Skip if zero Maninder Kaur [email protected] www.eazynotes.com 8

9. Register Reference Instructions In Register Reference Instruction:  First 12 bits (0-11) specify the register operation.  The next three bits equals to 111 specify opcode.  The last mode bit of the instruction is 0.  Therefore, left most 4 bits are always 0111 which is equal to hexadecimal 7. Maninder Kaur [email protected] www.eazynotes.com 9

10. Register Reference Instructions Symbol Hexadecimal code Description CLA 7800 Clear AC CLE 7400 Clear E CMA 7200 Complement AC CME 7100 Complement E CIR 7080 Circulate right AC and E CIL 7040 Circulate left AC and E INC 7020 Increment AC SPA 7010 Skip next instruction if AC positive SNA 7008 Skip next instruction is AC is negative SZA 7004 Skip next instruction is AC is 0 SZE 7002 Skip next instruction is E is 0 HLT 7001 Halt computer Maninder Kaur [email protected] www.eazynotes.com 10

11. I/O Reference Instructions In I/O Reference Instruction:  First 12 bits (0-11) specify the I/O operation.  The next three bits equals to 111 specify opcode.  The last mode bit of the instruction is 1.  Therefore, left most 4 bits are always 1111 which is equal to hexadecimal F. Maninder Kaur [email protected] www.eazynotes.com 11

12. I/O Reference Instructions Symbol Hexadecimal code Description INP F800 Input character to AC OUT F400 Output character from AC SKI F200 Skip on input flag SKO F100 Skip on Output flag ION F080 Interrupt on IOF F040 Interrupt off Maninder Kaur [email protected] www.eazynotes.com 12

Computer instructions

Recommended

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Computer instructions (20)

More from Anuj Modi (18)

Computer instructions