Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Reduced Instruction Set Computer (RISC):
As we discussed before most of the modern CPUs are of the GPR (General Purpose Register) type. A few instances of such type of CPUs are the, IBM 360, Intel 80x86 ,Motorola 68xxx and DEC VAX But as these CPUS were obviously better than previous accumulator and stack based CPUs they were yet lacking in various areas:
1. The instructions were of varying length from 1 byte to 6-8 bytes. It is reason of problems with the pre- fetching and pipelining of instructions.
2. ALU (Arithmetic Logical Unit) instructions could have operands that were memory locations. Since the number of cycles it takes to access memory varies so does the all instruction. It isn't good for pipelining, compiler writers and several multiple issues.
3. Most of the ALU instruction had only 2 operands where 1 of the operands is also the destination. It means this operand is cracked in the time operation or it ought to be saved before somewhere.
Therefore in the early 80's the idea of RISC was come. The SPARC project was begun at Berkeley and the MIPS project at Stanford. RISC means Reduced Instruction Set Computer. The ISA is composed of instructions that all have accurately the similar size, typically 32 bits. so they can be pipelined and pre-fetched and successfully. All of the ALU instructions have 3 operands which are just registers. Only memory access is throughout explicit LOAD/STORE instructions. Therefore A = B + C can be assembled as:
LOAD R1, A
LOAD R2, B
ADD R3, R1, R2
STORE C, R3
What is Hamiltonian path? A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where
The hexadecimal number for (95.5) 10 is ? Ans. (95.5) 10 = (5F.8) 16 Integer part Fractional part 0.5x16=8.0
Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15) Use Karnaugh map. Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15) F'=B'D+B'C+AC+AB'
example of data dictionary
If various load generators need to access the similar physical files, rather than having to remember to copy the files every time they change, each load generator can reference a c
Define swapping. A process needs to be in memory to be implemented. Though a process can be swapped temporarily out of memory to a backing store and then brought back into mem
Q. Explain the following: a) Gray code b) Parity code c) Overflow Q. Give the counting up to 30 in Base 5. Q. Convert (175.6)8 into Gray code and Excess-3 code.
The logic circuit given below, converts a binary code y 1 y 2 y 3 into Ans. Gray code is X1 = Y1, X2 = Y1 XOR Y2 , X3 = Y1 XOR Y2 XOR Y3 For
Q. Designing the instruction format is a complex art? Instruction Length Significance: It's the fundamental issue of the format design. It concludes the richness and flex
what are the types of isoquants
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd