Instructions for Part 2In part 2 (and probably in every part) I'm going to use "matrix" and "two-dimensional array"interchangeably.In part 2 we will read in the data from file, prepare ThreadOperation for part 3 by adding inputs,and add another helper method to verify we can access the submatrices accurately.1. Modify ThreadOperation to take as input (through the constructor) two matrices and aquadrant indicator. The indicator could be a String, an int, an enum or a set of indexes. It's upto you.2. Modify the main method to instantiate the four ThreadOperation objects withplaceholder values to confirm that the code still runs without error. The placeholders are justexample matrices and a quadrant indicator.3.Write a static method named printSubmatrix that takes four integer indexes and amatrix and prints out the submatrix indicated by the indexes.4.Create a matrix and use it to test printSubmatrix in main. Your print2dArraymethod from part 1 should come in handy for this.5.The filename should be given through the command prompt and passed into main viaString[] args6. Open and connect to the file using a Scanner.7. Read in the number of rows and columns and save these in local variables in main.8. Read in the first and second matrices (two-dimensional arrays) from the file. I recommendwriting a method to accomplish this task and calling the method twice (once for each matrix).Consider using this method header:

the program is an given below :

In part 2 we will read in the data from file, prepare ThreadOperation for part 3 by adding inputs, and add another helper method to verify we can access the submatrices accurately. 1. Modify ThreadOperation to take as input (through the constructor) two matrices and a quadrant indicator. The indicator could be a String, an int, an enum or a set of indexes. It's up to you. 2. Modify the main method to instantiate the four ThreadOperation objects with placeholder values to confirm that the code still runs without error. The placeholders are just

