A botanist wants to test the effectiveness of a new plant food (Food A) against a standard one (Food S) on marigolds, She conducts a controlled experiment using two separate garden plots. Food A was used on a random sample of 300 marigold flowers and Food S was used on a separate random sample of 250 marigold flowers. In the group using Food A, 282 marigold flowers successfully bloomed. In the group using Food S, 204 marigold flowers successfully bloomed. If we were to test of a difference existed in this experiment, which parameter would you conduct inference on?

Which statement best describes outdoor time?

Question 3.2. Consider that translation look-aside buffers (TLBs) are used with the paging system. We assume TLB hit ratio is 90%. We also know that the TLB access time is only 5ns and the regular memory access time is 95ns. What is the effective access time (ETA)?

In planning a dramatic play center, you would want __________.

Problem 6. (12 points) Simply putting a final result will not earn credit. You need to show your work to obtain the result. Question 6.1. Given the following message (in hexadecimal): 47 40 A3 4C and a symmetric encryption algorithm that applies bitwise XOR operation between the key and the message. If the key is : AC 19 28 57 What is the generated ciphertext?

Question 1.13. The basic unit in the Transmission Control Protocol is called a(n) _______.

Question 1.8. In an access matrix, the ____ right allows a process to change the entries in a row.

Problem 4. (9 + 5 points) Simply putting a final result will not earn full credit. You need to show your work to obtain the result. Question 4.1. Demand paging is an advanced paging system that can handle page fault effectively. Explain the sequence of events that happens when a page-fault occurs.

Question 2.3. How does a virus differ from a worm?

Question 4.2. When dealing with the page fault, a page replacement may be needed to obtain a free frame for target page. Assume that the reference string of page numbers is 3,2,1,2,0,1,7,0,1. The number of pages in memory is 3 and initially the memory is empty. Run Least Recently Used (LRU) page replacement algorithm and illustrate the procedure by completing the following with the method in the slides. Based on the algorithm output, identify how many page faults are found?