5.00
(1 Rating)

CMPE 139 [Bilgi university] [Logic and Discrete Mathematics]

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This course covers basic mathematical definitions and computer science and engineering applications. At the end of this course, students will be equipped with the relationship between theoretical mathematics and practical computer science and engineering. Students are expected to actively participate in lectures and practice hours.

What Will You Learn?

  • Logic
  • Logic, Boolean algebra, Modeling Computation.
  • Mathematical Proof Techniques
  • Sets and Functions
  • Sequences and Summations, Cardinality of Sets, Algorithms
  • Divisibility and Modular Arithmetic, Solving Congruences
  • Cryptography
  • Counting
  • Discrete Probability
  • Relations
  • Graphs and Graph Terminology
  • Graph Isomorphism and Connectivity

Course Content

Proposition

  • Proposition
    01:30:00

Propositional Equivalences

Quantifires

Boolean Algebra

Rules of Inference

Proofs

Sets

Functions

Division

Module Uses

Mod part 2

Counting Principles 1

Counting Principles 2

week9

week 9 : Bayes Theorem

Relations

Student Ratings & Reviews

5.0
Total 1 Rating
5
1 Rating
4
0 Rating
3
0 Rating
2
0 Rating
1
0 Rating
RG
Raihana Grine
1 month ago
best explanation , thank you :)
Open chat
💬 كيف يمكنني مساعدتك؟
مرحبا Ostazy
كيف يمكن ان اساعدك