pseudocode

The Background I am a student just beginning to learn MIPS for one of my courses, and my professor is not allowing the usage of pseudo-instructions such as Load Address ( la ) in our code. I am wondering what an example of the correct usage of standard instructions would look like to store the address of a declared variable into a register for use later in the code. My Solution I have currently been attempting to use this code, though I am getting a syntax error in the lui instruction. main: .data Array: .space 80 #Declares that Array will hold 20 integers .text lui $s0, Array #loads most

I have a triangulated isometric grid, like this: (source: mathforum.org ) In my code, triangles are grouped by columns. As I hover the mouse, I want to calculate what triangle the mouse coordinates are in. Is there a simple algorithm to do that? What you want to do is turn this into a grid as much as possible because grids are far easier to work with. The first thing you do is work out what column it's in. You say you store that so it should be easier by doing a simple integer division on the x coordinate by the column width offset by the box start. Easy. After that you want to work out what

Does anyone know the Donald B. Johnson's algorithm , which enumerates all the elementary circuits (cycles) in a directed graph? I have the paper he had published in 1975, but I cannot understand the pseudocode. My goal is to implement this algorithm in Java. Some questions I have, for example, is what is the matrix A k it refers to. In the pseudocode, it mentions that Ak:=adjacency structure of strong component K with least vertex in subgraph of G induced by {s,s+1,....n}; Does that mean I have to implement another algorithm that finds the A k matrix? Another question is what the following

Given a set of 2d points (in Cartesian form), I need to find the minimum-area ellipse such that every point in the set lies either on or inside the ellipse. I have found the solution in the form of pseudo-code on this site, but my attempt to implement the solution in C++ has been unsuccessful. The following image illustrates graphically what the solution to my problem looks like: In my attempt, I used the Eigen library for the various operations on matrices. //The tolerance for error in fitting the ellipse double tolerance = 0.2; int n = 10; // number of points int d = 2; // dimension MatrixXd