Operating System
[email protected]
Exam
40% unannounced quiz
60% final exam
Teaching method
Reference book
1.2
Reference book
System Concepts, Seventh Edition, Avi Silberschatz, Peter Baer
Galvin a
8.6 Partial orderings
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Content
Partial Order
14/ 10/ 10
Linear order ( ?)
Quasio
Discrete Mathematical Structures
Trees ( ?)
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Application
?
?
?
?
?
14/ 9/ 4
Coll
6.3 Bayes Theorem
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Example 1
14/ 9/ 3
We have two boxes. The first contains two
Discrete Mathematical Structures
Graph Coloring
?
Yang Juan
[email protected]
YangJuan
College of Computer Science & Technology
[email protected]
Beijing University of Posts &
CollegeofComputerScience
Discrete Mathematical Structures
Minimum Spanning Trees
( ?)
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Weighted graph ( ?
Discrete Mathematical Structures
Shortest Path Problem
( ?)
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Many problems in t
Discrete Mathematical Structures
Euler Paths and Circuits ( ?
?)
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Problem
CanId
Discrete Mathematical Structures
Planar Graphs
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Planar Graphs ?
A graph is calle
What are Graphs?
Not
Generalmeaningineverydaymath:
Aplotorchartofnumericaldatausinga
coordinatesystem.
Technicalmeaningindiscretemathematics:
Aparticularclassofdiscretestructures(tobe
defined)thatisus
9.4: Connectivity
In an undirected graph, a path of length n
from u to v is a sequence of adjacent edges
going from vertex u to vertex v.
A path is a circuit if u=v.
A path pass through the vertices o
8.6 Partial orderings
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
Content
Partial Order
2013/11/6
Linear order
Quasiorder
P
8.5 Equivalence
Relations
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
Definition
A relation R on a set A is an equivalence
Relations
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
8 Relations
2013/11/6
8.1 Relations and Their Properties
8.2 n-ary Re
8.4 Closures of Relations
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
Closures of Relations
Definition
3 elements:
2013/11/
8.5 Equivalence Relations
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Definition
A relation R on a set A is an equivalence
8.4 Closures of Relations
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
Closures of Relations
Definition
3 elements:
14/ 9/ 3
Relations
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
8 Relations
14/ 9/ 3
8.1 Relations and Their Properties
?
8.2 n-ary
7.3: Divide & Conquer
R.R.s
Main points so far:
Many types of problems are solvable by
reducing a problem of size n into some
number a of independent subproblems, each
of size n/b, where a1 and b>1.
7.4: Generating Functions
Definition: The generating function for the
sequence a0,a1.ak of real numbers is the
infinite series
G ( x) =a0 +a1 x +L ak x k +L = ak x k
k =0
14/ 9/ 3
College of Computer
7.4: Generating
Functions
Definition: The generating function for the
sequence a0,a1.ak of real numbers is the
infinite series
G( x) a0 a1 x
2013/11/6
ak x k
College of Computer Science & Technology
7.3: Divide & Conquer
R.R.s
Main points so far:
Many types of problems are solvable by
reducing a problem of size n into some
number a of independent subproblems, each
of size n/b, where a1 and b>1.
Advanced Counting
Techniques
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
7 Advanced Counting
Techniques
7.1 Recurrence Rela
6.3 Bayes Theorem
Yang Juan
[email protected]
College of Computer Science &
Technology
Beijing University of Posts &
Telecommunications
Example 1
2013/11/6
We have two boxes. The first contains two
Advanced Counting
Techniques
Yang Juan
[email protected]
College of Computer Science & Technology
Beijing University of Posts &
Telecommunications
7 Advanced Counting
Techniques
7.1 Recurrence Rela