Pinned Repositories
beedel
bracket-matching
Implementing the stack data structure to find if the brackets in a string are matching.
bulletproof-testing
A workshop on testing in Python. Covers mocking, smoke and mutation testing.
dependency-discoverer
A program that processes the c/yacc/lex source file arguments, outputting the dependencies between the corresponding .o file, the .c source file, and any included .h files.
ds-from-scratch
A program that benchmarks operations of a dynamic set when it is implemented using a doubly-linked list vs a binary search tree.
glover
A Django web app for matching with other UofG students.
mastermind
The Mastermind game on the Ruby command-line.
schedulers
Implementation of the FCFS, RR, SJF, and SRTF scheduling algorithms.
test-double-guide
This guide clarifies the differences between dummies, stubs, fakes, spies, and mocks. It includes practical examples and attempts to clarify the optimal use cases for each type.
word-ladder
Implementing the graph data structure and using the BFS algorithm to solve the word ladder problem.
beedel's Repositories
beedel/beedel
beedel/bracket-matching
Implementing the stack data structure to find if the brackets in a string are matching.
beedel/bulletproof-testing
A workshop on testing in Python. Covers mocking, smoke and mutation testing.
beedel/dependency-discoverer
A program that processes the c/yacc/lex source file arguments, outputting the dependencies between the corresponding .o file, the .c source file, and any included .h files.
beedel/ds-from-scratch
A program that benchmarks operations of a dynamic set when it is implemented using a doubly-linked list vs a binary search tree.
beedel/glover
A Django web app for matching with other UofG students.
beedel/mastermind
The Mastermind game on the Ruby command-line.
beedel/schedulers
Implementation of the FCFS, RR, SJF, and SRTF scheduling algorithms.
beedel/test-double-guide
This guide clarifies the differences between dummies, stubs, fakes, spies, and mocks. It includes practical examples and attempts to clarify the optimal use cases for each type.
beedel/word-ladder
Implementing the graph data structure and using the BFS algorithm to solve the word ladder problem.