higherGround574

hey jus thought i would introduce myself and say hi... CS major at Illinois tech... prefered language of progamming: Java

Halo Halo 2 Doom series (classic) metriod prime unreal

Hi, I'm working on a OOP school project, and I'm trying to add a web interface to it; however, my experience working with html forms is limited. Anyways, I'm trying to set up a user login, where the user enters some info onto a form. I want to pull the …

I have to get an animation to restart once the user scrolls the mouse over the image... I know I have to use MouseMotionListener, what I don't know is how to get the coordinates of the image to do this operation. I'm using GridBagLayout manager, the whole thing runs inside …

Hey guys, I'm for the most part a backend programmer but I'm taking a GUI class as a elective, and I'm haveing some problems with an applet. Part of the assigment is to create a logo design that displays a bunch of pentagons in a circle with different colors and …

does anyone know of a good distro that offers a downloadable iso .. and the gnome environment???

im a linux noob.... and i jus installed suse pro 9.3 however, i am not able to play any audio files. ive tried to play mp3's on amarok and xmms. It is not a hardware or volume control prob since the files will not even start. I also noticed that …

i jus installed fedora version 4 ... and I am unable to access any of my windows partion files. I had been using suse 9.3 previously and all of the mounting was automaticly done .. so any help anyone might have would be appreciated

if anyone knows of some good tutorials or links covering the how/to's of programming C completly off of linux command line... inputs would be greatly appreciated ... --thanx

I'm currenty using Eclipse for my compiler ... does anyone have any better suggestions?

In my opinion the best way to tackle this is with a recursive algorithm. This equation looks kind of like a Fibonacci's numbers problem with a slight difference. the equation should be X = X - (1 / (n+1)) + (1 / (n+2)) where x and n both start as …

the easiest way to break a number down right to left is to use the mod function rightDigit = wholeNumber % 10 will give you the right most digit then all you have to do is subtract the rightDigit from the wholeNumber, divide it by 10 and pass the wholeNumber …

Discrete math is probably the single most important CS class i have taken, for examining algorithms... but im still trying to figure out how biology fits into the picture

I want to start studying for the scjp exam but I'm not too sure where to start... Does anyone have some good book or link suggestions?

in the past i have been able to run dos commands thru C++... for example: system("cls") in C++ used to clear the screen... does anyone know if this can be done in java?

I would appreciate any input anyone might have for the following problem: Describe the worst-case time complexity, measured in terms of comparisons, of the following searching algorithm: (x: increasing integer a1, a2, a3.... an) i=1//left end point j=n//right end point while (i<j) t=[ (i+j/3) ] begin if ( x < …