lec17-18 - CS C341 I S C361 Data Structures Algorithms...

This preview shows pages 1–6. Sign up to view the full content.

Click to edit Master subtitle style 2/7/11 Sundar B. CS C341 / I S C361 Partially Ordered Data Totally Ordered Data vs. Partially Ordered Data - ADT Priority Queue Data Structure for Priority Queue - A Heap - Representation (Binary Trees and Arrays) - Implementation of Operations Heap Sort 11

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2/7/11 Sundar B. Partial Order A (binary) relation R, subset of S x S,&is said to be a partial order if (it is reflexive: x R x for all x in S) it is transitive: x R y and y R z implies x R z for x,y,z in S it is anti-symmetric: x R y and y R x implies x = y Example “is an ancestor of” on persons “under-writes” on companies Question: 22
2/7/11 Sundar B. Total Order A (binary) relation R, subset of S x S, is said to be a total order if x R y OR y R x for any x and y in S. Examples: <= on real numbers “is at least as old as” on persons 33

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2/7/11 Sundar B. Total Order vs. Partial Order Implications: 5th element? Minimum element? Linear Order – Refer Discrete Structures Least common ancestor Join and Meet – Refer Discrete Structures 44
2/7/11 Sundar B. Total Order vs. Partial Order Application: Consider a multi-processing operating system More than one process could be waiting (for CPU) Processes are to be scheduled No self knowledge or co-ordination among processes Need a queue for “ ready” processes Need a strategy for adding/deleting processes 55

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 19

lec17-18 - CS C341 I S C361 Data Structures Algorithms...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online