Labsolved - Coding Assignment Tutor | CS 作业 辅导 代写

The University of Melbourne School of Computing and Information Systems COMP20005 Engineering Computation Assignment 1      1 Learning Outcomes In this assignment you will demonstrate your understanding of loops and if statements by writing a program  that sequentially processes a file of input data. You are also expected to make use of functions and arrays.   2 The Story... The prevalence of smart phones and Internet of Things has accumulated huge volumes of human trajecto ries, that is, sequences of GPS points recording the locations of people or other objects. For example, Uber has recorded 7.6 billion trips in 2022. In this assignment, we are given a set of trajectory data that records people’s locations at different times. The aim is to identify if any of the trajectories is sufficiently similar to a given query trajectory . Such com putations are the basic building block of many location-based applications, such as to find shareable Uber trips (see Figur...

Your Task Assignment: Overall, you will create a partial error-handling dictionary (spellchecker) using a radix tree. You will be using the same dataset as Assignment 1. Users will be able to query the radix tree and will get either the expected key, or the closest recommended key. You will then write a report to analyse the time and memory complexity of your Assignment 1 linked list compared to your radix tree implementation. C Implementation: Your programs will build the dictionary by reading data from a file. They will insert each suburb into the dictionary (either the linked list (Stage 3) or radix tree (Stage 4)) . Your programs will handle the search for keys . There are three situations that your programs must handle: Handle exact matches: output all records that match the key (Stage 3 and 4). Handle similar matches: if there are no exact matches, find the most similar key and output its associated records ( Stage 4 only ). Handle no matches being found: if neither exact n...