Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Computer Engineering Expert

problem 1: This problem involves the problem of computing change for a given coin system. A coin system is defined to be a sequence of coin values v1 < v2 < . . . < vn, such that v1 = 1. For ex, in the U.S. coin system we have six coins with values h1, 5, 10, 25, 50, 100i. The problem is what is the best way to make change for a given integer amount A.

a) Let c ≥ 2 be an integer constant. Suppose that you have a coin system where there are n types of coins of integer values v1 < v2 < . . . < vn, such that v1 = 1 and, for 1 < i ≤ n, vi = c · vi−1. (For ex, for c = 3 and n = 4, an ex would be h1, 3, 9, 27i.) Describe an algorithm which given n, c, and an initial amount A, outputs an n-element vector that indicates the minimum number of coins in this system that sums up to this amount. (Hint: Use a greedy approach.)

b) Given an initial amount A ≥ 0, let hm1, . . . ,mni be the number of coins output by your algorithm.

Prove that the algorithm is correct. In particular, prove the following:

i) For 1 ≤ i ≤ n, mi ≥ 0
ii) Pni=1mi · vi = A
iii) The number of coins used is as small as possible.

Prove that your algorithm is optimal (in the sense that of generating the minimum number of coins) for any such currency system.

c) Give an ex of a coin system (either occurring in history, or one of your own invention) for which the greedy algorithm may fail to produce the minimum number of coins for some amount. Your coin system must have a 1-cent coin.

problem 2: You are given an undirected graph G = (V,E) in which the edge weights are highly restricted.

In particular, each edge has a positive integer weight of either {1, 2, . . . ,W}, where W is a constant (independent of the number of edges or vertices). Show that it is possible to compute the single-source shortest paths in such a graph in O(n + m) time, where n = |V | and m = |E|. (Hint: Because W is a constant, a running time of O(W(n + m)) is as good as O(n + m).)
 
Requirement: Algorithm running time needs to be in DJIKstra’s running time or better.

problem 3: You are the mayor of a beautiful city by the ocean, and your city is connected to the mainland by a set of k bridges. Your city manager tells you that it is necessary to come up with an evacuation plan in the event of a hurricane. Your idea is to add a sign at each intersection pointing the direction of the route to the closest of the k bridges. You realize that this can be modeled as a graph problem, where the street intersections are nodes, the roads are edges, and the edge weights give the driving time between two adjacent intersections. Note that some of the roads in your city are one-way roads.

a) describe how to solve the evacuation-route problem in O(mlog n) time, where n is the number of intersections and m is the number of streets connecting two adjacent intersections. Note that the number of bridges k is not a constant, that is, it may depend on n and m. Therefore, a running time of O(k · mlog n) is not an acceptable solution. The output of your algorithm will be a labeling of the intersections, with an arrow pointing to the road to take to the closest bridge.

b) Some of the bridges can hold more capacity than others. For 1 ≤ i ≤ k, we associate a positive numeric weight ci with each bridge. To encourage people to use bridges with higher capacity, we treat distances to different bridges differently. In particular, if δ is the actual distance from some intersection to bridge i, we assign it a capacity-weighted distance of δ/ci. Therefore, the higher the bridge capacity is, the lower the weighted distance. Present an O(mlog n) time algorithm to solve the evacuation-route problem using capacity-weighted distances.
 
Additional info: Some of the bridges will be higher capacity. Their weights will be function of (distance/number of lanes) → this will give us shorter weight and we can treat it as a better route to take even though the distance is farther away.

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M91939

Have any Question? 


Related Questions in Computer Engineering

1 write a program that allows the user to specify a circle

1. Write a program that allows the user to specify a circle by typing the radius in a JOptionPane and then clicking on the center. Note that you don't need a "Draw" button. 2. Write a program that allows the user to spec ...

We have talked a lot about designing models but we have

We have talked a lot about designing models, but we have assumed so far that you know what the level of complexity of your model will be. Is there always an appropriate level of complexity of an agent-based model? Discus ...

Design an algorithm for solving the towers of hanoi problem

Design an algorithm for solving the Towers of Hanoi problem that does not employ recursion ([This algorithm does not in itself have practical application other than perhaps measuring the life of the universe. It does, ho ...

Suppose a chosen-ciphertext attacker cannot recover the

Suppose a chosen-ciphertext attacker cannot recover the secret decryption key loran encryption scheme. Does this mean the encryption scheme is secure? Consider a symmetric-key cryptosystem in which cryptographic keys are ...

The following is a dump of an sctp general header in

The following is a dump of an SCTP general header in hexadecimal format. 04320017 00000001 00000000 a. What is the source port number? b. What is the destination port number? c. What is the value of the verification tag? ...

1 what is a honeypot how is it different from a honeynet2

1. What is a honeypot? How is it different from a honeynet? 2. How does a padded cell system differ from a honeypot? 3. What is network footprinting? What is network fingerprinting? How are they related?

1 the binary search tree operations can also be implemented

1. The binary search tree operations can also be implemented iteratively. Design and implement an iterative solution for each operation: (a) search (b) find minimum (c) insert (d) delete 2. Design and implement the funct ...

Your company is debating transferring all of their

Your company is debating transferring all of their information to a Cloud storage provider. The CFO feels this move is a big cash savings plan, one that could save the company a lot of money. The CIO feels the risk is to ...

Question 1 an example of the neuron model is the sigmoid

Question 1. An example of the neuron model is the sigmoid function which is defined by: φ(v)=1/(1+exp?(-v)) For this problem, you need to prove that (∂φ(v))/∂v=φ(v)(1-φ(v)) Question 2. Consider the following cost functio ...

1 why shouldnt an organization give an employee candidate a

1. Why shouldn't an organization give an employee candidate a tour of secure areas during the candidate's interview? 2. List and describe the typical relationships that organizations have with nonemployees. What are the ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen