32767 signed, 65535 unsigned.
Assume the first element is the largest and store its value. Then traverse the remainder of the list, one element at a time. If the current element's value is larger than the stored value, overwrite the stored value with the current element's value. Once you've traversed the list, the stored value will hold the largest value.
start input A & B if A>B print A is greatest if B>A print B is greatest stop james ola writes.....SOT.
To find the largest number: Assume (temporarily) that the first number is the largest number. You might call this the "largest number found so far". Then, for each number after the first one, compare the number with the largest number found so far. If the new number in the list is larger, call that one the "largest number found so far". Repeat for each number. After processing all the numbers, the "largest number found so far" will simply be the largest number.For example, if your list is (5, 2, 8, -1), you start assuming that 5 (the first number in the list) is the largest number. You compare with 2 - "5" is still the largest number, since 2 is smaller. When you compare with 8, you find that 8 is larger, so you replace your "largest number" with 8. "-1" is smaller, so nothing changes. Since we processed the entire list, the largest number is now 8.You can do the same - mutatis mutandis - to find the smallest number.
no it doesn't
A nibble is 4 bits, so the largest unsigned number is 1111, or 15. Also, the largest signed number is 0111, or 7.
The largest number which can be stored in an 8 bit memory byte is 255. The largest prime number below 255 is 251.
The largest number which can be stored in an 8 bit memory byte is 255 .The largest prime number below 255 is 251.
The largest number which can be stored in 8 bits is 255. The largest prime number which is less than or equal to 255 is 251.
The largest number which can be stored in an 8 bit memory byte is 255 . The largest prime number below 255 is 251.
8
674
9999.99
largest prime no. 6-bit is 61.
this means 26-1=63 .63 is the largest number can be stored in 6 bit pattern so nowlargest prime number in between 63 is 61
It isn't. The largest unsigned number that can be stored in one byte (8 bits) is 2^8 - 1 = 255.
what are bits and how can we use it with programming computers
Write your own prime number program and find out.