Q1. Choose the suitable answer from the following MCQ 1-. Information about a process is maintained in a A. Stack B. Translation Lookaside Buffer C. Process Control Block D. Program Control Block 2- Which of the following is not an advantage of multiprogramming? A. Increased throughput B. Shorter response time C. Decreased operating system overhead D. Ability to assign priorities to jobs 3-Message passing system allows processes to A. Communicate with each other without sharing same address space B. Communicate with one another by resorting to shared data C. Share data D. name the recipient or sender of the message 4- Which of the following is contained in Process Control Block (PCB)? A. Process Number B. List of Open files C. Memory Limits (I) All of the Above 5- The Hardware mechanism that enables a device to notify the CPU is called A. Polling B. Interrupt C. System Call D. None of the previous 6- The number of processes completed per unit time is known as A. output B. throughput C. efficiency D. capacity 7- Operating system is a collection of (A) Software routine B. Input-output devices C. Hardware components D. All of these 8- Card reader is an example of A. Multi-tasking B. Multiprogramming C. Batch operating system D. None of these 9- When was the first operating system developed? A. 1948 B. 1949 (C) 1950 D. 1951 10- To access the services of the operating system, the interface is provided by the (A) System calls B. API C. Library D. Assembly instructions 111- The systems which allow only one process execution at a time, are called as A. Uniprogramming systems B. Uniprocessing systems C. Unitasking systems D. None of the mentioned 12-which state of a process defined the process is being created (A). new B. running C. ready D. waiting Q2) Consider the following CPU processes with arrival times and length of CPU bursts (in milliseconds) as given below: \begin{tabular}{|c|c|c|} \hline Process & Arrival time & Burst time \\ \hline P1 & 0 & 7 \\ \hlineP2 & 3 & 3 \\ \hlineP3 & 5 & 5 \\ \hlineP4 & 6 & 2 \\ \hline \end{tabular} If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the processes, then calculate the average waiting time