Forum

The Computer Well

Created 27th November 2010 @ 20:02

Add A Reply Pages: 1 2 ... 11 Next »

octochris

(0v0)

Since everyone else is doing it, I figured I’d do it with a twist. For a while I’ll answer your IT related questions (dunno how long, until I get bored I guess).

If the question can’t be answered in one reply then it probably shouldn’t be here, make a thread for it and I’ll get around to it if I have the time. Keep your questions concise and to the point, if you have to use more than three sentences for it you should consider creating a new thread.

Don’t put questions about my configs in here, they should go in the relevant thread.

My areas of expertise:

* Artificial intelligence
* Artificial neural networks
* BIOS configuration
* BSD kernel
* CPU technologies
* Debugging (esp. NT kernel)
* Embedded computing
* Hardware (commercial and home)
* Hardware flashing
* Kerberos
* Networking (commercial and home) inc. backbone infrastructure like DSLAM/BRAS
* NT kernel
* Number systems
* Overclocking
* Peripherals
* Pulse computation
* Security
* Virtualisation
* Windows (versions from 3.1 to 7 and server editions)

Would rather not answer programming questions as they actually might require me to think.

poxie

Actually teach me boolean logic, cause I suck at it!


Last edited by poxie,

octochris

(0v0)

Quoted from poxie

teach me to program in machine code?

Why would you want to do that? Just use ASM or something.

poxie

T’was merely a joke. Edited one is fo’ real question!

David

explain what A stack overflow is. My computing teach attempts to explain it but fails at it.

octochris

(0v0)

Quoted from poxie

Actually teach me boolean logic, cause I suck at it!

you should be embarrassed, it’s easy as fuck, literally you could learn all about it just by reading the wikipedia article

octochris

(0v0)

Quoted from David

explain what A stack overflow is. My computing teach attempts to explain it but fails at it.

imagine the following function:

int recursive()
{
recursive();
}

it keeps on getting called recursively, and once you fill the call stack with this you get the stack overflow (because it is full)

this is a simple example, but the core element of most stack overflows is that you are nesting function calls too deeply for the call stack.

you can also get it by allocating masses of memory on the stack.

edit: should be noted that most compilers will optimise for this sort of recursion.


Last edited by octochris,

franco

chris says: feel free to ask any questions you have about x subjects, i will answer them for you.

poxie says: so how does x work etc etc..

chris says: rofl idiot

poxie

Quoted from octochris

[…]

you should be embarrassed, it’s easy as fuck, literally you could learn all about it just by reading the wikipedia article

Embarrassed)))

octochris

(0v0)

Quoted from franco

chris says: feel free to ask any questions you have about x subjects, i will answer them for you.

poxie says: so how does x work etc etc..

chris says: rofl idiot

my answer would just be a copy and paste of the wikipedia article, it’s literally pretty much all there

https://secure.wikimedia.org/wikipedia/en/wiki/Boolean_logic#Properties

Can you explain the main differences between the “link state” and the “distance vector” algorithms?

Edd

T2P

phenom II or intel i-series?

money isn’t an issue (unless ofc its £2501560160161601)


Last edited by Edd,

Skyride

DUCS

Quoted from octochris

imagine the following function:


int recursive();

int recursive()
{
recursive();
}

fixed that for you )))

octochris

(0v0)

Quoted from Skyride

[…]

fixed that for you )))

WUPS LOLOLO

octochris

(0v0)

Quoted from Edd

phenom II or intel i-series?

money isn’t an issue (unless ofc its £2501560160161601)

intel if money isn’t an issue. they have the superior chip so they charge exorbitant amounts for it.

Add A Reply Pages: 1 2 ... 11 Next »