Answer:
The highest numeral in binary code is 1
In binary, you can only have 1s and 0s
if you're asking for the biggest number that can be represented, it's 255, which is 11111111. (this is 8 1s)
Explanation:
Is this a trick question? lol
May I have brainliest please? :)
3-database of new clients
Answer:
Your computer does not support this code because you have put spaces in between the code, or maybe that is how you have written the question.
Answer:
In a <u>little endian computer</u> -The data's least substantial byte is put at the lower address byte. The remaining information will be put in memory in order in the next three bytes.
a)1234
4 is placed at the least significant bits,so this byte stored at lower memory address.
1 is placed at the most significant bits,so this byte stored at higher memory address.
b) ABFC
C is placed at the least significant bits,so this byte stored at lower memory address.
A is placed at the most significant bits,so this byte stored at higher memory address.
c) B100
0 is placed at the least significant bits,so this byte stored at lower memory address.
B is placed at the most significant bits,so this byte stored at higher memory address.
d) B800
0 is placed at the least significant bits,so this byte stored at lower memory address.
B is placed at the most significant bits,so this byte stored at higher memory address.
Answer:
PROGRAM QuadraticEquation
Solver
IMPLICIT NONE
REAL :: a, b, c
;
REA :: d
;
REAL :: root1, root2
;
//read in the coefficients a, b and c
READ(*,*) a, b, c
WRITE(*,*) 'a = ', a
WRITE(*,*) 'b = ', b
WRITE(*,*) 'c = ', c
WRITE(*,*)
// computing the square root of discriminant d
d = b*b - 4.0*a*c
IF (d >= 0.0) THEN //checking if it is solvable?
d = SQRT(d)
root1 = (-b + d)/(2.0*a) // first root
root2 = (-b - d)/(2.0*a) // second root
WRITE(*,*) 'Roots are ', root1, ' and ', root2
ELSE //complex roots
WRITE(*,*) 'There is no real roots!'
WRITE(*,*) 'Discriminant = ', d
END IF
END PROGRAM QuadraticEquationSolver
