FIU Data Structures Project Statements Discussion

You need to peer-evaluate the Project Statements of your three other classmates.

You need to upload the PDF here at “Project Statement Peer Evaluation”. The statements assigned to you to evaluate can be found inside the “Project Statement” assignment -> Assigned Peer Reviews. The detailed guide with screenshots can be found at

https://community.canvaslms.com/t5/Student-Guide/How-do-I-submit-a-peer-review-to-an-assignment/ta-p/293 (Links to an external site.)

along with video tutorial at

https://www.youtube.com/watch?v=wkgPvezGpX8. (Links to an external site.)

Consider the following rubric while evaluating,

1. The project statement describes an innovative and interesting problem – out of 20 points
2. The project statement is clear, understandable, contains required components, and follows the suggested structure – out of 60 points
3. The project statement describes an innovative approach of solving a well-known problem – out of 20 points
4. Detailed, constructive comments of at least 25 words and almost 50 words in explaining your reasons for the above-awarded points. These comments could also contain a description of further “How can this Problem Statement be improved?”

Upload the PDF containing the following,

Project statement
In this project, you will create a program that can traverse a map like a delivery system.
The input will be a 6 x 6 road map. The matrix will be composed of a single source with multiple
destinations. The matrix will be composed of open spaces and obstacles with multiple
destinations scattered around the map, one at each corner of the map excluding the start.
The start of the map will be the first cell (0,0). The goal of the delivery truck is to reach all
delivery spots in an efficient manner. Just like any car the four directions that it can do is right,
left, down, and up from its current spot. The delivery truck cannot pass beyond the boundaries of
the matrix, that includes the bounds of the map and any cell labeled as “ | ”. The wanted output
should be a printout of the route taken.
Part A
There will be functions and a graph class that will be provided as a guide. The printout wanted
will be route detailing how the destinations will be visited from first to last, “First stop:” “Second
stop:” “Last stop:” as many as needed. You will need some extra functions like:
1. A function to create a graph that will detail the cells as vertices and the edges between
vertices as legal moves (up, down, left, right).
2. Essentially the shortest paths to each destination should be found and then combine
them as to make the most efficient route that should be taken.
3. Write a function findRoute1 that will essentially find a route between all the
destinations. If the route is found then display the route and the order destinations
were visited (first, second,…, last. ( D1 – D2 – D3)). If no route is found then display,
No route found. Hint: consider using Dijkstra’s algorithm.
Your code should implement the functions on the same map and print out the solutions as
specified.
Example of the road map:
Part B
Write a function findRoute2 that will do the opposite and find a route from the destinations to the
start.
Turning the problem from a single source multiple destinations to single destination multiple
sources. This means the shortest paths from the destinations to the source should be found and
made into a route from the farthest to closest and see which should be visited first and last and
create a route that is efficient. If a route is found display which destinations are closest to farthest
and the most efficient route that should be taken(Example: D1 -> D2 -> D3). If not possible
display, No routes found. Hint: consider using Bellman Ford or Dijkstra’s algorithm.
Project Statement
A stock brokerage firm wants to determine the stocks with the least amount of volatility for the
week based on the sector. Given an undirected graph of stocks associated by sector, determine
the sector with the least amount of volatility along with the stock options in that sector based on
which ones are the least volatile. The firm will use these picks to make recommendations to their
clients.
The goal of the algorithm is to find all the stock tickers in each sector with the least amount of
volatility.
Example of the undirected graph. The starting node is the W5000FLT index, which represents
the US stock market.
Expected Output:
W5000 -> VHT -> JNJ -> UNH -> TMO -> VGT -> MSFT -> AAPL -> V -> NVDA -> VFH ->
BRK -> JPM
Part A
1. Create a graph class that represents the undirected graph using an adjacency list. Each
vertex represents a stock, and each edge represents an association between the two
stocks. The graph class has a function addEdge as well.
2. Create a function that reads in the data from the file “stocklistings.txt” that contains an
array with all the stocks, given as stock, volatility, and association (ex. F, 103, 102).
Volatility acts as the value of the vertex, with the original percentage value being
represented by a number (ex. 1.03% volatility being 103). The function addEdge takes
volatility and association as parameters.
3. Create a function called makeTickerVector that makes a vector that stores the stock ticker
and the volatility amount.
Part B
1. Create a function called findShortestPath1 to find the shortest path by using a breadthfirst search algorithm. Making an empty Boolean array to store all the visited nodes is
recommended.
2. Create a function called findShortestPath2 to find the shortest path by using a depth-first
search algorithm. Making an empty Boolean array to store all the visited nodes is
recommended.
3. Create a function called printPath that prints the path generated. Include a for loop that
replaces the volatility amount with the ticker symbol when printing. By using the vector
created in makeTickerVector, the ticker can originate from the vector.
Project Statement
In this project, you will develop program for a catapult. The program reads altitude and longitude
outputs and inputs that are displayed within the program. The catapult will have an array of
trajectory and angle.
Part a
1) Implement a class called catapult that reads the trajectory, altitude, longitude, and angle.
a) a function that input for different for all four.
b) a n overload output for operator to print out trajectory, altitude, longitude, and angles.
c) A function for maxheap for altitude and longitude.
d) A function for minheap for altitude and longitude.
2) Implement a class called Math for to calculate the trajectory.
3) Implement a function called FindWinds() the altitude and longitude changes when the
program is run.
Part b
In this part, you’re going to use quicksort algorithm to find the fastest way to launch the catapult
with any speed.
2) Implement a template called that stores objects within type vector this includes:
a) The functions trajectory(int) left(int), right(int), altitude(int), longitude(int), and
angle(int).
b) For maxheap, functions initializeMaxHeap(), maxHeapify().
c) Function heapsort().
3) . Implement a member function of catapult that sorts the trajectory using heapsort.
Since the heap is only used to sort the trajectory, you can declare the heap within the
catapult::heapsort function, come up with your own angles into the heap, sort the trajectory, and
then use your own longitude and altitude.