JENETTE JOYCE ANAPI

UGRD-CS6105 Discrete Mathematics

1. Dashboard
2. My courses
3. UGRD-CS6105-2023T
4. Week 2: Sets
5. Prelim Quiz 1

Started on Sunday, 22 November

2020, 2:32 PM

State Finished

Completed on Sunday, 22 November

2020, 3:07 PM

Time taken 34 mins 59 secs

Grade 20.00 out of 20.00

(100%)

Question 1
Correct

Mark 1.00 out of 1.00

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a square,

and the other is a triangle. Each shape is drawn in a single color. Suppose you believe me when

I tell you that if the square is blue, then the triangle is green. What do you therefore know about

the truth value of the following statement?

If the triangle is not green, then the square is not blue. The answer is: [The statement is

TRUE]

Question 1
Correct

Mark 1.00 out of 1.00

Question text
Does a rational r value for r2 =6 exist?
Select one:
a.
No, a rational r does not exist.
b.
Yes, a rational r exist.

Question text 2

Determine whether the sentence below is an atomic statement, a molecular statement, or not a

statement at all.

Customer must wear shoes [Not Statement]

Question 3
Correct

Mark 1.00 out of 1.00

Classify the sentence below as an atomic statement, a molecular statement, or not a statement

at all. If the statement is molecular, identify what kind it is (conjuction, disjunction, conditional,

biconditional, negation).

Every natural number greater than 1 is either prime or composite.

The answer is: [Molecular,Conditional]

Flag question

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a square,

and the other is a triangle. Each shape is drawn in a single color. Suppose you believe me when

I tell you that if the square is blue, then the triangle is green. What do you therefore know about

the truth value of the following statement?

The square and the triangle are both green.

The answer is: The Statement is False

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Classify the sentence below as an atomic statement, a molecular statement, or not a statement

at all. If the statement is molecular, identify what kind it is (conjuction, disjunction, conditional,

biconditional, negation).

The Broncos will win the Super Bowl or I’ll eat my hat.

The answer is: [Molecular, Conjuctional]

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Find | R | when R = {2, 4, 6,..., 180}

The answer is: 90

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A ∩ B
Select one:
{1, 2, 6, 7}
{3, 4, 5}
{5, 6, 7}
{1, 2, 3}
The answer is: {3, 4, 5}

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A U B

