CS285

CS285 introduces mathematical logic and fundamental discrete structures used in computing. The course covers propositional logic, predicates, sets, functions, sequences, summations, matrices, number theory, cryptography, induction, recursion, counting, recurrence relations, and relations. The course prepares students for higher-level computing courses where discrete structures and proof techniques are fundamental.

• Describe basic concepts of propositional logic, sets, sequences, functions, sums, number theory, recurrences, and counting.
• Apply proof techniques using propositional logic, rules of inference, and induction.
• Perform operations on integers, matrices, sets, functions, sequences, sums, number theory, relations, propositional logic, and proof techniques.
• Apply counting principles and recurrence relations to counting problems.
• Use basic cryptography algorithms.
• Collaborate ethically and communicate clearly when developing cryptographic solutions.