Search and Graph Analysis Algorithms Report Writing - IT Assignment Help

Assignment Task

Section A: Core information  
Return and status of marked assignments At the latest this will be within 4 weeks from the date of submission but we will endeavour to return it earlier than this.Assessments are subject to double marking/scrutiny, and internal quality inspection by a nominated School of Management internal assessor. All results when first published are provisional until confirmed by the relevant External Examiner and the Examination Board.
No appeals regarding your published mark are available until after confirmation by that Examination Board.
Section B: Coursework Brief and Requirements
Introduction:
Consider a problem we have covered from this module or from any other module (e.g. from Data Analytics I or Mathematics II) involving non-trivial algorithms. You are also free to consider any other algorithmic topics we may not have covered e.g. image-processing. The problem should relate to a management problem or business-idea that requires the use of algorithms.A non-trivial algorithm will be will involve loops and be of at least linear complexity. The more complex your algorithm the more opportunity you will have to demonstrate increased understanding and more sophisticated analysis, providing enhanced potential of a good grade.You may wish to continue with the same algorithm/problem you presented in your Assignment 2 essay or choose a different algorithm or problem.
Example algorithms:

• Here are some examples of non-trivial algorithms you could consider:
• Data Analytical Classification algorithms including Decision Tree Induction and Nearest Neighbour
• Data Analytical Clustering algorithms including Hierarchical Clustering and K-Means Clustering
• Matrix Row Reduction algorithm to solve systems of simultaneous equations or to find inverse matrices
• Simplex Linear Programming algorithm
• Search and Graph Analysis algorithms, including shortest-path algorithms
• Exhaustive Enumeration and Greedy/Heuristic Algorithms for any NP-Complete problem (eg travelling salesman, knapsack packing problem, wedding banquet seating …)

Report Format and Structure:
The main body of your report has a word count limit of 2000 words, consisting of a number of sections, as detailed below. In addition, you should include as appendices: all your code appropriately commented; your test run outputs; and extracts from your test data. There is no word limit on the appendices, which will be assessed alongside the main body of your report.

• You are required to submit two files, with a third optional data file:
• A single PDF document containing your full report, including all the appendices.
• A single supplemental code file, which can either be in the form of a standard python code file (.py) or a Jupyter notebook file (.ipynb). This code will not be marked, but may be required to validate that the code you have provided as an appendix can be executed, as claimed.
• An optional data file (.csv), if this is required to run your supplemental code file.
• The requirements of the code and code appendix are provided first in these instructions as this forms the primary focus of this assignment. This is followed by instructions for each of the sections of main body of the report.
• CODE APPENDIX: Provide working python code that solves your problem (30%)
• Provide, as an appendix to your report, your completed coded.
• Embed in your code comments that describe each function in terms of its purpose, inputs and outputs. Additional comments should also be included to help explain key steps in your algorithms, and examples of particular techniques you have used.
• You are not required to have written all the code yourself.
• There are plenty of examples of python code on the Internet that provide solutions to any problem you are likely to consider. Please feel free to use such code, providing suitable references to these sources. Any code you do re-use should fully implement your chosen algorithms, so that you can identify and comment on how the code implements these algorithms.
• You are not allowed to use python modules that directly implement your algorithm in such a way that you cannot see exactly how the code implements the algorithm.
• You can though use standard python modules to provide appropriate data representations for your algorithm (eg numpy for matrix data or networkx for graph data) or provide other functions that do not form part of the core implementation of your focus algorithm (eg math, statistics, csv, random modules).

This IT Assignment has been solved by our IT Experts at My Uni Papers. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
    

Be it a used or new solution, the quality of the work submitted by our assignment Experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.