Hexadecimal numbers are just a convenient representation of binary data. When entered as text, they consist of ASCII characters 0-9 and a-f. The numbers will then have to be converted to binary. This is accomplished by converting to uppercase, subtracting the ASCII offset (48 for 0-9 or 55 for A-F), so that the result is a number between 0 and 15 (inclusive). This can be stored in computer memory to represent 4 bits.
Hexadecimal numbers represent binary numbers in the following way:
hex | binary
0 = 0000
1 = 0001
2 = 0010
3 = 0011
4 = 0100
5 = 0101
6 = 0110
7 = 0111
8 = 1000
9 = 1001
a = 1010
b = 1011
c = 1100
d = 1101
e = 1110
f = 1111
As you can see, no other 4 bit combination exists.
Answer:
00(01)*+|(01)*+101|00(01)*+101
Rest detail is in explanation.
Explanation:
(01)* means all the strings comprising of 0 and 1
when we add + the set includes empty sets as well. and for or we use union, and this can be done using the | sign.
And for concatenation, we have like 00(01)* etc. Hence, the above regular expression.
Answer:
#include <iostream>
using namespace std;
int main()
{
int i = 45;
for ( i = 45; i <=165; i = i + 6)
cout << i << endl;
}
Explanation:
I corrected your code and highlighted the mistakes. Even though you wrote the correct algorithm, your code did not compile because of the typos you made.
Remember, C++ is a case-sensitive language. That means, "For" is not same as "for".
Generally, variables and keywords are written in lower case. Of course, there are exceptions, such as constant variables are all written in uppercase letter and class names start with an uppercase letter.
