PREV

NEXT

• Introduction to Discrete Mathematics &Basics of Counting
• The pigeonhole principle
• Permutations and Combinations
• Binomial coefficient and identities
• Advanced Counting Techniques-Application of recurrence relation
• Solving of linear recurrence relation ,Generating functions
• Inclusion - Exclusion
• Graphs and graph models
• Mid term exam
• Special types of graph
• Representing graphs and graph isomorphism
• Connectivity
• Euler and Hamilton paths
• Shortest path problems
• Trees
• Relations ,their properties,n-ary relation
• Closure of relation
• Final term exam