assume you have 50 to 100 employees whose ids are in the rage of 1000 to 1099, and you have a file that can accommodate all employees, size 100. show how would you map the employees IDs to the file address, (you don't need to map all 100 employees ad to the file) show a few examples. Show an example of collision and show how you can resolve collisions. ** if we have exactly 100 employees what would happen??

assume you have 50 to 100 employees whose ids are in the rage of 1000 to 1099, and you have a file that can accommodate all employees, size 100. show how would you map the employees IDs to the file address, (you don't need to map all 100 employees ad to the file) show a few examples. Show an example of collision and show how you can resolve collisions. ** if we have exactly 100 employees what would happen??

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 10P

See similar textbooks

Similar questions

Given the following transaction database from a supermarket: Transaction ID items T1 I1, I2, I3 T2 I2, I3, I4 T3 I4, I5 T4 I1, I2, I4 T5 I1, I2, I3, I5 T6 I1, I2, I3, I4 What is the output of the Apriori algorithm run on the above transaction database with a minimum support of 50 % (i.e. 3 out of 6 transactions)? Calculate the following confidence: {I1, I2} => { I3} {I2} => {I1, I3} {I1, I3} => {I2} Calculate the following lift: {I2} => {I3} {I2} => {I4} {I1, I3} => {I2}
What is the security requirement on password hashing? Given a password w, its hash is calculated as . This question is about the security requirement on function h. (a) Can we use any function as h for password hashing? For example, can we use the "mod 100" function, which is a common computer science function? (Given any integer value x, "mod 100" function works by "x mod 100," which is a value between [0, 99]; for example, if x = 105, x mod 100 = 5; x = 1000000, x mod 100 = 0;) (b) If not, what is the security requirement on h?
How would you find the middle number using a red-black BST? Like if you had a set of numbers: 1,5,7,11,19, how could you find and return the middle number 7 using a red-black BST?
I need to correct the following two pseudo code assignments, and I have trouble finding more mistakes in the code. Can anyone help me find them? // Cooper College maintains a master file of students and credits// earned. Each semester the master is updated with a transaction// file that contains credits earned during the semester.// Each file is sorted in Student ID number order. start Declarations num masterID string masterName num masterCredits num transID num transCredits string bothDone = "N" num HIGH_VALUE = 999999 InputFile master InputFile trans OutputFile newMaster getReady() while bothDone = "N" detailLoop() endwhile allDone()stop getReady() open master "master.dat" //changed to "master.dat" open trans "trans.dat" //changed to "trans.dat" open newMaster "newMaster.dat" //changed to "newMaster.dat" readMaster() readTrans()…
Correct answer will be upvoted else downvoted. Computer science. You have an arrangement a with n components 1,2,3,… ,k−1,k,k−1,k−2,… ,k−(n−k) (k≤n<2k). How about we call as reversal in a couple of files i<j to such an extent that a[i]>a[j]. Assume, you have some change p of size k and you assemble an arrangement b of size n in the accompanying way: b[i]=p[a[i]]. You will probably find such change p that the absolute number of reversals in b doesn't surpass the all out number of reversals in a, and b is lexicographically greatest. Little update: the grouping of k integers is known as a stage in the event that it contains all integers from 1 to k precisely once. Another little update: a grouping s is lexicographically more modest than another succession t, if either s is a prefix of t, or for the primary I to such an extent that si≠ti, si<ti holds (in the principal position that these arrangements are unique, s has more modest number than t). Input…
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Suppose Alice has r and w rights over the file book. Alice wants to copy r rights to book to Bob. Assuming there is a copy right c, write a command to do this. Now assume the system supports a copy flag; for example, the right r with the copy flag would be written as rc. In this case, write a command to do the copy. In the previous part, what happens if the copy flag is not copied?
In this activity, you will create cryptograms by encoding two messages using matrix multiplication. You must use a unique matrix to encode each cryptogram. For both messages, use this table of corresponding numbers and letters. _(space) 0 I 9 R 18 A 1 J 10 S 19 B 2 K 11 T 20 C 3 L 12 U 21 D 4 M 13 V 22 E 5 N 14 W 23 F 6 O 15 X 24 G 7 P 16 Y 25 H 8 Q 17 Z 26 Encode the message "go straight" using the matrix: 2 3 1 3
Assume you have two sequences ? and ? of the same length ? > 1, where each sequence contains integer values. The goal of this problem is to find a subsequence ? which has the following properties:1. The subsequence ? is common to both ? and ?.2. The subsequence ? length is maximum among any other common subsequences.3. The subsequence ? cannot be empty.4. The values in subsequence S are consecutive values in X and Y. Brute-force algorithm:Generate all possible subsequences of X, and all subsequences of Y. Then, for each subsequence sx in X, and for each subsequence sy in Y, check if sx and sy are equal. If so, then compare its length with the maximum common subsequence found so far and keep the maximum length subsequence. Input FormatInput consists of two 1-dimenional arrays of size ?, where ? > 1 Output Format Output is:• ?: length of the subsequence S• ?: starting index in sequence X for the first element in S• ?: starting index in sequence Y for the first element in S There's…
You are the sysadmin for a big tech company, and you have to estimate the amount of servers you need to handle some long-running jobs. One server can handle only one job at once. One job can only be executed by one server at once. Once a server has finished executing its current job, it can be reassigned to a new job. Given an array of time intervals intervals where intervals[i] = [starti, endi], representing the start and end time for a particular job that needs to be executed, return the minimum number of servers required to run all jobs. Constraints: 1 <= intervals.length <= 104 0 <= starti < endi <= 106 Function definition for Java: public int minMeetingRooms(int[][] intervals) { // Your code here } Function definition for Python: def minMeetingRooms(self, intervals: List[List[int]]) -> int: #Your code here Announced Test Cases: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2Explanation: We need one server for the job that starts at 0. For the job…
Please check the answer and add explanation properly Implement ( program ) an attack on the Hill cipher as discussed in class and the textbook. Your attack should work on a 2 ∗ 2 matrix. Show how your attack works on the example on page 8 4 , and also run it on some other inputs.
Use python to cluster the points that given in the file points.txt. Use K-means algorithm. You should use different number of clusters 2,3,4, and 5. Draw the results of each case and show the points of each cluster with different color. Explain which one is the best and discuss the results. file content of point.txt x y0.12 0.290.57 0.190.60 0.570.06 0.280.06 0.420.15 0.250.02 0.200.44 0.240.83 0.760.62 0.330.52 0.640.86 0.150.10 0.350.91 0.580.11 0.470.52 0.290.14 0.110.56 0.240.00 0.170.57 0.380.85 0.300.92 0.510.99 0.380.51 0.080.22 0.130.10 0.300.51 0.160.59 0.470.76 0.340.08 0.500.62 0.440.52 0.190.17 0.140.94 0.350.59 0.470.44 0.320.94 0.520.66 0.360.45 0.440.84 0.070.53 0.230.55 0.130.60 0.590.37 0.620.24 0.190.58 0.160.87 0.520.41 0.040.11 0.450.44 0.140.40 0.040.40 0.620.83 0.060.40 0.290.39 0.560.37…