English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Perform the logical operation B3B2B1B0 (the numbers should be small) OR 1010 where Bi is a binary digit.

2007-02-28 07:52:39 · 4 answers · asked by Princess Peach 3 in Computers & Internet Hardware Other - Hardware

4 answers

it is somthing to do with prossesor buses and 16 bit prossesing but thats all i know

2007-02-28 07:59:23 · answer #1 · answered by mark d 3 · 0 1

Okay the first part looks like it is describing bit positions bit 3 bit 2 bit 1 bit 0. In this case:
Bit 3 is 1
Bit 2 is 0
Bit 1 is 1
bit 0 is 0

Bit 3 has a place value of 8 or 1 * 8 = 8
Bit 2 has a place value of 4 but it is 0 and 0 * 4 = 0
Bit 1 has a place value of 2 or 1 * 2 = 2
Bit 0 has a place value of 1 but it is 0 and 0 * 1 = 0
So the total is 10 in decimal. It is also the hex digit "a" in hexadecimal.

Bit positions are used to determine the value of a binary number. Each position is the next power of two higher:
1, 2, 4, 8, 16, 32, 64, 128, 256 etc.
Computers these days are generally 32 bit or 64 bit. This means that the highest number they can work with in a single instruction or the largest address that they can point at is 2^32-1 or 2^64-1.

Hope this helps.

2007-02-28 08:10:09 · answer #2 · answered by Ernie 4 · 0 1

OR anything with anything then you end up with the highest number in the binary position so 1111 OR 1010 =>1111. Alternatively 0000 OR 1010 => 1010. OR truth table is 0+0=>0 0+1 =>1 1+0=>1 1+1=>1

2007-02-28 08:02:03 · answer #3 · answered by Del Piero 10 7 · 0 1

What??!!

2007-02-28 08:14:06 · answer #4 · answered by Moofie's Mom 6 · 0 1

fedest.com, questions and answers