If a process is executing in its critical section, then no other processes can be executing in their critical section. What is this condition called?

What is the output of this program? int main() {    pid_t pid;    int var = 100    pid = fork();    if (pid == 0) {              var = 200   }   fork();   print(“%d”, var)   return 0; }

What is the output of this program?    int main() {        pid_t child;        child = fork();        printf(“%d\n”,child);        return 0; }

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

With _____________ only one process can execute at a time; meanwhile all other process are waiting for the processor. With ______________ more than one process can be running simultaneously each on a different processor.

Semaphore is a/an _______ to solve the critical section problem.

The given DFA corresponds to which of the following Regular expressions?

The interval from the time of submission of a process to the time of completion is termed as ____________

Which of the following is a stage of compiler design?

Which of the following do we use to form an NFA from a regular expression?