WGU C950 Task 1 Data Structures and Algorithms II |
Actual verified study complete Solutions | A+ Graded |
2026 Updates | 100% correct
Date: 05/01/2026
C950 Data Structures and Algorithms II
Introduction
This document describes the WGUPS Routing Program's planning and design methodology. The
project's goal is to provide a Python-based system that guarantees the timely delivery of all 40
items while meeting delivery requirements and keeping the overall delivery distance within 140
miles. To manage package information and optimize delivery routes, the application will use an
effective routing algorithm and appropriate data structures.
A. Algorithm Identification
I will create delivery routes using a greedy nearest-neighbor algorithm, which repeatedly
chooses the closest delivery location while still meeting all package and deadline constraints.
B. Data Structure Identification
Page 1 of 5
, To enable quick lookups and updates of package status during routing and delivery, I will keep
package records on a hash table.
B1. Explanation of Data Structure
Every package has its associated fields (address, deadline, city, zip, weight, notes, and status)
stored as a single object or record. The hash table maps associate a distinct package ID with that
record. For the program to promptly retrieve and update the package's status and delivery time
while trucks are on their way,
C1. Algorithm’s Logic
LOAD packages into hash_table keyed by package_id
LOAD distance_table (address-to-address distances)
INITIALIZE Truck1, Truck2, Truck3 with empty loads ASSIGN
packages to trucks based on constraints:
deadlines
"must be with" groups
delayed packages / wrong address (#9 updated at 10:20)
truck capacity (16)
FOR each truck that leaves the hub:
current_location = HUB
current_time = departure_time
WHILE truck has undelivered packages:
IF current_time >= 10:20 AND package #9 address is wrong:
UPDATE package #9 address in hash_table
Page 2 of 5
Actual verified study complete Solutions | A+ Graded |
2026 Updates | 100% correct
Date: 05/01/2026
C950 Data Structures and Algorithms II
Introduction
This document describes the WGUPS Routing Program's planning and design methodology. The
project's goal is to provide a Python-based system that guarantees the timely delivery of all 40
items while meeting delivery requirements and keeping the overall delivery distance within 140
miles. To manage package information and optimize delivery routes, the application will use an
effective routing algorithm and appropriate data structures.
A. Algorithm Identification
I will create delivery routes using a greedy nearest-neighbor algorithm, which repeatedly
chooses the closest delivery location while still meeting all package and deadline constraints.
B. Data Structure Identification
Page 1 of 5
, To enable quick lookups and updates of package status during routing and delivery, I will keep
package records on a hash table.
B1. Explanation of Data Structure
Every package has its associated fields (address, deadline, city, zip, weight, notes, and status)
stored as a single object or record. The hash table maps associate a distinct package ID with that
record. For the program to promptly retrieve and update the package's status and delivery time
while trucks are on their way,
C1. Algorithm’s Logic
LOAD packages into hash_table keyed by package_id
LOAD distance_table (address-to-address distances)
INITIALIZE Truck1, Truck2, Truck3 with empty loads ASSIGN
packages to trucks based on constraints:
deadlines
"must be with" groups
delayed packages / wrong address (#9 updated at 10:20)
truck capacity (16)
FOR each truck that leaves the hub:
current_location = HUB
current_time = departure_time
WHILE truck has undelivered packages:
IF current_time >= 10:20 AND package #9 address is wrong:
UPDATE package #9 address in hash_table
Page 2 of 5
