Step 1: Evaluate the options. - **Option 1** is the correct definition, as the PCB represents a process in the operating system. - **Option 2** is incorrect because the PCB stores more than just the process state; it stores other information like registers and I/O status. - **Option 3** is incorrect; the PCB doesn't control a block. - **Option 4** is incorrect because the PCB does not tell the logic behind the process. Thus, the correct answer is option **1**.
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: