Step 1: Understanding the sections.
- **Critical section** (C): This is the section where the process accesses shared resources.
- **Entry section** (A): This is the section before the critical section, where the process requests entry.
- **Remainder section** (B): The section after the critical section, where the process releases the resource and performs other tasks.
- **Exit section** (D): This section handles the exit process from the critical section.
Step 2: Arrange the sections correctly.
To form a valid structure for a process in the critical section:
- The process first enters the **Entry section** (A), checks for any conditions (if needed), and then moves to the **Critical section** (C).
- After completing its task in the **Critical section**, the process moves to the **Exit section** (D) to release the resource.
- Finally, the process moves to the **Remainder section** (B) for other tasks.
Step 3: Conclusion.
The correct order of statements is **(C), (B), (A), (D)**.
Find the next two terms of the series:
The given series is: \( A, C, F, J, ? \).
(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:
Find the number of triangles in the given figure.

Match List-I with List-II.
| List-I | List-II |
|---|---|
| A. Shortest First Served Scheduling | I. CPU is allocated to the process with the highest priority |
| B. Shortest Job First Scheduling | II. The process that requests the CPU first is allocated the CPU first |
| C. Priority Scheduling | III. The algorithm associates with each process the length of the next CPU burst |
| D. Round-Robin Scheduling | IV. A pre-emption is added to switch between processes |
Choose the correct answer from the options given below:
Match List-I with List-II.
| List-I | List-II |
|---|---|
| A. Shortest First Served Scheduling | I. CPU is allocated to the process with the highest priority |
| B. Shortest Job First Scheduling | II. The process that requests the CPU first is allocated the CPU first |
| C. Priority Scheduling | III. The algorithm associates with each process the length of the next CPU burst |
| D. Round-Robin Scheduling | IV. A pre-emption is added to switch between processes |
Choose the correct answer from the options given below: