(See the attached pdf for complete details)
Map Routing:
Implement the classic Dijkstra’s shortest path algorithm and optimize it for maps. Such algorithms are widely used in geographic information systems (GIS) including MapQuest and GPS-based car navigation systems.
Your goal:
Optimize Dijkstra’s algorithm so that it can process thousands of shortest path queries for a given map. Once you read in (and optionally preprocess) the map, your program should solve shortest path problems in sublinear time. One method would be to precompute the shortest path for all pairs of vertices; however you cannot afford the quadratic space required to store all of this information. Your goal is to reduce the amount of work involved per shortest path computation, without using excessive space. We suggest a number of potential ideas below which you may choose to implement. Or you can develop and implement your own ideas.
You need to implement 2 improvement ideas, in order to get full points on the coding part. If you come up with your own ideas, you will get extra credits. (up to 10 points)
Category: Algorithms & Data Structures
1. Running the codes on your own PC, showing and explaining the result. (explain the result)
2. Parts of the code that belongs to the optimization (the modifications made from the
original code).
(tell me the code that you have changed)
3. Describe and justify your approach. Compare your approach to the bare bones
implementation. In particular give the average number of vertices examined. (give me explainition for this one)
1. Objectives
The main objective of this project is to get familiar with designing and developing an algorithmic problem solution using data structures concepts.
2. Introduction
On this project each group of students will solve a problem to assess their understanding of data structure. Students will work in groups of 2-3 students then collect their work in one report to be submitted with the other project materials.
3. Required work
Choose an algorithmic problem related to the concepts of data structures (one that has been covered in class) and write a problem statement on it.
Examples of projects topics:
Problem Name
Suggested Data Structure
Train Schedule Manager
Student Course Scheduler
Social Network Connections
Shopping Cart
Flight Reservation System
Shortest Path Finder
Music Streaming Playlist
Doubly Link list
2D- Array
Graph
Singly Link list
2D-Array
Graph
Circular Link list
Select one of the projects Name in the table above. It is also possible to suggest new project (must be approved by course instructor). Understand the problem. Implement at least two solutions of the problem using data structures.
You must use at least one data structure in your solution. Analysis the Algorithm complexity of your solutions 4. What to submit?
Project Report Source Code Describe the Problem. Describe the Algorithm used to solve the problem. Analysis the Algorithm complexity of your solutions.
Write the program in Java code to solve the problem.
https://drive.google.com/file/d/14aQ-0Hg8GwrpFJnFS… Check the deliveribles part from the uploaded PDF. I need the screen recording of working code with output. And in the drive link you have one read me file answer the questions for that file. And also need the code only in “JAVA” programming language.
1- Compare and contrast any four (4) sorting algorithms based on the following factors:
Time Complexity Space Complexity Ease of Implementation Applications of Algorithm 2- Write Java code to use a priority queue to sort numbers in ascending order. 3- Given below is a Java method to remove a node from a
binary tree. Your task is to:
A.
Write a detailed explanation for
each block or segment of the provided code. A block or segment is a logical
grouping of lines that perform a specific task or operation together.
B.
Ensure your explanations are
clear, concise, and demonstrate your understanding of the code’s functionality.
Q1-Given below is a Java method to remove a node from a binary tree. Your task is to:
Write a detailed explanation for each block or segment of the provided code. A block or segment is a logical grouping of lines that perform a specific task or operation together.
Ensure your explanations are clear, concise, and demonstrate your understanding of the code’s functionality.
private BinaryNode
if (t == null)
return t;
int compareResult = x.compareTo(t.element);
if (compareResult < 0)
t.left = remove(x, t.left);
if (compareResult > 0)
t.right = remove(x, t.right);
else if (t.left != null && t.right != null) { t.element = findMin(t.right).element;
t.right = remove(t.element, t.right);
}
else
t = (t.left != null) ? t.left : t.right;
return t;
}
Q2-Write Java code to use a priority queue to sort numbers in ascending order.
Q3-Compare and contrast any four (4) sorting algorithms based on the following factors:
Time Complexity Space Complexity Ease of Implementation Applications of Algorithm
The file P09_01.xlsx contains a random sample of
100 lightbulb lifetimes. The company that produces
these lightbulbs wants to know whether it can claim
that its lightbulbs typically last more than 1000 burning hours.
a. Identify the null and alternative hypotheses for this
situation.
b. Can this lightbulb manufacturer claim that its
lightbulbs typically last more than 1000 hours at
the 5% significance level? What about at the 1%
significance level? Explain your answers