logo

Crowdly

Browser

Add to Chrome

OS LAB(CSE29)

Looking for OS LAB(CSE29) test answers and solutions? Browse our comprehensive collection of verified answers for OS LAB(CSE29) at kiitmoodle.in.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Which of the following statements are true?

A. Longest job first scheduling may cause starvation

B. Non-Preemptive scheduling may cause starvation

C. FCFS is better than Round robin in terms of response time
0%
0%
0%
0%
View this question
Let us assume that a parent process with a process id of 1012 is completed before the completion of the child process with a process id of 1013. Among the following statements which is true about the child process.

A) The child process becomes a zombie process.

B) The parent process id of the child is 1012.

C) The child process becomes a orphan process.

D) The parent process id of the child is other than1012.
0%
67%
0%
0%
View this question
What is the command to identify the system demon process?
67%
0%
0%
0%
View this question
On a successful call to the fork () API, what value is return to the parent process.
0%
0%
0%
0%
View this question
Function “WEXITSTATUS” returns the PID of
0%
0%
0%
0%
View this question
Find the correct statement.
0%
0%
0%
0%
View this question
Consider a process P1 that forks P2, P2 forks P3, and P3 forks P4. P1 and P2 continue to execute while P3 terminates. Now, when P4 terminates, which process must wait for and reap P4?
0%
0%
0%
0%
View this question
There are 20 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which of the following quantum times is the best value for small response times, if the processes have a short runtime, i.e. less than 20ms?
0%
0%
0%
0%
View this question
Consider a set of n tasks with known runtimes R1, R2, …,Rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
0%
75%
0%
0%
View this question
The fork() API creates a new process by duplicating the calling process. In this context, which of the following is true about it.
0%
0%
50%
0%
View this question

Want instant access to all verified answers on kiitmoodle.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Browser

Add to Chrome