Question 1: Suppose that we test a discount system in some e-shop. The system can send a loyalty card to a client and admit a discount of 0% (no discount), 5%, or 10% according to the following rules: “No discount” is the default discount option. A nonregistered user has 0% discount by definition. If a registered user spent more than $1000 in the previous shopping sessions, and there were 19 or less shopping sessions, admit 5% discount. If a registered user spent more than $1000 in the previous shopping sessions and there were at least 20 shopping sessions, admit 10% discount. A loyalty card is sent only to registered customers who spent more than $1000 or had at least 20 shopping sessions.Write a Junit test and use the test cases. Write a Junit test and use the test cases.

Question 1: Suppose that we test a discount system in some e-shop. The system can send a loyalty card to a client and admit a discount of 0% (no discount), 5%, or 10% according to the following rules: “No discount” is the default discount option. A nonregistered user has 0% discount by definition. If a registered user spent more than $1000 in the previous shopping sessions, and there were 19 or less shopping sessions, admit 5% discount. If a registered user spent more than $1000 in the previous shopping sessions and there were at least 20 shopping sessions, admit 10% discount. A loyalty card is sent only to registered customers who spent more than $1000 or had at least 20 shopping sessions.Write a Junit test and use the test cases. Write a Junit test and use the test cases.

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

Suppose that we test a discount system in some e-shop. The system can send a loyalty card to a client and admit a discount of 0% (no discount), 5%, or 10% according to the following rules: “No discount” is the default discount option. A nonregistered user has 0% discount by definition. If a registered user spent more than $1000 in the previous shopping sessions, and there were 19 or less shopping sessions, admit 5% discount. If a registered user spent more than $1000 in the previous shopping sessions and there were at least 20 shopping sessions, admit 10% discount. A loyalty card is sent only to registered customers who spent more than $1000 or had at least 20 shopping sessions. Design a test case for the requirements
Suppose that we test a discount system in some e-shop. The system can send a loyalty card to a client and admit a discount of 0% (no discount), 5%, or 10% according to the following rules: “No discount” is the default discount option. A nonregistered user has 0% discount by definition. If a registered user spent more than $1000 in the previous shopping sessions, and there were 19 or less shopping sessions, admit 5% discount. If a registered user spent more than $1000 in the previous shopping sessions and there were at least 20 shopping sessions, admit 10% discount. A loyalty card is sent only to registered customers who spent more than $1000 or had at least 20 shopping sessions. Please give the complete decision table
Suppose that we test a discount system in some e-shop. The system can send a loyalty card to a client and admit a discount of 0% (no discount), 5%, or 10% according to the following rules: “No discount” is the default discount option. A nonregistered user has 0% discount by definition. If a registered user spent more than $1000 in the previous shopping sessions, and there were 19 or less shopping sessions, admit 5% discount. If a registered user spent more than $1000 in the previous shopping sessions and there were at least 20 shopping sessions, admit 10% discount. A loyalty card is sent only to registered customers who spent more than $1000 or had at least 20 shopping sessions. I wrote programming in Java, but I can't do Junit test. Can you write the program and do a Junit test on the methods?
Consider a program that allows a surgeon in one city to assist in an operation on a patient in another city via an internet connection. Who might want to attack the program? What type of harm might they want to cause? What kind of vulnerabilities might they exploit to cause harm? Could those vulnerabilities also cause harm in the absence of an active, malicious, attacker?
Alice (Sender): Sends an encrypted message along with the encrypted symmetric key. Bob (Receiver): Decrypts the symmetric key using his private key, then decrypts the message using the symmetric key. give me in graphical represenation or dgarm flows to easily understand
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together. Pick a beginning cell (r1,c1) with non-zero worth. Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2. Lessening the worth of the beginning cell by some sure non-zero integer. Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that: a most limited way is one that goes through the most un-number of cells; all cells on this way barring the beginning cell, yet the completing cell might be altered; the subsequent worth of every cell should be a non-negative integer; the cells are changed freely and not really by a similar worth. On the off chance that the beginning and finishing cells are something very…
Develop a performance-testing client that takesan int value T from the command line and performs T trials of the following experiement: generate the connections in an N-by-Nsquare grid, randomly oriented and in random order, then use UnionFind to determineconnectivity as in our development client, looping until all sites are connected. For eachN, print the value of N, the average number of connections processed, and the ratio ofthe running time to the previous. Use your program to validate the hypotheses in thetext that the running times for quick-find and quick-union are quadratic and weightedquick-union is near-linear. Note : As N doubles, the number of sites in the grid increasesby a factor of 4, so expect a doubling factor of 16 for quadratic and 4 for linear.
Write a program that performs the brute-force attack to break the password. The following table shows encrypted passwords using the crypt() function. Your mission is to break the password corresponding your CWID in the table. For example, the last digit of your CWID is 1, then you should identify the plaintext password for indBOW06MoVz6. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. i want answer for 2nd one
You are placing an order with an online retailer. To complete a purchase, your web browser sends a single encrypted, MAC-authenticated message to the web site, consisting only of the following information: a) your credit card information, b) the item number and quantity being ordered. a. Write a formula using the function symbol MAC(…) to indicate what is being authenticated. You may choose any reasonable variable names for the data items. b. Say an adversary is sitting between you and the retailer, with the ability to intercept traffic and send messages. Assume the authentication is not vulnerable to length extension. Describe a cryptographic attack the adversary could carry out to “max out” your credit card. What type of attack is this? c. What could the retailer do to prevent this attack, simply by changing what data is sent in that single encrypted, authenticated message? Write a new MAC() formula to show the new construction.
Is it reasonable to assume that the probability of sending message m∊M is uniformly distributed over the message space M? How is this different from assuming that the key kis uniformly selected from the key space K
A hallway has 100 locked lockers. A guy begins by opening each of the 100 lockers.He then shuts every other locker. Then, on his third pass, he toggles every third locker (closes if open, opens if closed). This method is repeated for 100 passes, such that the man toggles every ith locker on each pass i. How many lockers are open after his 100th journey along the corridor, in which he toggles just locker #100?
Give expanded answers/arguments to the following (i.e. not just a Yes or No). It would also strengthen your argument if you have at least one reference: If I am not using my network, why can’t others (probably neighbours) use it occasionally?