Introduction to some courses of CSI at the University of Ottawa A CSI2101 Discrete structures have applications in computer science, algorithm analysis, and design. predicate logic. A Survey of Argumentation Techniques; Applications of Induction to Computational Problems. Applications of graph theory in information technology. Program correctness, preconditions, postconditions and invariants. Analyze recursive programs using recurrence relations. Properties of integers and basic cryptography applications. 2 CSI2110 Discrete structures have applications in computer science, algorithm analysis, and design. predicate logic. A Survey of Argumentation Techniques; Applications of Induction to Computational Problems. Applications of graph theory in information technology. Program correctness, preconditions, postconditions and invariants. Analyze recursive programs using recurrence relations. Properties of integers and basic cryptography applications. III CSI 2120 Programming Paradigms (3 credits) Introduces the major programming paradigms: object-oriented, imperative, logical, and functional. Related programming languages, their basic properties and typical applications. Programming in imperative, logical, and functional languages. The influence of programming paradigms on problem solving and program design strategies. An overview of other paradigms, such as constraint-based, rule-based, and event-driven programming. Four CSI 2120 Programming Paradigms (3 credits) Introduces the major programming paradigms: object-oriented, imperative, logical, and functional. Related programming languages, their basic properties and typical applications. Programming in imperative, logical, and functional languages. The influence of programming paradigms on problem solving and program design strategies. An overview of other paradigms, such as constraint-based, rule-based, and event-driven programming.