|
Post Number: 1
|
LiNeY
Lady of DetNet
Group: Members
Posts: 782
Joined: Dec. 2000
|
|
Posted on: Oct. 24 2001,19:26 |
|
|
As posted before, I started teaching myself programming C. I love it, and it's real fun... I got as far as pointers, and I think I even understood what they're about. However, I haven't been doing anything in the last weeks, because I didn't have anything useful to do. I mean... I could write simple (very simple!) programs, if I knew what to write a program about. I need tasks, or exercises, or challenges, or whatever.Do any of you guys have an idea what I could do? It shouldn't be too difficult (remember I'm a blonde) and cover the basic use of C. I'd be glad about suggestions and ideas... my brain and my compiler are yearning for some action! ------------------ C'est à cette amie que je me confie - mais c'est l'autre que j'embrasse...
|
|
|
|
Post Number: 2
|
chmod
Jedi Knight
Group: Members
Posts: 373
Joined: Jul. 2001
|
|
Posted on: Oct. 24 2001,19:36 |
|
|
Once you've got pointers down, you might wanna explore data structures a bit - linked lists, binary trees, etc... They are a pain in the ass but you can learn a lot by playing with them. What platform do you do all your coding on?
|
|
|
|
Post Number: 3
|
|
Post Number: 4
|
|
Post Number: 5
|
|
Post Number: 6
|
chmod
Jedi Knight
Group: Members
Posts: 373
Joined: Jul. 2001
|
|
Posted on: Oct. 24 2001,21:31 |
|
|
Shit man, I've got 6 AP classes. It actually hasn't been that bad.... yet. But AP computer science is a joke, fortunately the teacher is open-minded enough to let me work on my own stuff. I would insert a rant about that course somewhere, but it seems Chase has already done so. hmph. Anyways... here's an interesting quiz on C you might wanna try, for shits and giggles: http://www.cprogramming.com/cgi-bin/quiz.cgi
|
|
|
|
Post Number: 7
|
|
Post Number: 8
|
@$$h0l3
FNG
Group: Members
Posts: 40
Joined: Dec. 2000
|
|
Posted on: Oct. 25 2001,03:31 |
|
|
If you want something that will teach you more about designing an algorithm than coding, try the towers of Hannoy (sp?) problem. Properly implemented, it should only be a handful of lines, but you must think long and hard before you code to get the recursion right (at least when you are starting to code). The problem: You have three pegs, two are empty, and one has x number of disks stacked on it. The disks are stacked with the largest disk on the bottom and the smallest on top. You goal is to move all the disks from one peg to another, but there are rules. 1) you can only move one disk at time. 2)you cannot put a larger disk on top of a smaller one. Sometimes there's a third rule, but I don't remember it. I believe when I took <don't laugh> Pascal </don't laugh> back in the old days, the completed program was ~ 20 lines long, including variable declarations, begin..end statements and the main program. But it took me a while to figure it out, and it's a very tidy exercise in recursion. When you see it in your head for like x=64 rings, it's quite cool.
|
|
|
|
Post Number: 9
|
|
Post Number: 10
|
|
|
|