Discrete Structure

Chapter 1 : Set Theory and Logic

Set Theory and Logic are foundational areas of mathematics and computer science that provide tools for understanding and analyzing collections of objects and their relationships, as well as reasoning systematically.

Chapter 2 : Relations and Functions

Relations and functions are mathematical concepts used to describe relationships between elements of two sets. They are fundamental in mathematics, computer science, and related fields.

Chapter 3 : Counting and Probability

Counting and probability are fundamental areas in mathematics and statistics that focus on quantifying outcomes and measuring the likelihood of events.

Chapter 4 : Graph Theory

Graph theory is a branch of discrete mathematics that studies graphs, which are mathematical structures used to model pairwise relationships between objects. It is widely used in computer science, network analysis, operations research, and many other fields.

Chapter 5 : Finite Automata

Finite automata are mathematical models of computation used to design and analyze the behavior of systems with a finite number of states. They are fundamental in computer science, particularly in the study of formal languages, compilers, and digital circuit design.

Assignment

Assignment 1 (chapter 1 & 2)

Assignment 2 (chapter 2 & 3)

Assignment 3 (chapter 3 & 4)

Assignment 4 (chapter 4 & 5)