The jobs will be randomly generated and stored as " job objects. Each job object Will Include: . arrival Time . Cpu Time priority remaining time Your program will generate 25 jobs, simulate (un) the algorithms and display the original job information and the table. Documentation should include - data structures used and why -"runtimes" (Big-"0") for the code - Summary of your - appropriate usuge I am results of each algorithm. Posting pseudocode to generate the 25 jobs. D generate The 25 jobs. C++ or Java are fine. No Python! Project Specs Saturday, Septeer 30, 2023 12:42 PM Description: Given a set of (simulated) "jobs", run the following Job Scheduling. Algorithms and evaluate the performance of each. (1)Fifo (2) Shortest Job Algorithm (non-premptive) (3) Shortest Remaining Job Algorithm (pre-emptive) (+) "Highest" Priority Algorithm (assigned). (5) Round-Robin: with and without context switch All algorithmes should be analyzed by collecting - turn-around time -Throughput for a fixed length of time. Output should include: a table (similar to the "quiz" output table) Showing values for each algorithm; :-turnaround time also calculate the average- also calculate the average-turnaround time for each algorithm. and through-put.

1. Let S = {1,2...n} be a set activities, where activity i € S has a start time si, a finish time f; and a profit p, asSociated with it. Design an dynamic programming algorithm for computing a set of compatible activities of maximum profit. Argue that the time complexity of you algorithm is O(n log(n)). (You must start with the correct definitions, and then write a recurrence relation.)

Consider a set of n independent tasks. All tasks arrive at t = 0. Each task Ti is characterized by its computation time Ci and deadline Di. Prove that EDF is optimal for both preemptive AND non-preemptive cases. please type the answers

Calculate average waiting time (AWT), average turnaround time (ATAT) and average response time (ART) for the following Ready Queue scenario by using following algorithms.A) Shortest Job First Algorithm (Preemptive)B) Round Robin where Time Quantum = 2C) Analyze and tell that which one is efficient in term of AWT, ATAT and ART.

Computer science question using knapsack problem

A service station has both self-service and full-service islands. On each island, there is a single regular unleaded pump with two hoses. Let X denote the number of hoses being used on the self-service island at a particular time, and let Y denote the number of hoses on the full-service island in use at that time. The joint pmf of X and Y appears in the accompanying tabulation. p(x, y) 0 1 2 0 0.10 0.05 0.01 x 1 0.06 0.20 0.07 2 0.06 0.14 0.31 (a) What is P(X = 1 and Y = 1)? P(X = 1 and Y = 1) = | (b) Compute P(X ≤ 1 and Y < 1). P(X ≤1 and Y < 1) = (c) Give a word description of the event { X0 and Y + 0 }. One hose is in use on one island. One hose is in use on both islands. At least one hose is in use at both islands. At most one hose is in use at both islands. Compute the probability of this event. P(X +0 and Y 0) = [ (d) Compute the marginal pmf of X. x 0 Px(x) Compute the marginal pmf of Y. y Py(y) 0 Using Px(x), what is P(X ≤ 1)? P(X ≤ 1) = = 1 2 1 2

Marco Dorigo developed Ant Colony Optimization (ACO) algorithm and this algorithm is used to solve many case studies. Let's say, you are using ACO to solve Travelling Repairman Problem (TRP). Describe the process on how ACO implemented in TRP case study. State if there are any improvisation you would like to make in ACO to improve the implementation in TRP case study. Following Figure 2 shows the definition of the case study. Also, include which algorithm, PSO or ACO, is better used for solving TRP case study. You may use any illustration/description to describe your solution. Travelling repairman problem (TRP) is a scheduling problem whereby a repairman must visit the scheduled locations to conduct the job needed. Each location has a period/time in which the repairman is allowed to arrive. This is to allow maximum number of repair jobs are successfully performed.

Consider the two versions of Quicksort that are based on the following: (i) Median selection algorithm using the linear-time select method; (ii) The randomized pivot selection algorithm   Which of the two algorithms has a faster worst-case asymptotic behavior? Which of the two algorithms has a faster average-case performance? Provide empirical evidence of your answer by writing the corresponding programs for each and conducting experimental evaluation. Your experimental results should provide evidence of your answer. For this you need to run an adequate number of experiments on a variety of array/list sizes (use large randomly generated lists of integers).

Given two strings A and B and the following operations can be performed on A. Find a minimum number of operations required to make A and B equal. (Please Design a dynamic programming algorithm that can use the following operations to make A equals to B and analyze the complexity. Assume the size of the string is n.). When designing the dynamic programming algorithm, please describe the size and dimensionality of the dynamic programming table, and explicitly formulate the recurrence relationship. 1. Insert 2. Delete 3. Replace

Suppose that a manufacturing company builds n different types of robots, sayrobots 1, 2, . . . , n. These robots are made from a common set of m types of materials, saymaterials 1, 2, . . . , m. The company has only a limited supply of materials for each year,the amount of materials 1, 2, . . . , m are limited by the numbers b1, b2, . . . , bm, respectively.Building robot i requires an aij amount from material j. For example, building robot 1requires a11 from material 1, a12 from material 2, etc. Suppose the profit made by sellingrobot i is pi. Write an integer linear program for maximizing the annual profit for thecompany