Lecture 13

Exam 1 Review

With Question/Answer Animations

© 2019 McGraw-Hill Education. All rights reserved. Authorized only for instructor use in the classroom.  No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education.
• Topics in Exam 2
Chapter 2 - Sections 2.1, 2.2, 2.3
Chapter 9 - Full chapter
except Warshall's algorithm
Chapter 10 - Sections 10.1 to 10.8 excluding 10.7

© 2019 McGraw-Hill Education

• Question Types
1 - Fill in the blanks
2 - True/ False
3 – Problems
4 – Comparisons
5,6 and 7 – Problems

© 2019 McGraw-Hill Education

• Tips to do well
1 - Read the covered section from book
2 - Solve the exercises for these sections
3 – Solve problem sets
4 – Go through lecture slides and notes
5 – Practice

© 2019 McGraw-Hill Education

• Tips to do well
1 - Come 10 min. early for exam
2 - Bring extra pen/pencil and eraser
3 – Bring ID
4 – Read questions carefully
5 – If you can’t solve then move quickly to next
question time is limited

© 2019 McGraw-Hill Education

• Set Theory
Set Concepts
Set Operations

© 2019 McGraw-Hill Education

• Principle of Inclusion-Exclusion
Solving problems for it.

© 2019 McGraw-Hill Education

• Properties of Relation
R = {(0, 0),(1,1),(1,2),(1,3),(2,0),(2,2), (2,3), (3,0),
(3,3)
Find if the given relation is reflexive, symmetric,
anti-symmetric and transitive
Find reflexive, symmetric and transitive closure of
the relation

© 2019 McGraw-Hill Education

• Properties of Relation
a, b € R if a+b > 3
R = {(1,3),(2,2), (2,3), (3,1), (3,2), (3,3)}
Find if the given relation is reflexive, symmetric,
anti-symmetric and transitive
Find reflexive, symmetric and transitive closure of
the relation

© 2019 McGraw-Hill Education

• Properties of Relation
Equivalence relation
Partial Ordering relation

© 2019 McGraw-Hill Education

• Graph
Graph Terminology
Graph Isomorphism
Euler and Hamilton Path
Euler and Hamilton Circuit

© 2019 McGraw-Hill Education

• Graph-
Problem Solving on board

© 2019 McGraw-Hill Education