Given six memory partitions of 300 KB , 600 KB , 350 KB , 200 KB , 750 KB , and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 KB and 500 KB  (in order)?

Order the sequence of events, in scheduling process P1 after process P0

Write the possible contents of the file /tmp/xyz after this program.

In the answer if you want to mention any non-text character, then write \0  For example abc\0\0 means abc followed by any two non-text characters

int main(int argc, char *argv[]) {

Select all the correct statements about the process init on Linuxes/Unixes.

Select the sequence of events that are NOT possible, assuming a non-interruptible kernel code

(Note: non-interruptible kernel code means, if the kernel code is executing, then interrupts will be disabled).

Note: A possible sequence may have some missing steps in between. An impossible sequence will will have n and n+1th steps such that n+1th step can not follow n'th step.

What will this program do?

int main() {

fork();

execl("/bin/ls", "/bin/ls", NULL);

printf("hello");

}

When you turn your computer ON, on BIOS based systems, you are often shown an option like "Press F9 for boot options". What does this mean?

Select all the correct statements about bootloader.

Every wrong selection will deduct marks proportional to 1/n where n is total wrong choices in the question.

You will get minimum a zero.

Select all statements that correctly explain the use/purpose of system calls.