Subject classification: this is a mathematics resource.

Logic

- Overview (A.pdf)
- Functions (A.pdf)
- K-Map (A.pdf)


  • Logic in Haskell (pdf)


Proof


Set theory


  • Sets in Haskell (pdf)


Functions and Relations


  • Functions in Haskell (pdf)
  • Relations in Haskell (pdf)


Algorithms

  • Algorithms
- Overview (A.pdf)
- Bubble Sort (B.pdf)
- Insertion Sort (C.pdf)
- Binary Search (D.pdf)
  • The Growth of Functions (A.pdf)
  • The Complexity of Algorithms (A.pdf)



Induction and Recursion


  • Induction and Recursion in Haskell (pdf)


Number theory


  • Number Theory in Haskell


Combinatorics


Probability



Graphs


  • Graph Drawing in Latex (A.pdf)
  • Network Analysis using R (A.pdf)


Trees

  • Tree Background (pdf)
  • Tree Traversal (pdf)
  • Binary Search Tree (pdf)


  • Tree Drawing in Latex (A.pdf)


Automata

  • Finite State Machine (pdf)
  • Finite State Automata (pdf)
  • Push Down Automata (pdf)
  • Turing Machine (pdf)


Formal Language

  • Regular Language (pdf)
  • Context Free Language (pdf)
  • Recursively Enumerable Language Language (pdf)


Discrete Calculus


Topology


Operations research


Note



go to [ Electrical_&_Computer_Engineering_Studies ]

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.