This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1. Q59 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. Q53 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. Q519 A tree with n vertices is a subgraph of K n . Student Response Value Correct Answer True 100% True Score: 10/10 4. Q51 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. Q54 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. Q516 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.
 Spring '12
 sdaf

Click to edit the document details