Select one:
{1, 2, 3, 5, 6, 7}
{1, 2, 3, 4, 5, 6, 7}
{3, 4, 5}
{1, 2, 6, 7

The answer is: : {1, 2, 3, 4, 5, 6, 7}

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Classify the sentence below as an atomic statement, a molecular statement, or not a statement

at all. If the statement is molecular, identify what kind it is (conjuction, disjunction, conditional,

biconditional, negation).

We can have donuts for dinner, but only if it rains.

The answer is: [Molecular] [Conditional]
Question 10
Correct

Mark 1.00 out of 1.00

In my safe is a sheet of paper with two shapes drawn on it in colored crayon. One is a square,

and the other is a triangle. Each shape is drawn in a single color. Suppose you believe me when

I tell you that if the square is blue, then the triangle is green. What do you therefore know about

the truth value of the following statement?

The square and the triangle are both blue.

The answer is: The statement is FALSE

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the cardinality of R = {20,21,...,39, 40}
| R | = Answer ( 21 )

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The cardinality of {3, 5, 7, 9, 5} is 5.
Select one:
True
False

Question 13
Correct

Mark 1.00 out of 1.00

Flag question
Question text

Classify the sentence below as an atomic statement, a molecular statement, or not a statement

at all. If the statement is molecular, identify what kind it is (conjuction, disjunction, conditional,

biconditional, negation).

The sum of the first 100 odd positive integers.

The answer is: [Atomic] [N/A]
Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find |A ∩ B| when A = {1, 3, 5, 7, 9} and B {2, 4, 6, 8, 10} “The answer is: 0”

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B

Select one:
{1, 2}
{3, 4, 5}
{1, 2, 3, 4, 5, 6, 7}
{1, 2, 6, 7}
The answer is: {1,2}

Question 16
Correct

Mark 1.00 out of 1.00

Flag question
Question text

Determine whether the sentence below is an atomic statement, a molecular statement, or not a

statement at all.

The customers wore shoes and they wore socks. [ Molecular ]

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Determine whether the sentence below is an atomic statement, a molecular statement, or not a

statement at all.

The customers wore shoes. The answer is: [Atomic]

Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Let A = {3, 4, 5}. Find the cardinality of P(A).
Answer: 8

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Classify the sentence below as an atomic statement, a molecular statement, or not a statement

at all. If the statement is molecular, identify what kind it is (conjuction, disjunction, conditional,

biconditional, negation).
Everybody needs somebody sometime.
The answer is: [Atomic] [N/A]

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the cardinality of S = {1, {2,3,4},0}
| S | = Answer: 3

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Select one:
{1, 2, 6, 7}
{3, 4, 5}
{1, 2, 3}
{5, 6, 7}
The answer is: {3, 4, 5}
Question 2
Correct

Mark 1.00 out of 1.00

Flag question
Find f (1)
Select one:
a.
1
b.
3
c.
4
d.
2

The answer is: 4

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Determine the given number of elements in A U B.

The answer is: 18

Question 4
Correct

Mark 1.00 out of 1.00

Flag question
Consider the function f : N → N given by f (0) 0 and f (n + 1) f + 2n + 1. Find f (6).

The answer is: 36

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Let A, B and C represent people who like apples, bananas, and carrots respectively. The

number of people in A = 10, B = 12 and C = 16. Three people are such that they enjoy apples,

bananas as well as carrots. Two of them like apples and bananas. Let three people like apples

and carrots. Also, four people are such that they like bananas and carrots.

How many people like apples only? 226616

How many people like only one of the three? 226616

The answer is: [2 and 26]

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B

Select one:
{1, 2, 3, 5, 6, 7}
{1, 2, 3, 4, 5, 6, 7}
{1, 2, 6, 7}
{3, 4, 5}
The answer is: : {1, 2, 3, 4, 5, 6, 7}

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
For a function f : N → N, a recursive definition consists of an initial condition together with
a recurrence relation .

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Rule that states that every function can be described in four ways: algebraically (a formula),
numerically (a table), graphically, or in words.
Select one:
a.
Rule of function
b.
Rule of thumb
c.
Rule of four

The answer is: Rule of Four

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Answer the following:

 f (1) = 4231

What is the element n in the domain such as f =1 4231

Find an element n of the domain such

that f = n. 4231

The answer is: that f = n. [3]

Question 10
Correct

Mark 2.00 out of 2.00

Flag question

Question text
How many 3-letter words with or without meaning, can be formed out of the letters of the word,
'LOGARITHMS', if repetition of letters is not allowed?
The answer is:
( 720 )

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Defined as the product of all the whole numbers from 1 to n.

The answer is: Factorial

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text

In how many different ways can the letters of the word 'OPTICAL' be arranged so that the

vowels always come together?

The answer is: 720
Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Given the diagram, answer the following questions

How many people takes tea and wine? 32
How many people takes coffee but not tea and wine? 45
What is the difference of persons who take wine and coffee to the persons who the persons who
takes tea only? 15

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The ________________________ states that if event A can occur in m ways, and event B can
occur in n disjoint ways, then the event “A or B” can occur in m + n ways.
Select one:
a.
Distributive principle
b.
Additive principle
c.
Commutative principle
The answer is: Additive principle
Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Additive principle states that if given two sets A and B, we have |A × B| |A| · |B|.
Select one:
True
False

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be
formed?
Select one:
a.
2100
b.
210
c.
21100
d.
244000

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
GIven the function :

f : Z → Z defined by f = 3n
Which of the following is a possible range of the function?
Select one:
a.
All numbers except 3
b.
3,4,5,6,7,8,9,10
c.
3,6,9,12 only
d.
all multiples of three
e.
1,2,3

Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
IN combinations, the arrangement of the elements is in a specific order.
Select one:
True
False

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a rule that assigns each input exactly one output
The answer is: Function

Question 1
Correct

Mark 1.00 out of 1.00

Question text
Does a rational r value for r2 =6 exist?
Select one:
a.
No, a rational r does not exist.
b.
Yes, a rational r exist.
Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following the logic representation of proof by contrapositive?
Select one:
a.
P → Q = ¬Q → ¬P
b.
P → Q = ¬Q → P
c.
P → Q = Q → ¬P
d.
P → Q = ¬(Q → P)
Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Let ‘G’ be a connected planar graph with 20 vertices and the degree of each vertex is 3. Find
the number of regions in the graph.
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 4
Correct

Mark 1.00 out of 1.00

Flag question

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

THE ANSWER IS: 4

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following statements is NOT TRUE?
Select one:
a.
Any tree with at least two vertices has at least two vertices of degree two.
b.
A graph F is a forest if and only if between any pair of vertices in F there is at most one path.
c.
Let T be a tree with v vertices and e edges. Then e v − 1.
Flag question

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

Select one:
True
False

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Solve for the value of n in
−4= n+7 over 6
The answer is: -31

Question 8
Correct

Mark 1.00 out of 1.00

Flag question
Question text

A Euler pathEuler circuitEuler's Rule is a Euler pathEuler circuitEuler's Rule which starts and

stops at the same vertex.

The answer is: A [Euler circuit] is a [Euler path] which starts and stops at the same vertex.
Question 9
Correct

Mark 1.00 out of 1.00

Flag question

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

The answer is: Proof by contradiction

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A function which renames the vertices.
Select one:
a.
non-isomorphism
b.
isomorphism
Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
What is the minimum height height of a full binary tree?
The answer is: 2
Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Answer is the simplest style of proof.
The answer is: Direct Proof

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
An undirected graph G which is connected and acyclic is called ___ tree
_________.
Select one:
a.
cyclic graph
b.
tree
c.
bipartite graph
d.
forest
Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
For all n in rational, 1/n ≠ n - 1
Select one:
True
False
SOLUTION; 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

The answer is: FALSE

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

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

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the contrapositive of the given statement.
If you travel to London by train, then the journey takes at least two hours.
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.
Question 17
Correct

Mark 1.00 out of 1.00

Flag question
Question text
If the right angled triangle t, with sides of length a and b and hypotenuse of length c, has
area equal to c2/4, what kind of triangle is this?

Select one:
a.
scalene triangle
b.
isosceles triangle
c.
obtuse triangle
SOLUTION; (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.

The answer is; ISOSCELES Triangle.

Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the
graph). A walk in which no edge is repeated is called a trail, and a trail in which no vertex is
repeated (except possibly the first and last) is called a path
Select one:
a.
Walk
b.
Subgraph
c.
Vertex coloring

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is an algorithm for traversing or searching tree or graph data structures.
Select one:
a.
spanning tree
b.
depth first search.
c.
breadth first search
Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text

The tree elements are called verticeselementsedgesnodes

The answer is: The tree elements are called [nodes]
Question 1
Correct

Mark 1.00 out of 1.00

Question text
What is the missing term?

3,9,__,81....
The answer is: 27
Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Identify the propositional logic of the truth table given
Select one:
a.
conjunction
b.
negation
c.
implication
d.
disjunction
Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Arithmetic progression is the sum of the terms of the arithmetic series.
Select one:
True
False

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The sum of the geometric progression is called geometric series
Select one:
True
False

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The study of what makes an argument good or bad. LOGIC
Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text

What is the 4th and 8th element of a = n^(2) ?

Select one:
a.
8,16
b.
64,16
c.
32,64
d.
16,64
Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A set of statements, one of which is called the conclusion and the rest of which are called
premises.
The answer is; argument

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Answer is a function from a subset of the set of integers.
The answer is; Sequence

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
match the following formulas to its corresponding sequence

answers; 1 choose Arithmetic SeriesGeometric SeriesDouble Summation

Answer 2Choose...Arithmetic SeriesGeometric SeriesDouble Summation

The correct answer

is: →

Geometric Series, → Double Summation

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Given the series : 2,5,8,11....
What is the type of progression? Arithmetic
What is the sum from 1st to 5th element? 40

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Assume the sequence: 1,3,5,7,9, ….

What is the 20th term? 31GeometricArithmetic 29

What type of progression this suggest? 31GeometricArithmetic 29

The answer is: What is the 20th term? [29]
What type of progression this suggest? [Arithmetic ]
Question 12
Correct

Mark 1.00 out of 1.00

Question text
Match the truth tables to its corresponding propositional logic
Answer 1Choose...Disjunction,Conjunction,Implication

Answer 2Choose...Disjunction,Conjunction,Implication

Answer 3Choose...Disjunction,Conjunction,Implication
The correct answer is: → Disjunction, →

Conjunction, → Implication

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many possible output will be produced in a proposition of three statements?
The correct answer is: 8

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The geometric sequences uses common Answer in finding the succeeding terms.T
The answer is: factor

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Deduction rule is an argument that is not always right.
Select one:
True
False

Question 16
Correct
Mark 1.00 out of 1.00

Flag question

Question text
¬P ∨ Q is equivalent to :
Select one:
a.
¬P ∧ ¬Q
b.
P→Q
c.
¬(P∨Q)
Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
De Morgan's law is used in finding the equivalence of a logic expression using other logical
functions.
Select one:
True

False
Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A sequence that involves a common difference in identifying the succeeding terms.
Select one:
a.
Geometric Progression
b.
Arithmetic Progression
Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
¬(P ∨ Q) is logically equal to which of the following expressions?
Select one:
a.
¬P ∨ ¬Q
b.
¬P ∨ Q
c.
¬P ∧ ¬Q.
Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Logic EquivalenceDeductionTautology is the same truth value under any assignment of truth

values to their atomic parts.

The answer is: [Logic Equivalence] is the same truth value under any assignment of truth
values to their atomic parts

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A connected graph with no cycles.
Answer: TREE

Question 2
Correct

Mark 1.00 out of 1.00

Flag question
Question text
It is the switching the hypothesis and conclusion of a conditional statement.
Answer: Converse

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text

If two vertices are adjacent, then we say one of them is the parent of the other, which is called

the grandparent childparent of the parent.

The answer is: If two vertices are adjacent, then we say one of them is the parent of the other,
which is called the [child] of the parent.
Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Indicate which, if any, of the following graphs G = (V, E, φ), |V | = 5, is not connected.
Select one:
a.
φ = ( 1 {1,2} 2 {1,2} 3 {2,3} 4 {3,4} 5 {1,5} 6 {1,5} )
b.
φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )
c.
φ = ( a {1,2} b {2,3} c {1,2} d {2,3} e {3,4} f {1,5} )

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A Bipartite graph is a graph for which it is possible to divide the vertices into two disjoint sets
such that there are no edges between any two vertices in the same set.
Select one:
True
False

