Discrete Structures
Propositional Logic. Predicate Logic. Sets. Functions. Sequences and Summation. Proof Techniques. Mathematical induction. Inclusion-exclusion and Pigeonhole principles. Permutations and Combinations (with and without repetitions). The Binomial Theorem. Discrete Probability. Recurrence Relations.…
Learning outcomes
At the end of this course, the students will be able to: 1. convert logical statements from informal language to propositional and predicate logic expressions; 2. describe the strengths and limitations of propositional and predicate logic; 3. outline the basic structure of each proof technique (direct proof, proof by contradiction, and induction) described in this unit; 4. apply each of the proof techniques (direct proof, proof by contradiction, and induction) correctly in the construction of a sound argument; 5. apply the pigeonhole principle in the context of a formal proof; 6. compute permutations and combinations of a set, and interpret the meaning in the context of the particular application; 7. map real-world applications to appropriate counting formalisms, such as determining the number of ways to arrange people around a table, subject to constraints on the seating arrangement, or the number of ways to determine certain hands in cards (e.g., a full house); and 8. solve a variety of basic recurrence relations. New Computing
Course contents
Propositional Logic. Predicate Logic. Sets. Functions. Sequences and Summation. Proof Techniques. Mathematical induction. Inclusion-exclusion and Pigeonhole principles. Permutations and Combinations (with and without repetitions). The Binomial Theorem. Discrete Probability. Recurrence Relations. CSC 299: SIWES I (3 Units C: PH 135) Learning Outcomes At the end of this training, students should be able to: 1. explain how a typical computer firm/unit operates; 2. describe the various assignments carried out and the skills acquired during the SIWES period; and 3. submit a comprehensive report on the knowledge acquired and the experience gained during the exercise. Course Contents Students are attached to private and public organisations for a period of three months during the second-year session long break with a view to making them acquire practical experience and to the extent possible, develop skills in all areas of Computer Science. Students are supervised during the training period and shall be expected to keep records designed for the purpose of monitoring their performance. They are also expected to submit a report on the experience gained and defend their reports.