Ask Question, Ask an Expert


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

Consider a directed random graph of the kind discussed in

Consider a directed random graph of the kind discussed in Section 13.11. a) If the in- and out-degrees of vertices are uncorre1ated, i.e., if the joint in/outdegree distribution P jk is a product of separate functions of ...

1 discuss the basic components of cryptography2 discuss the

1. Discuss the basic components of cryptography. 2. Discuss the weaknesses of symmetric encryption. 3. Discuss the weaknesses of public-key encryption. 4. Why is a hybrid cryptosystem preferred over symmetric and public- ...

Answer all 9 questionsshort answer 1-810 points each with

Answer All 9 questions Short Answer 1-8[10 points each with each about 3/4 - 1 page double-spaced]: 1. If the spot rate for Swiss Francs versus US Dollars is one SF equals 1.05 US$, and the annual interest rate on fixed ...

Another simple although not so efficient way to generate

Another simple (although not so efficient) way to generate these permutations in lexical order is to start with the permutations {1, 1, 1, ..., 1}. The next permutation in each case is generated by scanning the current p ...

Creating a new sales and inventory management system for

Creating a new sales and inventory management system for pet supply store. System allows 1) sales orders to be entered by clerk, 2) total price calculated and 3) inventory updated. Sales may be in person or over the phon ...

Compare and contrast the protocol field at the network

Compare and contrast the protocol field at the network layer with the port numbers at the transport layer. What is their common purpose? Why do we need two port-number fields but only one protocol field? Why is the size ...

1 what type of topology is used when customers in an area

1. What type of topology is used when customers in an area use DSL modems for data transfer purposes? Explain. 2. What are the user data rates of STS-3, STS-9, and STS-12? 3. Show how STS-9s can be multiplexed to create ...

Spanning trees given a node it in a amprested graph s for

Spanning trees: Given a node It in a &rested graph S. for which there is at least one path from every node in S ton, state a precise definition for a spanning tree of 9 rooted at n. Then think of what might be meant by a ...

1 write and test a function removeduplicatessomelist that

1. Write and test a function removeDuplicates(somelist) that removes duplicate values from a list. 2. One disadvantage of passing a function to the list sort method is that it makes the sorting slower, since this functio ...

1 authentication using certi fi cates although considered

1. Authentication using certi fi cates, although considered safe, suffers from weaknesses. Discuss these weaknesses using speci fi c examples. 2. Kerberos and SSL are additional layers to enhance authentication. Detail h ...

  • 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

WalMart Identification of theory and critical discussion

Drawing on the prescribed text and/or relevant academic literature, produce a paper which discusses the nature of group

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