Implement a C++ code for a Priority Queue

Analysis of Financial Time Series: USD/EGP Exchange Price

The daily USD/EGP exchange prices R are available over the period from December 1, 2016

to April 21, 2017 in the file : “[login to view URL]” . Assuming that the average exchange price over

the given period is M, a change Ci in a given day (i) is positive when the price rises over M,

and it is negative when it drops below that average.

From the given data set, we need to find the dates of each of the N most positive changes (e.g.

N = 10) as they represent the N highest exchange prices over the whole data set. Likewise, we

need to find the dates of each of the N most negative changes (e.g. N = 10) as they represent

the N lowest exchange prices over the whole data set.

This problem can be solved using Priority Queues where each item is composed of 2 elements:

the date and the exchange price change from the average. Priority here is for the price change.

We also need to find the start date and the end date of the contiguous period over which the

sum of price changes C is maximum.

This problem is called the Maximum Subsequence Problem. The problem statement is as


Given a sequence of n values (possibly negative), C0, C1, ..., Cn-1, find the values of the indices

(i,j) that maximize the value of the sum

(This is zero if all values are negative).

Example: Suppose the changes in price are: - 0.2, 1.1, - 0.4, 1.3, - 0.5, - 0.2

Smax = C1 + C2 + C3 = 2.0 (hence i = 1 and j = 3)

Required Implementations:

1. Implement the PQ class.

2. Find the N highest and N lowest exchange rate days over the whole data set (e.g. N =


3. Implement the Maximum Subsequence Algorithm and find the start and end days of

the contiguous period over which the sum of price changes is maximum.

Skills: Algorithm, C Programming, C# Programming, C++ Programming, Software Architecture

See more: priority queue c++ example, priority queue c++ geeksforgeeks, priority queue c++ code linked list, c++ priority queue implementation using heaps, c program to implement priority queue using singly linked list, priority queue c++ code using array, priority queue in c++, priority queue adt c++, priority queue c sharp, priority queue algorithm in c, c code for assignment problem, algorithm for priority queue in c, priority queue code, implement priority queue, priority queue code pdf

About the Employer:
( 0 reviews ) Egypt

Project ID: #16990857

11 freelancers are bidding on average ₹1677 for this job


I am very proficient in c and c++. I have 16 years c++ developing experience now, and have worked for more than 7 years. My work is online game developing, and mainly focus on server side, using c++ under Linux environ More

₹5000 INR in 0 days
(138 Reviews)
₹1050 INR in 10 days
(50 Reviews)

Hello We are highly motivated young technocrats from India. We are approachable, you can come to us if you have a struggle, we are happy to help. Team TiponTongue

₹3000 INR in 2 days
(28 Reviews)

I am good at competitive programming and you can check my codechef account and hackerrank account. I have 1 Gold, 5 Silver and 7 Bronze medal on hackerrank and 5 star on codechef. Account link :. Codechef: https More

₹1250 INR in 2 days
(1 Review)

I have experience in implementing such data structures and algorithms in c++. I would deliver the project within the time constraint.

₹950 INR in 2 days
(1 Review)

A proposal has not yet been provided

₹1250 INR in 3 days
(0 Reviews)
₹1250 INR in 1 day
(0 Reviews)

Skills in c++ Presently working with cognizant technologies

₹1750 INR in 2 days
(0 Reviews)

Dear sir, I have read your requirement.I have been programming c++ for 2 years.I can do your task quickly and in skilfull way. let me do your task Waiting for your reply Regards

₹650 INR in 1 day
(0 Reviews)

Hi, okay, I will do it in quoted price. 1250 total. -will use binary heap Lets begin with it. :) Thanks Priyanshu

₹1250 INR in 1 day
(0 Reviews)
₹1050 INR in 1 day
(0 Reviews)