1 / 2

Explanation of XOR Operation in Computing

Learn the concept of XOR operation in computing, its advantages over subtraction, and how it works in parallel computation. Understand its application when converting byte addresses to word addresses.

jocelyn-zimmerman
Download Presentation

Explanation of XOR Operation in Computing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quiz 2 -Answer 1 area: lwc1 $f2,0($gp) # $f2=PI mul.d $f0,$f12,$f12 # $f0=R2 mul.d $f0,$f0,$f2 # $f0=R2*PI jr $ra #return 1 1000001 0110000… = -1.011*2(129 - 127)= -1.011*22 = 101.1 = 5.5 63.75 = 111111.11 = 1.1111111* 25 = 1.1111111* 2(1028 - 1023) = 0 10000000110 111111100000... Answer 2

  2. Answer 3 addi $t0,$zero,0xa010 # $t0=0xa010 lui $t0,0x700d # $t0=0x700da010 The upper bits of both PCs are the same so we just have to convert the byte address to a word address. So the address in the jump instruction is: 0x20000. Performing a XOR operation on two numbers. If they are equal the result will be 0. The result bits are then ORed together. If they are all 0 the result will be 0. It is faster because all bits are computed in parallel. Not like subtraction where the higher bits are dependent on the lower bit carries. Answer 4

More Related