0
Add your answer:
Earn +20 pts
What is the significance of the power of 2s in computer science and mathematics?
The power of 2s is significant in computer science and mathematics because it is the basis for binary numbering systems, which are fundamental in digital computing. Powers of 2 are used in memory allocation, data storage, and calculations in computer programming. They also play a key role in algorithms, data structures, and other mathematical concepts, making them essential in various computational tasks.
How many IP addresses in one ip octet?
A complete IP address has 4 octets. MPGMichael We are talking IPv4 because IPv6 uses quintets. There are 4 octets in an IPv4 address. Each octet is separated by a dot (.) Each place has a binary value assigned to it as follows. 128s, 64s, 32s, 16s, 8s, 4, 2s, and 1s place The place values repeat in each octet The place values are read from right to left in binary numbers Within each octet there are 2^8 or 2 to the 8thpower possible addresses. So the math answer is 256. However if you write it out you will see that 128+64+32+16+8+4+2+1 = 255 and 256 is actually carried to the next octet. So there are 255 possible addresses in each octet For example a class C address would look like this 192.168.1.2 or binary 11000000.10101000.00000001.00000010
Why do computers use 2s not 10s?
Computers are only capable of differentiating between two possible states. That is: a switch is either on or off; a capacitor is either full of charge or it is empty; a score upon an optical disc is either long or short; there is either a flux transition or there is not; there is either a hole punched at a position on a card or there is not. All are valid ways of representing binary values and all are or have been used by computers at one time or another. We use 1s and 0s, but computers cannot; they are simple machines, they have no actual intelligence whatsoever. They have to use mechanic representations.
How many binary digits has an ip address?
There are 32 binary digits in an IPv4 address. There are 128 binary digits in an IPv6 address IPv4 addresses are organized into four 8 bit octets 11111111. 11111111. 11111111. 11111111 each place can represent either a zero or a one. Each place has an assigned binary place value. 1s, 2s, 4s, 8s, 16, 32s, 64, and 128s place right to left and repeating in each octet. There are 2^32 possible IP addresses = 4,294,967,296 possible addresses; or 4 billion 294 million 967 thousand 296. And they are all used up at this time. IPv4 addresses can also be written in decimal form. If you add all the place values in a single octet (128+64-32+16+8+4+2+1) it will equal decimal 255. IPv4 in decimal, as you will see it everywhere except class will look like this 255.255.255.255 Enough on IPv4 There are 128 binary digits in an IPv6 address. Therefore, there are 2^128 possible IPv6 addresses. That is in English is 340 undecillion, 282 decillion, 366 nonillion, 920 octillion, 938 septillion, 463 sextillion, 463 quintillion, 374 quadrillion, 607 trillion, 431 billion, 768 million, 211 thousand and 456 give or take a few. IPv6 addresses are represented by eight groups of hexadecimal quartets (four of them) separated by colons. Here is an example of a valid IPv6 address: 2001:cdba:0000:0000:0000:0000:3257:9652 Any four-digit group of zeroes within an IPv6 address may be reduced to a single zero or completely omitted. Consequently, the following IPv6 addresses are alike and equally valid. 2001:cdba:0000:0000:0000:0000:3257:9652 2001:cdba:0:0:0:0:3257:9652 2001:cdba::3257:9652 the omitted zeros have to occur together 2001:cdba…..can be converted to binary or decimal. Note each hex value in each quartet represents 4 binary digits. Just examining the second quartet in the above address we have Hex c d b a bin 1100 .1101 .1011 .1010 Dec 12 13 11 10
Why 2's complement binary subtraction is preffered over 1's complement binary subtraction?
1
The 2's compliment of the number 1000 is?
To get the 2s complement, find the 1s complement (by inverting the bits) and add 1. Assuming that number is [4-bit] binary it would be 1000. If it is preceded by 0s, as in, for example, 0000 1000, then it would be 1111 1000.
What is the binary complement 8 bit representation for negative 19?
8-bit 2s complement representation of -19 is 11101101 For 1s complement invert all the bits. For 2s complement add 1 to the 1s complement: With 8-bits: 19 � 0001 0011 1s � 1110 1100 2s � 1110 1100 + 1 = 1110 1101
What is binary equivalent of -15 using 2's complement?
-15 is 11111111 and 2s com is 1111 0001
What is the integer equivalent represented by 2's complement of the binary number 10001011?
To get the 2s complement, change all 1 bits to 0s and all 0 bits to 1s, and add 1 to the result. So the 2s complement of the 8-bit binary number 10001011 is the binary integer 01110101. If you want that in decimal, then remember that each place value column is twice the value of the place value column to its right, and the rightmost place value column for an integer is 1. Thus 01110101 in decimal is 64 + 32 + 16 + 4 + 1 = 117 (And 10001011 as a signed 8-bit binary integer represents the decimal integer -117.)
What is the 2's complement value of -85?
87
How you do find the binary code of -19?
One way is using the Twos (2s) complement; that is you find the binary representation of the positive number of -19, flip all the bits (0s to 1s and 1s to 0s), and finally add 1 to it.The positive bit of -19 is simply 19. It has a binary code of 0001 0011 (8 bits are required for this particular method). Flipping the bits, we get 1110 1100. Adding 1 (or 0000 0001) to our last answer, we get 1110 1101 which would be the binary representation of -19.
How do you represent -123 in twos complement in 10 bits register?
-123 = 11 1000 0101 [I presume the number 123 is in decimal] First write the positive number in binary using 10 bits (I've split it into groups of 4 bits to make it easier to read): 123 = 00 0111 1011 Convert to 1s complement by inverting all bits (any 0 => 1, any 1 => 0): 00 0111 1011 => 11 1000 0100 Finally add 1 to get 2s complement: 11 1000 0100 + 1 = 11 1000 0101 Thus the 2s complement of the negative number: -123 = 11 1000 0101 This can also be expressed in hexadecimal: -123 = 0x385 Or in octal (easy to convert if the binary number is first written in groups of 3 bits): -123 = 1 110 000 101 = 01605 [I've used C notation for the hexadecimal and octal numbers.]
Do binary numbers consist of 1 and 2s?
Yes
What is the 2's complement value of 98?
To find the 2s complement invert the bits and add 1: 98 = 1100010 = ...0000 0110 0010 (written in complete nybbles with leading 0 bits) → 2's complement: ...1111 1001 1101 + 1 = ...1111 1001 1110 Every bit in front of the first bit is a 1 (the exact number will depend upon the number of bytes used to store the number).
How do you detect overflow when adding two numbers in 2s complement form?
You can detect overflow if the result turns out to be negative (which is the same as checking to see if the sign bit is 1). For example if you tried to add 5 and 6 in to 4-bit 2s complement, you would get 0101 + 0110 = 1011, which is a negative number since the sign bit (the 1 on the left) is a 1. This is an overflow.
What is the 1's complement of 10?
The 1's complement is formed by inverting every binary digit (bit) of the number - if it is a 0 it becomes a 1, otherwise it is a 1 and becomes a 0. If 10 is in base 2, then its 1's compliment is 01 or just 1. If 10 is in base 10, then in binary it is 1010 and its 1's complement is 0101 = 5 in decimal. However, if more bits are being used to store it, there would be leading 0s that get inverted to 1s and so the resultant number is different; examples: 8 bits (a byte): decimal 10 = 0000 1010 → 1111 0101 = 245 in decimal 16 bits: decimal 10 = 0000 0000 0000 1010 → 1111 1111 1111 0101 = 65525 Next, if 2s complement is being used to represent negative numbers, the binary 1111 0101 represents decimal -11; similarly 1111 1111 1111 0101 represents decimal -11.
