Prove that the algorithm from Exercise 44 is a 2- approximation algorithm for the load balancing problem. [Hint: Use both parts of Exercise 43.]Exercise 44: Write out in pseudo code the greedy algorithm that goes through the jobs in order and assign each job to the processor with the smallest load at that point in the algorithm.Exercise 43: Suppose that L* is the minimum makespan when p processors are given n jobs, where tj is the time required to run job j.1. Show that L* maxj = 1,2,….,n tj2. Show that L*
Leslie Ogu CSCI 4531 09/06/2016 Chapter 2: Encryption Symmetric Encryption + The universal technique for providing confidentiality for transmitted or stored data + Also referred to as conventional encryption or singlekey encryption + Two requirements to use: + Need a strong encryption algorithm + Sender and receiver must have obtained copies of the secret key in a secure fashion and and must keep the key secure + Only alternative before publickey encryption in 1970’s + Still most widely used alternative + 5 Ingredients + Plaintext + Encryption algorithm + Secret key + Ciphertext + Decryption algorithm + Process: + Plaintext input has encryption algorithm implemented on it + There is a secret key shared by sender and recipient and is used in encryption + The now ciphertext is transmitted to the recipient and they use their decryption algorithm, along with the shared key, to convert it back to plaintext Attacking Symmetric Encryption Cryptanalytic Attacks Rely on: Nature of the algorithm Some knowledge of the general characteristics of the plaintext Same sample plaintextciphertext pairs Exploits the characteristics of the algorithm to attempt to deduce a specif
