Hackers
Access computer system or network without authorization
Breaks the law; can go to prison
Crackers
Break into systems to steal or destroy data
U.S. Department of Justice calls both hackers
Ethical hacker
Performs most of the same activities but with owner’s permission
Name:
Anonymous2009-12-03 10:48
( ~_~)
Name:
Anonymous2009-12-03 10:53
Something else I learned(also from same PowerPoint):
Programming languages used by experienced penetration testers
-Practical Extraction and Report Language (Perl)
-C
Tools on your computer might be illegal to possess
Contact local law enforcement agencies before installing hacking tools
Written words are open to interpretation
Governments are getting more serious about punishment for cybercrimes
Name:
Anonymous2009-12-03 11:18
It is hard to write a simple definition of something as varied as hacking, but I think what these activities have in common is playfulness, cleverness, and exploration. Thus, hacking means exploring the limits of what is possible, in a spirit of playful cleverness. Activities that display playful cleverness have "hack value".
>>13
It just goes to show they are not an EXTREME EXPERT BBCODER.
Name:
Anonymous2009-12-03 20:26
People need to learn how to properly define things.
Who is your professor? I need to get together with him
and have a |GAY DAD EXPLOSION|
Name:
Anonymous2009-12-07 12:09
Race conditions are another problem that can occur in a multithreaded environment. This happens when the relative timing in execution of multiple threads can affect the outcome of each the thread’s execution. For example, if two threads both access and modify the same variable to perform a few calculations, the result is non deterministic based on the relative execution of the statements in each thread. Here is some code to elaborate on this example:
Thread_1(){
X = X * 100;
Print(X); }
Thread_2(){
X++;
Print(X); }
Lets say X starts out at 0. If Thread_1 was running slow and it timed out after the first statement (X = 0 * 100) and then the second statement would have to wait until Thread_2 times out. Thread two runs fast enough to finish its operation before timing out, resulting in printing out (1). Thread_1 gets the processor again and starts back up where it left of, right about to print X. When Thread_1 prints X it also gets the same result (1) because X was modified before it was able to print out its result. What ends up happening is the user who put in request for thread one got the answer 0 times 100 is equal to 1 which is obviously wrong. This must be fixed for the system to maintain its deterministic nature.
>>16
No one does simple calculations like that, but sometimes it comes down to something like that (inside something complex) where you need to keep multiple threads in synchronization.
>>24
My point being that if you naively lock things to overcome race conditions you can (and usually will) get deadlock in the non-simple case. Simply synchronizing on resources doesn't solve all race conditions. QE-Friggin'-Deadlock.
Name:
Anonymous2009-12-08 18:27
>>26
Ok I get it, you are an expert multiprogrammer.