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
Previous 10 Questions — JECA MCA 2023
Nearest first
1
2
3
4
5
6
7
8
9
10
14. _________ is the most appropriate scheduling in case of a time-shared operating system.
(A) FCFS (B) R…
Topic: JECA MCA 2023
13. BIOS means ______________.
(A) basic input/output system (B) best input/output system (C) …
Topic: JECA MCA 2023
12. Auxiliary memory is also known as ______________ memory.
(A) Primary (B) Secondary (C) Bin…
Topic: JECA MCA 2023
11. Address of the next instruction to be executed is specified by ______________.
(A) MBR (B) MAR &…
Topic: JECA MCA 2023
__________ interrupt may happen due to power failure.
Topic: JECA MCA 2023
What is the output?
#include <stdio.h>
#include <stdlib.h>
void main(){
int *ptr;
ptr = (int*) calloc(3…
Topic: JECA MCA 2023
What is the output?
#include <stdio.h>
void main(){
int **ptr;
int temp = 65;
ptr[0] = &temp;
printf(…
Topic: JECA MCA 2023
What is the output?
#include <stdio.h>
void main(){
int i = -9;
printf("%d %d %d", i++, ++i, ++i);
}
Topic: JECA MCA 2023
What is the output?
#include <stdio.h>
void main(){
char M = 'M';
printf("%d, %c", M, M);
}
Topic: JECA MCA 2023
What is the output?
#include <stdio.h>
enum colors{RED, BROWN, ORANGE};
void main(){
printf("%ld..%f..%d", RED,…
Topic: JECA MCA 2023
Next 10 Questions — JECA MCA 2023
Ascending by ID
1
2
3
4
5
6
7
8
9
10
16. Resource allocation graph is used to represent ______________.
(A) deadlock (B) virtual memory &…
Topic: JECA MCA 2023
17. Banker’s algorithm for resource allocation deals with ______________.
(A) mutual exclusion (B) mutual …
Topic: JECA MCA 2023
18. Page fault means ______________.
(A) required page is available in main memory (B) required page is no…
Topic: JECA MCA 2023
19. ___________ is a technique to move a process from main memory to secondary memory.
(A) Deadlock (B) Sy…
Topic: JECA MCA 2023
20. Demand paging is considered as ______________.
(A) fetching a page when not needed (B) switching betwe…
Topic: JECA MCA 2023
21. Thrashing means a condition having ______________.
(A) minimum paging (B) optimized paging  …
Topic: JECA MCA 2023
22. A counting semaphore is initialized to 15. Then, 4 wait operations and 2 signal operations are completed on this se…
Topic: JECA MCA 2023
23. What do you mean by fork()? Choose the correct option.
(A) Starvation (B) Creation of new task &…
Topic: JECA MCA 2023
24. In file management, FAT means ______________.
(A) Feature Access Table (B) File Access Table &nbs…
Topic: JECA MCA 2023
25.What is the output of the following program ? include <iostream> using namespace std; int ad…
Topic: JECA MCA 2023
