Suppose we have a system of 3 processes named A, B and C. A sends two messages to C- the message contents being 1 and 2 respectively. Similarly B sends 2 messages to C; the contents being 3 and 4 respectively. Process C simply keeps doing this: receive a message and print it. (a) Assuming all the default assumptions, what possible outputs will be generated by C? (By "output" we mean the entire sequence of numbers printed by Cin a complete run of the system. Note that several different sequences are possible in different runs.) You can enumerate these sequences or describe them precisely in words. (b) Assuming that the communication lines are non-FIFO, what would be your new answer?

Suppose we have a system of 3 processes named A, B and C. A sends two messages to C- the message contents being 1 and 2 respectively. Similarly B sends 2 messages to C; the contents being 3 and 4 respectively. Process C simply keeps doing this: receive a message and print it. (a) Assuming all the default assumptions, what possible outputs will be generated by C? (By "output" we mean the entire sequence of numbers printed by Cin a complete run of the system. Note that several different sequences are possible in different runs.) You can enumerate these sequences or describe them precisely in words. (b) Assuming that the communication lines are non-FIFO, what would be your new answer?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

vvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…
2. Define the function O(k), with k > 2, as 22 + 4? + 62 + ·..+ m? where m is the largest even number that is < k. Please implement the function in MIPS and make sure your implementation indeed works on the simulator, by printing the value O(15) to the terminal.
Hi! This is not a graded question I just need it for my reviewer. Thanks! 2.Recall that a public-key cryptosystem consists of three functions: A key generator G, an encryption function E, and a decryption function D. Any user, say Alice (A), can use the key generator to generate a key pair (PKA, SKA), in which PKA is Alice’s public key, and SKA is her secret key; she can then publish her name and public key in a directory. Subsequently, anyone who wants to send a private message x to Alice can look up PKA in the directory, compute a ciphertext y ←− E(x, PKA), and send y to Alice over an open line. Only Alice can compute x ←− D(y, SKA), because only she knows the decryption key SKA that corresponds to encryption key PKA. Note that there is no need for a key-distribution center, as there is when one is using a symmetric-key cryptosystem, but there is a need for public-key directories. a) What is a public-key certificate? What is the problem with public-key directories that certificates…
The same professor writes a program to analyze the chat logs from the various lectures as a partial measure of class participation. Each chat log consists of multiple lines, each of form TIME, NAME, COMMENT, in the order in which they were posted to the chat . The algorithm then sorts all that data - across all the chat logs - in order of student names, and scores each set using a metric based on the number of contributions and their length. [a] What are the various input sizes to consider when analyzing the algorithmic approaches? (One is the number of students in the class, but that is not the only factor.) [b] Which sorting algorithm do you think is best suited for the sorting portion of this algorithm and why? [c] What is the time complexity of the sorting algorithm chosen in step [b] as a function of the various input sizes identified in step [a]? [d] What is the overall time complexity of the chat analysis program as described above?
Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not print the average waiting time and the average turnaround time. You are required to compute these for each process and print the values for each process separately. Add comments in the code so that the code is understandable. Take input from the user: the number of processes, their CPU burst times and arrival times for n number of processes. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming
Suppose a train was supposed to start at station A, pause at stationsB, C, D, ... , Y, and finish at station Z. However, it did not arrive at Z. Suppose in yourfactory the piece of equipment or process labeled A makes part B work, which in turnmakes C, D, ... , and Z work. However, Z is not working. You want to find out why.What algorithm do you use? Think of other applications of this technique.
Computer Science Implement RSA encryption and decryption functions in Java. Note you should not use any existing security modules to perform the encryption/decryption tasks. Just write a program to compute the answers. Your program should ask user’s input for a public key (n, e), and for Q1 ask for m and display c; and ask for c and display private key d and original message m.
Suppose, you are the owner of a bank that operates in a strange way. Customers can lend money from your bank (just like a normal bank) and they can also deposit money in your bank. A register is maintained to track the daily transactions. However, being the strange owner of a strange bank, you have a fascination with finding out whether a portion of your daily transactions (in/out) balance out to zero. For example, suppose your daily transaction register looks like this: 1 Lend 100 2 Deposit 150 3 Lend 400 4 Lend 500 5 Deposit 1000 6 Lend 460 7 Deposit 160 8 Deposit 200 9 Lend 500 10 Depost 100 In this case, there is a portion of the transactions that would balance itself out. (6th, 7th, 8th, and 10th transactions would amount to 0). Your task is to use a genetic algorithm to solve this strange bank problem. Task Breakdown: Model the transaction register in a way suitable for the problem.…
C programming Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL Your program is required…
Translate the following specifications into English where F(p) is“Printer p is outof service”, B(p) is “Printer p is busy”, L(j) is “Print job j is lost”, and Q(j) is “Print job j isqueued”. a) ∃p(F(p) ∧ B(p)) → ∃jL(j)b) ∀pB(p) → ∃jQ(j)c) ∃j(Q(j) ∧ L(j)) → ∃pF(p)d) (∀pB(p) ∧ ∀jQ(j)) → ∃jL(j)
Our discussion of slices in this chapter has actually been about "backward slices" in the sense that we are always concerned with parts of a program that contribute to the value of a variable at a certain point in the program. We could also consider "forward slices" that refer to parts of the program where the variable is used. Compare and contrast forward slices with du-paths.
Consider the software that runs in an Automated Teller Machine (ATM) machine. One task that must be able to be performed is to determine the type (denomination) of currency and the numbers of bills (aka “banknotes” for those of you not from North America) for each type dispensed. A requirement is that our ATM use the fewest number of bills that it can to dispense the specified amount of money. It only dispenses fifties, twenties, tens, fives, and ones. Design and implement program that writes out what bills would be dispensed if this machine existed for the amount of money that was asked for by the user.Test CasesIn the comments at the top of your file, list 3 test cases that you came up with. Something like this but choose your own examples. You should write your test cases in such a way that, if they all pass, you can be fairly confident your program will work all the time. '''Test case #1:Input: $1Output: 0 fifties, 0 twenties, 0 tens, 0 fives, 1 onesTest case #2:Input: $22Output:…