CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure that you have a friendly user interfaces and display very helpful messages.

Python only** define the following function: 1.  This function must add a task to a checklist, setting its initial value to False. It will accept two parameters: the checklist object to add to, and the task name to add. In addition to adding the task, it must return the (now modified) checklist object that it was given. There is one issue, however: a task cannot be added to a checklist if the name requested is already being used by another task in that checklist. In that case, this function must print a specific message and must return None Define addTask with 2 parameters Use def to define addTask with 2 parameters   Use a return statement Within the definition of addTask with 2 parameters, use return _ in at least one place.   Do not use any kind of loop Within the definition of addTask with 2 parameters, do not use any kind of loop.

Computer Science Part C: Interactive Driver Program Write an interactive driver program that creates a Course object (you can decide the name and roster/waitlist sizes). Then, use a loop to interactively allow the user to add students, drop students, or view the course. Display the result (success/failure) of each add/drop.

The destination of a function's return value may be represented as a sequence of instructions. When making modifications to the stack, keep in mind that they must not prevent the method from returning to its caller.

c programming Task 3: Complete armstrong_task3.c by implementing armstrong_recursive function. int armstrong_recursive (int arm); It performs same operation as in Task 1, however in a recursive manner. A number to be checked whether it is armstrong or not is given as an input and the function returns the summation of the digits. If the returned value is equal to the given input value then it is an armstrong number.

A fast food restaurant is planning to develop a system to process customer’s orders. The system receives food orders from the users, and stores and processes according to the order in which the users placed the orders. The system can remove an order from the list of orders once the order is complete. The system can also display the order which is currently being processed by the employees. The system displays the list of orders as well. The system displays all these options as a menu of choices to a user and performs the operations according to the user’s selection. (Please see the test runs on the next page). Write a program in C/C++ to develop a simple order processing system for the fast-food restaurant. In your program, you must use queue to store and process customer’s orders. Your program must use a linked list to perform the queue operations. Your output format should be as shown in the test runs (see the next page). Your program must contain the following user-defined…

It is possible to see the function's return address by issuing a set of instructions. It's important to remember that modifying the stack shouldn't prevent the process from returning to its caller.

Compilation Techniques The program snippet is known as follows: a = 10; b = 1; c = 2; do {        b = b + 1       while (b <= 10) {                   if (a%2==0)                          c = c + b; a = a + 1;       } } while (c < = 30); Make a code generator for the above program fragment.