Discrete Structures 40-115 
  CE Department- Sharif University of Technology Spring 2012 - Group 2 

  Main Menu
   Home
   Syllabus
   Assignments
   Grades
   Calendar
   Resources
   Piazza

Calendar

 Date   Topic  Comments
  1390/11/16     Basics of Counting   §5.1, 5.3
  1390/11/18     Generalized Permutations and Combinations   §5.4, 5.5
  1390/11/23     Inclusion-Exclusion Principle   §7.5, 7.6
  1390/11/25     Generating Permutations and Combinations   §5.6
  1390/11/30     Propositional Logic and Equivalences   §1.1, 1.2
  1390/12/02     Predicates and Quanitifiers   §1.3, 1.4, 1.5
  1390/12/07     Rules of Inference, Proof Techniques   §1.6, 1.7
  1390/12/09     Set Theory   §2.1, 2.2
  1390/12/14     Functions and Sequences   §2.3, 2.4
  1390/12/21     Number Theory   §3.4, 3.5, 3.6
  1391/01/20     Pigeonhole Principle   §5.2
  1391/01/22     Mathematical Induction   §4.1, 4.2
  1391/01/24     Midterm 1   
  1391/01/27     Recurrence Relations   §7.1
  1391/01/29     Solving Recurrence Relations   §7.2
  1391/02/03     Generating Functions   §7.4
  1391/02/05     Relations   §8.1
  1391/02/10     Representing Relations, Closures   §8.3, 8.4
  1391/02/12     Equivalence Relations, Partial Orders   §8.5, 8.6
  1391/02/17     Lattices, Boolean Algebra   §8.6, 11.1
  1391/02/19     Midterm 2   
  1391/02/24     Graph Theory, Introduction   §9.1, 9.2, 9.3
  1391/02/26     Connectivity, Extremality, Euler and Hamiltonian Paths   §9.4, 9.5
  1391/02/31     Planar Graphs, Graph Coloring   §9.7, 9.8
  1391/03/02     Trees, Spanning Trees   §10.1, 10.4, 10.5
  1391/03/07     Modelling Computation, Regular Languages   §12.3, 12.4
  1391/03/09     Turing Machines   §12.5

 This website is visited 103896 times since February 2012. Updated Thursday 1970-01-01 03:30