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 define a dc component and its effect on digital

1. Define a DC component and its effect on digital transmission. 2. Define the characteristics of a self-synchronizing signal. 3. List five line coding schemes discussed in this book. 4. Define block coding and give its ...

Design an algorithm that compares a random and sorted array

Design an algorithm that compares a random and sorted array and establishes the average distance that elements must travel in moving from random to sorted order.

In this problem we want to study the clock frequency

In this problem we want to study the clock frequency requirements for a hardware implementation of DES in real-world applications. The speed of a DES implementation is mainly determined by the time required to do one cor ...

1 what is a restricted range and what effect does it have

1. What is a restricted range, and what effect does it have on correlation coefficients? How would you detect and correct a restricted range? 2. How do we know whether a particular score is an outlier?

Cryptography projectlets suppose that alice and bob have

Cryptography Project Let's suppose that Alice and Bob have each a number n_A and respectively n_B between 1 and 10 and they want to know if they have the same number or not. The problem is that in case they don't have th ...

Assignmentconsider the following scenarioyou are the it

Assignment Consider the following scenario: You are the IT Manager of a small financial services firm that is in the process of upgrading its content management system. You have been tasked to plan an IT budget and staff ...

Dta interpretation research reportyour task write a

Data Interpretation Research Report Your task: Write a report on the statistical relationship that you find between the stock price of the company that you have been assigned and the following three variables: the FTSE, ...

Problem 3- network design for schoolnetwork design for

Problem 3- Network Design for School: Network Design for Schoola network has to be designed for a school. There are100 computers in the school. And has 5 Labs each of them consisted of 31 computersThe users in the lab sh ...

1 how is an application layer firewall different from a

1. How is an application layer firewall different from a packet-filtering firewall? Why is an application layer firewall sometimes called a proxy server? 2. How is static filtering different from dynamic filtering of pac ...

1 assume we add a new protocol to the application layer

1. Assume we add a new protocol to the application layer. What changes do we need to make to other layers? 2. Explain which entity provides service and which one receives service in the client-server paradigm. 3. In 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