CourseNana | Algorithm

COMP10002 Foundations of Algorithms - Assignment 2: Dynamic memory and Cellular Automaton

COMP10002Foundations of AlgorithmsCDynamic memoryCellular Automaton

In this project, you will demonstrate your understanding of dynamic memory and linked data structures (Chapter 10) and extend your program design, testing, and debugging skills. You will learn about cellular automata, implement a tool for performing cellular automata computations, and use this tool to solve a practical problem.

EECS 183 Elementary Programming Concepts - Project 3: Ciphers

EECS183Elementary Programming ConceptsCiphersC++Encryption AlgorithmCryptography

In this project, you will move on to cryptography and you’ll be asked to encrypt and decrypt messages using three different encryption algorithms. The S’more part of this project will challenge you to “crack” others’ secret messages in ciphertext and convert them back to plaintext.

CITS3402 High Performance Computing - Assignment - Sparse matrix-matrix multiplication using MPI and OpenMP

CITS3402High Performance ComputingMPISparse matrix-matrix multiplicationOpenMPC

Your task is to implement the matrix-matrix multiplication algorithm using MPI and OpenMP taking two sparse matrices in the matrix market representation as the input.

COMP4500/7500 Advanced Algorithms and Data Structures - Assignment 2

COMP4500COMP7500Advanced Algorithms and Data StructuresJava

You are in charge of managing a venue for k consecutive days from day 0 to day k − 1 (inclusive), where k ≥ 1. There are n different configurations, c0, c1, . . . cn−1, that the venue can be in, where n ≥ 1. The venue must be in exactly one of the n different configurations at any one time, and is in configuration c0 on day 0.

CSC 485H/2501H: Computational linguistics, Fall 2024 - Assignment 2: The Lesk algorithm & word2vec, BERT and Transformer

CSC485Computational linguisticsThe Lesk algorithmword2vecPythonBERT

Recall the problem of word sense disambiguation (WSD): given a semantically ambiguous word in context, determine the correct sense. A simple but surprisingly hard-to-beat baseline method for WSD is Most Frequent Sense (MFS): just select the most frequent sense for each ambiguous word, where sense frequencies are provided by some corpus

FIT2004 Algorithms and data structures - Assignment 2: A Fun Weekend Away and Customised Spell Checker

FIT2004Algorithms and data structuresPythonA Fun Weekend AwayCustomised Spell Checker

Given all the hard work during the semester, you and your friends decided that you should better get a weekend off after Week 12 before starting preparing for your final exams. Your plan is to do some fun activity (e.g., surfing, hiking, kayaking, mountain biking, etc.) during this weekend getaway

Computer Science 320SC Applied Algorithmics - Programming Assignment 5: Finding partner and Killing enemies.

COMPSCI 320COMP320Applied AlgorithmicsMeet your partner at skyscraperDynamic ProgrammingPython

This 5th assignment lets you get familiar with dynamic programming design and development. It is worth 5% of your total course marks. We would like you to implement efficient dynamic programming algorithms for two tasks: Task 1: Finding partner and Task 2: Killing enemies.

COMP9414 Artificial Intelligence - Assignment 1: Constraint Satisfaction Search

COMP9414Artificial IntelligenceConstraint Satisfaction SearchPythonGreedy SearchDomain Splitting

More technically, this assignment is an example of a *constraint optimization problem*, a problem that has constraints like a standard Constraint Satisfaction Problem (CSP), but also *costs* associated with each solution. For this assignment, we will use a *greedy* algorithm to find optimal solutions to visitor hosting problems that are specified as text strings.

CS 0445 Algorithms and Data Structures I Project 1: ReallyLongInt

CS 0445Algorithms and Data Structures IReallyLongIntArrayDSJava

Design and implement a generic class (ArrayDS<T>) that will act as a data structure for accessing sequences of Java Objects. Your ArrayDS<T> class will primarily implement 2 interfaces – SequenceInterface<T> and ReorderInterface. The details of these interfaces are explained in the files SequenceInterface.java and ReorderInterface.java. Read these files over very carefully before implementing your ArrayDS<T> class.

COMP3702 Artificial Intelligence (Semester 2, 2024) Assignment 2: BeeBot MDP

COMP3702Artificial IntelligenceBeeBot MDPPython

You have been tasked with developing a planning algorithm for automatically controlling BeeBot, a Bee which operates in a hexagonal environment, and has the capability to push, pull and rotate honey ‘Widgets’ in order to reposition them to target honeycomb locations. To aid you in this task, we have provided support code for the BeeBot environment which you will interface with to develop your solution. To optimally solve a level, your AI agent must efficiently find a sequence of actions so that every Target cell is occupied by part of a Widget, while incurring the minimum possible action cost.