Consider the tasks A, B, and C, as described below. Which of the following statements are true or false? *(For FCFS and RR, when tasks have the same submission time, they are ordered alphabetically - For RR, new tasks are added to the end of the ready queue) True False With FCFS, C's turnaround time would be 4 . With SJF, C's reponse time would be 0 . With RR and a time slice of 5 , B's completion time would be 31 . With SRTF, B's response time would be 0 . With FCFS, the average turnaround time would be 13.333. A problem takes 7.8ms to be solved using a monothreaded process, but only 2.3 ms to be solved using a multithreaded process on a four processors system. How can the speedup be described? Linear (or ideal) Superlinear Sublinear Consider the following (pseudo) code. We assume that 'main 0 ' creates and runs each thread entirely before continuing its own execution (via calls to 'thread_wait( ('). Which statements are true or false once the execution reaches / Here! /? Which statements about thread models and implementations are true or false? True False Kernel-level threads can be scheduled on different CPUs The "idle thread" or "OOM reaper" are kernel-level threads The kernel manages some parts of user-level threads via specific syscalls A user-level threading library needs to implement its own scheduling policy A user-level threading library can theoritically create millions of concurrent threads Which of the following functions are "multithread safe" (aka reentrant)? Meaning that they can be called by multiple threads concurrently. (Note that you can find out this info in each function's manpage) Multithread safe Multithread unsafe printf() random_r() strerror() ctime_r() memcpy()