Problem 1: Thread creation (30%) a. Using Java multithreading library, write a Java program that calculates the sum of the numbers from 1 to 100,000,000. Split the numbers between four threads equally where each thread calculates the sum of one fourth of the numbers. For example, the 1st thread will calculate the sum of the numbers from 1 to 25,000,000 whereas the 2nd thread will calculate the sum of the numbers from 25,000,001 to 50,000,000 and so forth. The main thread will have to print out the sum after gathering the results. Note that you have the choice to create threads by either implementing Runnable interface or extending Thread class. b. Now, write a sequential version of the program described above using a single main thread (i.e., without multithreading). Make sure to record and print out the time spent during the execution of both sequential and multithreaded versions (hint: you may consider using System.currentTimeMillis() to record execution time). Problem 2: Synchronization (40%) Assume that we have a file named “sharable.txt” which can be shared among several threads. We want to write a program that controls the access to that file in a way that only one thread at a time is allowed to access it (i.e., for writing/appending purposes). Using Java multithreading, write a program that creates three threads and assigns a number to each thread. Then, each thread will start running by executing a code for opening the file “sharable.txt” and writing the following lines: Thread x started writing Thread x is currently writing Thread x finished writing Your program should allow only one thread -at any given time-to access the file and write in it. It also 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, the output stored in “sharable.txt” should look like the following: Thread x started writing Thread x is currently writing Thread x finished writing Thread y started writing Thread y is currently writing Thread y finished writing Thread z started writing Thread z is currently writing Thread z finished writing Problem 3: Interrupt handling (30%) In Java multithreading environment, one thread can send an interrupt to another by calling the interrupt() method on the Thread object for the target thread (i.e., the thread to be interrupted). To handle interrupts in a target thread, Java allows two approaches. One is performed by writing an exception handler for InterruptedException (only applicable if the target thread is invoking methods which throw that exception such as sleep). The other approach is performed by periodically checking the interrupt status flag Thread.interrupted and performing the handling routine when that flag is set to true. Write a Java program that illustrates the use of the two approaches described above. Your program should start by creating two threads, each thread should use different interrupt handling approach. Then, the program needs to send interrupts to each one of the created threads such that a thread needs to return (i.e., stop execution) after receiving an interrupt from the main thread. Make sure to output (print out) the status of each thread before and after being interrupted. Submission: In a zipped file, you are required to include the following: 1. The output from each program (you may use screenshots). 2. The source code for each program in (.java) format.

Chapters 1-8, which is available online and include interactive programing and lectures http://interactivepython.org/runestone/static/pyth... 1. Choose two different algorithms to find the shortest path. Using those algorithms, implement “program_a.py” which uses the first to find the shortest path between nodes A and I for the graph below. Implement “program_b.py” which uses the second to find the shortest path between nodes A and I for the graph below. Use timeit to measure the performance on both. Write a discussion that compares results in program_a.py and program_b.py. In your discussion, include analysis of the time complexity, i.e Big O. 2. Create a Microsoft word document that provides screen captures of running your algorithms with your commentary of the results and your code. At the END of the document, include your python source code at the END of the report for reference and turnitin checking, in TEXT format, NOT screen capture.

Write a shell script to locate executable files. This script takes a list of file names from the command line and determines which would be executed had these names been given as commands. Please refer the Syllabus for the Assignment / Project Requirements and Guidelines The search path should be based only on the user's PATH environment variable. You shall not use the Unix which command, the ksh whence (type) command, the locate command, or the bash type command. The code for the script shall not use the UNIX ls command to determine if the file is executable or if it exists. The script should find only the first occurrence of the "file". If the file is not found, the script the following <command> NOT FOUND <command> would be replaced by the name of the "file" you didn't find. If the first parameter is '-a', then the script should print all occurrences of the executable file in the user's path. Again, if the file was not on the path, an error message should be displayed. The find command shall not be used. A project using temporary files will not be graded. NOTE: The shell variable PATH defines the search path for the directory containing the command. Alternative directory names are separated by a colon (:). The current directory can be specified by two or more adjacent colons, or by a colon at the beginning or end of the path list. If the command name contains a / then the search path is not used, you just check if the command/file specified is executable and not a directory. Otherwise, each directory in the path is searched for an executable file.