Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Discrete Math

    Uploaded by

    nel baradi
    This document outlines the chapters and topics covered in the course MTM 215: Discrete Mathematics. The course covers topics in set theory, relations, functions, counting techniques, graph theory, properties of integers, and Boolean algebra. It explores concepts like sets, Venn diagrams, relations, functions, sequences, recursion, graphs, trees, integers, primes, and Boolean logic. The goal is to introduce students to discrete structures and mathematical reasoning.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Discrete Math

    Uploaded by

    nel baradi
    37 views1 page
    This document outlines the chapters and topics covered in the course MTM 215: Discrete Mathematics. The course covers topics in set theory, relations, functions, counting techniques, graph theory, properties of integers, and Boolean algebra. It explores concepts like sets, Venn diagrams, relations, functions, sequences, recursion, graphs, trees, integers, primes, and Boolean logic. The goal is to introduce students to discrete structures and mathematical reasoning.

    Original Description:

    course outline

    Original Title

    discrete math

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the chapters and topics covered in the course MTM 215: Discrete Mathematics. The course covers topics in set theory, relations, functions, counting techniques, graph theory, properties of integers, and Boolean algebra. It explores concepts like sets, Venn diagrams, relations, functions, sequences, recursion, graphs, trees, integers, primes, and Boolean logic. The goal is to introduce students to discrete structures and mathematical reasoning.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    37 views1 page

    Discrete Math

    Uploaded by

    nel baradi
    This document outlines the chapters and topics covered in the course MTM 215: Discrete Mathematics. The course covers topics in set theory, relations, functions, counting techniques, graph theory, properties of integers, and Boolean algebra. It explores concepts like sets, Venn diagrams, relations, functions, sequences, recursion, graphs, trees, integers, primes, and Boolean logic. The goal is to introduce students to discrete structures and mathematical reasoning.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    MTM 215: DISCRETE MATHEMATICS

    Course Outline
    Chapter 1 Set Theory
    - Sets and Elements, Subsets
    - Venn Diagram
    - Set Operations
    - Algebra of Sets, Duality
    - Finite Sets, Power Sets, Partitions
    - Classes of Sets, Power Sets, Partitions
    - Mathematical Induction
    Chapter 2 Relations
    - Products Sets
    - Relations
    - Pictorial Representatives of Relations
    - Composition of Relations
    - Types of Relations
    - Closure Properties
    - Equivalence Relations
    - Partial Ordering Relations
    Chapter 3 Functions and Algorithm Functions
    - Mathematical Functions, Exponential and Logarithmic Functions
    - Sequences, Indexed Classes of Sets
    - Recursively Defined Functions
    - Cardinality
    - Algorithm and Functions
    Chapter 4 Advanced Counting Techniques, Recursion
    - Combinations with Repetitions
    - Ordered and Unordered Partitions
    - Inclusion-Exclusion Principle Revisited
    - Pigeonhole Relations
    - Recurrence Relation
    - Linear Recurrence Relations with Constant Coefficients
    - Second-Order Homogeneous Linear Recurrence Relations
    - General Homogeneous Recurrence Relations
    Chapter 5 Graph Theory
    - Graphs and Multigraphs
    - Subgraphs, Isomorphic and Homeomorphic Graphs
    - Paths, connectivity
    - Traversable and Eulerian Graphs, Bridges Of Königsberg
    - Labeled and Weighted Graphs
    - Complete, Regular, and Bipartite Graphs
    - Tree Graphs
    - Planar Graphs
    - Graph Colorings
    - Graph Algorithms
    - Travelling-Salesman Promblem
    Chapter 6 Properties of Integers
    - Order and Inequalities, Absolute Value
    - Mathematical Induction
    - Division Algorithm
    - Divisibility Primes
    - Greatest Common Divisor, Euclidean Algorithm
    - Fundamental Theorem of Arithmetic
    Congruence Relation
    Chapter 7 Boolean Algebra
    - Basic Definitions
    - Duality
    - Basic Theorems
    - Representation Theorem
    - Sum-of-Products Form for Sets

    You might also like