| 00:12.15 | *** join/#aegis doc|work (~doc@213-202-166-63.bas503.dsl.esat.net) |
| 00:54.31 | pmazer | the more i read about programming in lisp, the more i want to learn it if just for the "think differently" aspect |
| 01:12.44 | whatah | yeah |
| 01:12.49 | whatah | that's how i feel about castrating you |
| 01:12.56 | whatah | just to do something out of the box |
| 01:13.00 | whatah | :P j/k |
| 01:15.26 | *** join/#aegis floppyears (~floppy@c-67-171-199-143.client.comcast.net) |
| 01:16.14 | pmazer | haha |
| 01:16.31 | pmazer | thanks, i appreciate it, lol |
| 01:17.34 | whatah | :-) |
| 01:18.03 | whatah | floppyears: i think i am almost finished implementing dijsktra's algorithm. I was trying to read it out of the book, we went over it in class and now it makes more sense |
| 01:18.42 | floppyears | whatah: when we went over it in class, it made no sense for me. |
| 01:19.07 | floppyears | the teacher was horrible. |
| 01:19.08 | floppyears | ;( |
| 01:19.37 | floppyears | I personally don't like dijsktra's algorithm, because it doesn't look far ahead in advance. |
| 01:19.48 | floppyears | it only looks at the adjacent paths only. |
| 01:20.00 | whatah | floppyears: well, see... the fact is, it works |
| 01:20.05 | whatah | because it is a greedy algorithm |
| 01:20.10 | whatah | and it's proven to work |
| 01:20.14 | whatah | in a very short time. |
| 01:20.17 | floppyears | I don't like greedy algorithms. |
| 01:20.20 | whatah | well |
| 01:20.23 | floppyears | I don't find them to be very efficient. |
| 01:20.24 | whatah | that's your problem |
| 01:20.27 | whatah | um |
| 01:20.34 | whatah | dijsktra's algorithm is extremely efficient |
| 01:20.41 | whatah | that's why it is one of the defacto path finding algorithms |
| 01:20.49 | whatah | the only issue is implementing that messed up heap |
| 01:20.54 | floppyears | if they are teaching us algorithms, I would like them to teach me things that are good and efficient. |
| 01:21.06 | whatah | um, dijsktra's algorithm is efficient |
| 01:21.10 | whatah | it is big O(E) |
| 01:21.13 | floppyears | whatah: it will always work, but it doesn't use resources efficiently. |
| 01:21.37 | whatah | use resources efficiently? you mean it needs another data structure? |
| 01:21.56 | whatah | oh come on, i think it is efficient and it doesn't cost *that* much |
| 01:22.05 | whatah | i would prefer it over a brute force |
| 01:22.15 | floppyears | dijsktra's algorithm is not that efficient if you have to do the whole tree because you don't always have the final path until you finish the whole tree. |
| 01:22.28 | whatah | i was using floyd's algorithm, but when there are too many vertices, then you run into a problem |
| 01:22.53 | whatah | floppyears: you want an algorithm that only goes part way and finds a close approximation, is what you are saying? |
| 01:23.07 | floppyears | whatah: I guess you do have a point. I was just hoping we get to learn more cryptic and efficient ones. |
| 01:23.11 | whatah | instead of finding all solutions to shortest path, it will find the shortest solution, approximately |
| 01:23.27 | whatah | floppyears: yeah. |
| 01:24.28 | floppyears | I liked another algorithm better than dijsktra's |
| 01:24.32 | whatah | which? |
| 01:24.47 | floppyears | there was one in which you looked at the shortest costs path and you added them to your tree. |
| 01:25.03 | whatah | um |
| 01:25.08 | floppyears | then you start adding the least expensive one and go up |
| 01:25.17 | whatah | i am not sure what you meant |
| 01:25.23 | whatah | you mean the way to find a minimum spanning tree? |
| 01:25.29 | floppyears | for example you first add all the paths of value 1 then you add all the paths of value 2, and so on and son on. |
| 01:25.34 | floppyears | right. |
| 01:25.41 | whatah | that's not a shortest path finder |
| 01:25.46 | whatah | that finds the min. spanning tree. |
| 01:25.59 | whatah | which algorithm for it did you like better? kruskal's or prim's? |
| 01:26.33 | floppyears | I like prim's better. |
| 01:27.31 | floppyears | I personally like looking at this algorithms from a mathematical point of vie. |
| 01:27.35 | floppyears | s/vie/view. |
| 01:27.54 | floppyears | I feel like you get to learn a lot more than just by looking at it in a CS class. |
| 01:30.49 | whatah | yeah, that one is a greedy algorithm |
| 01:30.50 | whatah | it is basically like dijsktra's algorithm ,just instead of adding weights, you set the weights |
| 01:30.50 | whatah | actually, it is exactly the same exact for that one difference |
| 01:30.50 | whatah | heh |
| 01:30.50 | whatah | oh |
| 01:30.50 | whatah | hmmm |
| 01:30.50 | whatah | you can look at mine once i finish coding |
| 01:30.50 | whatah | heh |
| 01:34.56 | pmazer | whatah: what language do you code this stuff in? c? |
| 01:35.30 | whatah | c++ |
| 01:35.40 | whatah | i am t3h c++ pimp |
| 01:36.17 | pmazer | is it required, or do you just prefer it? |
| 01:36.33 | whatah | i prefer it |
| 01:36.44 | floppyears | unfortunately we had to use java to code :( |
| 01:37.51 | whatah | hmmm |
| 01:38.13 | whatah | did you know that with pointers, you can change charArr[0] to [charrArr]0? |
| 01:38.17 | whatah | that is kinky |
| 01:38.21 | pmazer | floppyears: we have to use java for the AP CS AB class i'm taking next year |
| 01:38.33 | whatah | java is really easy, in my opinion |
| 01:38.42 | whatah | AP CS is just intro to programming, right? |
| 01:39.22 | pmazer | whatah: CS A is... CS AB is an intro to CS |
| 01:39.32 | whatah | um |
| 01:39.34 | whatah | what's that mean? |
| 01:39.37 | whatah | like how to use a computer? |
| 01:39.50 | floppyears | pmazer: I know it's easy to teach with because you don't have to teach a whole lot about the language itself in order to teach complex stuff. |
| 01:40.14 | floppyears | pmazer: I would personally like it, if they had a more diverse option of languages to choose from. |
| 01:40.57 | pmazer | whatah: intro to CS as in intro to big O efficency and more algorithms and stuff |
| 01:41.08 | pmazer | whatah: more like the theory to programmingh |
| 01:41.20 | whatah | hmmm |
| 01:41.24 | whatah | it's not an algorithms course |
| 01:41.28 | whatah | it sounds like a discrete math course |
| 01:41.42 | whatah | what's it count as? |
| 01:41.59 | whatah | i don't think it's an algorithms course, because algorithms is a sick course |
| 01:42.20 | pmazer | never bad to hear this... lol: "hey would u be interested in doing php coding for money?" |
| 01:42.30 | floppyears | whatah: have you had discrete math 2 before. |
| 01:42.30 | whatah | haha |
| 01:42.37 | whatah | discrete math 2? |
| 01:42.39 | whatah | what's 2? |
| 01:42.43 | pmazer | whatah: it's probably more like your CS 101 class |
| 01:42.56 | floppyears | whatah: second course or part 2 of discrete math. |
| 01:43.06 | whatah | pmazer: there is no cs 101, it is cs 105 - an intro to computing (using a computer), cs 140 = intro to java. |
| 01:43.12 | whatah | i didn't know there was one |
| 01:43.20 | whatah | i think maybe we had both parts in the same term, i guess |
| 01:43.23 | whatah | i am a math major, too |
| 01:44.42 | pmazer | whatah: well, i don't know what it is... a more basic programming theory class using actual programming and some algorithms and such |
| 01:45.00 | whatah | interesting |
| 01:45.05 | whatah | sounds like you will be learning sorts |
| 01:45.09 | whatah | and data structures |
| 01:45.14 | floppyears | whatah: then you probably find all this algorithm stuff pretty easy. |
| 01:45.20 | whatah | maybe it's a data structures course? |
| 01:45.31 | whatah | floppyears: nah, i didn't take graph theory yet. but algorithms is pretty easy, yeah |
| 01:45.41 | whatah | analyzing code isn't that hard, for me |
| 01:46.52 | floppyears | whatah: I find graphs a lot of fun, it's very useful and aplicable. |
| 01:47.43 | pmazer | whatah: yeah, i know we'll be learning sorts and data structs |
| 01:47.59 | whatah | it sounds like the course should be called 'data structures' |
| 01:48.00 | whatah | heh |
| 01:48.31 | floppyears | I would personlly like things more if instructors made their classes more real world applicable. their examples are horrible. |
| 01:49.47 | whatah | hmmm |
| 01:49.53 | whatah | you saw my projects, right? |
| 01:51.22 | floppyears | whatah: `haven't really had time to take a look at them. |
| 01:51.34 | whatah | hmmm |
| 01:51.38 | whatah | without looking at the code |
| 01:51.38 | floppyears | we have visit comming tomorrow morning, so I have to clean the house. |
| 01:51.51 | whatah | you can see what the general idea is tomorrow by looking at the .pdf files |
| 01:52.37 | whatah | http://bing49.hillrs.binghamton.edu/listing.php?repname=cs333&path=%2Fdocs%2F&rev=0&sc=0 |
| 01:52.41 | whatah | oops |
| 01:52.46 | whatah | http://bing30.hillrs.binghamton.edu/listing.php?repname=cs333&path=%2Fdocs%2F&rev=0&sc=0 |
| 01:52.48 | whatah | my IP changed |
| 01:54.26 | floppyears | why has your ip changed. |
| 01:54.37 | whatah | the campus networks went down today |
| 01:54.44 | whatah | and they reassigned me a new IP |
| 01:54.46 | pmazer | whatah: that still doesn't work for me |
| 01:54.54 | floppyears | oh. |
| 01:54.59 | whatah | http://bing30.hillrs.binghamton.edu/websvn/listing.php?repname=cs333&path=%2Fdocs%2F&rev=0&sc=0 |
| 01:55.09 | whatah | how's that? |
| 01:55.18 | floppyears | I was actually referring at the boring classes that I took :) |
| 01:55.26 | whatah | oh |
| 01:55.31 | pmazer | whatah: yep, works |
| 01:55.36 | whatah | you win. floppyears |
| 01:55.47 | floppyears | lol |
| 01:55.57 | floppyears | well, gotta go do some cleaning |
| 01:56.08 | whatah | good luck |
| 01:57.19 | floppyears | thanks |
| 02:03.05 | pmazer | this dude's dad is an asp.net programmer: |
| 02:03.07 | pmazer | (22:00:40) Absolute883: k myd ad said that no corporate company would want my Sql to be used |
| 02:03.10 | pmazer | (22:00:43) Absolute883: cus its free |
| 02:03.24 | pmazer | so damn funn |
| 02:03.26 | pmazer | funny |
| 02:05.17 | whatah | hmm |
| 02:05.18 | whatah | where is he? |
| 02:05.48 | pmazer | hmm? |
| 02:06.00 | pmazer | what do you mean by where? |
| 02:11.29 | pmazer | so funny... he's trying to start up a web development company and he wants me to do the php stuff |
| 02:12.02 | pmazer | i just may do it, but im afraid of making some kind of security hole and getting screwed for it |
| 02:14.35 | whatah | you wouldn't get screwed for it |
| 02:14.38 | whatah | do it, do it |
| 02:14.42 | whatah | and give me 5% |
| 02:15.23 | pmazer | haha |
| 02:15.55 | pmazer | i should just develop a php backend for his sites, and get him to pay me $1000 for it and be done :-P |
| 02:17.11 | whatah | 1000? that's all? |
| 02:17.14 | whatah | dude, go higher |
| 02:17.58 | pmazer | he's talking about me getting like $200 for each website.. does that sound about right? |
| 02:18.00 | whatah | i don't know |
| 02:18.03 | whatah | i can ask |
| 02:18.12 | whatah | it is more about time spent, then a salary |
| 02:18.14 | whatah | i think |
| 02:18.44 | pmazer | yeah, but i think ill only spend a couple hours per website once i get a decent backend going |
| 02:21.12 | pmazer | a php script to create the db tables i need, then maybe a few hours tailoring the script to meet specs |