Match LIST-I with LIST-II
\[\begin{array}{|c|c|}\hline \text{LIST-I (Hex Code)} & \text{LIST-II (Instruction)} \\ \hline \text{A. 4F} & \text{I. MOV C,A} \\ \hline \text{B. 80} & \text{II. ADD B} \\ \hline \text{C. 47} & \text{III. MOV B,A} \\ \hline \text{D. 76} & \text{IV. HLT} \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Step 1: Understand the instruction codes.
Each hexadecimal code in LIST-I corresponds to a specific instruction in LIST-II.
- **A: 4F** corresponds to "MOV C,A" (This is a common instruction in assembly language where the contents of register A are moved to register C).
- **B: 80** corresponds to "ADD B" (This is an addition operation with the operand in register B).
- **C: 47** corresponds to "MOV B,A" (This moves the contents of register A to register B).
- **D: 76** corresponds to "HLT" (This halts the processor or the program execution).
Step 2: Conclusion.
The correct matching is:
- A - I (MOV C,A)
- B - II (ADD B)
- C - III (MOV B,A)
- D - IV (HLT)
Thus, the correct answer is option (2).
Find the least upper bound and greatest lower bound of \( S = \{X, Y, Z\} \) if they exist, of the poset whose Hasse diagram is shown below:
Suppose \( D_1 = (S_1, \Sigma, q_1, F_1, \delta_1) \) and \( D_2 = (S_2, \Sigma, q_2, F_2, \delta_2) \) are finite automata accepting languages \( L_1 \) and \( L_2 \), respectively. Then, which of the following languages will also be accepted by the finite automata:
(A) \( L_1 \cup L_2 \)
(B) \( L_1 \cap L_2 \)
(C) \( L_1 - L_2 \)
(D) \( L_2 - L_1 \)
Choose the correct answer from the options given below: