Attached is the pseudocode for the Merge algorithm. When this algorithm is called with Merge (A, 1, 4, 8) with A = (4, 6, 8, 9, 2, 5, 10, 12), how many times does line 15 execute? How many times does line 17 execute? How many times does line 22 execute? How many times does line 26 execute?

Try switching the joins pthread_join(tid2, NULL); pthread_join(tid1, NULL); Do you see any difference? Please report if and why you do or do not see any difference in terms of the randomness in the result of the shared resource.  In the inc_dec_resource() function, implement mutual exclusion (pthread_mutex_lock) to ensure that the result becomes 0 every time when you execute your program. Put your updated code in the report (highlighted) and show your screenshot of the execution by running the script three time using $ time ./shared_resource_mutex. Hint: Your loop is incrementing/decrementing the resource which should be protected by each thread while it is executing that portion.   #include <stdio.h> #include <pthread.h>   #define iterations 300000000 long long shared_resource = 0;   pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; // Thread function to modify shared resource void* inc_dec_resource(void* arg){     //get the pointer from main thread and dereference it…

The following query is written in relational algebra.Project[Deposit.aid,Deposit.amount](Select[Deposit.amount>=10000]( Join[aid=aid](Account,Deposit)))Our database system includes the implementation of B+ tree indexes solely. Assume wehave indexes on primary keys of tables and an index on Deposit.amount.Which join algorithm reads less number of pages from the disk: sort-merge join or indexnested loops join?

Use a merge sort to sort 3,6,9,4,2,10, 8, 1,7,5 into increasing order. Show all steps used by the algorithm

The following is the pseudo-code for merge-sort algorithm: MERGE-SORT(A,p,r) if p < r q = [(p + r)/2] MERGE-SORT(A, p, q) MERGE-SORT(A,q + 1,r)MERGE(A, p, q, r) What is the T(n) expression for this algorithm?

Question 38 If the total number of items is n, how many operations occur when each merge step in Mergesort Algorithm? 3'n-1. 3'n O 2*n+1 0 2'n-1 O2n

6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec

Create a merge solution based on the following concept that lowers the additional space needed to max(M, N/M): Divide the array into N/M chunks of size M (for the sake of ease, suppose N is a multiple of M). Then, (i) sort the blocks as items with their first key as the sort key, and (ii) cycle through the array combining the first block with the second, then the second block with the third, and so on.

For a sequence of {5, 2, 6, 3, 8}, use the first element as pivot, which of the following is the result after performing one time partition in quick sort? (A) 2, 3, 5, 8, 6 (B) 3, 2, 5, 8, 6 (C) 3, 2, 5, 6, 8 (D) 2, 3, 6 5, 8

Please generate the 16 subkeys of this key 0x011f011f010e010e (the 8 parity bits are included) by using DES subkey schedule algorithm and demonstrate that this key is a semi-weak key (i.e., there are only 2 different subkeys that can be generated by this key). Please represent the subkeys you generate in hexadecimal.