Skip to content
0091-484-2540360
[email protected]
Kalamassery, Kochi, Ernakulam
Search for:
TOP MENU
Primary Menu
HOME
ABOUT US
Albertian Institute of Science & Technology
Instructors
Annual Appraisal
Research & Consultancy @ AISAT
ALL COURSES
Departments
AI & ML Courses
ASH Courses
CE Courses
CSE Courses
ECE Courses
EEE Courses
ME Courses
First Year Courses
Applied Science & Humanities Courses
Engineering Chemistry Courses
Engineering Mathematics Courses
Engineering Physics Courses
English Courses
General Courses
General Courses
IIC Orientations
Physical Education Training
Placement Training
Research Orientation
Soft Skill Development
CONTACT US
PROFILE
LOGIN
Main Site
Search for:
Main Site
0091-484-2540360
[email protected]
Kalamassery, Kochi, Ernakulam
Home
All Courses
Computer Science & Engineering
DISCRETE MATHEMATICS
DISCRETE MATHEMATICS
Curriculum
7 Sections
42 Lessons
15 Weeks
Expand all sections
Collapse all sections
Introduction to Discrete Mathematics
1
1.1
Overview
Welcome to Discrete Mathematics Course
1
2.1
Welcome Video
Module_01 Sets, Relations, and Functions
9
3.1
Sets and Subsets, Venn Diagrams, Set Operations
3.2
Relations
3.3
Operations on Relations
3.4
Transitive closure of relations
3.5
Equivalence Relation
3.6
Partial Ordering
3.7
Functions
3.8
Cantor’s Diagonilization
3.9
Lagrange’s Theorem
Module_02 Mathematical Logics and Proofs
8
4.1
Mathematical Logic and Proofs
4.2
Propositional Logic
4.3
Predicate Logic
4.4
Logical Equivalence
4.5
Rules of Inference
4.6
Rules of Inference in Predicate Logic
4.7
Proof strategies Part 1
4.8
Proof strategies Part 2
Module_03 Induction and Recurrences
7
5.1
Induction
5.2
Recurrence Relations
5.3
Counting using Recurrence Relations
5.4
Solving Linear Homogeneous Recurrence Relations
5.5
Solving Linear Homogeneous Recurrence Relations Part II
5.6
Solving Linear Non-Homogeneous Recurrence Relations
5.7
Generating Functions
Group Theory
6
6.1
Groups
6.2
Group Theory
6.3
Cyclic Groups
6.4
Subgroups
6.5
Homomorphism and Isomorphism
6.6
Cosets and Lagrange’s Theorem
Review and exam preparation
10
7.1
Problems on Cantor diagonalization
7.2
Lagrange’s Theorem
7.3
Guidelines
7.4
Cyclic Group
7.5
Pigeon hole and counting
7.6
Rules of inference_1
7.7
Equivalence relations and equivalence classes
7.8
Logic puzzles
7.9
Function composition
7.10
Homomorphism
This content is protected, please
login
and
enroll
in the course to view this content!
Modal title
Main Content
