| Topic
|
No. of hours
|
Lecture
|
Tutorial/Practical
|
|
Sets, Special Sets, Venn Diagrams, the Size of a Set, Power Set and Set Operations.
|
4
|
2
|
2
|
|
Relations, Inverse Relation, Graphical Representatives of Relations, Types of Relations.
|
4
|
2
|
2
|
|
Composition of Relations, n-array Relations and their applications.
|
4
|
2
|
2
|
|
Function Definition, Compositions of Functions, Inverse Function, Modular Arithmetic Function, Cryptography Applications (Caesar Cipher).
|
4
|
2
|
2
|
|
Recursively Defined Functions, Sequences, Arithmetic Progression, Geometric Progression, Recurrence Relations.
|
4
|
2
|
2
|
|
Logic and Proofs, Propositional Logic, Compound Statements, Logic and Bit Operations, and Propositional Equivalences.
|
4
|
2
|
2
|
|
Predicates, Quantifiers, Negating Quantified Expressions, Nested Quantifiers, Rules of Inference, and Logical Reasoning.
|
4
|
2
|
2
|
|
Mathematical Induction, Recursion
|
4
|
2
|
2
|
|
Mid-Term Exam
|
2
|
|
|
|
Techniques of Counting, Sum/Product Rule, Tree Diagrams, Permutations, Combinations, Binomial Theorem, Permutations with Repetition, Combinations with Repetition.
|
4
|
2
|
2
|
|
Graph Terminology, Directed Graphs, Representing Graphs, Graph Connectivity,
|
4
|
2
|
2
|
|
Euler Circuits and Paths, Hamilton Circuits and Paths, Shortest-Path Problems (Dijkstra’s Algorithm), Planar Graphs.
|
4
|
2
|
2
|
|
Trees and Minimum Spanning Trees
|
4
|
2
|
2
|
|
Final Exam
|
2
|
|
|
