To understand the basic concept of Set theory, Relations and Functions.
To learn the concept of Tree and Graph theory to solve real-world computer science problems.
To acquire knowledge of discrete structure concept in computer science.
Develop logic to formulate and solve a problem using set theory
Apply knowledge using concept of relation and function to solve problems in computer science
Model computer science problems by using concept of tree and graph theory
Solve real world problems using graph and tree.
SET THEORY: Sets, Combinations of sets, Venn Diagrams, Finite
and Infinite sets, Uncountable infinite sets, Principle of inclusion and
exclusion, Multisets.
COUNTING: The Basics of Counting, Permutations and
Combinations, Binomial Coefficients, Algorithms for generating
Permutations and Combinations, The Pigeonhole Principle.
COUNTING PPT
RELATIONS : Relations and Their Properties, n-ary Relations and Their Applications, Representing Relations , Closures of Relations, Equivalence Relations, Partial Orderings - Chain, Anti chain and Lattice, Groups, Types of Groups.
FUNCTIONS: Surjective, Injective and Bijective functions, Inverse Functions and Compositions of Functions, Recursive Function.
GRAPH: Graph and Graph Models, Graph Terminology and Types of Graph, Representing Graph and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Single source shortest path- Dijkstra's pseudo code algorithm, Planar Graph.
TREES: Introduction, properties of trees, Binary search tree, decision tree, prefix codes and Huffman coding, Spanning Trees and Minimum Spanning Tree - Kruskal‘s and Prim‘s pseudo code algorithms , Case Study- Game Tree.