Question 7 Not yet answered For Questions 7,8 refer to the statement given below. Consider the process P1, P2, P3, P4 with their Burst times. Apply SJF CPU scheduling algorithm. Assume all the processes arrive at the same time. Marked out of 1.00 P Flag question Process Burst Time (ms) P1 3 P2 2 P3 5 P4 4 Find the waiting time of P2 and P3. O a. P3 -5 P2 -9 O b. P2 - 3 P3-0 O c. P2-2 P3 - 1 O d. P2-0 P3-9 Question 8 For Questions 7,8 refer to the statement given below. Not yet answered Marked out of 1.00 Consider the process P1, P2, P3, P4 with their Burst times. Apply SJF CPU scheduling algorithm. Assume all the processes arrive at the same time. P Flag question Process Burst Time (ms) P1 3 P2 2 P3 5 P4 4 7 Find the waiting time for Process P1 and P2. O a. P1-2 P2-0 O b. P1-5 P2-9 O c. P1 -5 P2-0 O d. P1 - 2 P2 -5 Question 12 Not yet answered Which of the following memory management technique allows the memory space to be divided into unequal sized chunks? Marked out of 1.00 O a. Compaction O b. Fragmentation P Flag question O c. Segmentation O d. Paging Question 15 Not yet answered Which of the following refers to the process of handshaking between host and device coordinating with the controller? Marked out of 1.00 O a. Signal O b. Polling P Flag question O c. Interrupt O d. None Question 21 Which of the following UNIX command shows the first few lines of Name.txt file? Not yet answered O a, echo Marked out of 1.00 O b. tail P Flag question O c. sort O d. head