Hand written plzz3. Solve the scheduling issue with deadlines for the following data:1098765421job55558575752055 654535gain2123123123deadlineA. Show of all the steps of the algorithm using Brake 1 (without DSS).Show of all the steps of the algorithm using Brake 2 (with DSS).B.| |3

Scheduling is the process of organizing tasks, jobs or activities in particular order or sequence in…

3. Solve the scheduling issue with deadlines for the following data: 10 55 55 NI 9 2 col 8 7 85 75 3 2 6 75 5 20 NI 4 55 3 Hand written plzz 3 2 65 45 1 1 35 Im 3 A. Show of all the steps of the algorithm using Brake 1 (without DSS). B. Show of all the steps of the algorithm using Brake 2 (with DSS). job gain deadline

3. Solve the scheduling issue with deadlines for the following data: 10 55 55 NI 9 2 col 8 7 85 75 3 2 6 75 5 20 NI 4 55 3 Hand written plzz 3 2 65 45 1 1 35 Im 3 A. Show of all the steps of the algorithm using Brake 1 (without DSS). B. Show of all the steps of the algorithm using Brake 2 (with DSS). job gain deadline

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

The search algorithm developed will be used for users to search the catalog for all items matching the search keyword(s), and there are a total of 15000 items in the catalog. During development, three different algorithms were created. • Algorithm A runs in constant time, with a maximum runtime of 1.10 seconds and returns all matching results. ● Algorithm B runs in logarithmic time, with a maximum runtime of 0.3 seconds, and returns only the first result. ● Algorithm C runs in linear time, with a maximum runtime of 1.50 seconds and returns all matching results. Which algorithm would be the least suitable for the requirements stated? In your answer, justify your choice by explaining why you picked that algorithm, and why you did not pick the other two algorithms.OND OND OND DAD
Using truth table and functions please complete task 3. Schematic truth table should match). Must have 3 ins and 7 outs. Will upvote!(:
A binary search algorithm on an array of N elements have an average complexity in the order of? A. Nlog2N B. log2N C. N-1 D.2N Justify your answer with explanations Modifying software to respond to changes in its environment is called? A. Adaptive maintenance B. Corrective maintenance C. Pre-emptive maintenance D. Preventive maintenance Justify your answer with explanations
The first time you run algorithm A on a dataset of n elements; it is faster than algorithm B. The second time you run algorithm A on a dataset of n elements; it is slower than algorithm B. Explain how this is possible. Give an example for algorithm A and algorithm B.
Given a sequence of integers, e.g., \[ 9,-1,45,6,8,21,34,5,55,65,543,18,90,122,132,0,66,100,-12,17 \] design an algorithm/method to re-arrange the order of the data items (i.e., form a new sequence of the integers) so that when the data items are inserted sequentially into an initially empty BST, the newly created BST will be a balanced BST. a) Design the algorithm (in pseudo code) and analyse your algorithm. b) Write a Python function/method to implement your algorithm. c) Write a program that calls the above function, thereby demonstrating your algorithm by (i). Print the re-arranged data items (i.e., a new sequence) generated by the algorithm, and (ii). Build a BST using the newly generated data sequence as input (that is, insert the data items, oneby-one, into an initially empty BST). Print the tree shape of the BST. (Note: The program should use at least two datasets to demonstrate the algorithm, one of which is the dataset given above).
Let A be an algorithm which has an execution time O (N5), where N is the size of the entry. Which of the following statements is NOT true about Algorithm A? Question 3 options: For any N, there may be entries for which the execution time is greater than N4 seconds. For any N, there may be entries for which the execution time is greater than N6 seconds. For any N, there may be entries for which the execution time is less than N4 seconds. For any N, there may be entries for which the execution time is less than N6 seconds. There are constants A and B such that for all N the execution time is less than A × N5 + B seconds.
Fast
Write the pseudocode of an algorithm to find a TSP tour based on MST. Apply your algorithm on the following instance of TSP and determine the weight of the TSP tour.
Order the following functions by asymptotic growth rate (number 1 is the best algorithm, and number 3 is the worst). 4nlog n+2n 2log n n³ + 2
Python In the football league, there are n teams divided equally into four divisions. Within each division, every team plays every other team twice per season. What is the time complexity of this procedure? State all assumptions and show workings. Detailed answer please
Instrument FrequencyCounter to use Stopwatch and StdDraw to make a plot where the x-axis is the number of calls on get() or put() and the y-axis is the total running time, with a point plotted of the cumulative time after each call. Run your program for Tale of Two Cities using SequentialSearchST and again using BinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.
6. There are currently several online newspapers in Bangladesh, such as prothom Alo, bdnews24, daily star, Bangla tribunes, etc. Suppose you have access to these online newspapers contest and want to group them into a set of articles about the same story (e.g., all the sports news of all these newspapers will appear in the same place). What type of algorithms will you use to perform such kind of operation above? What are the motivations for choosing your algorithm? Explain.