Review notes on the principles of computer organization-the abbreviated version contains sample questions (do not enter the ugly characters)

Comprehensive Review of Principles of Computer Composition [Pi Pilei]

Chapter One Introduction

1. Von Neumann is centered on arithmetic unit -> now, centered on memory
2. Central processing unit: arithmetic unit + controller (input device, output device, memory)
3. Performance indicators: machine word length, data Channel width, main memory capacity, computing speed

Chapter 2 Data Machine Level Representation

1. Change the pattern to ask for X, [X] original, [X] complement, [X] reverse
(Listening to the teacher carefully is the fastest way to learn this part), it is recommended to do all the examples in the book again
2. Fixed-point notation (you can only memorize if you can’t remember, but smart kids never have to memorize it by rote)
3. Floating-point notation
4. IEE754
whether it is forward or backward, it is possible to ask questions, Don't take a fluke
5. CRC code
Insert picture description here
Insert picture description here

Insert picture description here

Chapter III Command System

1. The instruction format is
m instructions, and the number of opcode fields is N, then ***m<=2^N***
2. Addressing method
(1) Word addressing: each instruction executed, PC+1; Read a data from the main memory, address counter+1
(2) Byte addressing: every time an instruction is executed, PC+4
(3) bit addressing
3. Data addressing mode
Immediate addressing
register addressing S=( Ri)
Direct addressing S=(A)
Indirect addressing S=((A))
Register indirect addressing S=((Ri))
Indexed addressing S=((Rx)+A) Where Rx is the indexed register
Base addressing S=((Rb)+D) where Rb is the base address register
Relative addressing EA=(PC)+D Range (PC)-2 (n-1) ~(PC)+2 (n-1 ) -1

Data addressing will definitely cause big problems here, so find more classic questions to practice your hands

Insert picture description here

Chapter 4 Numerical Machine Calculation

1. Complement code addition and subtraction
2. Judgment overflow
00 no overflow
01 positive overflow
10 negative overflow
11 no overflow
3. Original code one-digit multiplication
Learn to explain the schematic diagram on the book , the exam will have short answer questions
4. Original code division during the
general exam Multiplication of the original code will be a big problem, and the steps of the original code division will be a fill-in-the-blank problem

For example: negative -> quotient 0 left shift + |Y|, positive -> quotient 1 left shift + [|Y|] change complement
Insert picture description here

5. Floating-point addition
steps will be used as fill-in-the-blank questions: order, add mantissa, normalize, round, judge overflow

Insert picture description here

Chapter 5 Storage System and Structure

1. Storage system hierarchy
remember 1B=1 byte=8bit
2. Dynamic RAM refresh method: centralized, distributed, asynchronous
3. Main memory address, cache address, direct image test will have big questions (find classics yourself Question type practice)

Chapter 6 Central Processing Unit (controller + arithmetic unit)

1. The main registers in the CPU: general registers + special registers

2. Special registers broken down :( exam will be a data flow diagram, and then rely on your special function registers are what's what)??
The program counter PC: instructions for storing the address being executed or the next address of the next instruction
instruction Register IR: store the instruction fetched from the main memory.
Memory data register MDR: store the data word or instruction
memory address read from or written to the main memory. Register MAR: store the main memory unit currently accessed by the CPU Address
Status register PSWR: store the program status word
such as CF: carry flag bit, ZF: zero flag bit

3. The basic composition of the controller: instruction components, timing components, interrupt control logic, micro-operation signal generator

4. The hardware realization method of the controller: combination logic type, storage logic type, combination logic and storage logic combination type

5. Instruction operation process: ( fetch instruction, data-look at the stage )
instruction fetch stage-analysis fetch stage-execution stage

Insert picture description here
6. Basic terminology:
Micro commands: micro-operation control signal
micro-operation: the operation of the micro-command
microinstruction: a content storage control unit, a plurality of micro-commands set
the micro-address: a memory control unit stores the address of the control word
Microprogram: an ordered collection of a series of microinstructions
Program: composed of machine instructions, compiled by the programmer, and stored in the main memory in advance

Exercises 6-13 and 6-14 in the book "The Principles of Computer Composition in Jiang Benshan's Version" are very classic

Insert picture description here

Insert picture description here

Chapter 7 Bus: A common information transmission line for multiple components ***time sharing***

chapter eight

Will fill in the blank question for example: 24*24 dot matrix Barabara, the answer is 72.. . . During the epidemic, this part was not the focus

Chapter 9 Input and Output System (too many concepts are tested)

1. Serial : serial transmission of one bit of data
2. Parallel : transmission width is all bits of a byte (or word)
3. Addressing method : independent addressing, unified addressing
4. **Interrupt: * * while the computer is normally performed in an emergency exceptions or special circumstances suddenly occurs, CPU to temporarily suspend the current procedures, and turn to emergency events occur randomly for processing, after processing, CPU return to their own original program to continue
5 . interrupt condition :
① CPU receives an interrupt request
②CPU interrupt
③ execution of an instruction is completed
6. interrupt process : an interrupt request, the arbiter, in response, the processing returns to
7. the interrupt arbitration : for those issuing interrupt request requires immediate attention, or For interrupt sources that can cause serious consequences, specify the highest priority; for those interrupt sources that can delay response and processing, specify a lower priority.
8. DMA composition : main memory address counter, transfer length counter, interrupt mechanism, DMA request trigger, control/status register, data buffer register
9. DMA working process : DMA preprocessing, data transfer, DMA post-processing

Screenshots of some messy sample questions

In terms of memory expansion, design questions (mostly word expansion )
such as 32KB->256KB
Insert picture description here

Insert picture description here
PS: It is not easy to sort by hand, please like and pay attention. Pirate picture dog biss, network spray biss.

Guess you like

Origin blog.csdn.net/qq_43704702/article/details/108430853