This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Knuth's | |
------- | |
FUNDAMENTAL ALGORITHMS | |
The Art of Computer Programming, | |
======================================================================== | |
The process of preparing a program for a digital computer is especially | |
attractive, not only because it can be economically and scientifically | |
rewarding, but also because it can be an aesthetic experience much like |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Brian Anderson | |
Assignment 9 - Com S 352 | |
April 4, 2012 | |
[NOTE --> PLEASE USED A FIXED WIDTH FONT TO READ THIS DOCUMENT] | |
1. (25pts) Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order | |
from low-end to high-end of user memory space), how would the first-fit, best- fit, and | |
worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in the arriving order)? |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<title>Canvas Plotting Test</title> | |
<style> | |
canvas { border:1px solid black;} | |
</style> | |
</head> | |
<body> | |
<canvas id="sample" width="600" height="300"></canvas> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Brian Anderson | |
ComS 352 - Assignment 10 | |
4/17/2013 | |
------------------------- | |
1: In the long run, what is the maximum acceptable page-fault rate in | |
order to achieve an effective access time of no more than 200 nanoseconds? | |
physical frames = 256 | |
page fault time = 4ms (no write to main) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Brian Anderson | |
Com S 352 - Assignment 11 | |
April 25, 2013 | |
===================================================================================== | |
1. If we are currently at logical block 8 (i.e., the last block accessed was | |
block 8) and want to access logical block 4, how many physical blocks | |
must be read from the disk? | |
Block Size: 1024 bytes. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'rubygems' | |
BASE_PATH = "/not/important/anymore/" | |
# Hash to store all the words found | |
OPTIMIZER = {} | |
# Can pass in a path to a file, if not it will use | |
# a file foud at BASE_PATH/bingo_words.txt | |
if ARGV[0].is_a?(String) | |
puts "Reading from #{ARGV[0]}" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// | |
// You will need to use -lpthreads in your make command | |
// 'cc pipedThreadPool.c -lpthreads -o test' | |
// | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <unistd.h> | |
#include <sys/types.h> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
find . -type f -size 0 > bad_files.txt |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module ActiveRecord | |
class Base | |
# Just hack this in, since I don't have AR 4.0 installed | |
def self.where(*attrs) | |
puts attrs.inspect | |
end | |
def self.table_name | |
"erics_models" | |
end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN"> | |
<html> | |
<head> | |
<title>Test</title> | |
</head> | |
<body> | |
<canvas id="canvaz" width="400" height="400" /> | |
</body> | |
<script type="text/javascript" charset="utf-8"> |