9/8/2020 Midterm Quiz 2: Attempt review

Home / My courses / CS 6202C_1 / Week 9: Graphs / Midterm Quiz 2

Started on Tuesday, 8 September 2020, 11:33 AM

State Finished
Completed on Tuesday, 8 September 2020, 11:38 AM
Time taken 5 mins 49 secs
Grade 20.00 out of 20.00 (100%)

Question 1
The tree elements are called nodes
Complete

Mark 1.00 out of

1.00

Your answer is correct.

Question 2 An undirected graph G which is connected and acyclic is called ____________.

Complete

Mark 1.00 out of Select one:

1.00
a. cyclic graph

b. forest

c. bipartite graph

d. tree

Your answer is correct.

Question 3 Proofs that is used when statements cannot be rephrased as implications.

Complete

Mark 1.00 out of

1.00 Answer: Proof by Contradiction

Question 4 A function which renames the vertices.

Complete

Mark 1.00 out of Select one:

1.00
a. isomorphism

b. non-isomorphism

Your answer is correct.

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 1/6
9/8/2020 Midterm Quiz 2: Attempt review

Question 5 Find the contrapositive of the given statement.

Complete
If you travel to London by train, then the journey takes at least two hours.
Mark 1.00 out of
1.00
Select one:
a. If your journey by train takes more than two hours, then you don't travel to London.

b. If your journey by train takes less than two hours, then you don’t travel to London.

Your answer is correct.

Question 6 Which of the following statements is NOT TRUE?

Complete

Mark 1.00 out of Select one:

1.00
a. A graph F is a forest if and only if between any pair of vertices in F there is at most one path.

b. Let T be a tree with v vertices and e edges. Then e v − 1.

c. Any tree with at least two vertices has at least two vertices of degree two.

Your answer is correct.

Question 7 Let ‘G’ be a connected planar graph with 20 vertices and the degree of each vertex is 3. Find the
Complete number of regions in the graph.
Mark 1.00 out of
1.00
Answer: 12

Solution
By the sum of degrees theorem,
20 ∑ i=1 deg(Vi) = 2|E|

20(3) = 2|E|
|E| = 30

By Euler’s formula,
|V| + |R| = |E| + 2

20+ |R| = 30 + 2
|R| = 12

Hence, the number of regions is 12.

Question 8
If n is a rational number, 1/n does not equal n-1.
Complete

Mark 1.00 out of

1.00
Select one:
True

False

Question 9
What is the minimum height height of a full binary tree?
Complete

Mark 1.00 out of

1.00

Answer: 3
https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 2/6
9/8/2020 Midterm Quiz 2: Attempt review
Answer: 3

Question 10 What is the matching number for the following graph?

Complete

Mark 1.00 out of

1.00

Answer: 4

Question 11
As soon as one vertex of a tree is designated as the root
  , then every other vertex on the tree can be
Complete
characterized by its position relative to the root.
Mark 1.00 out of
1.00 edge tree

Your answer is correct.

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 3/6
9/8/2020 Midterm Quiz 2: Attempt review

Question 12 Which of the following the logic representation of proof by contrapositive?

Complete

Mark 1.00 out of Select one:

1.00
a. P → Q = ¬Q → P

b. P → Q = ¬(Q → P)

c. P → Q = ¬Q → ¬P

d. P → Q = Q → ¬P

Your answer is correct.

Question 13 Solve for the value of n in :

Complete
−4= n+7 over 6
Mark 1.00 out of
1.00

Answer: -31

Question 14 A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the graph). A
Complete walk in which no edge is repeated is called a trail, and a trail in which no vertex is repeated (except
Mark 1.00 out of possibly the first and last) is called a path
1.00

Select one:
a. Vertex coloring

b. Walk

c. Subgraph

Your answer is correct.

Question 15 It is an algorithm for traversing or searching tree or graph data structures.

Complete

Mark 1.00 out of Select one:

1.00
a. depth first search.

b. breadth first search 

c. spanning tree

Your answer is correct.

Question 16
A Euler circuit is a Euler path which starts and stops at the same vertex.
Complete

Mark 1.00 out of

1.00

Your answer is correct.

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 4/6
9/8/2020 Midterm Quiz 2: Attempt review

Question 17
direct proof
Complete
is the simplest style of proof.
Mark 1.00 out of
1.00

Question 18 Does a rational r value for  r2 =6 exist?

Complete

Mark 1.00 out of Select one:

1.00
a. No, a rational r does not exist.

b. Yes, a rational r exist.

Your answer is correct.

r2 = 6
 
r = √(6)
 
The number 6 is not a perfect square.  Also, the square root of 6 cannot be written as a simple fraction
because there many significant non-repeating digits after the decimal point.

Question 19
If the right angled triangle t, with sides of length a and b and hypotenuse of length c,
Complete
has area equal to c2/4, what kind of triangle is this?
Mark 1.00 out of
1.00

Select one:
a. isosceles triangle 

b. obtuse triangle

c. scalene triangle

Your answer is correct.

(a2+b2)/4=(1/2)ab
Multiply both sides by 4 to get:

a2+b2=2ab
Solving for 0 we get:

a2-2ab+b2=0
And factoring the polynomial we get:

(a-b)2=0
Take the square root of both sides:

±(a-b)=0
a=b

Therefore, a triangle with two equal sides is an ISOSCELES Triangle.

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 5/6
9/8/2020 Midterm Quiz 2: Attempt review

Question 20 For all n in rational, 1/n ≠ n - 1

Complete

Mark 1.00 out of Select one:

1.00
True

False

 1 ? n2 - n
 
 0 ? n2 - n - 1
 
Solve the quadratic
 
  n = ( - (-1) ± √ (1 - 4(1)(-1))) / 2(1)
 
  n = ( 1 ±  √ 5 ) / 2
 
√ 5 is an irrational number, therefore
 
(1/n) ≠ n - 1 for rational n's

◄ week9 ppt Jump to... Module 11 ►

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=545107&cmid=31731 6/6