Q1.1 Which of the six resource-allocation graphs below illustrate deadlock? For those situations that are deadlocked, provide the cycle of threads and resources. Where there is not a deadlock situation, illustrate the order in which the threads may complete execution. (a) (b) (d) R₁ .. T₁ T3 R₁ T₂ R₂ .. T3 (e) .. T₁ T R₂ T₂ T4 T3 R₂ (f) R₁ 53 R₂ R₂ T3 R3

PLEASE USE PTHREADS Write a program in C using PTHREADSthat will simulate the operations of the following Batch scheduling algorithms: PLease use Pthreads First-Come, First-Served Shortest Job First Your Program will implement threads for each algorithm plus the main thread. A linked list will be used to represent the list of jobs available to run. Each node will represent a Job with the following information: int PID Process ID int time; The time needed on CPU to finish executing Main thread: Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node. Starts the FCFS thread, followed by SJF thread. Wait for both threads to finish before exiting. FCFS thread: The thread will simulate the First-Come, First-Served algorithm. Displays the data in a list in the order they were inserted. SJF thread: The thread will simulate the Shortest…

3. Implement mutual exclusion with multithreading in Java Build a Java program which simulates a communication between a server and clients. You must use a thread to represent each party (as server or client). (Hint: study about the Semaphore class to perform mutual exclusion between threads) Create three threads. One thread will act as a server, which always ready to receive a message from a client (ping) and then replies the message to the same client (pong). The other two threads will become the clients, where each client will send a message to the server (ping) and waits for the reply (pong). Define 2 different classes to represent the server and the client. To perform the communication, each thread will refer to a same variable/data structure for sending and receiving the message. Use mutual exclusion approach to ensure each client can send and receive the reply without interruption from any other client(s). For this simulation, your objective is to ensure that each client must…

Problem 0. a. Why does a pthread_cond_wait() take both a pthread_cond_t * and a pthread_mutex_t as arguments? b. What happens if a thread passes pthread_cond_wait() a pointer to a pthread_mutex_t for which it is not holding the lock?