CSIT - Discrete Structure Notes - Tu Bsc.Csit Notes & Solutions

Overview

Title: Discrete Structures and Mathematics - Course Contents Overview

Notes for Discrete Structures Notes 

Unit 1: Basic Discrete Structures

• Understanding Sets, Functions, Sequences (7 Hrs)

  • Sets: Definitions, Operations, Representations
  • Functions: Types, Graphs, Functions in Computer Science, Fuzzy Sets
  • Sequences and Summations: Basics, Progressions, Summation Concepts

  Notes and Resources:

  • PDF Document: [Link to Basic Discrete Structures PDF]

Unit 2: Integers and Matrices

• Exploring Integers and Matrices (6 Hrs)

  • Integers: Division, Number Theory Applications, Algorithms
  • Matrices: Zero-One Matrices, Boolean Operations

  Notes and Resources:

  • PDF Document: [Link to Integers and Matrices PDF]

[Continue the pattern for Units 3 through 6]

Unit 3: Logic and Proof Methods

• Understanding Logic and Proofs (6 Hrs)

  • Logic: Propositional Logic, Quantifiers, Rules of Inferences
  • Proof Methods: Terminology, Direct/Indirect Proofs, Mistakes in Proofs

  Notes and Resources:

  • PDF Document: [Link to Logic and Proof Methods PDF]

Unit 4: Induction and Recursion

• Exploring Induction and Recursion (5 Hrs)

  • Induction: Mathematical Induction, Well Ordering
  • Recursive Definitions, Algorithms, Proving Correctness

  Notes and Resources:

  • PDF Document: [Link to Induction and Recursion PDF]

Unit 5: Counting and Discrete Probability

• Understanding Counting and Probability (9 Hrs)

  • Counting: Principles, Pigeonhole, Permutations, Combinations
  • Discrete Probability: Introduction, Hashing, Expected Value, Randomized Algorithms
  • Advanced Counting: Recurrence Relations, Solving Homogeneous and Non-Homogeneous Equations

  Notes and Resources:

  • PDF Document: [Link to Counting and Discrete Probability PDF]

Unit 6: Relations and Graphs

• Exploring Relations, Graphs, and Trees (12 Hrs)

  • Relations: Properties, Representations, Equivalence, Partial Ordering
  • Graphs: Basics, Types, Connectivity, Algorithms (Dijkstra’s Algorithm)
  • Trees: Traversals, Spanning Trees, Minimum Spanning Trees
  • Network Flows: Commodity Flow Models, Max Flow-Min Cut Theorem

  Notes and Resources:

  • PDF Document: [Link to Relations and Graphs PDF]

Related Notes and Documents

Find All Document Related to Discrete Structure Here

×