• Process States in Operating Systems:
• The Ready state is a queue (Ready Queue) where processes that are loaded into primary memory and waiting for CPU allocation reside.
• The number of CPUs ($n$) determines the maximum number of processes that can be in the Running state simultaneously ($n$ processes executing in parallel).
• However, the number of processes in the Ready state is limited only by available system memory, page tables, and OS configuration, and is therefore independent of $n$.
• Conclusion: Independent of n (Option 4).

Correct option: (4) Option 4

• Shortest Remaining Time First (SRTF / Preemptive SJF) Execution Trace:
• Timeline Analysis:
• Time ~0.001: P1 arrives with burst 8. P1 starts execution.
• Time ~4.001: P2 arrives with burst 6. Remaining time for P1 is $8 - 4 = 4$. Since $4 \lt 6$, P1 is not preempted and continues executing.
• Time ~8.001: P1 finishes execution. Only P2 is in the ready queue with burst 6. P2 begins execution.
• Time ~14.001: P2 finishes execution ($8.001 + 6 = 14.001$). Exactly at this time, P3 arrives with burst 4. Since the CPU is free, P3 is dispatched immediately at time 14.001!
• Time ~16.001: P4 arrives with burst 2. At this point, P3 has executed for 2 units, leaving a remaining burst of $4 - 2 = 2$. By standard tie-breaker (non-preemption on equal remaining burst), P3 continues and completes at time 18.001.
• Waiting Time Calculation for P3:

• Conclusion: The waiting time of process P3 is 0 (Option 4).

Correct option: (4) Option 4

• Linear vs. Non-linear Data Structures:
• Linear Data Structures: Elements are arranged sequentially where each element has a unique predecessor and successor (except first and last):
• Arrays, Lists, Linked Lists, Stacks, Queues.
• Non-linear Data Structures: Elements are arranged hierarchically or interconnected arbitrarily without a single sequential sequence:
• Tree: Hierarchical parent-child relationship.
• Graphs: Interconnected network of vertices and edges.
• Hash tables: Associative key-value mapping indexed via hash functions (non-sequential).
• List: Classic sequential linear data structure.
• Conclusion: (A), (B) and (C) only are non-linear data structures (Option 1).

Correct option: (1) (A), (6) and (C) only.