Question 5
Correct

Mark 1.00 out of 1.00

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Indicate which, if any, of the following three graphs G = (V, E, φ), |V | = 5, is not isomorphic to
any of the other two.
Select one:
a.
φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )
b.
φ = ( b {4,5} f {1,3} e {1,3} d {2,3} c {2,4} a {4,5} )
c.
φ = ( f {1,2} b {1,2} c {2,3} d {3,4} e {3,4} a {4,5} )

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The given graph is planar.
Select one:
True
False

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The minimum number of colors required in a proper vertex coloring of the graph.
Answer: Chromatic number

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The number of simple digraphs with |V | = 3 is Answer; : 512

Question 11
Correct

Question text
The number of edges incident to a vertex.
Answer:Degree of a vertex

Question 12
Correct

Mark 2.00 out of 2.00

Flag question

Question text

Fill in the blanks.

A graph F is a two pathsone pathbranchforest if and only if between any pair of vertices in F

there is at most two pathsone pathbranchforest .

ThE ANSWER IS; A graph F is a [forest] if and only if between any pair of vertices in F there is
at most [one path].

Question 13
Correct

Mark 4.00 out of 4.00

Flag question

Question text
Match the following properties of trees to its definition.

Answer 1Choose...4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph F is a
Proposition forest if and only if between any pair of vertices in F there is at most one pathAny tree
4.2.3 with at least two vertices has at least two vertices of degree one.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.
 Answer 2Choose...4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph F is a
