Professor Tom Valente
Office: Bagby 123, ext 6210
Hours: TO BE ANNOUNCED
That being said, please realize that most of the learning for the course will take place outside of the lectures. This will happen as a result of lab experiments and exercises, studying from the textbook, homework problems, and programming projects. It is absolutely necessary to do all of these and to have read the required material before each class in order for you to keep pace with the course. Feel free to drop by my office for questions, or simply to chat about the course and your progress in it.
Programming is not a spectator sport, so simply coming to classes, though necessary, is not by itself sufficient as a source for learning. Remember to take advantage of every opportunity to learn by making use of readings, lectures, labs, projects, homework, myself, and your classmates (when permitted).
Your grade is a weighted average of labs, projects, and exams, computed as follows:
Attendance will be checked at the beginning of each class. In an introductory computer science class, attendance at every class is absolutely essential, so I expect you to attend every class and to be on time. If you miss class, you will hear from me.
A site that allows us to track Euclid's GCD algorithm step-by-step.
Programming a simple machine in its machine language.
Programming a simple machine in its assembly language.
A scratchpad that allows for some object-oriented programming.
Enjoy this colorful object-oriented example in Java.
Illustration of the selection sort algorithm.
Illustration of the insertion sort algorithm.