Patrick Buhagiar

The aim of this assignment was to implement an API which provides a number of calls allowing processes to memory map sections of a file located on a remote machine. Processes can then read and write to this memory area using the provided calls, with changes being propagated to the remote ﬁle by the library. Multiple processes from multiple client machines should be able to access and modify the same ﬁle on a remote machine. This was implemented in C on Ubuntu. Check out my Github for the full implementation.

REQUIREMENTS

The requirements consisted of a Client-Server model with:

The server having the ability to open a number of files (or section of files) on the machine using a file descriptor, and storing them in memory.
The client having the ability to demand that the server maps a particular file (or section of file) to memory.
The client having the ability to demand that the server unmaps a particular file (or section of a file) from memory.
The client having the ability to demand a part of the memory from the server.
The client having the ability to alter a part of the memory from the server.

Implementation

Continue reading “Remote File Memory Mapping” →

GitHub: https://github.com/PatrickBuhagiar/Sudoku-Solver

Given an initial Sudoku puzzle S0, we explore the state-space until we reach an end state Sn representing the solved puzzle. With the singleton technique, transitions between states will occur by looking up cells which only have one single candidate value.

The class Sudoku will represent the puzzle as a list of rows each containing a list of integers. Unknown cells are represented by the number 0.

class Sudoku(val grid: List[List[Int]]) {
    def row (row: Int): Set[Int] = ... 
    def column(column: Int): Set[Int] = ... 
    def block(block: Int): Set[Int] = ...
}

The row, column and block functions take an index as a parameter and return the content of the row, column or block respectively.

Continue reading “Sudoku Solver” →