9. Consider the two substitution reactions 1 - 2 shown below. Select the product(s) that will...
help with 9 please
9. Consider the two substitution reactions shown below Select the product(s) that will be produced in each reaction from the list provided below (P1-P8). If more than one product is formed indicate their approximate ratios. Y CHOH OY HONE DUSO reaction bowent a tion 2 a) reaction 1: PL + P2 in 1:1 ratio: reaction 2: P1 only b) reaction 1: P5 only, reaction 2: P7 only c) reaction 1: P1 only: reaction 2: P7 P8...
C program Read file problem: For example, I have an input.txt file like this: q 1 tq 4 p1 10 p2 5 p3 7 p4 20 p5 17 p6 9 p7 3 p8 11 p9 15 p10 1 I want the num of q is in one array, tq is in one array, the order of process(ie,p1,p2) is in one array, and process time is in one array(process time is the number after like p1,p2). There may many q,tq,p so...
4. Consider the three elimination reactions 1 - 3 shown below. Select the product(s) that will be produced in each reaction from the list (P1 and/or P2 and/or P3), provided below. Of all possible products formed, choose the two correct labels for the products: (i) label all products as either "major" or "minor," and (ii) label all products as either "less stable" or "more stable" t-BuOK NaOH H2O reaction 1 reaction 2 reaction 3 List of products to consider: CORRECT...
(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2 , 25 being a randomly assigned ID(1-50) and 2 being a randomly assigned priority number(1-10). Once the priority queue is full(10 max), it will transfer the highest priority process to a waiting queue. Once the waiting queue is full(7 max), one process(highest priority) will transfer to a ready queue where the system would perform the process in a round robin style. Once 25 processes...
You choose a random permutation (p1, p2, p3, p4, p5, p6, p7) of 1, 2, 3, 4, 5, 6, 7, with each of the 7! permutations equally likely. What is the probability that (1 + p1)(2 + p2)(3 + p3)(4 + p4)(5 + p5)(6 + p6)(7 + p7) is even? Give an exact answer as a simplified fraction and justify your answer.
4. Consider the three elimination reactions 1-3 shown below Select the product(6) that will be produced in each reaction from the list (P1 and/or P2 and/or P3), provided be low Of all possible products formed, choose the two correct labels for the products: (i) label all products as either "major" or "minor," and ii) label all products as either "less stable" or "more stable" NaOH t-BuOK н.о Br Br reaction 2 reaction reaction 3 List of products to consider P1...
1. Fill in the table below for the following compounds- molecules and polyatomic ions. For each compound, calculate the number of available electrons for all the atoms in the molecule and determine what the central atom in the molecule will be. Central Atom Total Number Molecular of Available Formula Electrons HCN P1 P2 SO3 P3 P4 NO3 P5 P6 P7 P8 SIH4 P9 P10 SO2CI2 NH4 P11 P12 P13 P14 PO43 P15 P16 PF5 SF&C P18 P17 P19 P20 XeF2
(d) Pre-emptive priority scheduling [4 marks]: Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst Priority Arrival Time P1 8 3 0 P2 3 4 1 P3 6 2 3 P4 3 1 5 P5 1 5 7 P6 3 8 14 P7 8 5 18 (d-1) Draw Gantt chart illustrating the execution of these processes using pre-emptive priority (a smaller priority number implies a higher priority) [2 marks] 00 01 ...
Consider the following set of processes (P1 arrived at t=0; burst time=10), (P2 arrived at t=2: burst time=8). (P3 arrived at t=3; burst time=3), (P4 arrived at t=10; burst time=4), (P5 arrived at t=12: burst time=1). (P6 arrived at t=15; burst time=4). At (t=20) using RR (Q=3), as process scheduling algorithm, process will be handled P1 Ο P20 P3 O P4 P5 a P6 о
Please answer the following question in C++ language Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1. 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive...