Host A is sending a file to Host B. There are 3 links (therefore 2 switches) between the hosts. The file is segmented into packets of 40 bytes, with a 10 byte header added to each packet. Each link has a transmission rate of 100 kbps and a speed of 1000 km per sec. The switches are 100km away from each other. Host A is 50 km away from the first switch while Host B is 150 km away from the second switch. Data travels from Host A to the first switch, on to the second switch and then to Host B. What is the propagation delay (in seconds) when a packet of data travels between the 2 routers?

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.

How can a user delete a drawing object

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e.g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.