I have successfully completed the second week of my stint as a sophomore Computer Science major at UVM. I wrote my first program for Intermediate Programming in Java (I hope that I remember all the syntax soon, else the upcoming projects are going to suck). I am really quite confused about boolean circuits and what, exactly, they are doing. I see lines and then lines coming off of lines and lines going into gates and out of gates and into other gates and I am simply lost. Ho hum.
Three of my courses appear to be near-carbon copies, too. Two of them, incidentally, are taught by the same professor (Snapp, if you were curious). They all basically have taken the ideas of computer logic and are just applying it slightly differently. One looks at the actual structures of computer math, another at applications of computer-style math in the real world and the third looks that the probability that computer-math-based programs and processes will work (among other things, though).
The courses, since you asked (I don't think I actually have any readers, but whatever) are Discrete Structures (called Discrete Mathematics by most universities), Probability and Statistics for Computer Science Majors and Puzzles, Games and Algorithms. Puzzles, Games and Algorithms is probably my most interesting (and, incidentally, easiest) course this semester. We're going to the Great Corn Maze in the Northeast Kingdom of Vermont on the 26th of this month. If I remember to, I'll post about it.
As a shameless plugs, I would like to invite everyone to use Blackle.com as much as possible as opposed to Google. It is powered by Google but uses a black screen which saves kilowatt-hours (but only in a significant amount if a great many people use it).
Also, I would like to post this video for your enjoyment (it's quite old and I've seen it countless times):
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment