Step 1: Understanding Stack-Organised Computers.
A stack-organised computer uses a stack to hold its operands and results. Instructions typically manipulate the stack and use a Last-In-First-Out (LIFO) order.
Step 2: Instruction Formats.
- Zero-Address Instructions: In this format, no operands are explicitly provided in the instruction. The operands are implicitly taken from the stack, and the result is placed back on the stack. This is the most common format used in stack-organised computers.
- One-Address Instructions: These require one operand to be explicitly specified, with the other operand implicitly taken from the stack.
- Two-Address Instructions: This format requires two explicit operands. It is typically used in register-based or accumulator-based computers.
- Three-Address Instructions: This format specifies three operands, often used in complex processors.
Step 3: Conclusion.
The correct answer is (A) Zero-Address Instructions, as stack-organised computers operate on a stack and typically use zero-address instructions.
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: