Jump to content


  • Posts

  • Joined

  • Last visited

  • Days Won


Everything posted by jcarmody

  1. I understand the things you've both written. I also think that I understand that a brute-force approach to the "Three Sum" problem is ~N^3 because it nests loops and operates N*N*N times. I guess I understand that expanding a binary search process will lead to 'log N', but I'd only be guessing and accepting some maths that I've either forgotten or never learned. I'm studying Union-Find algorithms this week, too. The programming assignment involves solving a percolation problem. I haven't read the problem statement, but the lectures introduced the concept and I believe I can implement an efficient algorithm because the lecture told me that the "weighted quick-union with path compression" is the best approach. I should probably discuss this in Coursera's forums but I like the people here so much! I'm going to keep plugging away on the off chance that something will click and I'll learn something. Thanks for your comments.
  2. Algorithms Part 1 began today... What do you call a programmer that doesn't understand order-of-growth calculations? Hopeless?
  3. You're welcome; I hope you stick around and enjoy/enrich LAVA.
  4. Perhaps this? It will be True after the input goes above 3 and will go False if the input = 0. It won't change if the input is 1 or 2. Untitled 1.vi
  5. I don't understand what you mean by 'latch'. It sounds like you want to ignore the occasional error when the input comes to zero (0-2) and keep the output True, but for how long? Perhaps you mean that whatever condition exists at the beginning of execution should persist throughout. Do you want the output to be True if it begins between 3 and 10 and never go False, regardless of changes in the input?
  6. What shoud the output be when the input is less than 0, between 2 and 3 or greater than 10?
  7. I'm not sure what you mean. You wrote "condition one" and "condition two", but your vi only has one input and three outputs.
  8. My company sometimes takes this approach with design flaws that would be too expensive to fix.
  9. I'm not able to get this to work (LV2011, SP1, WinXP with Microsoft Speech SDK 5.1 installed). I don't get any errors, it just doesn't detect when I say something from the list. In addition, when I press the Stop button, Release Session.vi never finishes. If I enabled debugging it will finish, and LabVIEW crashes if I abort it. I wonder if this behavior offers any clues into my bigger problem of not recognizing speech.
  10. I've "sold" three of the technicians I work with on this package; I wonder if they want my job. (They can have it )
  11. That's the first thing I though about after posting the link. The OP doesn't reveal a location so I couldn't know if it would help.
  12. You get an arduino as an added bonus! I bought it for my twelve-year-old son to learn on.
  13. Even better than second-hand - http://www.sparkfun.com/products/11225
  14. No. It looks interesting, though, and I may preview the class to see how they build a web crawler. I had played with Python before and have been able to google answers to the questions I've had. That looks like one I'd need to take. How far did you get and what did you think of it? It hasn't started yet.
  15. There's a board on the NI forums dedicated to that kind of thing - http://forums.ni.com/t5/Version-Conversion/bd-p/VersionConversion
  16. Thanks for the comment. I feel better about planning on the Coursera Algorithms course(s). I looked at their website; it's interesting. Thanks.I'd seen, and been intrigued by, Structure and Interpretation of Computer Programs at MIT OpenCourseWare before. Do any of you have any experience with this book/course? Scheme would be an interesting language to learn, and it would help me with Emacs/LISP.
  17. Thanks for your response. I've got some experience with text programming - BASIC, VB, Fortran, C, Java and now Python. I'm thinking I'm going to go with Python because of its popularity and it works well with Google's App Engine. I'm going to stay away from C if I can. Python!
  18. I've been following these forums for over five years now and can't articulate how much I get out of reading the threads. (I credit passing my CLD-R to reading them.) Over the years I've recognized the gulf that exists between my background and many of yours and have, more and more, wanted to narrow it. (I've often felt guilty about participating in a forum for Advanced Architects, because I'm neither.) I'd like to begin to change that, however, by studying the fundamentals of Computer Science. Higher education is changing drastically in many exciting ways (don't get me started on how it' looks like a bubble getting ready to burst) and I've begun participating by taking some free, online classes. I'm better than half-way through CS253, Web Application Engineering, on Udacity.com and have signed up for Algorithms, Part 1 and Statistics 1 on Coursera.org starting in August. I've seen many other courses I'd like to take, and I'd like to ask for advice on how to begin. Specifically, Coursera is going to offer a class on Automata, based on a 100-level course taught at Stanford University. While reading the course description I followed the link to I read the introduction and table of contents and think it's worth buying (don't have to, though, 'cuz it's online ), and the course worth taking. My questions for you are: will the CS courses mentioned above help me move in my desired direction, and what other resources do you recommend for beginning a Computer Science education? I understand that what I'm going to do will take a lot of effort and time and I'm open to taking college classes (but I don't prefer that route), online courses, reading books (purchased or online)... Just about anything, really. Do you have a favorite book that will help? I'd appreciate any advice you can give. Thank you.
  19. I'm happy to call this type of paradox "undefined" and move on, just like when a math operation results in NaN. I should probably just read more. A little more reading, this time on Russel's Paradox, makes me question what the implications are to the mathmeticians trying to resolve it. Is it purely academic?
  20. Just for some off-topic fun, I'd like to point out that this has been attempted, sort of.
  21. I doubt that it's a linear relationship. Can't be unseen, now...
  22. They're beautiful! Congratulations
  23. I was so hoping that I could be the first person to respond to this.
  24. Do any of you use the Runkeeper smartphone app? I've been using it for over a year now and have progressed from not being able to move my (formerly) fat body a half-mile without choking on my lungs to being able to run a 5K in under 30 minutes. I just signed up for one of their fitness classes that will have me running a sub-60-minute 10K in 16 weeks. I'm looking to build my Street Team with a few like-minded folks. Anyone interested? My Runkeeper profile is here. Jim (cross-posted on NI's forum here)
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.