Category: Algorithms & Data Structures

Draw an ER diagram for the following SPL Saudi Post system.
SPL application relies on a company-wide information system. In SPL Saudi Post system, shipped items are the main component of the SPL product tracking information system. Shipped items can be characterized by item number (unique), weight, dimensions, insurance amount, destination, and final delivery date. Shipped items are received into the SPL system at a single retail center. Retail centers are characterized by their type, unique ID, and address. Shipped items make their way to their destination via one or more standard SPL transportation events (flights, truck deliveries). These transportation events are characterized by a unique schedule Number, a type (flight, truck), and a delivery Route.

NSTRUCTIONS
For this assignment, you will evaluate and propose changes to the data architecture of an organization. This can be for your current/former employer, or other entity you are familiar with. Please feel free to change the name of the organization. Although this will not be shared outside of the university, confidentiality is understood and respected. It is also understood a certain amount of elaboration will be required. If you have any questions, please feel free to ask.Please find the requirements below:Define the current state of data in the organization
Create a data flow diagram illustrating the current state of data (please use Word, Visio, or Lucidcharts)
Align and discuss the proposed Data Architecture changes as it relates to organization enterprise strategy and business architecture
Create a revised data flow diagram (please use Word, Visio, or Lucidcharts)
Concluding remarks
This assignment should be written in APA format with a maximum of two pages (not including the title and reference pages). Provide support from at least three scholarly articles. Use the attached student paper template.Student Paper Template.docx

NSTRUCTIONS
For this assignment, you will evaluate and propose changes to the data architecture of an organization. This can be for your current/former employer, or other entity you are familiar with. Please feel free to change the name of the organization. Although this will not be shared outside of the university, confidentiality is understood and respected. It is also understood a certain amount of elaboration will be required. If you have any questions, please feel free to ask.Please find the requirements below:Define the current state of data in the organization
Create a data flow diagram illustrating the current state of data (please use Word, Visio, or Lucidcharts)
Align and discuss the proposed Data Architecture changes as it relates to organization enterprise strategy and business architecture
Create a revised data flow diagram (please use Word, Visio, or Lucidcharts)
Concluding remarks
This assignment should be written in APA format with a maximum of two pages (not including the title and reference pages). Provide support from at least three scholarly articles. Use the attached student paper template.Student Paper Template.docx

Data Structures
IT245

Purpose
In this discussion board, you will post your answer to the question to make you aware of the importance of use of data structures in programming. You will also read and respond to 2 other classmate’s postings. This is an excellent way for you to interact with your colleagues and share your thoughts about their answers in a critical way.
Topic of the Discussion (100 – 200 words)
Action Item
Data structure is a specialized way for organizing, processing, retrieving and storing data. It makes it easy for program/software/application to access and work with the data. Some examples of data structure include Array, Stack, Queue, Linked List, Graphs and Trees.
Discuss at least two potential issues that may arise in programs and software without using data structures. Provide one example of each issue.
Submission Instructions
Access the discussion forum for this Discussion Board by clicking on the discussion forum title.
Click on “Create Thread.”
Enter a title for your response in the “Subject” line.
Type your answer into the message field to answer the question.
Assure uniqueness and other qualities of academic writing when posting your discussion.
Respond to two other classmates’ postings by critically reviewing your classmate’s answer and stating with reasons which point you agree or disagree with.
Short responses such as “I agree”, “I disagree”, “You are right”, “Very good answer”, etc., are NOT acceptable. You need to be critical with some substance.
Post your answer and your 2 comments on your classmates’ answers before Sunday 15/09/2024 @ 11:59 PM.
3 marks (2 x 1 = 2 Marks for mentioning the correct issues and 0.5 x 2 = 1 Mark for example) for posting your answer, and
0.5 marks for each response to your classmate’s posting (2 x 0.5 = 1 mark)
Submission Requirements
Submission Due Date
Grading Criteria (4 Marks)
Note that merely a copy/paste from the Internet will lead to a ZERO mark.

(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)

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.

(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)

(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)