All comics by Boffolus

 

The magic of the holidays by Boffolus 3-08-02
It's not Christmas It's Christmas!	It's still not Christmas Wait a minute My time has come	Gasp! My tree is really a drunk! Fuck off

 

This comic rated S for Suck by Boffolus 3-08-02
Acceptance I'm badly pixellated I look queer	This just gets worse and worse I'm a chicken I'm a carryover from the last panel	Life's unanswerable questions Why am I watching tv in the snow? How am I talking?

 

Mm, blasphemous by Boffolus 3-08-02
2 Jesi for the price of 1! I am Jesus! So am I!	Jesi is the plural of Jesus Why are we in hell? Good thing we're both dressed for the heat	Nevermind Shit Shit

 

MY SHIFT KEY CAN"T TURN OFF! HELP by Boffolus 3-13-02
She's right I have a boner! Worst joke ever	I like continuity This toilet is uncomfortable Where's my body?	You think of something better Well I'm outta here My work here is done

 

Predictible humour at it's best by Boffolus 3-13-02
Let's find out Who's been fucking all the bitches?	Waiting for Godot	Didn't see that one coming I've been fucking all the bitches!

 

Blah by Boffolus 3-23-02
Oo, sinister Do you have the cloning ray prepared? Yes, but I still think this is stupid	I blew my special effects budget	Wait, that's not funny. What a loser What a loser

 

This a good way of studying for tests by Boffolus 4-01-02
Violence and graph theory A spanning tree is a subgraph of a simple connected graph that contains no cycles A tree is a simple connected graph that contains no cycles. The difference between a tree and a spanning tree is that a spanning tree is obtained by removing edges from a graph with cycles	Mm, minterms Any circuit can be expressed as a combination of boolean variables, which have values of either 0 or 1. These values can be enumerated in a table showing all possible combinations of the variables The circuit can be represnted by taking each combination of variables that gives 1 as a result, doing a boolean multiplication (AND operation) on those terms to create a minterm	Boolean reduction made easy Repeate this process for every time the graph gives a result of 1, and then do a boolean addition (OR operation) on all the minterms The resulting formula will be a simplified representation of the circuit. The minterms can be further reduced by removing variables that have no effect on the outcome of the minterm

Showing page 1.