I hereby claim:
- I am nlowe on github.
- I am nlowe (https://keybase.io/nlowe) on keybase.
- I have a public key whose fingerprint is 2F5C 8194 0C20 C76C 9ECD DEEA 1091 4399 6445 9621
To claim this, I am signing this object:
/* Program: client.c | |
* A simple client to work with server.c program. | |
* Host name and port used by server is to be | |
* passed as arguments. | |
* | |
* To test: Open a terminal window. | |
* At prompt ($ is my prompt symbol) you may | |
* type the following as a test: | |
* | |
* $ ./client 192.168.0.12 54554 |
Preparing to run build script... | |
Running build script... | |
Analyzing build script... | |
Processing build script... | |
Compiling build script... | |
======================================== | |
Test | |
======================================== | |
Executing task: Test |
*************************************** | |
* YoYo Games Runner v1.0(999)[r32908] * | |
*************************************** | |
RunnerLoadGame: C:\Program Files\Steam\steamapps\common\Heat Signature Beta\data.win | |
######################################################################### | |
####!!!!$$$$$$ pwd - C:\Program Files\Steam\steamapps\common\Heat Signature Beta\ | |
######################################################################### | |
RunnerLoadGame() - C:\Program Files\Steam\steamapps\common\Heat Signature Beta\data.win | |
Checking if INIFile C:\Program Files\Steam\steamapps\common\Heat Signature Beta/options.ini Exists | |
C:\Program Files\Steam\steamapps\common\Heat Signature Beta/options.ini file contents: [Windows] |
/* | |
* Directory example for EECS 2550. | |
* Author: Jerry Heuring | |
* Date: August 23, 2007 | |
* | |
* This is an example that demonstrates how you could | |
* use system calls to go through directories on Unix. | |
* Technically, I believe that it is POSIX compliant and | |
* may work with Microsoft Windows but have not tested | |
* it. |
I hereby claim:
To claim this, I am signing this object:
Selecting FBConfig | |
GLX_FBCONFIG_ID=119 | |
GLX_BUFFER_SIZE=32 | |
GLX_DOUBLEBUFFER=1 | |
GLX_RED_SIZE=8 | |
GLX_GREEN_SIZE=8 | |
GLX_BLUE_SIZE=8 | |
GLX_ALPHA_SIZE=8 | |
GLX_DEPTH_SIZE=24 |
MST-Kruskal(G, w) | |
A = ∅ | |
for each vertex v ∈ G.V | |
Make-Set(v) | |
sort the edges of E by increasing w (weight) value | |
for each edge (u, v) ∈ E (taken in weight order) | |
if Find-Set(u) ≠ Find-Set(v) | |
A = A ∪ {(u, v)} | |
Union(u, v) | |
return A |
; Nathan Lowe | |
; EECS 2110 - Computer Architecture and Organization | |
; Spring 2016 at the University of Toledo | |
; | |
; Description: Given an input radix, output radix, and two numbers in the | |
; specified input radix, perform the following operations: | |
; A+B | |
; A-B | |
; A*B | |
; A/B if b != 0, otherwise display an error |
# Not actually python, but that's the closest language to the pseudocode dialect the book uses | |
B-Tree-Search(x, k) | |
i = 1 | |
while i ≤ x.n and k > x.key[i] | |
i = i + 1 | |
if i ≤ x.n and k == x.key[i] | |
return (x, i) | |
if x.leaf | |
return nil | |
else Disk-Read(x.c[i]) |
node *root=NULL; | |
void AVL_Insert(data X) | |
{ | |
node *Y; // The new node we insert | |
node *A, *B, *F; // see below... | |
node *C, *CL, *CR // ... for description | |
int d; // displacement; Used to adjust BFs | |
if (root==NULL) // Empty tree? Make root node! | |
{ |