# montu - 1 Q5-9 Let G=(V E be a pseudograph with vertices V...

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

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.

Unformatted text preview: 1. Q5-9 Let G=(V, E) be a pseudograph, with vertices V = {a, b, c, d, e}, and edges {a, b}, {b, c }, {c, d}, {a, b}, {d, b}, {b, e}, {c, e}. Is the subgraph H=(G\{a, d, e}, E) a complete graph? Student Response Value Correct Answer A. Yes 100% B. No Score: 10/10 2. Q5-3 A binary relation from A to B is a proper subset of A x B. Student Response Value Correct Answer False 100% False Score: 10/10 3. Q5-19 A tree with n vertices is a subgraph of K n . Student Response Value Correct Answer True 100% True Score: 10/10 4. Q5-1 A recurrence relation is a formula expressing terms of a sequence, except for some initial terms, as a function of one or more previous terms of the sequence. Student Response Value Correct Answer False 0% True Score: 0/10 5. Q5-4 A relation R on A is reflexive if (a, a) is in R for all a in A. Student Response Value Correct Answer True 100% True Score: 10/10 6. Q5-16 In a rooted tree, a leaf has no siblings....
View Full Document

## This note was uploaded on 03/11/2012 for the course LSDHFA 234 taught by Professor Sdaf during the Spring '12 term at UOIT.

### Page1 / 6

montu - 1 Q5-9 Let G=(V E be a pseudograph with vertices V...

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

View Full Document
Ask a homework question - tutors are online