Implement the C program that accepts a group of integers numbers in the main function. The program will sort the input numbers using two different sorting algorithms. The main program will fork the parent into a new child process. First, the parent will sort the input numbers using a merge sort algorithm. Second, it will wait for the child process using the wait system call, so the child will complete sorting the input numbers using quick sort algorithm. Repeat your code in threading instead of forking

Implement the C program that accepts a group of integers numbers in the main function. The program will sort the input numbers using two different sorting algorithms. The main program will fork the parent into a new child process. First, the parent will sort the input numbers using a merge sort algorithm. Second, it will wait for the child process using the wait system call, so the child will complete sorting the input numbers using quick sort algorithm. Repeat your code in threading instead of forking

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Is there a way to optimize the following multithreaded quick sort algorithm, in C? I am looking for suggestions to make it run faster. I am trying to get closer to the qsort function's time. I don't want anything too complicated, like thread pooling. Here is the code: #include <stdio.h>#include <stdlib.h>#include <errno.h>#include <string.h>#include <pthread.h>#include <time.h>#define SORT_THRESHOLD 40typedef struct _sortParams {char** array;int left;int right;int* threadsLeft; // A counter to keep track of how many more threads are available to be created.pthread_mutex_t* mutex;} SortParams;static int maximumThreads; /* maximum # of threads to be used */static void insertSort(char** array, int left, int right) {int i, j;for (i = left + 1; i <= right; i++) {char* pivot = array[i];j = i - 1;while (j >= left && (strcmp(array[j], pivot) > 0)) {array[j + 1] = array[j];j--;}array[j + 1] = pivot;}}/*** This function uses a mutex to…
Write a java program to insert one element in a singly linked list before a given element. Your program will print the original list, request the user to put in an element to be inserted, and an element to indicate the location of the insertion, then print the final list after the insertion is done. If the element doesn't exist in the list, add the new element to the end of the list. No duplicate values are allowed to store in list. Once you done insertion operation (at least 10 element inserted) in your list, Draw a binary search tree and AVL tree ( show all rotations ) as per your inserted values . Use the following as your test cases to evaluate whether your program works correctly: If you have a linked list: 6à2à7. With user input 8 and 2. Your list should become 6à8à2à7: With user input 8 and -1. Your list should become 6à2à7à8: Let suppose your final linked list . 6à2à7à8à5à10à1à9à3
Q2: Besides the while-loop in Q1, I want to implement a 2nd while-loop running in parallel with the first while: while(1) { wt(1); XX); } However, on an MCU there is no parallelism. (For ex., on Arduino I can define only one loop() function.) Write a single while that does the job of both whiles. (a) Write it in a procedural style. (b) Write it the super-loop style (state-machine with fixed heartbeat).
Write a Python source code using recursion to merge two sorted lists into a merged list which is obviously a bigger list containing all elements from the two sorted lists. Comment on the computational complexity of this code. Please name your function "merge" that has two arguments (first list, second list) and return a list of int.
Write a program called shuffleSort. It first checks to see if the data arein order. If they are, the sort is finished. If they aren’t, the data are shuffled andthe process repeats. What is the best-case running time? Is there a worst-caserunning time? Why or why not? If each time the data were shuffled they werearranged in a never-seen-before configuration, would this change your answer?
Create a Python 3 program to help us organize the files in the current folder. The program will have a list with program extensions (it should work with any).When the program is executed, for each extension, it will move all the files with that extension to a folder with that name. For example, with list = ["png", "mp4", "doc"], the program would move all files with the extension ".png" from the current folder into a folder named "png". Same with the ".mp4" files in the"mp4" folder and ".doc" files with the "doc" folder.
Create a Python programme that reads a string list from the user and stores it in a dynamic array. The user should be able to insert as many pieces as they want and remove them as needed. Exemplify each sentence, please.
Again create a data file of random integers. Then write a program in C to implement the selection sort algorithm of Figure 3.6 using file input data. Write a separate function (method, procedure) to find the location of the largest number in the unsorted section of the list (see Figure 2.14) and have your main function call that as needed. Write your sorted list to another data file.
Write a program in python which will read two integers, j and k, from standard input. Use the list function and the range function to print a list of integers from k down to j (inclusive). Notice the form of the output is a list. You may assume that j is less than or equal to k. For example: Input Result 2 5 [5, 4, 3, 2] 0 0 [0] -3 3 [3, 2, 1, 0, -1, -2, -3]