Study guides

☆☆

Q: What is the larest binary number a nibble can hold?

Write your answer...

Submit

Still have questions?

Continue Learning about Engineering

A binary tree is a data structure consisting of binary nodes. A binary node is a data structure with two branches, each of which may hold a reference to another binary node. These branches are known as the left and right branches respectively. Since the nodes maintain references to every other node in the tree, it is only necessary to keep track of the root node.

Each hexadecimal digit can hold one of 16 values (0-F); 16 = 2^4, so exactly 4 bits (binary digits) can hold the same value as 1 hexadecimal digit. As a result the conversion from binary to hexadecimal is simply a matter of grouping the bits together in blocks of 4 (making nybbles) and converting each block into a single hexadecimal digit. Similarly for binary to octal but in this case as 8 = 2³ the bits are group into blocks of 3 which are then converted into octal digits. However, converting decimal to hexadecimal is not so "easy" as each decimal digit does not map to an exact number of binary digits. The only exception would be when using BCD (Binary Coded Decimal) where only the bit patterns for the decimal digits 0-9 are used in every 4 bits (wasting 6 possible digits) and where 0000 1001 (09) + 0000 0001 (01) = 0001 0000 (10). In this case the hexadecimal representation of the BCD is exactly the same as the decimal, but I have never seen it used as such (beyond the binary representation).

If you assign -1 to a unsigned variable it will contain the biggest number its able to hold. For example if you assign -1 to a unsigned int it will be 4294967295 as its the biggest number a unsigned int can hold.

Answer to Why ASCII has only 255 codesAs you know the alphabet has 26 letters. If you include capital letter that would be 52. There is also lots of punctuation, digits we end up with 127. But there is other function buttons (example. Ctrl + Alt + Del) we need to get more space. If we use 7 binary digits (Computers counting systems is binary) we end up with 127. That isn't enough to hold all the characters. So we make it 8 binary digits. The maximum number for 8 binary digits is 11111111. Which in our counting system is 255.AnswerASCII is a 7-bit character encoding, so it has only 128 codes: 0 through 127. The upper 128 codes in an 8-bit byte (128 through 255) are unused and undefined by ASCII, but many ASCII extensions (such us ISO-8859-1) make use of those unused codes.

Structures in C are user defined data types. They can hold a number of values but all must be of the same type.

Related questions

Its all in binary really. As each binary number refers to the pixel it will hold to form the shape after.

1 byte may be able to hold just 1 number of the binary code chain (I.E. 1001111001010100011010)

Unsigned.

Yes - it's the largest number that can be represented in Binary code with 8 bits

It is most commonly called an unsigned integer, but some programming languages have other terms for it.

Static RAM

I had mouses at my home, they nibble your clothes into shreds. Then a pest control was arranged. It made things better.

This is because a number represented in hexadecimal requires fewer digits. A hexadecimal string of length s can hold a number which is approx 8^s as large as a binary string of the same length.

Actually, that answer is incorrect. Binary is used to hold information. However, without a context, the information can only be translated as a number. There are two types of binary integers (ironic, right?). The first type is called unsigned. The second type is called signed. If you have an unsigned binary integer, the number can only be positive. If you have a signed binary integer, the first number indicates the sign of the number (and ONLY the sign. A position cannot mean both a value AND positive or negative). A '0' in front means positive, and a '1' in front means negative. So, if the number in question was an unsigned integer, it would have a value of 1024 + 64 + 32 + 16 + 4 + 1 = 1141. If the number in question was a signed integer, it would have a value of (-1)*(64 + 32 + 16 + 4 + 1) = -117.

Theoretically, the smallest amount of data a binary computer can hold is one bit (an eighth of a byte. it can only hold two states: 1 or 0.)

A binary tree is a data structure consisting of binary nodes. A binary node is a data structure with two branches, each of which may hold a reference to another binary node. These branches are known as the left and right branches respectively. Since the nodes maintain references to every other node in the tree, it is only necessary to keep track of the root node.

In digital logic and computing, a counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship to a clock signal.A register is a device that can hold a binary number or series of bits-just store it-.

People also asked