Problem Statement

This set contains two independent multiple-choice questions from the Programming Basics group (Operating System Fundamentals and Data Structures Basics sections) of the assessment. Each question is self-contained. How your answer is graded: your program reads no input. Print the option number you chose for each of the two questions, one per line, in order Q1, Q2. Q1 (Operating System Fundamentals). Consider a computing system which handles jobs on a priority basis. That is, jobs with higher priority are executed first (priority is considered in ascending order — a smaller priority number means higher priority). What will be the value of the turnaround time for the job P2 given below, along with the respective priorities and burst times, if they all arrive at the same time? Process Burst Time Priority P0 7 3 P1 7 2 P2 4 5 P3 9 8 18 7 9.75 14 Q2 (Data Structures Basics). Consider the list of integers given below: 4 17 29 30 48 51 69 If the binary search technique is used to search