Three batch jobs, A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4 and 8 minutes. Their priorities are 3, 5, 2, 1 and 4 respectively, with 5 being the highest priority.
(a) For each of the following scheduling algorithms, determine the mean turnaround time. Ignore any process switching overhead.
1. Round Robin
2. Priority scheduling
3. First come, First served (run in order 10, 6, 2, 4, 8)
4. Shortest job first
For (a), assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For (b) through (d) assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound.
Answers
Answer:
1. The average turn around time is 21.2 minute using round robin scheduling algorithm with a quantum time of 1 minute.
2. The average turn around time is 20 minute using Priority scheduling algorithm.
3. The average turn around time is 19.2 minute using First Come First Serve scheduling algorithm.
4. The average turn around time is 14 minute using Shortest Job First scheduling algorithm.
Explanation:
Gantt chart was used to solve the scheduling problem.
Image showing the Gantt chart and working solution is attached.
Round Robin scheduling algorithm is a type of scheduling that uses a time slice for each process/job. Once the time slice is complete, the process leave to join the queue again if it has not finished execution.
Priority scheduling algorithm is a type of scheduling algorithm that allows a process/job to execute/complete based on the order of priority. In this case, the higher the number, the higher the priority. With 5 having the highest priority.
First Come First Serve scheduling algorithm is a type of scheduling algorithm that allows execution of a process/job based on first come first server i.e based on order of arrival time. In this case the order is ABCDE.
Shortest Job First scheduling algorithm is a type of scheduling algorithm that allocate the CPU to the process/job having the shortest completion time first. In this case, Job C has the shortest completion time.
Related Questions
Suppose you need to organize a collection of telephone numbers for a company division. There are currently about 6,000 employees, and you know that the phone switch can handle at most 10,000 phone numbers. You expect several hundred lookups against the collection every day. Would you use an array list or a linked list to store the information
Answers
Answer:
Using an array list is preferable
Explanation:
A Linked List is an arranged collection of information of the same type in which each element is connected to the next using pointers.
An array list contains set of similar data objects stored in a well arranged memory locations under a common heading or a variable name.
Array elements can be accessed randomly using the array index and can be looked up anytime which makes it correct.Random accessing is not possible in linked list.
Answer:
I would use an array list over a linked list to store the given information from the question.
Explanation:
Let us define what an array list and linked list are
Array list: Array List and Linked List both maintains insertion order and implements List interface. Array List basically uses a dynamic array to keep or store the elements.
Linked list: Linked List internally uses a list that is doubly linked to keep or store the elements
Now,
Using an array list will be of advantage than a linked list as far as look ups are concerned. also we do have some idea about the size of information,
while a Linked list will be useful when we don't know the size of data. also retrieving the information from the array list is much more simpler than linked list as random access is possible with arrays against sequential traversal for lists.
Which of the following are ways a vote thief could cast multiple votes in an online election? (check all that apply)
a. Using a DoS attack to make a legitimate vote server unavailable and direct voters to fake vote servers
b. Purchasing pass codes from people willing to sell their right to vote
c. Setting up fake vote servers to collect pass codes of voters
d. Using social engineering techniques to get pass codes from targeted voters
Answers
Answer:
All of the given options apply and are correct.
Explanation:
a) The first option is correct because the intruder can use denial-of-service attack and by flooding the site with traffic to get the voter server unavailable. Then he can direct the voters to a fraud vote server.
b) The second options correctly applies too because the thief also buys the pass codes from the people who want to sell their right to vote and this way the thief can purchase multiple pass code and cast multiple votes.
c) The hackers can set up fake vote servers and then direct the voters to these servers or websites in order to collect pass codes of voters. These pass codes can then be misused by the thief to cast multiple votes in an online election.
d) Social engineering techniques can also be used to get pass codes from certain voters. By manipulating the targeted voters psychologically they can get their pass codes to cast multiple votes illegally.
In a class named InputTextToOutputFile.java use the following prompt to get the fileName of the output file from the user: "What is the name of your output file?" Once the output file is opened, write everything the user types until the input contains "STOP!" Note: Include the line containing "STOP!" as the last thing written to the file. This work must be completed in your textbook ZYBooks -- CMP-326: Programming Methods II No other forms of submission will be accepted.
Answers
Answer:
Detailed program code is written at explaination
Explanation:
Program:
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
public class InputTextToOutputFile
{
public static void main(String[] args) throws IOException
{
Scanner in=new Scanner(System.in);//Scanner object to get user input
System.out.println("What is the name of your output file? ");
String fileName = in.nextLine();//get output file name
File file = new File(fileName);//File object with fileName as input
//Create the file by method file.createNewFile()
if (file.createNewFile())
{
System.out.println("File is created!");
} else {
System.out.println("File already exists.");
}
//FileWriter object with user file name given as input
FileWriter writer = new FileWriter(file);
System.out.println("Enter text to write to a file : ");
String line;//variable to store line content
do {
line=in.nextLine();//get line content from user
writer.write(line+"\n"); //write content to file by adding new line(\n) character
}while(!line.equals("STOP!"));//repeat a loop until user enters "STOP!" line
writer.close();//close the file object
}
Final answer:
To solve this problem, use the Scanner class to get user input and the FileWriter and BufferedWriter classes to write to a file. Prompt the user for the output file name and write everything the user types to the file until they enter "STOP!"
Explanation:
In order to solve this problem in the class named InputTextToOutputFile.java, you can use the Scanner class to get user input. First, create a Scanner object to read user input from the console. Then, prompt the user with the message "What is the name of your output file?" and store their response in a variable called 'fileName'.
Next, you can use the FileWriter and BufferedWriter classes to create and write to a file. Open the output file using the 'fileName' variable, and create a FileWriter and BufferedWriter object to write to the file.
Now, you can use a while loop to continuously read user input and write it to the file until the input contains the string "STOP!". Inside the while loop, read the user input using the Scanner object, and use the BufferedWriter object to write the input to the file. Finally, outside of the while loop, write the string "STOP!" to the file and close the BufferedWriter object to ensure that all the data is written to the file.
Design an application in which the number of days for each month in the year is stored in an array. (For example, January has 31 days, February has 28, and so on. Assume that the year is not a leap year.) Display 12 sentences in the same format for each month; for example, the sentence displayed for January is Month 1 has 31 days.
Answers
Final answer:
To design an application in which the number of days for each month in the year is stored in an array, create an array of integers representing the number of days in each month. Use a loop to display 12 sentences, each containing the month number and the corresponding number of days.
Explanation:
To design an application in which the number of days for each month in the year is stored in an array, you can create an array of integers representing the number of days in each month. Here's an example:
int[] daysInMonth = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
Then, you can use a loop to display 12 sentences, each containing the month number and the corresponding number of days. Here's an example:
for (int i = 0; i < 12; i++) {
System.out.println("Month " + (i + 1) + " has " + daysInMonth[i] + " days.");
}
Final answer:
To design the application, create an array with the number of days corresponding to each month and iterate through the array to display sentences for each month using the provided mnemonic or the knuckle mnemonic to remember the days.
Explanation:
To design an application that stores the number of days for each month in an array, we'll assume a non-leap year. We have the mnemonics "Thirty days hath September, April, June, and November. All the rest have thirty-one, save the second one alone, Which has four and twenty-four, till leap year gives it one day more". So, we'll create an array with the following values: 31 (January), 28 (February), 31 (March), 30 (April), 31 (May), 30 (June), 31 (July), 31 (August), 30 (September), 31 (October), 30 (November), 31 (December). Then, we can iterate through this array and display the sentences accordingly.
For example, the following pseudo-code can be used to display the sentences:Initialize an array daysInMonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]For each index in the array representing a month (starting from 0 for January):Print "Month (index + 1) has (value at current index) days"
The knuckle mnemonic is a physical way to remember the number of days in each month, where months with 31 days are represented by the protruding knuckles and shorter months fall in the spots between the knuckles.
Each time an item is added and requires reallocation, count X + 1 units of cost, where X is the number of items currently in the array. This cost will cover the X assignments which are necessary to copy the contents of the full array into a new (larger) array, and the additional assignment to put the item which did not fit originally To make this more concrete, if the array has 8 spaces and is holding 5 items, adding the sixth will cost 1. However, if the array has 8 spaces and is holding 8 items, adding the ninth will cost 9 (8 to move the existing items + 1 to assign the ninth item once space is available).
When we can bound an average cost of an operation in this fashion, but not bound the worst case execution time, we call it amortized constant execution time, or average execution time. Amortized constant execution time is often written as O(1+), the plus sign indicating it is not a guaranteed execution time bound.
In a file called amortizedAnalysis.txt, please provide answers to the following questions:
1. How many cost units are spent in the entire process of performing 16 consecutive push operations on an empty array which starts out at capacity 8, assuming that the array will double in capacity each time new item is added to an already full dynamic array? Now try it for 32 consecutive push operations. As N (ie. the number of pushes) grows large, under this strategy for resizing, what is the big-oh complexity for push?
2. How many cost units are spent in the entire process of performing 16 consecutive push operations on an empty array which starts out at capacity 8, assuming that the array will grow by a constant 2 spaces each time new item is added to an already full dynamic array? Now try it for 32 consecutive push operations. As N (ie. the number of pushes) grows large, under this strategy for resizing, what is the big-oh complexity for push?
Answers
Answer:
1. Average of total Cost = Total Cost/n = O(1)
2. Average of total Cost = Total Cost/n = O(n)
Explanation:
1) Array has Initial size of 8
For adding 16 elements
1. So Cost for first 8 element its 8.
2. On adding 9th element cost is (8+1) = 9 and array is resized to size of 16
3. Then for 10th,11th,12th,.......,16th element Cost is 7.
So total cost is 8 +9 + 7 = 24 ..So for adding 16 elements Cost is 24 units.
For adding 32 elements
1. So Cost for first 8 element its 8.
2. On adding 9th element cost is (8+1) = 9 and array is resized to size of 16
3. Then for 10th,11th,12th,.......,16th element total Cost is 7.
4. On adding 17th element cost is (16+1) = 17 and array is resized to size of 32.
5. Then for 18th,19th,20th,.......,32th element total Cost is 15.
So total cost is 8 +9 + 7 +17+15= 56 ..So for adding 32 elements Cost is 56 units.
We are Intrested in finding the Amortized Cost i.e Averga cost over large number of insertion:-
When the array size is doubled:-
N operation of N pushes will have cost of 1+2+4+8+16+.. + 2k where 2k < N, Summing upo the series we have
2k-1 - 2 . But 2k <=n <= 2k-1 So,
The total cost of the sequence of n insertions will be O(n) .
Since the Amortized Cost is the Average of total Cost = Total Cost/n = O(1)
2) resize by increasing the size by 2 elements
For adding 16 elements
1. So Cost for first 8 element its 8.
2. On adding 9th element cost is (8+1) = 9 and array is resized to size of 10
3. Then for 10th element Cost is 1
4. Then for 11th element Cost is 11
5.Then for 12th element Cost is 1
6.Then for 13th element Cost is 13
6.Then for 14th element Cost is 1
6.Then for 15th element Cost is 15
6.Then for 16th element Cost is 1
So total cost is 60 ..So for adding 16 elements Cost is 60 units.
For adding 32 elements
1. So Cost for first 8 element its 8.
2. On adding 9th element cost is (8+1) = 9 and array is resized to size of 10
3. Then for 10th element Cost is 1
4. Then for 11th element Cost is 11
5.Then for 12th element Cost is 1
7.Then for 13th element Cost is 13
8.Then for 14th element Cost is 1
9.Then for 15th element Cost is 15
10.Then for 16th element Cost is 1
11. Then for 17th element Cost is 17
12. Then for 18th element Cost is 1
13.Then for 19th element Cost is 19
14.Then for 20th element Cost is 1
15.Then for 21th element Cost is 21
16.Then for 22th element Cost is 1
17.Then for 23th element Cost is 23 .. . . .. .. Then for 31th element Cost is 31 .. . . . . . . . . .. Then for 32th element Cost is 1 .
So total cost is 260 ..So for adding 32 elements Cost is 260 units.
N operation of N pushes will have cost of 1+2+3+4+5+.. + N-1 = N(N-1)/2
The total cost of the sequence of n insertions will be O(n2) .
Since the Amortized Cost is the Average of total Cost = Total Cost/n = O(n)
The cost of an international call from New York to New Delhi is calculated as follows: Connection fee, $1.99; $2.00 for the first three minutes; and $0.45 for each additional minute. Write a program that prompts the user to enter the number of minutes the call lasted and outputs the amount due. Format your output with 2 decimal places c++
Answers
Answer:
#include <iostream>
using namespace std;
int main()
{
double minutes, cost = 0;
cout<<"Enter the number of minutes: ";
cin >> minutes;
if (minutes <= 3)
cost = 1.99 + (minutes * 2);
else
cost = 1.99 + (2 * 3 + (minutes - 3) *0.45);
cout <<"The cost is: " << cost <<endl;
return 0;
}
Explanation:
Declare the variables
Ask the user for the minutes
Check the minutes:
If it is less than or equal to 3, calculate the cost by summing multiplication of the minutes by 2 and 1.99
Otherwise, calculate the cost by summing the multiplication of the first 3 minutes by 2, multiplication of the remaining minutes by 0.45 and 1.99
Print the the cost
Final answer:
The program calculates the cost of an international call based on the connection fee, the rate for the first three minutes, and the rate for each additional minute, given the total call duration input by the user. It then outputs the total amount due formatted with two decimal places.
Explanation:
The question relates to creating a C++ program that calculates the total cost of an international call from New York to New Delhi. The cost includes a connection fee, a fixed cost for the first three minutes, and a variable cost for each additional minute. The C++ program must prompt the user for the duration of the call in minutes and calculate the total amount due based on the given rates. It should then display the final amount formatted to two decimal places.
Here is an outline of the program that performs this calculation:
#include
#include
using namespace std;
int main() {
const double connectionFee = 1.99;
const double firstThreeMinuteCost = 2.00;
const double additionalMinuteCost = 0.45;
int minutes;
double amountDue;
cout << "Enter the number of minutes the call lasted: ";
cin >> minutes;
if (minutes <= 3) {
amountDue = connectionFee + firstThreeMinuteCost;
} else {
amountDue = connectionFee + firstThreeMinuteCost + (minutes - 3) * additionalMinuteCost;
}
cout << fixed << setprecision(2);
cout << "The total amount due for the call is $" << amountDue << endl;
return 0;
}
The user is prompted for the total minutes of the call. The program calculates the cost considering all the constraints and displays the result with two decimal places using fixed and setprecision manipulators.
Which of the follow is the best technique to determine how many menu items are needed and how to structure the menus and sub menus.
a. Group use cases by data requirements
b. Group use cases by dependency
c. Group use cases by actor.
d. Group business functions by department
Answers
Answer:
c. Group use cases by actor.
Explanation:
A use case is used to describe interaction between systems and users to achieve a goal. Mostly, a list of possible interaction between the system and the user is identified. The user can be a single person or a group. By using use case, the requirement of a systems is identified from a users point of view.
Write a code block to decode strings from secret encodings back to readable messages. To do so: Initialize a variable called decoded as an empty string Use a for loop to loop across all characters of a presumed string variable called encoded Inside the loop, convert the character to another character: Get the unicode code point for the character (using ord) Subtract the value of key to that code point (which should be an int) This undoes the secret encoding of the character, getting back to the original value Convert this new int back to a character (using chr). Also inside the loop, add this converted character to the string decoded
Answers
Answer:
The answer is provided in the attached document.
Explanation:
The explanation is provided in the attached document.
Suppose a program is running on a distributed-memory multiprocessor. There are 1,000 instructions in the program and 80% of instruction references hit in the local memory and 20% of instruction references involve the remote communication in the remote memory. 10 ns time is required for the remote communication for each instruction reference. If the CPU clock rate is 4 GHZ and CPI is 0.5, what is the running time of this program?
Answers
Answer:
2125 ns.
Explanation:
First of all Execution Time = Number of Instructions * CPI * Clock Cycle
Number of Instructions = 1000
CPI = 0.5
Clock Cycle = 1/clock rate = 1/4GHz = 0.25 * 10-9 s
So Execution Time = 1000 * 0.5 * 0.25 * 10-9
Execution Time = 125 * 10-9 s
Execution Time = 125 ns
Now 20% of the instructions take 10 ns extra time for remote communication.
1 instruction takes 10ns
so 20% of 1000 = 200 instructions will take 200*10 = 2000ns
So Total Execution Time = 125+2000 = 2125 ns.
Hot sites ________. are a.more expensive than CDP b.Lose less data during a disaster than CDP c.Both are more expensive than CDP and Lose less data during a disaster than CDP d.Neither are more expensive than CDP nor Lose less data during a disaster than CDP
Answers
Answer:
d. Neither are more expensive than CDP nor Lose less data during a disaster than CDP
Explanation:
A hot site is considered a site that remain very much functional and permits immediate recovery when a disaster occurs. One great advantage of hot sites is that they can be used for operation before the occurrence of a disaster. Hot sites are usually cost effective and hence are less expensive than CDP. With hot sites, users are only faced with minimal downtime in the course of a disaster that affects one of the data centers, hence it is not that they lose less data during a disaster than CDP.
Write a query to display the invoice number, line numbers, product SKUs, product descriptions, and brand ID for sales of sealer and top coat products of the same brand on the same invoice. Sort the results by invoice number in ascending order, first line number in ascending order, and then by second line number in descending order
Answers
Final answer:
To display the invoice number, line numbers, product SKUs, product descriptions, and brand ID for sales of sealer and top coat products of the same brand on the same invoice, you can use a SQL query with multiple joins and sorting conditions.
Explanation:
To display the invoice number, line numbers, product SKUs, product descriptions, and brand ID for sales of sealer and top coat products of the same brand on the same invoice, you can use SQL query with multiple joins and sorting conditions. Here's an example:
SELECT i.invoice_number, l1.line_number, l1.product_sku, l1.product_description, l1.brand_idFROM invoices i
JOIN lines l1 ON i.invoice_number = l1.invoice_number
JOIN lines l2 ON i.invoice_number = l2.invoice_number AND l1.brand_id = l2.brand_id
WHERE l1.product_description LIKE '%sealer%' AND l2.product_description LIKE '%top coat%'
ORDER BY i.invoice_number ASC, l1.line_number ASC, l2.line_number DESC;
This query assumes that the tables for invoices are named 'invoices' and the tables for lines are named 'lines'. Modify the table names and column names according to your database schema.
Final answer:
The SQL query should select invoice numbers, line numbers, product SKUs, product descriptions, and brand IDs where product descriptions are 'sealer' or 'top coat' and group by invoice number and brand, ensuring there are at least two such products on the same invoice. The query should sort results as specified.
Explanation:
Writing a SQL query involves selecting specific columns from a table and applying the conditions that match the data retrieval requirements. For this scenario, we want to display invoice numbers, line numbers, product SKUs, product descriptions, and brand IDs for sales of 'sealer' and 'top coat' products of the same brand on the same invoice. Additionally, we are asked to ensure the results are sorted by invoice number in ascending order, first line number in ascending order, and then by second line number in descending order.
Here is an example of what the SQL query might look like:
SELECT InvoiceNumber, LineNumber1, LineNumber2, SKU, ProductDescription, BrandID FROM Sales WHERE (ProductDescription = 'sealer' OR ProductDescription = 'top coat') AND BrandID IS NOT NULL GROUP BY InvoiceNumber, BrandID HAVING COUNT(*) > 1 ORDER BY InvoiceNumber ASC, LineNumber1 ASC, LineNumber2 DESC;
Note that database structure is assumed, and actual table and column names may vary.
PROBLEM 3 This program is about exception handling. Create an empty list. Use a loop to ask user to input 5 integers. In every iteration, add user input to the list if it can be converted to an integer. Otherwise, display an error message. Display the list of integers after the loop. The following is an example: Enter an integer: 24 Enter an integer: 5.6 Input value cannot be converted to integer Enter an integer: 1,000 Input value cannot be converted to integer Enter an integer: 41 Enter an integer: 8 Integer list: [24, 41, 8] Save your Python program in a file named Lab11P3.py. Submit the file to Blackboard for credit.
Answers
Answer:
see explaination
Explanation:
The program code
lst = []
for i in range(5):
n = input("Enter an integer: ")
if(n.isdecimal()):
lst.append(int(n))
else:
print("Input value cannot be converted to integer")
print("Integer list:",lst)
see attachment for output
1) Write expressions of relational algebra for the following queries draw the query trees for each and write the SQL statement: a. What PC models have a speed of at least 3.00 b. What the model numbers of all color printers c. Which manufacturer make laptops with at least 100 GB d. Find the model and price of all products (of any type) made by manufacturer "B" e. Find the manufacturers that sell laptops but not PC.
Answers
Answer:
Explanation:
Find attach the solution
The expressions of relational algebra for the given queries and the query trees for each with the SQL statement are explained.
Given are expressions for the given queries in relational algebra, draw the query trees, and provide the corresponding SQL statements:
Let's assume we have the following tables:
PC (model, speed, ram, hd, price)
Printer (model, color, type, price)
Laptop (model, speed, ram, hd, screen, price)
Product (model, type, price)
Manufacturer (name, country)
a. Relational algebra expression: π model (σ speed ≥ 3.00 (PC))
Query tree:
π model
|
σ speed >= 3.00
|
PC
SQL statement:
SELECT model
FROM PC
WHERE speed >= 3.00;
b. Relational algebra expression: π model (σ color = 'color' (Printer))
Query tree:
π model
|
σ color = 'color'
|
Printer
SQL statement:
SELECT model
FROM Printer
WHERE color = 'color';
(Note: Replace 'color' with the actual value representing color printers.)
c. Relational algebra expression: π name (σ hd ≥ 100 (Laptop ⋈ Manufacturer))
Query tree:
π name
|
σ hd >= 100
|
Laptop ⋈ Manufacturer
SQL statement:
SELECT DISTINCT m.name
FROM Laptop l
INNER JOIN Manufacturer m ON l.model = m.model
WHERE l.hd >= 100;
d. Relational algebra expression: π model, price (σ name = 'B' (Product ⋈ Manufacturer))
Query tree:
π model, price
|
σ name = 'B'
|
Product ⋈ Manufacturer
SQL statement:
SELECT p.model, p.price
FROM Product p
INNER JOIN Manufacturer m ON p.model = m.model
WHERE m.name = 'B';
e. Relational algebra expression: π name (Manufacturer) - π name (σ type = 'PC' (Product ⋈ Manufacturer)) ⋈ π name (σ type = 'Laptop' (Product ⋈ Manufacturer))
Query tree:
π name (Manufacturer)
|
-
/ \
/ \
π name π name (σ type = 'Laptop' (Product ⋈ Manufacturer))
|
σ type = 'PC'
|
Product ⋈ Manufacturer
SQL statement:
SELECT DISTINCT m.name
FROM Manufacturer m
WHERE m.name NOT IN (
SELECT DISTINCT m2.name
FROM Product p
INNER JOIN Manufacturer m2 ON p.model = m2.model
WHERE p.type = 'PC'
)
AND m.name IN (
SELECT DISTINCT m3.name
FROM Product p
INNER JOIN Manufacturer m3 ON p.model = m3.model
WHERE p.type = 'Laptop'
);
Please note that the SQL statements assume the actual column names in the tables may vary, and you need to adjust them accordingly.
Learn more about SQL statements click;
https://brainly.com/question/34389274
#SPJ3
Consider the following 3-PARTITION problem. Given integers a1; : : : ; an, we want to determine whether it is possible to partition of f1; : : : ; ng into three disjoint subsets I; J;K such that X i2I ai = X j2J aj = X k2K ak = 1 3 Xn i=1 ai For example, for input (1; 2; 3; 4; 4; 5; 8) the answer is yes, because there is the partition (1; 8), (4; 5), (2; 3; 4). On the other hand, for input (2; 2; 3; 5) the answer is no. Devise and analyze a dynamic programming algorithm for 3-PARTITION that runs in time polynomial in n and in P i ai.
Answers
Answer:
Explanation:
Find attach the solution
Suppose you are given a sequence or array of n real numbers (a1, a2, . . . , an), all distinct. We are interested in sorting this list, and ideally sorting it as efficiently as possible / with minimal effort. All information relevant to sorting a list can be thought of as contained in the order permutation. If a list (a1, a2, a3) has an ordering permutation of (3, 1, 2), that would mean a3 ≤ a1 ≤ a2, hence, the sorted form of the list would be (a3, a1, a2). This permutation encodes how all the elements compare to one another.
1) How many possible ways could a list of n values be ordered, i.e., how many ordering permutations are there?
2) Argue that if you know a list’s order permutation, sorting is easy (linear time), and conversely, if you know the steps to sort the list, you can easily generate the order permutation.
3) Given this, argue that sorting can’t be easier than finding the order permutation.
4) If every element comparison (testing where ai ≤ aj ) provides at most one bit of information, argue that in order to be able to sort any list, you need to perform at least approximately log2 (n!) many comparisons.
5) Based on the prior result, argue that merge sort is, asymptotically, as or more efficient than any other sorting algorithm.
Answers
Answer:
1. n
2. we can slect that permutation without any comparison and the array wil be sorted in to one time.
3. we cannot sort the list without any comparision test.
Explanation:
1. The total number of permutations available are n! because there are ' n ' distinct elements in an array.
2. Here we are given the total ordering permutations, among those available permutations there will be one permutation in which all the elements of the array are sorted. so, we can slect that permutation without any comparison and the array wil be sorted in to one time.
3. If there is no total ordering permutation then we cannot sort the list without any comparision test. In this case we should know the the number of inversion required to see the array. Based on the permutations we can select the permutation which requires minimum inversions. Here inversion sort works well.
See attachment for the details of 4 and 5.
A custom window shade designer charges a base fee of $50 per shade. In addition, charges are added for certain styles, sizes, and colors as follows.
Styles:
Regular shades:Add $0
Folding shades: Add $10
Roman shades: Add $15
Sizes:
25 inches wide: Add $0
27 inches wide: Add $2
32 inches wide: Add $4
40 inches wide: Add $6
Colors:
Natural: Add $5
Blue: Add $0
Teal: Add $0
Red: Add $0
Green: Add $0
Create an application that allows the user to select the style, size, color, and number of shades from list boxes or combo boxes. if a combo box is used, set its drop-downstyle property in such a way the the new items cannot be added to the customer list by the user total charges should be displayed on a second form.
Answers
Answer:
Check the explanation
Explanation:
* Filename: ShadeDesigner.java
* Programmer: Jamin A. Bishop
* Date: 3/31/2012
* version 1.00 2012/4/2
*/
import java. awt.*;
import java. awt. event.*;
import java. text. DecimalFormat;
import javax. swing.*;
import javax. swing. event. ListSelectionEvent;
import javax. swing. event. ListSelectionListener;
public class ShadeDesigner extends JFrame
{
private String[] styles = {"Regular Shades", "Folding Shades", "Roman Shades"};
private String[] size = {"25 Inches Wide", "27 Inches Wide",
"32 Inches Wide", "40 Inches Wide"};
private String[] colors = {"Natural", "Blue", "Teal",
"Red", "Green"};
private JLabel banner;// To display a banner
private JPanel bannerPanel;// To hold the banner
private JPanel stylesPanel;//
private JPanel sizePanel;//
private JPanel colorPanel;
private JPanel buttonPanel;//
private JList stylesList;
private JList sizeList;
private JList colorList;
private JTextField Styles;
private JTextField Size;
private JTextField Color;
private JButton calcButton;
private JButton ExitButton;
private double totalCharges = 50.00;
//Constants
private final int ROWS = 5;
private final double regularCost = 0.00;//base price for the blinds
private final double foldingCost = 10.00;//extra cost for folding blinds
private final double romanCost = 15.00;//extra cost for roman blinds
private final double twentyfiveInCost = 0.00; //extra cost for 25" blinds
private final double twentySevenInCost = 2.00;//extra cost for 27" blinds
private final double thirtyTwoInCost = 4.00;//extra cost for 32" blinds
private final double fourtyInCost = 6.00;//extra cost for 40" blinds
private final double naturalColorCost = 5.00;//extra cost for color
public ShadeDesigner()
{
//display a title
setTitle("Shade Designer");
// Specify what happens when the close button is clicked.
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
// Create the banner on a panel and add it to the North region.
buildBannerPanel();
add(bannerPanel, BorderLayout. NORTH);
stylesPanel();
add(stylesPanel, BorderLayout. WEST);
sizePanel();
add(sizePanel, BorderLayout. CENTER);
colorPanel();
add(colorPanel, BorderLayout. EAST);
buttonPanel();
add(buttonPanel, BorderLayout. SOUTH);
pack();
setVisible(true);
}
//build the bannerpanel
private void buildBannerPanel()
{
bannerPanel = new JPanel();
bannerPanel.setLayout(new FlowLayout(FlowLayout.CENTER));
banner = new JLabel("Shade Designer");
banner.setFont(new Font("SanSerif", Font.BOLD, 24));
bannerPanel.add(banner);
}
//stylepanel
private void stylesPanel()
{
JLabel styleTitle = new JLabel("Select a Style.");
stylesPanel = new JPanel();
stylesPanel. setBorder(BorderFactory. createEmptyBorder(5,5,5,5));
stylesList = new JList (styles);
stylesList.setVisibleRowCount(ROWS);
JScrollPane stylesScrollPane = new JScrollPane(stylesList);
stylesList. setSelectionMode(ListSelectionModel.SINGLE_SELECTION);
stylesList. addListSelectionListener(new stylesListListener());
stylesPanel. setLayout(new BorderLayout());
stylesPanel. add(styleTitle, BorderLayout. NORTH);
stylesPanel. add(stylesScrollPane, BorderLayout. CENTER);
Styles = new JTextField (5);
Styles. setEditable(false);
//stylesPanel. add(StylesLabel, BorderLayout. CENTER);
stylesPanel. add(Styles, BorderLayout. SOUTH);
}
private class stylesListListener implements ListSelectionListener
{
public void valueChanged (ListSelectionEvent e)
{
String selection = (String) stylesList. getSelectedValue();
Styles. setText(selection);
}
}
//size panel
private void sizePanel()
{
JLabel sizeTitle = new JLabel("Select a Size.");
sizePanel = new JPanel();
sizePanel. setBorder(BorderFactory. createEmptyBorder(5,5,5,5));
sizeList = new JList (size);
sizeList.setVisibleRowCount(ROWS);
JScrollPane stylesScrollPane = new JScrollPane(sizeList);
sizeList.setSelectionMode(ListSelectionModel.SINGLE_SELECTION);
sizeList.addListSelectionListener(new sizeListListener());
sizePanel. setLayout(new BorderLayout());
sizePanel. add(sizeTitle, BorderLayout. NORTH);
sizePanel. add(stylesScrollPane, BorderLayout. CENTER);
//sizeLabel = new JLabel("Style Selected: ");
Size = new JTextField (5);
Size.setEditable(false);
//stylesPanel. add(StylesLabel, BorderLayout. CENTER);
sizePanel. add(Size, BorderLayout. SOUTH);
}
private class sizeListListener implements ListSelectionListener
{
public void valueChanged (ListSelectionEvent e)
{
String selection = (String) sizeList. getSelectedValue();
Size. setText(selection);
}
}
Which of the following is specified by the detailed procedures in a test plan? Question 12 options: The result of the final test of all programs How a separate operational and test environment is prepared The test data to be used Who will work with the new system and ensure that all necessary features have been included
Answers
Final answer:
A test plan typically details 'the test data to be used,' which includes sets of inputs designed to test software functionality and validate outcomes.
Explanation:
The question asks which component is specified by the detailed procedures in a test plan. Of the options provided, the one that is typically detailed in a test plan is the test data to be used. A test plan contains comprehensive information about the testing strategy, test objectives, resources needed for testing, test environment, test limitations, and the schedule of testing activities. Importantly, it specifies the test data which are sets of inputs given to a software program during testing to ascertain an expected outcome and validate the software's functionality.
How does join work? a. You write separator.join('a', 'b', 'c', 'd', ...) where 'a', 'b', 'c', 'd' can be replaced with other strings, but isn't in a list. b. The separator must be a single character, and you use list.join(separator). c. You use separator.join(a_list) where a_list is a list of strings. d. You write a_list.join(separator) where a_list is a list of strings, and separator is a string.
Answers
Answer:
c. You use separator.join(a_list) where a_list is a list of strings.
Explanation:
The join() is an in-built string method which returns a string concatenated with the elements of an iterable. It concatenates each element of an iterable (such as list, string and tuple) to the string and returns the concatenated string.
The syntax of join() is:
string.join(iterable)
From the above syntax, the string usually mean a separator and the iterable will be a string or list or tuple.
The answer is C.
c. You use separator.join(a_list) where a_list is a list of strings.
It is not A because the iterable could be a string. It is not D because the separator is outside not in the bracket.
A company is deploying smartphones for its mobile salesforce. These devices are for personal and business use but are owned by the company. Sales personnel will save new customer data via a custom application developed for the company. This application will integrate with the contact information stored in the smartphones and will populate new customer records onto it. The customer application's data is encrypted at rest, and the application's connection to the back office system is considered secure. The Chief Information Security Officer (CISO) has concerns that customer contact information may be accidentally leaked due to the limited security capabilities of the devices and the planned controls. Which of the following will be the MOST efficient security control to implement to lower this risk?
A. Implement a mobile data loss agent on the devices to prevent any user manipulation with the contact information.
B. Restrict screen capture features on the devices when using the custom application and the contact information.
C. Restrict contact information storage dataflow so it is only shared with the customer application.
D. Require complex passwords for authentication when accessing the contact information.
Answers
Answer:
A. Implement a mobile data loss agent on the devices to prevent any user manipulation with the contact information
Explanation:
Given that, the task is to provide Security controls to lower the risk
Hence, one should undertand the various purpose of troubleshooting, which are:
1. Before the security breach, preventive measures are designed to stop or avoid security breach from occurrence.
2. During the security breach, detective actions are designed to establish and characterize a security breach.
3. After the event, corrective actions are purposely designed to stop the level of any damage caused by the security breach.
Hence, in this case, the MOST efficient security control to implement to lower this risk is to implement a mobile data loss agent on the devices to prevent any user manipulation with the contact information
This is because, Mobile Data Loss Prevention (DLP) is a security function that is provided through email or data security solutions. Thus, through its policies application, to the ActiveSync agent, sensitive information can be restricted from being sent to any ActiveSync-enabled mobile device
Write a method named countMatching(). It has two parameters: a String and a character. The method returns a count of how many times the character parameter appears in the String parameter. Case matters. For example, 'A' is not the same as 'a'. You only need to write the countMatching() method and nothing else (do not modify the main() method provided below). Note, however, that your method must work for any parameters passed, not just the example below.
Answers
Answer:
Check the explanation
Explanation:
public static int countMatching(String s, char c) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == c)
++count;
}
return count;
}
Method in a complete Java program
public class FizzBuzz {
/* sample run:
* z appears 2 time(s) in FIZZbuzz
*/
public static void main(String[] args) {
String s = "FIZZbuzz";
char c = 'z';
int count = countMatching(s, c);
System.out.printf("%c appears %d time(s) in %s%n", c, count, s);
}
// Put your countMatching() method here:
public static int countMatching(String s, char c) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == c)
++count;
}
return count;
}
}
z appears 2 time(s) in FIZZbuzz Process finished with exit code
Write a method called justFirstAndLast that takes a single String name and returns a new String that is only the first and last name.
You may get a name with a middle name or multiple middle names but you should ignore those.
You can assume that there will be at least two names in the given String.
Java
public String justFirstAndLast(String name)
{
}
Answers
Answer:
Answer is in the attached screenshot.
Explanation:
Using regex to split a given input string via whitespace, then returns the first and last element of the array.
1. Write program, WriteData.java, that writes the following data to file books.txt. Include the semicolons. Fiction;Abraham Lincoln Vampire Hunter;Grahame-Smith;Wiley;NY;13.99;222 Fiction;Frankenstein;Shelley;Prescott;GA;7.99;321 NonFiction;Life of Kennedy;Jones;Pearson;MT;12.90;biography Fiction;Dracula;Stoker;Addison;CA;5.99;145 Fiction;Curse of the Wolfman;Hageman;Wesley;MA;10.59;876 NonFiction;How to Pass Java;Willis;Wiley;NY;1.99;technology Fiction;The Mummy;Rice;Addision;CA;7.99;954 NonFiction;History of Texas;Smith;Prescott;CA;9.75;history 2. Write class Publisher with attributes name and state. 3. Rewrite the Book class to include a type Publisher attribute. 4. Write two children of the Book class: FictionBook and NonFictionBook. FictionBook has an additional attribute, fictionCode. NonFictionBook has an additional attribute, catagoryCode. 5. Rewrite the BookTest program. Method buildInstances will read the data from the file, create instances of FictionBook and NonfictionBook from the data, assign these instances to the Book array and return the bookArray as before. Since it is reading data from the file, it does not have any method parameters. 6. Method createCharges should work the same.
Answers
Answer:
Check the explanation
Explanation:
WriteData.java:
import java.io.FileWriter;
import java.io.PrintWriter;
class WriteData {
String[][] data;
public WriteData() {
// Data to write to the file
data = new String[][]{{ "Fiction", "Abraham Lincoln Vampire Hunter", "Grahame-Smith", "Wiley", "NY", "13.99", "222"},
{"Fiction", "Frankenstein", "Shelley", "Prescott", "GA", "7.99", "321"},
{"NonFiction", "Life of Kennedy", "Jones", "Pearson", "MT", "12.90", "biography"},
{"Fiction", "Dracula", "Stoker", "Addison", "CA", "5.99", "145"},
{"Fiction", "Curse of the Wolfman", "Hageman", "Wesley", "MA", "10.59", "876"},
{"NonFiction", "How to Pass Java", "Willis", "Wiley", "NY", "1.99", "technology"},
{"Fiction", "The Mummy", "Rice", "Addision", "CA", "7.99", "954"},
{"NonFiction", "History of Texas", "Smith", "Prescott", "CA", "9.75", "history"}};
}
public void writeToFile() {
try {
PrintWriter pw = new PrintWriter(new FileWriter("books.txt")); // Creating an output stream to write to file
// Writing data to the file line by line
for (int i = 0; i < 8; i++) {
pw.println(data[i][0] + ";" + data[i][1] + ";" + data[i][2] + ";" + data[i][3] + ";" + data[i][4] + ";" + data[i][5] + ";" + data[i][6]);
}
pw.close(); // Closing the created output stream
}
catch(Exception e) {
System.err.println(e);
}
}
}
Publisher.java:
class Publisher {
private String name, state;
public Publisher(String name, String state) {
this.name = name;
this.state = state;
}
// Getters and Setters
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getState() {
return state;
}
public void setState(String state) {
this.state = state;
}
public String toString() {
return name + ";" + state;
}
}
Book.java:
class Book {
private String title, author;
private double price;
private Publisher publisher;
public Book(String title, String author, Publisher publisher, double price) {
this.title = title;
this.author = author;
this.publisher = publisher;
this.price = price;
}
public Double calculateCharge(int Qty){
return getPrice()*Qty;
}
public String getTitle() {
return title;
}
public void setTitle(String title) {
this.title = title;
}
public String getAuthor() {
return author;
}
public void setAuthor(String author) {
this.author = author;
}
public String getPublisher() {
return publisher.toString();
}
public void setPublisher(Publisher publisher) {
this.publisher = publisher;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
}
FictionBook.java:
class FictionBook extends Book {
String fictionCode;
public FictionBook(String title, String author, Publisher publisher, double price, String fictionCode) {
super(title, author, publisher, price); // Calling the parent constructor to initialize values
this.fictionCode = fictionCode;
}
// Getter and Setter
public String getFictionCode() {
return fictionCode;
}
public void setFictionCode(String fictionCode) {
this.fictionCode = fictionCode;
}
}
NonFictionBook.java:
class NonFictionBook extends Book {
String categoryCode;
public NonFictionBook(String title, String author, Publisher publisher, double price, String categoryCode) {
super(title, author, publisher, price); // Calling the parent constructor to initialize values
this.categoryCode = categoryCode;
}
// Getter and Setter
public String getCategoryCode() {
return categoryCode;
}
public void setCategoryCode(String categoryCode) {
this.categoryCode = categoryCode;
}
}
BookTest.java:
import java.util.Scanner;
import java.util.*;
import java.io.File;
import java.io.FileNotFoundException;
public class BookTest {
public static void main(String[] args) {
// TODO code application logic here
// Writing data to the file using WriteData.java program
WriteData writeData = new WriteData();
writeData.writeToFile();
int[] BookQauntity = {12, 8, 3, 53, 7, 23, 14, 5, 6};
Book[] book = new BookTest().buildInstances();
Double GrandTotal= new BookTest().createCharges(BookQauntity, book);
System.out.println("GrandTotal : "+ GrandTotal);
}
catch(FileNotFoundException e) {
System.err.println("File not found");
}
return bk;
};
// ISBN info is removed
Double createCharges(int[] BookQuantity, Book[] book){
Double Gtotal =0.0, total=0.0;
for(int i=0; i<8; i++){
total = book[i].calculateCharge(BookQuantity[i]);
System.out.println("Title : "+ book[i].getTitle() + ", Total Charge : "+ total);
Gtotal +=total;
}
return Gtotal;
};
}
Recall that to multiply an m×n matrix by an n×k matrix requires m×n×k multiplications. The Google PageRank algorithm uses a square matrix that’s filled with non-zero entries when pages link to one another. Suppose we have m web sites cataloged: this is then an m×m matrix. Denote this matrix by P. P is then run through an iterative algorithm that takes j loops to complete (for 5 < j < 100), and each step of this loop an m×m matrix is multiplied by P.
a. mj log m
b. m^2
c. m^3
d. m^4
e. m^2j^2
f. m^2log m
Answers
Answer:
option C i.e. m^3 is the correct option.
Explanation:
The Multiplication of one m x m matrix with a different m x m matrix will take time m x m x m = m3
And given that this multiplication occurred for j iterations, therefore, the total number of multiplication will be j * m3 = jm3
Consequently, the complexity order will be jm3
Since 5< j < 100, hence j can be substituted by constant and for this reason among all the options mentioned, option C i.e. m^3 is correct.
RXOR is described as a 1-bit left-shift rotation performed on the current hash value before each block (in sequence) is being XOR-ed with it. That is, process each successive n-bit block of data: a. Rotate the current hash value to the left by one bit. b. XOR the block into the hash value. Is it true that the following bit flips result in finding a message different than the original and that this new message "produces" the same hash
Answers
Answer:
For this given problem as RXOR is a 1 bit left shift rotation performed on a current tash,it is true that this bit flips flips result in finding a message different than the original and that this new message "produces" the same hash.
Write a function flush that takes as input a list of five cards, tests whether it is a flush (Note: straight flush is not a flush!) and return a boolean value. If the entry is anything other than five distinct cards, it should return (not print!) the message "This is not a valid poker hand".
Answers
Answer:
Explanation:
ef poker(hands):
scores = [(i, score(hand.split())) for i, hand in enumerate(hands)]
winner = sorted(scores , key=lambda x:x[1])[-1][0]
return hands[winner]
def score(hand):
ranks = '23456789TJQKA'
rcounts = {ranks.find(r): ''.join(hand).count(r) for r, _ in hand}.items()
score, ranks = zip(*sorted((cnt, rank) for rank, cnt in rcounts)[::-1])
if len(score) == 5:
if ranks[0:2] == (12, 3): #adjust if 5 high straight
ranks = (3, 2, 1, 0, -1)
straight = ranks[0] - ranks[4] == 4
flush = len({suit for _, suit in hand}) == 1
'''no pair, straight, flush, or straight flush'''
score = ([1, (3,1,1,1)], [(3,1,1,2), (5,)])[flush][straight]
return score, ranks
>>> poker(['8C TS KC 9H 4S', '7D 2S 5D 3S AC', '8C AD 8D AC 9C', '7C 5H 8D TD KS'])
'8C AD 8D AC 9C'
Suppose that TCP's current estimated values for the round trip time (estimatedRTT) and deviation in the RTT (DevRTT) are 400 msec and 25 msec, respectively (see Section 3.5.3 for a discussion of these variables). Suppose that the next three measured values of the RTT are 210, 400, and 310 respectively.
Compute TCP's new value of estimatedRTT, DevRTT, and the TCP timeout value after each of these three measured RTT values is obtained. Use the values of α = 0.125 and β = 0.25. a. Measured value RTT=350 msec Measured value RTT=325 msec c. Measured value RTT=250 msec estimatedRTT = ? DevRTT = ? TimeoutInterval = ?
Answers
Final answer:
The RTT, estimatedRTT, DevRTT, and TimeoutInterval are important TCP parameters used to manage data transmission reliability. Without specific RTT measurements, we cannot calculate exact values for them. The formulas for updating these values are weighted averages and take into account the most recent RTT measurements.
Explanation:
In Transmission Control Protocol (TCP), the round trip time (RTT) is a measure of the time a signal takes to be sent plus the time it takes for an acknowledgment of that signal to be received. This time is used by TCP to adjust the timeout interval for packet retransmission. The variables estimatedRTT and DevRTT are used to calculate the TimeoutInterval, which determine how long TCP waits for an acknowledgment before resending a packet.
To update estimatedRTT and DevRTT after each measured RTT:
For a new measured RTT, calculate the new estimatedRTT using the formula:estimatedRTT = (1 - α) * estimatedRTT + α * SampleRTT, where α is a weight (given as 0.125 in this case).Then calculate the new DevRTT using the formula:
DevRTT = (1 - β) * DevRTT + β * |SampleRTT - estimatedRTT|, where β is a weight (given 0.25 in this case).The TimeoutInterval can be calculated with:
TimeoutInterval = estimatedRTT + 4 * DevRTT.
However, to provide an accurate answer, we need the specific RTT measurements to calculate the exact values for estimatedRTT, DevRTT, and TimeoutInterval.
Geraldine's Landscaping Service and Gerard's Lawn Maintenance are merging their businesses and want to merge their customer files. Each file contains a customer number, last name, address, and property area in square feet, and each file is in customer number order. Design the logic for a program that merges the two files into one file containing all customers. Assume there are no identical customer numbers.
Answers
Final answer:
To merge the two customer files, you can use a simple algorithm that compares the customer numbers in each file and merges them accordingly.
Explanation:
To merge the two customer files, you can use a simple algorithm that compares the customer numbers in each file and merges them accordingly. Here's one possible logic for the program:
Read the first customer entry from both files.Compare the customer numbers.If the customer number from the first file is smaller, write that entry to the merged file and read the next entry from the first file.If the customer number from the second file is smaller, write that entry to the merged file and read the next entry from the second file.Repeat steps 2-4 until all entries from both files have been processed.If there are any remaining entries in the first file, write them to the merged file.If there are any remaining entries in the second file, write them to the merged file.By following this logic, you can merge the customer files into one file containing all the customers.
To merge the customer files, initialize file pointers for each file, compare customer numbers, write the smaller entry to the output file, and continue until all entries are merged. Ensure no duplicates by using unique customer numbers. Consider the general format used in geographic data management.
Merging Customer Files for Geraldine's Landscaping Service and Gerard's Lawn Maintenance
To merge the customer files of both Geraldine's Landscaping Service and Gerard's Lawn Maintenance, you need to design a program that combines the two files into one. Each file is sorted by customer number, which makes the merging process more straightforward. Here's a step-by-step explanation of the logic:
Initialize two file pointers, one for each input file.Open the output file where the merged data will be stored.Read the first entry from both input files.Compare the customer numbers of the current entries from both files.Write the entry with the smaller customer number to the output file.Advance the file pointer of the file from which the entry was written.Repeat steps 4-6 until you reach the end of one of the files.Copy the remaining entries from the other file to the output file.Close all files.This program ensures that all customers from both files are included in the merged output file without duplicates, thanks to the unique customer numbers. The same general format is applied when managing geographic data, where rows represent records and columns represent attributes.
By merging these files, businesses can geocode their customers to better understand their distribution and needs, leading to improved services.
Write a static method named countLastDigits that accepts an array of integers as a parameter and examines its elements to determine how many end in 0, how many end in 1, how many end in 2 and so on. Your method will return an array of counters. The count of how many elements end in 0 should be stored in its element at index 0, how many of the values end in 1 should be stored in its element at index 1, and so on.
Answers
Answer:
See explaination for the program code
Explanation:
code:
public static int[] countLastDigits(int[] list) {
int[] count = new int[10];
for (int i = 0; i < list.length; i++) {
int digit = list[i] % 10;
count[digit]++;
}
return count;
}
The program which counts the number of elements with ends with a certain digit is given below with, elements ending with 0 as index, 1 and so on.
public static int[] countLastDigits(int[] list) {
#initializes a function named countLastDigits
int[] count = new int[10];
for (int i = 0; i < list.length; i++) {
#a for loop to iterate over the array created
int digit = list[i] % 10;
count[digit]++;
#appends to counts variable
}
return count;
}
Learn more : https://brainly.com/question/18478903
Chose the number from following, and using Quadratic Selection Sort, the size of the auxiliary file is_____ . The first value in the auxiliary file is _______and the fourth value is______ , if you start counting with one, not zero. The largest value in the auxiliary file will be replaced with _______. The largest remaining value will be replaced with_______
40 73 43 64 25 82 37 49 58 76 67 85 28 46 88 61 19 52 70 31 79 55 22 34 16
Answers
Answer:
25, 40, 64, 16, 34
Explanation:
the size of the auxiliary file is 25
The first value in the auxiliary file is 40
the fourth value is 64
Largest value will be replaced with 16
The largest remaining value will be replaced with 34
Create a class named BaseballGame that contains data fields for two team names and scores for each team in each of nine innings. names should be an array of two strings and scores should be a two-dimensional array of type int; the first dimension indexes the team (0 or 1) and the second dimension indexes the inning. Create get and set methods for each field. The get and set methods for the scores should require a parameter that indicates which inning’s score is being assigned or retrieved. Do not allow an inning score to be set if all the previous innings have not already been set. If a user attempts to set an inning that is not yet available, issue an error message. Also include a method named display in DemoBaseballGame.java that determines the winner of the game after scores for the last inning have been entered. (For this exercise, assume that a game might end in a tie.) Create two subclasses from BaseballGame: HighSchoolBaseballGame and LittleLeagueBaseballGame. High school baseball games have seven innings, and Little League games have six innings. Ensure that scores for later innings cannot be accessed for objects of these subtypes.
Answers
Answer:
Check the explanation
Explanation:
BaseballGame:
public class BaseballGame {
protected String[] names = new String[2];
protected int[][] scores;
protected int innings;
public BaseballGame() {
innings = 9;
scores = new int[2][9];
for(int i = 0; i < 9; i++)
scores[1][i] = scores[0][i] = -1;
}
public String getName(int team) {
return names[team];
}
public void setNames(int team, String name) {
names[team] = name;
}
public int getScore(int team, int inning) throws Exception {
if(team < 0 || team >= 2)
throw new Exception("Team is ut of bounds.");
if(inning < 0 || inning >= innings)
throw new Exception("Inning is ut of bounds.");
return scores[team][inning];
}
public void setScores(int team, int inning, int score) throws Exception {
if(team < 0 || team >= 2)
throw new Exception("Team is ut of bounds.");
if(inning < 0 || inning >= innings)
throw new Exception("Inning is ut of bounds.");
if(score < 0)
throw new Exception("Score is ut of bounds.");
for(int i = 0; i < inning; i++)
if(scores[team][i] == -1)
throw new Exception("Previous scores are not set.");
scores[team][inning] = score;
}
}
HighSchoolBaseballGame:
public class HighSchoolBaseballGame extends BaseballGame {
public HighSchoolBaseballGame() {
innings = 7;
scores = new int[2][7];
for(int i = 0; i < 7; i++)
scores[1][i] = scores[0][i] = -1;
}
}
LittleLeagueBaseballGame:
public class LittleLeagueBaseballGame extends BaseballGame {
public LittleLeagueBaseballGame() {
innings = 6;
scores = new int[2][6];
for(int i = 0; i < 6; i++)
scores[1][i] = scores[0][i] = -1;
}
}