Write a multithread C program to count the number of prime numbers within a given range [low,high] (inclusive), where the program should be able to take in the number of threads as an argument. You may use this single thread in example.txt anyway you like.

Part 2: SynchronizationAssume that we have a file named "sharable.txt" which can be shared among several threads. Wewant to write a program that controls the access to that file in a way that only one thread at a timeis allowed to access it (i.e., for writing/appending purposes). Using Java multithreading, write aprogram that creates three threads and assigns a number to each thread. Then, each thread will startrunning by executing a code for opening the file "sharable.txt" and writing the following lines:Thread x started writingThread x is currently writingThread x finished writing – Student NameYour program should allow only one thread -at any given time-to access the file and write in it. Italso should keep away any thread from overwriting the lines written by any other threads (hint:use synchronized methods/blocks). Finally, when the execution of your program is completed, theoutput stored in "sharable.txt" should look like the following – put your name in place "YourName":Thread x...

When you compile and run packaged software from an IDE, the execution process can be as easy as clicking a run icon, as the IDE will maintain the classpath for you and will also let you know if anything is out of sorts. When you try to compile and interpret the code yourself from the command line, you will need to know exactly how to path your files. Let us start from c:\Code directory for this assignment. Consider a java file who's .class will result in the com.CITC1318.course package as follows: package com.CITC1318.course; public class GreetingsClass { public static void main(String[] args) { System.out.println("$ Greetings, CITC1318!"); } } This exercise will have you compiling and running the application with new classes created in a separate package: 1. Compile the program: c:\Code>javac -d . GreetingsClass.java 2. Run the program to ensure it is error-free: c:\Code>java -cp . com.CITC1318.course.GreetingsClass 3. Create three classes named Chapter1, Chapter2, and Chapter3...

Write a c++ program that reads in input commands related to a queue with no more than ten elements and performs the specified operations. Note that you should create three files, one for the main, one for Queue.h, and one for Queue.cpp. Those commands are: 'E', which will be followed by a number. You should enqueue that number 'D', which will dequeue the value from the front of the queue and print it, followed by a new line 'K'. which will peek at the value at the front of the queue and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid.

Write two c++ programs to implement a distributed version of a multithreaded Huffman decompressor using the one in project 1 The server program The user will execute this program using the following syntax: ./exec_filename port_no < input_filename where exec_filename is the name of your executable file, port_no is the port number to create the socket, and input_filename is the name of the file with the alphabet's information. The port number will be available to the server program as a command-line argument. The server program receives from STDIN the alphabet's information (using input redirection). The input file has multiple lines, where each line contains information (character and frequency) about a symbol from the alphabet. The input file format is as follows: A char representing the symbol. An integer representing the frequency of the symbol. Example Input File: E 3 G 3 F 1 H 2 Given the previous input file, the expected output for the server program is: Symbol: C,...

How did you decide to handle the possibility of queue underflow in java? A. Assume as a precondition that it will not occur. B. Provide an isEmpty operation so a client can prevent underflow. C. Ignore it. D. Throw a QueueUnderflowException if it occurs. E. Throw a QueueUnderflowException if it occurs, and provide an isEmpty operation so a client can prevent underflow

Consider the BadReaderWriter.java program attached with this. The program has three threads, namely, one reader thread and two writer threads, and they all access the same list of numbers. The reader thread reads the list and prints it to the terminal. The writer threads append numbers to the list. At any point in time, if either of the writer threads finds that the list contains n elements, then it appends the number n + 1 to the list. Run this program, examine the output, and identify the problems.Fix these problems by implementing the acquireLock() and releaseLock() methods in the code.

Write a shell script (largest.sh) to display the largest number in a list of numbers specified as command line arguments. For example: ./largest.sh 4 6 9 2 The largest number is 9 Note: Your program should be applicable for arbitrary number lists but not just for 4 6 9 2 in above example. As long as a list of numbers is given, your program should return the largest value inside the list. The number of elements in the argument list may not necessarily be 4. The runner of your program can give as many numerical arguments as he/she wants to. You can assume that all the input arguments can be interpreted as valid numerical values.

Some already helped me with this but I get the following error: Exception in thread "main" java.util.NoSuchElementException: No line found at java.util.Scanner.nextLine(Scanner.java:1540) at BirthdayReminder.main(BirthdayReminder.java:57) Write an application that allows a user to enter the names and birthdates of up to 10 friends. Continue to prompt the user for names and birthdates until the user enters the sentinel value ZZZ for a name or has entered 10 names, whichever comes first. When the user is finished entering names, produce a count of how many names were entered, and then display the names. In a loop, continuously ask the user to type one of the names and display the corresponding birthdate or "Sorry, no entry for name" if the name has not been previously entered. The loop continues until the user enters ZZZ for a name. The code for above program is given below: Step 2 Java: import java.util.*; public class BirthdayReminder{ public static void main(String[] args) {...

In UNIX, how would you remove the directory test and all files and subdirectories (recursively) in it? The directory test is located in (is a subdirectory of) /home/myid/smith/projects. O rmdir /home/myid/smith/projects/test O rmdir -r /home/myid/smith/projects/test rm -r /home/myid/smith/projects/test O rm -r projects/test