Qus : 1
WB JECA MCA PYQ
1
Each stage in pipelining should be completed within _________cycles.
(A) 1
(b) 2
(C) 3
(D) 4
1
A 2
B 3
C 4
D Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
In pipelining, the CPU instruction is divided into stages (Fetch, Decode, Execute, etc.). To maximize throughput, each stage must complete within 1 clock cycle . This ensures that new instructions can enter the pipeline without delay.
Correct Answer: (A) 1
Qus : 8
WB JECA MCA PYQ
2
A process is thrashing if ____.
1
it spends more time in execution, rather than paging 2
it spends more time in paging, rather than in execution 3
it has no memory allocated to it 4
it indefinitely waits for a resource Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: Thrashing occurs when the CPU spends most of its time handling page faults rather than executing instructions.
Answer: (B) it spends more time in paging, rather than in execution
Qus : 12
WB JECA MCA PYQ
1
When several processes access the same data concurrently and the outcome depends on the particular order in which the access takes place is called ________.
1
Race condition 2
Critical condition 3
Virtual condition 4
Linear condition Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: Order-dependent outcomes from concurrent access is a classic race condition .
Answer: (A) Race condition
Qus : 21
WB JECA MCA PYQ
2
15. If only one process can be able to access a particular resource at a time, then it is known as ______________.
(A) Mutual execution (B) Mutual exclusion (C) Multiple execution (D) Multiple exclusion
1
Mutual execution 2
Mutual exclusion 3
Multiple execution 4
Multiple exclusion Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: Allowing only one process to access a resource at a time is called mutual exclusion (mutex).
Qus : 23
WB JECA MCA PYQ
4
17. Banker’s algorithm for resource allocation deals with ______________.
(A) mutual exclusion (B) mutual inclusion (C) deadlock recovery (D) deadlock avoidance
1
mutual exclusion 2
mutual inclusion 3
deadlock recovery 4
deadlock avoidance Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: Banker’s algorithm is a deadlock avoidance algorithm ensuring the system stays in a safe state.
Qus : 24
WB JECA MCA PYQ
2
18. Page fault means ______________.
(A) required page is available in main memory (B) required page is not available in main memory (C) segment number (D) reduce page I/O
1
required page is available in main memory 2
required page is not available in main memory 3
segment number 4
reduce page I/O Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: A page fault occurs when the referenced page is not present in main memory, forcing a page-in from secondary storage.
Qus : 26
WB JECA MCA PYQ
3
20. Demand paging is considered as ______________.
(A) fetching a page when not needed (B) switching between two processes (C) fetching a page only when needed (D) switching between two threads
1
fetching a page when not needed 2
switching between two processes 3
fetching a page only when needed 4
switching between two threads Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: In demand paging , a page is loaded into memory only when it is actually referenced.
Qus : 27
WB JECA MCA PYQ
4
21. Thrashing means a condition having ______________.
(A) minimum paging (B) optimized paging (C) synchronized paging (D) excessive paging
1
minimum paging 2
optimized paging 3
synchronized paging 4
excessive paging Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: Thrashing occurs when the system spends most time paging due to insufficient frames, causing excessive paging and poor performance.
Qus : 28
WB JECA MCA PYQ
2
22. A counting semaphore is initialized to 15. Then, 4 wait operations and 2 signal operations are completed on this semaphore. The resulting value of the semaphore is ____________.
(A) 11 (B) 13 (C) 17 (D) 19
1
11 2
13 3
17 4
19 Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: Each wait (P) decrements; each signal (V) increments.
Initial: 15 → after 4 waits: 11 → after 2 signals: 13.
$$ 15 - 4 + 2 = 13 $$
Qus : 30
WB JECA MCA PYQ
4
24. In file management, FAT means ______________.
(A) Feature Access Table (B) File Access Table (C) Fault Allocation Table (D) File Allocation Table
1
Feature Access Table 2
File Access Table 3
Fault Allocation Table 4
File Allocation Table Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2023 PYQ
Solution
Explanation: FAT stands for File Allocation Table , a file system layout used to map files to disk clusters.
[{"qus_id":"12634","year":"2024"},{"qus_id":"12641","year":"2024"},{"qus_id":"12659","year":"2024"},{"qus_id":"12661","year":"2024"},{"qus_id":"12672","year":"2024"},{"qus_id":"12674","year":"2024"},{"qus_id":"12675","year":"2024"},{"qus_id":"12676","year":"2024"},{"qus_id":"12688","year":"2024"},{"qus_id":"12689","year":"2024"},{"qus_id":"12690","year":"2024"},{"qus_id":"12691","year":"2024"},{"qus_id":"12693","year":"2024"},{"qus_id":"12695","year":"2024"},{"qus_id":"12696","year":"2024"},{"qus_id":"12699","year":"2024"},{"qus_id":"12701","year":"2024"},{"qus_id":"12702","year":"2024"},{"qus_id":"12707","year":"2024"},{"qus_id":"12769","year":"2023"},{"qus_id":"12770","year":"2023"},{"qus_id":"12771","year":"2023"},{"qus_id":"12772","year":"2023"},{"qus_id":"12773","year":"2023"},{"qus_id":"12774","year":"2023"},{"qus_id":"12775","year":"2023"},{"qus_id":"12776","year":"2023"},{"qus_id":"12777","year":"2023"},{"qus_id":"12778","year":"2023"},{"qus_id":"12779","year":"2023"},{"qus_id":"12788","year":"2023"},{"qus_id":"12789","year":"2023"},{"qus_id":"12790","year":"2023"},{"qus_id":"12791","year":"2023"},{"qus_id":"12792","year":"2023"},{"qus_id":"12793","year":"2023"},{"qus_id":"12794","year":"2023"},{"qus_id":"12795","year":"2023"}]