In addition to becoming skilled in Programming and Problem Solving, Computer Scientists need to be aware of the limitations of particular techniques and be able to test for correctness of programs they produce. This course introduces students to the logical fundamentals underlying proof of correctness (propositional and predicate logic, proof techniques) and to the concept of a finite state machine, a restricted computational model used in many application domains. This course is very practical in nature and students will be required to apply the techniques they have learned to a particular set of problems.
