代写COSC2123/3119 Algorithms and Analysis代做Java程序

Algorithms and Analysis

COSC2123/3119

The Maze of Many:

An Exploration of Graph Traversal and Planning Problems

Assessment Type	Individual assignment. Submit online via GitHub.
Due Date	Week 11, Friday October 10, 19:59 (before 8pm). A late penalty will apply to assessments submitted after 7:59 pm.
Marks	30

1    Learning Outcomes

This assessment relates to four learning outcomes of the course which are:

•  CLO 1: Compare, contrast, and apply the key algorithmic design paradigms: brute force, divide and conquer, decrease and conquer, transform and conquer, greedy, dynamic pro- gramming and iterative improvement;

•  CLO 2:  Compare, contrast, and apply key data structures:  trees, lists,  stacks, queues, hash tables and graph representations;

•  CLO 3: Define, compare, analyse, and solve general algorithmic problem types: sorting, searching, graphs and geometric;

•  CLO 4: Theoretically compare and analyse the time complexities of algorithms and data structures; and

•  CLO 5:  Implement, empirically compare, and apply fundamental algorithms and data structures to real-world problems.

2    Overview

Across multiple tasks in this assignment, you will design and implement data structures that represent mazes as graphs and algorithms to explore these mazes. You will address both fully connected, non-cyclical mazes and mazes with cycles.  Some of the components ask you to critically assess your solutions through both theoretical analysis and controlled empirical ex- periments to encourage reflection on the relationship between algorithm design and real-world performance. The assignment emphasizes on strategic thinking and the ability to communicate solutions clearly and effectively.