A, B, C, D, G, H, I, L, M, N are presents 0,1,2,3,4, 5, 6, 7, 8, 9 respectively of decimal number system  (base 10) so, (INDIAN)_IO = (693609)₁₀
To find its hexadecimal equivalent

Thus (INDIAN)₁₀ = (693609)₁₀ = (A9569)₁₆

(i) Unicode is the newest concept in digital coding. In Unicode, every number has a unique character.
(ii) Unicode is the universal character encoding standard used for the representation of text for computer processing
(iii) It can be used to store and process all significant current and past languages. Unicode provides a unique hex encoded number for every character.
(iv) Unicode is a 16-bit code, which allows for about 65,000 different representations. This is enough to encode the popular Asian languages (Chinese, Korean, Japanese, etc.)
(v) It also turns out that ASCII codes are preserved. Therefore, conversion between ASCII and Unicode is a simple method (take all one byte ASCII codes and zero-extend them to 16 bits).
(vi) This will be the Unicode version of the ASCII characters. The C, C++ programs use the ASCII Code, and Java programs have already used Unicode. The Unicode Standard has been adopted by industry leaders such as Apple, HP, IBM, Microsoft, Oracle, SAP, Sun, Sybase, and Unisys. Unicode is required by web users and
modem standards.

The NOR gate circuit is an OR gate followed by an inverter. Its output is "true" if both inputs are "false" Otherwise, the output is "false". In other words, the only way to get 'I' as output is to have both inputs '0'. Otherwise the output is O. The logic circuit of the NOR gate is

The output of NOR gate is
C = \(\overline { \left( A+B \right) } \)
Read this as "C equals NOT of A OR B" or "C equals the complement of A OR B".
For example if both the input are o
C = \(\left( 0+0 \right) \) = \(\bar { 0 } \) = 1
The truth table for NOR gate is

NAND Gate:
The NAND gate operates an AND gate followed by a NOT gate. It acts in the manner of the logical operation "AND" followed by inversion. The output is "false" if both inputs are "true", otherwise,' the output is "true". In other words the output of the NAND gate is 0 if and only if both the inputs are 1, otherwise the output is 1. The logic circuit of NAND gate is

The logical Symbol of NAND gate is

The output of the NAND gate is
C = \(\overline { \left( A.B \right) } \)
Read this as "C" equals NOT of A AND B" or "e" equals the complement of A AND B".
For example, if both the inputs are 1
C = \(\overline { \left( 1.1 \right) } \) = \(\bar { 1 } \) = 0
the truth table for NAND gate is

AND and OR operation from NAND gates are shown below

A.B = (A NAND B) NAND ( A NAND B)
OR operation

A+B (ANAND A)NAND (B NANDY Y)
b) AND AND OR operation from NOR gates are shown below.

A - B = (A NORA A) NOR (B NOR B)

A+ B = (A NOR B) NOR (A NOR B)

AND Gate:
The AND gate can have two or more input signals and produce an output signal.
The output is "true" only when both inputs are "true", otherwise, the output is "false". In other words, the output will be 1 if and only if both inputs are 1;  otherwise the output is O. The output of the AND gate is represented by a variable say C, where A and B are two and if input boolean variables. In boolean algebra, a variable can take either of the values '0' or '1'. The logical symbol of the AND gate is AND gate is

One way to symbolize the action of an AND gate by writing the boolean function.
C = A AND B
In boolean algebra the multiplication sign stand for the AND operation. Therefore, the output of the AND gate is
          C = A.B or
Simply C = A .B
Read this as "C equals A AND B". Since there an two input variables here, the truth table has four entries, because there are four possible inputs: 00 01, 10 and 11
For instance both inputs are 0,
C = A.B
   = 0 .0 
    = 0
The Truth Table For AND Gate is

OR Gate:
The OR gate gets its name from the face that behaves like the logical inclusive "OR"  The output is "true" if either or both of the inputs are "true", both inputs are "false" then the output is "false", other words the output will be 1 if and only if 0, or both inputs are 1; otherwise, the output is 0, the logical symbol of the OR gate is

The OR gate output is
C = A or B
We use the + sign to denote the OR function therefore
C = A + B
Read this C equals A or B
For instance, if both the input are 1
C = A + B = 1 + 1 = 1
The truth table For OR Gate is

NOT Gate;
The NOT gate, called a logical inverter, has only one input. It reverses the logical state. In other words the output C is always the complement of the input. The logical symbol of the NOT gate is

The Boolean function of Not Gate is
C = NOT A
In boolean algebra, the overbar stands for NOT operation. Therefore,
C = \(\bar { A } \)
Read This as "C" equals Not "A" or "C" equals the complement of "A''
If A is 0
C = \(\bar { 1 } \) = 0
On the other hand, if A is 1
C = \(\bar { 1 } \) = 0
The truth table for NOT gate is