Proposition forest if and only if between any pair of vertices in F there is at most one pathAny tree
4.2.1 with at least two vertices has at least two vertices of degree one.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

Answer 3Choose...4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph F is a
Corollary forest if and only if between any pair of vertices in F there is at most one pathAny tree
4.2.2 with at least two vertices has at least two vertices of degree one.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

Answer 4Choose...4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph F is a
Proposition forest if and only if between any pair of vertices in F there is at most one pathAny tree
4.2.4 with at least two vertices has at least two vertices of degree one.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

THE ANSWER IS; Proposition 4.2.3 → Any tree with at least two vertices has at least two
vertices of degree one., Proposition 4.2.1 → A graph T is a tree if and only if between every pair
of distinct vertices of T there is a unique path., Corollary 4.2.2 → A graph F is a forest if and
only if between any pair of vertices in F there is at most one path, Proposition 4.2.4 → 4 Let T
be a tree with v vertices and e edges. Then e v − 1.

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The child of a child of a vertex is called
The correct answer is: grandchild

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Two graphs that are the same are said to be _______________
Select one:
a.
isometric
b.
isochoric
c.
isomorphic
Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many spanning trees are possible in the given figure? 4
Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the
graph). A walk in which no edge is repeated is called a trail, and a trail in which no vertex is
repeated (except possibly the first and last) is called a path.
THE ANSWER IS; Walk

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Paths start and stop at the same vertex.
Select one:
True
False

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A path which visits every vertex exactly once
Answer: Hamilton Path
Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many edges would a complete graph have if it had 6 vertices?
Select one:
a.
20
b.
25
c.
15
d.
30
Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is false?
Select one:
a.
A graph with one odd vertex will have an Euler Path but not an Euler Circuit.
b.
Euler circuits exist when the degree of all vertices are even
c.
A graph with more than two odd vertices will never have an Euler Path or Circuit.
d.
Euler Paths exist when there are exactly two vertices of odd degree.
Question 6
Correct

