• Abstract Data Type (ADT) Structural Decomposition:
• Operations $\to$ (III): Specifies the external functional interface and public behavior of the ADT without exposing internal implementation.
• Storage Structures $\to$ (I): The underlying concrete organization and memory representation (arrays, pointer chains) used to hold data at a lower level.
• Algorithms $\to$ (II): Procedural instructions describing step-by-step manipulation and processing of data within the storage structure to execute operations.
• Matching Result: (A) - (III), (B) - (I), (C) - (II) (Option 3).

Correct option: (3) (A) - (IID, (B) - (1), (C) - (IN)

• Circular Queue Full and Empty Boundary Conditions:
• Consider a circular queue of capacity $n - 1$ implemented using an array of size $n$, with index pointers FRONT and REAR:
• One empty slot is reserved to distinguish between full and empty states.
• Empty Condition: When no elements reside in the queue:

• Full Condition: When inserting one more element would advance REAR to meet FRONT:

• Conclusion: Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT (Option 1).

Correct option: (1) Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT

• Asymptotic Complexity Notations:
• Big-Omega ($\Omega$) Notation: Defines an asymptotic lower bound on the growth rate of an algorithm's execution time. Formally:

• Other Notations:
• Big-O ($O$): Asymptotic upper bound ($f(n) \le c \cdot g(n)$).
• Theta ($\Theta$): Asymptotically tight bound.
• Little-o ($o$): Strict upper bound.
• Conclusion: Omega (Option 1).

Correct option: (1) Omega