COSC 1285 Algorithms and Analysis
This assessment relates to 3 learning outcomes of the course which are:
1. Compare, contrast, and apply the key algorithmic design paradigms: brute force, divide and conquer, decrease and conquer, transform and conquer, greedy, dynamic programming and iterative improvement;
2. Define, compare, analyse, and solve general algorithmic problem types: sorting, searching, graphs and geometric; and
3. Implement, empirically compare, and apply fundamental algorithms and data structures to real-world problems.
The assignment is broken up into a number of tasks. Apart from Task A that should be completed initially, all other tasks can be completed in an order you are more comfortable with. Task D is considered a high distinction task and hence we suggest to tackle this after you have completed the other tasks.
Task A: Implement Random guessing
To help to understand the problem and the challenges involved, the first task is to develop a random guessing approach to Hangman game.
Task B: Implement Dictionary-Aware Guessing
In this task, you’ll implement the dictionary-aware guessing strategy.
Task C: Design and Implement Dictionary-Aware Guessing Strategy for Two Word Hangman
In this task, you’ll design and implement a guessing strategy/algorithm for the two word Hangman variant.