^     All messages            65-80 of 80  49-64 >>
80 www.bleaching-earth.com 05-01-2012 05:16 PM ET (US) Edit Delete Manufacturer of Activated Fullers Earth, Fuller Earth, Activated Attapulgite, Xinyuan Bleaching Earth is leading manufacturer, producer of bleaching earth,fullers earth, attapulgite, bentonite in China. 79 Olga 04-16-2012 03:32 PM ET (US) A5 has been graded. 78 Olga 04-15-2012 06:46 PM ET (US) Yes, the exam is open book/open notes, but no open final/midterm solutions 77 Ab 04-15-2012 06:43 PM ET (US) Is the exam is open book like the midterm? 76 Olga 04-11-2012 10:43 AM ET (US) The final exam is on Monday, April 16 at 2:00 PM, in SH 3307 75 Olga 04-09-2012 03:31 PM ET (US) Ab, yes you do not have to hand in the hard copy. 74 Ab 04-09-2012 03:12 PM ET (US) Just to be clear we dont need to hand in a hard copy at the locker right? 73 Olga 04-08-2012 06:29 PM ET (US) Ab, First you delete k-1 largest edges from MST. This leaves k connected components. Compute the average color in each connected component and paint the output pixel with the average color of its connected component. 72 Ab 04-08-2012 01:04 PM ET (US) After you read the image, load the graph and complete the MST how exactly do you rebuild the image? Every time I try it the image is just the same which is odd because all tests pass just fine. My MST is pretty slow but I shrunk the image and one of two things happen either the image is perfectly rebuilt or all the white pixels are first then just Red-Yellow-Blue-Green (something like that order over and over until the end). 71 Olga 04-07-2012 11:59 PM ET (US) Mark, if you want to get your assignment feedback form from the IO counter, then hand in an envelope with the io ticket. Otherwise you don't have to hand in anything. 70 Mark 04-07-2012 10:41 PM ET (US) Hi Olga, do you still want us to hand in a hard copy on Monday? 69 Olga 04-07-2012 03:30 PM ET (US) Hi everyone, since the assignment is due on Sunday, and many of you are probably off-campus, you do not have to hand in the soft copy, just the electronic copy. 68 Olga 04-07-2012 12:15 AM ET (US) Ohhai, Sure, you can use HashMap. Although I'm not sure what you mean by "checking if an object is already in the Graph", I'm not sure where I require this. Just make sure it runs on Gaul, do not worry about the version of Java. 67 ohhai 04-06-2012 10:17 PM ET (US) Hi, I just wanted to ask, are we allowed to use java.util.HashMap for our vertices? The assignment says to use a linked list, but when checking if an object is already in the Graph, taking O(1) vs. O(n) would be great. I have mine implemented using the HashMap, and its taking only 6s for the regular image on Gaul. Before it was taking a lot longer. Also, I am just curious if we should be making sure it runs on Gaul or do you have a level of Java compliance you would like us to use? I use 1.6 (its the standard right now), but I feel as though you might be on 1.4. Thanks. 66 Olga 04-06-2012 08:46 PM ET (US) Here is a final exam sample: http://www.csd.uwo.ca/~olga/FinalSamplePartialSolutions.pdf 65 Olga 04-06-2012 01:07 PM ET (US) There was a bug in my TestGraph program, effecting Test 10. You would fail it if your connected component method was based on DFS. If your connected component computation was based on BFS, then you would pass the test 10 with no problems. Thanks for Kbright2 for pointing it out. I fixed it now, download assignment files again if you need the new version.	Upgrade to PRO Upload pictures, personalize your board, and more! About these ads
^     All messages            65-80 of 80  49-64 >>