Scribd
Upload
14 views3 pages

Bal Lekhsi2

dhon lekhsi vaia 1

Uploaded by

editor's bench
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views3 pages

Bal Lekhsi2

dhon lekhsi vaia 1

Uploaded by

editor's bench
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Discrete Mathematics Class Notes

1. Introduction to Discrete Mathematics

 Discrete Mathematics: The study of mathematical structures that are fundamentally discrete
rather than continuous.

 Applications: Used in computer science, cryptography, algorithm design, and more.

2. Sets and Set Operations

 Set: A collection of distinct objects.

o Notation: ( A = {1, 2, 3} )

o Subset: ( A \subseteq B ) if every element of ( A ) is also in ( B ).

 Operations:

o Union: ( A \cup B ) (elements in ( A ) or ( B ) or both).

o Intersection: ( A \cap B ) (elements in both ( A ) and ( B )).

o Difference: ( A - B ) (elements in ( A ) but not in ( B )).

o Complement: ( \overline{A} ) (elements not in ( A )).

3. Logic and Propositional Calculus

 Propositions: Statements that are either true or false.

o Logical Connectives: AND (( \land )), OR (( \lor )), NOT (( \neg )), IMPLIES (( \
rightarrow )).

o Truth Tables: Used to determine the truth value of logical expressions.

 Logical Equivalences: Statements that are true in the same situations.

o Examples: ( p \land q \equiv q \land p ), ( p \lor q \equiv q \lor p ).

4. Functions

 Function: A relation between a set of inputs and a set of permissible outputs.

o Notation: ( f: A \rightarrow B )

o Types:

 Injective (One-to-One): Each element of ( A ) maps to a unique element of ( B ).

 Surjective (Onto): Every element of ( B ) is mapped by some element of ( A ).

 Bijective: Both injective and surjective.

5. Algorithms and Complexity


 Algorithm: A step-by-step procedure for solving a problem.

o Examples: Sorting algorithms (Bubble Sort, Merge Sort), Search algorithms (Binary
Search).

 Complexity: Measures the efficiency of an algorithm.

o Big O Notation: Describes the upper bound of an algorithm’s running time.

 Examples: ( O(1) ), ( O(n) ), ( O(n^2) ).

6. Graph Theory

 Graph: A set of vertices connected by edges.

o Types:

 Undirected Graph: Edges have no direction.

 Directed Graph (Digraph): Edges have a direction.

o Terminology:

 Vertex (Node): A point in the graph.

 Edge (Link): A connection between two vertices.

 Degree: The number of edges connected to a vertex.

 Special Graphs:

o Complete Graph: Every pair of vertices is connected by an edge.

o Bipartite Graph: Vertices can be divided into two disjoint sets such that no two vertices
within the same set are adjacent.

7. Combinatorics

 Counting Principles:

o Addition Principle: If there are ( n ) ways to do one thing and ( m ) ways to do another,
there are ( n + m ) ways to do either.

o Multiplication Principle: If there are ( n ) ways to do one thing and ( m ) ways to do


another, there are ( n \times m ) ways to do both.

 Permutations: Arrangements of objects in a specific order.

o Formula: ( P(n, r) = \frac{n!}{(n-r)!} )

 Combinations: Selections of objects without regard to order.

o Formula: ( C(n, r) = \frac{n!}{r!(n-r)!} )

8. Recurrence Relations
 Recurrence Relation: An equation that recursively defines a sequence.

o Example: Fibonacci sequence ( F(n) = F(n-1) + F(n-2) ) with initial conditions ( F(0) = 0 ),
( F(1) = 1 ).

 Solving Recurrence Relations: Methods include iteration, characteristic equations, and


generating functions.

9. Number Theory

 Prime Numbers: Numbers greater than 1 with no positive divisors other than 1 and itself.

 Greatest Common Divisor (GCD): The largest positive integer that divides two numbers
without leaving a remainder.

o Euclidean Algorithm: A method for finding the GCD of two numbers.

These notes provide a comprehensive overview of discrete mathematics, suitable for a class discussion
or study guide. If you need more detailed explanations or specific examples, feel free to ask!

You might also like