Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (th

A medical Centre can have many doctors. A doctor can be scheduled for many appointments but may not have any scheduled appointment at all. A patient can schedule request for one or more appointments. However, every appointment is about only one patient. As a result of every appointment, there must be a bill. One payment is applied to exactly 1 bill, and 1 bill can be paid off over time by several payments. A bill can be outstanding, having nothing yet paid on it at all. One patient can make many payments, but a single payment is made by only 1 patient. Some patients are insured by an insurance company. If they are insured, they can only carry insurance with one company. An insurance company can have many patients carry their policies. For patients that carry insurance, the insurance company will make payments, each single payment is made by exactly 1 insurance company. (Hint: final ERD must include 7 tables.) a) Identify the entities with attributes and keys (primary and foreign keys).…

Suppose you are in Canada's Thousand Islands National Park, and in one particular lake there are n small islands that park officials want to connect with floating bridges so that people can experience going between islands without a canoe. The cost of constructing a bridge is proportional to its length. Assume the distance between every pair of islands is given to you as a two dimensional matrix (an example of such a table for n = 8 islands is shown below). A B C Ꭰ E F G H A 240 210 340 280 200 345 120 B 240 265 175 215 180 185 155 C 210 265 - 260 115 350 435 195 Ꭰ 340 175 260 160 330 295 230 E 280 215 115 160 360 400 170 F 200 180 350 330 360 175 205 G 345 185 435 295 400 175 305 H 120 155 195 230 170 205 305 Design an algorithm for determining which bridges they should build to connect the islands at minimal cost. Write down the pseudocode and explain why your algorithm correctly computes the set of bridges of minimal cost. Analyze the runnning time of your algorithm.

Suppose you and your friend would like to use Diffie-Hellman key exchange system to exchange a keyword. Both of you have decided to use the following p = 4138327577, q = 3742197127.If you decide b = 1767005, and your friend has picked a number a that you don’t know. But you havereceived q a mod p from your friend, and the number is 980246808. Find out the common shared key.

. Consider the alphabet Σ = {0,1}. Give regular expressions generating the following lan- guages. (a) {w ¤ Σ* | w begins with a 0 and ends with a 1} (b) {w € Σ* | w contains at least four Os} 1* (c) {w € Σ* | w contains the substring 1101} (d) {w € Σ* | w has length at least 4 and its third symbol is a 0} (e) {w € Σ* | w begins with a 0 and has even length, or begins with a 1 and has odd length} (f) {€,0} (g) The empty set (h) All strings over Σ (i) All strings over Σ except the empty string

imagine that as example We have a  transportation company operates individual taxis and shuttles. It uses its taxis for transporting in the form of an individual or small group from one location to another. On the other hand, the shuttles have different scenario.  They are used to pick up individuals from separate locations and provide them conveyance to several destinations. Any individual can call the company from anywhere. It may be a hotel, a mall, entertainment venue or any tourist company. When the company receives a call from such individuals, it tries schedule any available taxi for pickup service for fee-based If There's no available taxi,  it does not operate any form of queuing system. Means " If there is no available car, the order is lost " If the vehicles are available, the individual confirms for pick-up. After arrival at the pick-up place the driver notify the company that it has picked up the passenger. The driver notifies the company again at the time of dropping him…

Suppose that a manufacturing company builds n different types of robots, sayrobots 1, 2, . . . , n. These robots are made from a common set of m types of materials, saymaterials 1, 2, . . . , m. The company has only a limited supply of materials for each year,the amount of materials 1, 2, . . . , m are limited by the numbers b1, b2, . . . , bm, respectively.Building robot i requires an aij amount from material j. For example, building robot 1requires a11 from material 1, a12 from material 2, etc. Suppose the profit made by sellingrobot i is pi. Write an integer linear program for maximizing the annual profit for thecompany

Description please. Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (that is, incurring the least in fees) to exchange all of our currency in Cs into currency Ct. Also, justify the its runtime. [We are expecting a description of the algorithm, as well as a brief justification of its runtime.]