Skip Navigation Links Türkçe  
Skip Navigation Links.

BIM 122 - Discrete Computational Structures

Instructor: Asst.Prof.İsmail SAN
Teaching Assistants:
Course Book:

Discrete Mathematics and Its Applications Global Edition, 7/e, by Kenneth Rosen and Kamala Krithivasan

Grading:
Other Resources:
Course Outline:
1. Week

Welcome to the Course!

  • Introduction to BIM122

The Foundations: Logic and Proofs

  • Propositional Logic
  • Applications of Propositional Logic

2. Week

The Foundations: Logic and Proofs

  • Propositional Equivalences
  • Predicate Logic and Quantifiers

3. Week
  • Predicate Logic and Quantifiers
  • Nested Quantifiers

4. Week
  • Rules of Inference
  • Introduction to Proofs

5. Week

6. Week

Basic Structures: 

  • Sets
  • Functions
  • Sequences
  • Sums
  • Matrices

7. Week

Boolean Algebra: 

  • Boolean Functions
  • Representing Boolean Functions
  • Logic Gates
  • Minimization of Circuits

8. Week

Modeling Computation: 

  • Finite State Machines with outputs
  • Finite State Machines without outputs
  • Turing Machine

9. Week

Algorithms: 

  • Algorithms
  • Growth of Functions
  • Complexity of Algorithms

10. Week

Number Theory and Cryptography: 

  • Divisibility and Modular Arithmetic
  • Integer Representations and Algorithms
  • Primes and Greatest Common Divisors
  • Solving Congruences
  • Applications of Congruences
  • Cryptography

11. Week

Graphs: 

  • Graphs and Graph Models
  • Graph Terminology and Special Types of Graphs
  • Representing Graphs

Home | Department | Undergraduate | Graduate | Research | Accreditations | Alumni

© 2011 CENG. All rights reserved.

Valid XHTML 1.0 Transitional Valid CSS!