Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-

Programming exercises

Name: Anonymous 2008-10-13 13:28

So right now I have nothing I need to code for myself, or at least nothing I'd be ABLE to code for myself, but I still want to improve the quality of my code/get better/learn more.

Does anyone know of a website with programming exercises of beginner-intermediate level for Sepples and/or Java that would actually interest me?

I googled around a little and most of the exercises there were shitty university assignments.

Name: Anonymous 2008-10-13 13:33

projecteuler

Name: Anonymous 2008-10-13 13:45

>>2
shitty maths assignments

Name: Anonymous 2008-10-13 13:52

just read SICP and stop screwing with ``Sepples and/or Java''

Name: Anonymous 2008-10-13 14:34

Name: Anonymous 2008-10-13 17:00

http://www.spoj.pl/info/
EXPERT PROBLEMSETTERS

Name: Anonymous 2008-10-13 17:36

>>3
Too hard for you? All programming-related things worth doing are maths challenges.

Name: Anonymous 2008-10-13 18:25

>> nothing I'd be ABLE to code
what knowledge are you lacking, OP?

For better sepples style, read anything by Herb Sutter you can get your hands on, starting with http://www.gotw.ca/publications/c++cs.htm

Name: Anonymous 2008-10-13 18:35

stop programming in C++ you fucking idiots

Name: Anonymous 2008-10-13 19:20

start programming in C++ you fucking idiots

Name: Anonymous 2008-10-13 19:55

>>8
I haven't touched client-server stuff, socks, etc

As for the thread, thanks for spoj.pl, but like the other guy said, projecteuler is more about maths than it is about programming. Nothing really worthwhile to learn there.

Name: Anonymous 2008-10-14 1:01

http://ace.delos.com/usacogate

Sign up and have a go at the problems there. Focus is on algorithms, which are a coder's bread and butter.

Name: Anonymous 2008-10-14 12:54

>>11
So, a little bit of network programming homework is required.

If you're happy with UI programming, then why not start off with a simple boardgame program -- this one might be fun to emulate : http://pentago.com/

Name: Anonymous 2008-10-14 13:41

>>2

Hey, these look kind of fun

Name: Anonymous 2008-10-14 14:00

So, in layman's terms:
The complexity of a problem is given as an order of an expression, it may be a polynomial, like O(x^2) and it's cool, but when the complexity is exponential, like O(2^n), it's not cool and the problem is NP-complete.

Did I get this right?

Name: Anonymous 2008-10-15 4:36

Project Euler is a great way to learn algorithms and maths.  On top of that, you see a lot of different implementations in the threads which can teach you a whole lot in many languages.

Name: Anonymous 2008-10-15 10:59

>>15
god damn answer me i want help

Name: Anonymous 2008-10-15 11:06

>>15
No.

Name: Anonymous 2008-10-15 13:55

>>18
What did I do wrong?

Name: Anonymous 2008-10-15 13:58

FUCK OFF
>>16
GET FUCKED YOU SHIT FACE

Name: Anonymous 2008-10-15 13:59

>>19
For NP-Complete problems it's not certain if they can be solved in polynomial or exponential time.

Name: Anonymous 2008-10-15 18:39

>>21
If you think that makes >>15 wrong you suck at logical reasoning.

Name: Anonymous 2008-10-16 11:01

>>19
The time complexity of a decision problem is given as the time complexity of the best algorithm to solve it on a deterministic Touring machine. It is written as an order of an expression, e.g. O(x2).
If the expression is a polynomial, the problem is in P and often it's cool. When the expression is exponential, like in O(2x), it's almost always not cool and the problem is in EXPTIME.
If a problem can be solved in polynomial time on a nondeterministic Touring machine, it's in NP. If a problem in NP has the property that all other problems in NP can be Karp reduced to it, then it's in NP-complete. A consequence of this is that if one problem in NP-C is in P, every problem in NP is in P.

Currently, we know that P ⊆ NP ⊆ EXPTIME and that P ≠ EXPTIME. The million dollar question is whether P = NP, NP = EXPTIME or neither.

Name: Anonymous 2008-10-16 11:32

>>23
x considered harmful. Please use n for natural numbers (AKA unsigned integers).

Name: Anonymous 2008-10-16 14:24

(AKA positive integers).

Name: Anonymous 2008-10-16 14:32

>>25

Back to /sci/, please.

Name: Anonymous 2008-10-17 13:18

>>26
Even /sci/ knows ``natural numbers'' has two definitions.

Name: Anonymous 2008-10-17 13:31

>>27
Get real

Name: Anonymous 2008-10-17 13:34

>>28
Be rational.

Name: Anonymous 2008-10-17 18:48

>>29
Isn't this complex.

Name: Anonymous 2008-10-17 19:17

>>30
Nah, it's natural.

Name: Anonymous 2008-10-17 19:18

>>31
Get real

Name: Anonymous 2008-10-17 19:24

>>32
Be rational.

Name: Anonymous 2008-10-17 19:26

>>33
Well your mom's imaginary.

Name: Anonymous 2008-10-17 19:29

>>32
Be rational.

Name: Anonymous 2008-10-17 19:31

>>34
mom's imaginary
mom
I lol'd.

Name: Anonymous 2008-10-17 21:57

>>35
Your post number is an integer.

Name: Anonymous 2008-10-18 1:47

>>37
Your post number is a nigger.

Name: Anonymous 2008-10-18 9:07

>>38
That's irrational.

Name: Anonymous 2008-10-18 14:31

>>39
Oh, it's real

Name: Anonymous 2008-10-18 15:10

Hax my commutative ring

Name: Anonymous 2008-10-18 15:24

So I spent the last two hours finding random chatbots on the Internet and instructing them to hax my anus.

Name: Anonymous 2008-10-18 15:27

>>42
And what did you discover?

Name: Anonymous 2008-10-18 15:34

>>43
They are either reluctant to speak about anatomy or don't get it or want to know more.

Name: Anonymous 2008-10-20 10:43

>>44
Are you for real?

Name: Anonymous 2008-10-20 12:21

>>45
You're irrational, that's for sure.

Name: Anonymous 2008-10-20 12:37

>>46
im natral.

Name: Anonymous 2008-10-20 17:03

This joke has been beaten to death already. Thank you for participating in this thread. This thread has ended peacefully.

Name: Anonymous 2008-10-21 9:47

>>48
wat

Don't change these.
Name: Email:
Entire Thread Thread List