Computer Application- ICAR JRF/SRF 2024

• 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

• Control Flow Structures:
• The decision structure:

If condition, then: [Module A] Else: [Module B] [End of if]

• Selects between two mutually exclusive execution paths based on the evaluation of a boolean condition.
• This fundamental algorithmic construct is termed a Double Alternative decision structure (as opposed to Single Alternative if-then or Multiple Alternative switch/case).
• Conclusion: Double Alternative (Option 2).

Correct option: (2) Double Alternative

• 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