Still no participant
Still no reviews
Upon successful completion of this course, students will be able to :
Module-I ( T-5 hrs-P-4 hrs-P-4 hrs )
Introduction to Logic, Logical connectives, Converse, Inverse, Contrapositive, Proportional Equivalences, Propositional Calculus, Translating English sentences to Logical expressions.
Practice-1 : Finding the truth values of compound propositions using Python
Practice-2 : Writing conditional statements in Python
Project-1 : Study on equivalent statements in Logic
Project-2 : Study on Propositional Calculus
Module-II ( T-5 hrs-P-0 hrs-P-4 hrs )
Predicates, Quantifiers, Bound and free variables, Rules of inference, Derivation of Valid conclusion, Nested Quantifiers.
Project-3 : Study on Universal Quantifiers and Existential Quantifiers
Project-4 : Study on Valid arguments in Logic
Module-III ( T-4 hrs-P-0 hrs-P-4 hrs )
Recurrence Relation and it's solution by using Generating function, Pigeon-Hole Principle.
Project-5 : Study on different types of Recurrence relations
Project-6 : Study on Pigeon-Hole Principle
Module-IV ( T-4 hrs-P-6 hrs-P-2 hrs )
The basics of counting, Generalized Permutations, Combinations and their Applications.
Practice-3 : Finding Factorial of a number using Python
Practice-4 : Finding out the value of P(n,r) using Python
Practice-5 : Finding out the value of C(n,r) using Python
Project-7 : Study on permutations and combinations
Module-V ( T-4 hrs-P-2 hrs-P-2 hrs )
Relations and their operations and properties, Equivalence relation, Representation of a relation, Closure of a relation.
Practice-6 : Finding Composition of Relations using Python
Project-8 : Study on different types of Relations
Module-VI ( T-3 hrs-P-0 hrs-P-4 hrs )
Partial order relation, Partially ordered set and totally ordered set, Hasse diagram, Maximal and minimal elements, Greatest and least elements, Supremum and infimum of a Poset.
Project-9 : Study on partially ordered sets and Totally ordered sets
Project-10 : Study on Hasse Diagram
Module-VII ( T-5 hrs-P-0 hrs-P-4 hrs )
Lattice and it's algebraic structure, Properties of a Lattice, De-Morgan's Law, Bounded and Distributive Lattices, Boolean Algebra, Boolean Function.
Project-11 : Study on Lattices and Ordered Sets
Project-12 : Study on Boolean Algebra
Chapters: 1(1.1 To 1.5), 5(5.1, 5.2, 5.5), 6(6.1, 6.2, 6.4), 7, 10(10.1, 10.2).
Finding the truth values of compound propositions using Python
Writing conditional statements in Python
Study on equivalent statements in Logic
Study on Propositional Calculus
Study on Universal Quantifiers and Existential Quantifiers
Study on Valid arguments in Logic
Solving Recurrence Relations by using Generating Functions
Study on different types of Recurrence relations
Study on Pigeon-Hole Principle
Finding Factorial of a number using Python
Finding out the value of P(n,r) using Python
Finding out the value of C(n,r) using Python
Study on permutations and combinations
Relation and their properties and different types of relations
Finding Composition of Relations using Python
Study on different types of Relations
Study on partially ordered sets and Totally ordered sets
Study on Hasse Diagram
Boolean Functions and Axioms of Boolean algebra
Study on Lattices and Ordered Sets
Study on Boolean Algebra
MR. Sasi Bhusan Padhi works as an Assistant Professor, Department of Mathematics, Centurion University of Technology and Management. He has received M.Sc degree in Mathematics from Berhampur University in the year 2001 with Gold Medal. He has 17 years of teaching experience in different Graduate and Post Graduate colleges. Now he is doing research in […]