Mark 1.00 out of 1.00

Flag question
Question text
All graphs have Euler's Path
Select one:
True
False

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
When a connected graph can be drawn without any edges crossing, it is called
________________ .
Select one:
a.
Edged graph
b.
Spanning graph
c.
Planar graph

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A sequence of vertices such that every vertex in the sequence is adjacent to the vertices before
and after it in the sequence
THE ANSWER IS; Walk
Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Does this graph have an Euler Path, Euler Circuit, both, or neither?
Select one:
a.
Euler Path
b.
Euler Circuit
c.
Both
d.
None
Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Tracing all edges on a figure without picking up your pencil or repeating and starting and
stopping at different spots
Select one:
a.
Euler Path
b.
Euler Circuit
Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A Answer graph has two distinct groups where no vertices in either group connecting to
members of their own group

The correct answer is: bipartite

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
These are lines or curves that connect vertices.
THE ASWER IS: Edges

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A Answer graph has no isolated vertices.
The correct answer is: connected

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Circuits start and stop at _______________
Select one:
a.
same vertex
b.
different vertices
Question 15
Correct

Mark 4.00 out of 4.00

Flag question

Question text
Match the following properties of trees to its definition.

Answer 1Choose...A graph F is a forest if and only if between any pair of vertices in F there
Corollary is at most one pathAny tree with at least two vertices has at least two vertices of degree
4.2.2 one.4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