In part 2 we will read in the data from file, prepare ThreadOperation for part 3 by adding inputs, and add another helper method to verify we can access the submatrices accurately. 1. Modify ThreadOperation to take as input (through the constructor) two matrices and a quadrant indicator. The indicator could be a String, an int, an enum or a set of indexes. It's up to you. 2. Modify the main method to instantiate the four ThreadOperation objects with placeholder values to confirm that the code still runs without error. The placeholders are just

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Implement a Multithreaded Sudoku Solution Validator using POSIX thread library in C Specifications This assignment consists of designing a multithreaded application that determines whether the solution to a Sudoku puzzle is valid. A Sudoku puzzle uses a 9×9 grid in which each column and row, as well as each of the nine 3×3 subgrids, must contain all of the digits 1 to 9. Following figure presents an example of a valid Sudoku puzzle solution. There are several different ways of multithreading this application. In this assignment, you need to implement the strategy to create multiple worker threads that check the following criteria: Nine threads to check that each of the 9 columns contains the digits 1 through 9 Nine threads to check that each of the 9 rows contains the digits 1 through 9 Nine threads to check that each of the 3×3 subgrids contains the digits 1 through 9 This would result in a total of 27 separate worker threads for validating a Sudoku puzzle solution.The parent…
In c++ if possible i have tried everything i can quite get it: Write a thread-safe logger implementation with interface: log(datetime timestamp, string severity, string message) that outputs lines to the console in the format: Timestamp [Severity] Message with the additional requirement that there must be a delay of at least 1 second before the line appears on the console. it must be: a. Exactly one line is printed to the console for each call to log. b. The call to log is non-blocking.
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…
you are to design a printer queue that is responsible for handling the printing requests coming from different users. You have to take into consideration that users have different levels of priorities. Each user has an identification number and a password, in addition to printing priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every printing request received, the program should check the priorities of that request and whether it can be moved forward in the queue to be served by the printer prior to serving the other requests. Using the programming language of your choice (preferably C++), write the printer queue that would handle the user request. The program must allow for requests coming from different users or from one user. Note: I need a working C++ code for this problem, and i need priorities.
Instruction: To test the Linked List class, create a new Java class with the main method, generate Linked List using Integer and check whether all methods do what they’re supposed to do. A sample Java class with main method is provided below including output generated. If you encounter errors, note them and try to correct the codes. Post the changes in your code, if any. Additional Instruction: Linked List is a part of the Collection framework present in java.util package, however, to be able to check the complexity of Linked List operations, we can recode the data structure based on Java Documentation https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html package com.linkedlist; public class linkedListTester { public static void main(String[] args) { ListI<Integer> list = new LinkedList<Integer>(); int n=10; for(int i=0;i<n;i++) { list.addFirst(i); } for(int…
An alternative to implementing Java's Runnable interface is to extend SyntheticComponent Thread Object Heuristic
The goal of this second exercise is to develop a better understanding of the Linuxinterprocess communication mechanisms. This would require you to write twoprograms P1 and P2. The first program P1 needs to generate an array of 50random strings (of characters) of fixed length each. P1 then sends a group offive consecutive elements of the array of strings to P2 along with the ID’s ofthe strings, where the ID is the index of the array corresponding to the string.The second program P2 needs to accept the received strings, and send backthe highest ID received back to P1 to acknowledge the strings received. Theprogram P2 simply prints the ID’s and the strings on the console. On receivingthe acknowledged packet, P1 sends the next five strings, with the string elementsstarting from the successor of the acknowledged ID. The above mechanism needs to be implemented FIFO and UNIX DOMAIN SOCKETS. Please note that you may NOT make assumptions about the reliability of the interprocess communication…
A. Suppose that q1 is a class CircularQueue object that is using circular queue concept and the maximum size of the array implementing q1 is 10. The current index value of front is 5 while the current index value of rear is 9. i. What are the index values of front and rear after adding TWO (2) elements into q1? Draw the circular queue diagram to show the addition process. ii. After implementing the process in Question 2A (i), what are the index values of front and rear after removing FIVE (5) elements from q1? Draw the circular queue diagram to show the removing process. iii. What are the current number of elements after implementing the process in Question 2A (i) and Question 2A (ii)? =======================
Write a C program to implement threading.a. Use following two Arraysa. Student ID[]={101,102,103,104,105}b. Student Results[]={85,45,55,65,75}b. Thread1 prints the student IDs of those students who has 1st and 2nd highest marks.c. Thread 2 prints the IDs of failed studentsd. Thread3 prints avg marks of the class
This is some code in C for quicksort. The quicksort works correctly, but I am trying to implement multithreading. I am trying to run the recursive calls in parallel with a limit on how much threads can be running at one time (set by the global variable 'maximumThreads'). My logic is incorrect with managing how many threads can be ran at the same time. The part that I need you to look at is after the for loop in quick sort, where I have my logic for the mutex and the conditional variable. Right now when I run my code, the program runs indefinitely. I would like help with correctly implementing this part. #include <stdlib.h>#include <string.h>#include <pthread.h>#include <stdio.h>#define SORT_THRESHOLD 40typedef struct _sortParams {char** array;int left;int right;int* currentThreads;pthread_mutex_t* mutex;pthread_cond_t* cond_var} SortParams;static int maximumThreads; /* maximum # of threads to be used *//* This is an implementation of insert sort, which…
This is some code in C for quicksort. The quicksort works correctly, but I am trying to implement multithreading. I am trying to run the recursive calls in parallel with a limit on how much threads can be running at one time (set by the global variable 'maximumThreads'). My logic is incorrect with managing how many threads can be ran at the same time. The part that I need you to look at is after the for loop in quick sort, where I have my logic for the mutex and the conditional variable. Right now when I run my code, the program runs without stopping. I would like help with correctly implementing this. #include <stdlib.h>#include <string.h>#include <pthread.h>#include <stdio.h>#define SORT_THRESHOLD 40typedef struct _sortParams {char** array;int left;int right;int* currentThreads;pthread_mutex_t* mutex;pthread_cond_t* cond_var} SortParams;static int maximumThreads; /* maximum # of threads to be used *//* This is an implementation of insert sort, which although…
Implement a city database using ordered lists by using java. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using both: an arraybased list implementation, and a circular single linked list implementation.Use may the following node, SLL implementations to implement an ordered circular single linked list