Answer 2Choose...A graph F is a forest if and only if between any pair of vertices in F there
Proposition is at most one pathAny tree with at least two vertices has at least two vertices of degree
4.2.4 one.4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

Answer 3Choose...A graph F is a forest if and only if between any pair of vertices in F there
Proposition
is at most one pathAny tree with at least two vertices has at least two vertices of degree
4.2.1 one.4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

Answer 4Choose...A graph F is a forest if and only if between any pair of vertices in F there
Proposition is at most one pathAny tree with at least two vertices has at least two vertices of degree
4.2.3 one.4 Let T be a tree with v vertices and e edges. Then e v − 1.A graph T is a tree if and
only if between every pair of distinct vertices of T there is a unique path.

THE ANSWER IS; Corollary 4.2.2 → A graph F is a forest if and only if between any pair of
vertices in F there is at most one path, Proposition 4.2.4 → 4 Let T be a tree with v vertices and
e edges. Then e v − 1., Proposition 4.2.1 → A graph T is a tree if and only if between every pair
of distinct vertices of T there is a unique path., Proposition 4.2.3 → Any tree with at least two
vertices has at least two vertices of degree one.

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Euler paths must touch all edges.
Select one:
True
False

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A simple graph has no loops nor multiple edges.
Select one:
True
False

Every connected graph has a spanning tree.

Select one:
True
False
A spanning tree that has the smallest possible combined weight.

minimum spanning tree

Answer:

tree
A connected graph with no cycles. (If we remove the requirement that the graph is
connected, the graph is called a forest.) The vertices in a tree with degree 1 are
leaves
called

What is the line covering number of for the following graph?

A graph is an ordered pair G (V, E) consisting of a nonempty set V (called the vertices) and a set
E (called the edges) of two-element subsets of V.
Select one:
True
False

A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique
path.

Select one:
True
False

It is a connected graph containing no cycles.

Answer: tree

A tree is the same as a forest.

Select one:
True
False

bijection
A is a function which is both an injection and surjection. In other words, if every
element of the codomain is the image of exactly one element from the domain

Indicate which, if any, of the following three graphs G = (V, E, φ), |V | = 5, is not isomorphic to
any of the other two.

Select one:
a.
φ = ( b {4,5} f {1,3} e {1,3} d {2,3} c {2,4} a {4,5} )

b.
φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )

c.
φ = ( f {1,2} b {1,2} c {2,3} d {3,4} e {3,4} a {4,5} )

Suppose P and Q are the statements:

P: Jack passed math.
Q: Jill passed math.
Translate "¬(P ν Q) → Q" into English.

Select one:
a.
Neither Jack or Jill passed math.

b.
If Jack or Jill did not pass math, then Jill passed math.

c.
Jill passed math if and only if Jack did not pass math.

d.
If Jack did not pass math and Jill did not pass math, then Jill did not pass math.

In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

Select one:
True
False

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

Select one:
a.
forest

b.
bipartite graph

c.
cyclic graph

d.
tree
A statement which is true on the basis of its logical form alone.

Select one:
a.
Double Negation

b.
De Morgan's Law

c.
Tautology

Consider the statement, “If you will give me a cow, then I will give you magic beans.” Determine
whether the statement below is the converse, the contrapositive, or neither.

Converse
 If you will give me a cow, then I will not give you magic beans.

Consider the statement, “If you will give me a cow, then I will give you magic beans.” Determine
whether the statement below is the converse, the contrapositive, or neither.

Contrapositive
 If I will not give you magic beans, then you will not give me a cow.

Two edges are adjacent if they share a vertex.

 Select one:
 True
 False

Consider the statement, “If you will give me a cow, then I will give you magic beans.” Determine
whether the statement below is the converse, the contrapositive, or neither.

Neither
 If I will give you magic beans, then you will give me a cow.

inverse image
• The of a a subset B of the codomain is the set f −1 (B) {x ∈ X : f (x) ∈ B}.
A graph in which every pair of vertices is adjacent.
Complete graph
Answer: