Question 44

Answer saved
Marked out of 1.00

Remove flag

Question text

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 statement is FALSE

The square is not blue or the triangle is green.

Question 33
Answer saved
Marked out of 1.00

Remove flag

Question text

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 statement is TRUE

If the triangle is green, then the square is blue.

Question 50
Answer saved
Marked out of 1.00
 Flag question

Question text

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.

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

Question 49
Answer saved
Marked out of 1.00

Flag question

Question text

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.

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

Question 48
Answer saved
Marked 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 45
Answer saved
Marked 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.
244000

b.
2100

c.
210

d.
21100

Question 44
Answer saved
Marked out of 1.00

Flag question

Question text
inverse image
• The Answer of a a subset B of the codomain is the set f −1 (B) {x ∈ X : f (x) ∈ B}.

Question text
Find |A ∩ B| when A = {1, 3, 5, 7, 9} and B {2, 4, 6, 8, 10}
 0
Answer:
Question 39
Answer saved
Marked 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.
1,2,3
c.
3,6,9,12 only

d.
all multiples of three

e.
3,4,5,6,7,8,9,10
Question 34
Answer saved
Marked out of 1.00

Flag question

Question text
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.

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

Question 31
Answer saved
Marked out of 1.00

Flag question

Question text
bijection
A Answer 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

Question text
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.
Jill passed math if and only if Jack did not pass math.

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

d.
If Jack or Jill did not pass math, then Jill passed math.
Question 25
Answer saved
Marked out of 1.00

Flag question
 Question text
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.

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

Question 24
Answer saved
Marked out of 1.00

Flag question

Question text
The cardinality of {3, 5, 7, 9, 5} is 5.

Select one:
True
False
Question 22
Answer saved
Marked out of 1.00

Flag question

Question text
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.

• You will give me a cow and I will not give you magic
Contrapositive
beans.

Question 19
Answer saved
Marked out of 1.00
 Flag question

Question text
range
The Answer is a subset of the codomain. It is the set of all elements which are assigned
to at least one element of the domain by the function. That is, the range is the set of all outputs.

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 four

b.
Rule of thumb

c.
Rule of function

Question 16
Answer saved
Marked 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 6
Answer saved
Marked out of 1.00
 Flag question

Question text

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 statement is FALSE

The square and the triangle are both green.

Question 3
Answer saved
Marked out of 1.00

Flag question

Question text
surjective and injecive are opposites of each other.

Select one:
True
False
Question 1
Answer saved
Marked out of 1.00

Flag question

Question text
Suppose P and Q are the statements:
P: Jack passed math.
 Q: Jill passed math.
Which of the following translates into “Jack and Jill both passed math” into symbols?

Select one:
a.
P→Q

b.
PΛQ

c.
PνQ

d.
¬(P Λ Q)

Question 1
Not answered
Marked out of 1.00

Flag question

Question text
All graphs have Euler's Path

Select one:
True
False
Feedback
The correct answer is 'False'.

Question 2
Not answered
Marked out of 1.00

Flag question

Question text
Paths start and stop at the same vertex.

Select one:
True
False
Feedback
The correct answer is 'False'.

Question 3
Not answered
Marked 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

Feedback
The correct answer is: bipartite

Question 4
Not answered
Marked 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

Feedback
The correct answer is: walk

Question 5
Not answered
Marked out of 4.00
 Flag question

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

Feedback
Your answer is incorrect.
The correct answer is: 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.4 → 4 Let T be a tree with
v vertices and e edges. Then e v − 1., 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.3 → Any tree with
at least two vertices has at least two vertices of degree one.

Question 6
Not answered
Marked out of 1.00

Flag question

Question text
A simple graph has no loops nor multiple edges.

Select one:
True
False
Feedback
The correct answer is 'True'.

Question 7
Not answered
Marked out of 1.00

Flag question

Question text
These are lines or curves that connect vertices.

Feedback
The correct answer is: Edges

Question 8
Not answered
Marked 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 Paths exist when there are exactly two vertices of odd degree.

c.
A graph with more than two odd vertices will never have an Euler Path or Circuit.

d.
Euler circuits exist when the degree of all vertices are even
Feedback
Your answer is incorrect.
The correct answer is: A graph with one odd vertex will have an Euler Path but not an Euler
Circuit.

Question 9
Not answered
Marked out of 1.00

Flag question

Question text
Circuits start and stop at _______________

Select one:
a.
different vertices

b.
same vertex
Feedback
Your answer is incorrect.
The correct answer is: same vertex

Question 10
Not answered
Marked out of 1.00

Flag question

Question text
A path which visits every vertex exactly once

Feedback
The correct answer is: Hamilton Path

Question 11
Not answered
Marked out of 1.00

Flag question

Question text
Euler paths must touch all edges.

Select one:
True
False
Feedback
The correct answer is 'True'.

Question 12
Not answered
Marked out of 1.00

Flag question

Question text
A Answer graph has no isolated vertices.

Feedback
The correct answer is: connected

Question 13
Not answered
Marked out of 1.00

Flag question

Question text
How many edges would a complete graph have if it had 6 vertices?

Select one:
a.
30

b.
20

c.
25

d.
15
Feedback
Your answer is incorrect.
The correct answer is: 15
Question 14
Not answered
Marked out of 1.00

Flag question

Question text
Does this graph have an Euler Path, Euler Circuit, both, or neither?

Select one:
a.
Euler Circuit

b.
None

c.
Euler Path

d.
Both
Feedback
Your answer is incorrect.
The correct answer is: Both

Question 15
Not answered
Marked 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.

Feedback
The correct answer is: Walk

Question 16
Not answered
Marked 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
Feedback
Your answer is incorrect.
The correct answer is: Euler Circuit

Question 17
Not answered
Marked 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.
Planar graph

c.
Spanning graph
Feedback
Your answer is incorrect.
The correct answer is: Planar graph

Question 1
Not answered
Marked out of 1.00

Flag question

Question text
The number of edges incident to a vertex.

Feedback
The correct answer is: Degree of a vertex

Question 2
Not answered
Marked out of 1.00
 Flag question

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

Feedback
The correct answer is: Chromatic number

Question 3
Not answered
Marked out of 1.00

Flag question

Question text
A connected graph with no cycles.

Feedback
The correct answer is: tree

Question 4
Not answered
Marked 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.
φ = ( b {4,5} f {1,3} e {1,3} d {2,3} c {2,4} a {4,5} )
 b.
φ = ( f {1,2} b {1,2} c {2,3} d {3,4} e {3,4} a {4,5} )

c.
φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )
Feedback
Your answer is incorrect.
The correct answer is: φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )

Question 5
Not answered
Marked out of 1.00

Flag question

Question text
The child of a child of a vertex is called

Feedback
The correct answer is: grandchild

Question 6
Not answered
Marked out of 1.00

Flag question

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

Select one:
True
False
Feedback
The correct answer is 'False'.
Question 7
Not answered
Marked out of 1.00

Flag question

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

Answer:
Feedback
The correct answer is: 4

Question 8
Not answered
Marked out of 1.00

Flag question

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

Feedback
The correct answer is: 512

Question 9
Not answered
Marked out of 1.00

Flag question

Question text
Two graphs that are the same are said to be _______________

Select one:
a.
isomorphic

b.
isometric

c.
isochoric
Feedback
Your answer is incorrect.
The correct answer is: isomorphic

Question 10
Not answered
Marked out of 4.00

Flag question

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

Feedback
Your answer is incorrect.
The correct answer is: 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.3 →
Any tree with at least two vertices has at least two vertices of degree one., Proposition 4.2.4
→ 4 Let T be a tree with v vertices and e edges. Then e v − 1.

Question 11
Not answered
Marked out of 1.00

Flag question
 Question text
The given graph is planar.

Select one:
True
False
Feedback
The correct answer is 'True'.

Question 12
Not answered
Marked out of 1.00

Flag question

Question text
It is the switching the hypothesis and conclusion of a conditional statement.

Feedback
The correct answer is: Converse

Question 13
Not answered
Marked out of 2.00

Flag question

Question text

Fill in the blanks.

A graph F is a if and only if between any pair of vertices in F there is at

most .
Feedback
Your answer is incorrect.
The correct answer is:
Fill in the blanks.
A graph F is a [forest] if and only if between any pair of vertices in F there is at most [one
path].

Question 14
Not answered
Marked 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 of the parent.

Feedback
Your answer is incorrect.
The correct 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 15
Not answered
Marked 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.
φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )

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

c.
φ = ( 1 {1,2} 2 {1,2} 3 {2,3} 4 {3,4} 5 {1,5} 6 {1,5} )
Feedback
Your answer is incorrect.
The correct answer is: φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )

Question 16
Not answered
Marked 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
Feedback
The correct answer is 'True'.

Question 1
Not answered
Marked out of 1.00

Flag question

Question text
¬P ∨ Q is equivalent to :

Select one:
 a.
¬(P∨Q)

b.
P→Q

c.
¬P ∧ ¬Q
Feedback
Your answer is incorrect.
The correct answer is: P → Q

Question 2
Not answered
Marked out of 1.00

Flag question

Question text
Deduction rule is an argument that is not always right.

Select one:
True
False
Feedback
The correct answer is 'False'.

Question 3
Not answered
Marked out of 1.00

Flag question

Question text
What is the missing term?
3,9,__,81....

Feedback
The correct answer is: 27

Question 4
Not answered
Marked out of 1.00

Flag question

Question text
The geometric sequences uses common Answer in finding the succeeding
terms.

Feedback
The correct answer is: factor

Question 5
Not answered
Marked 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
Feedback
Your answer is incorrect.
The correct answer is: ¬P ∧ ¬Q.

Question 6
Not answered
Marked out of 1.00

Flag question

Question text
Answer is a function from a subset of the set of integers.

Feedback
The correct answer is: Sequence

Question 7
Not answered
Marked out of 1.00

Flag question

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

Feedback
The correct answer is: logic

Question 8
Not answered
Marked out of 1.00

Flag question

Question text

is the same truth value under any assignment of truth values to their

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

Question 9
Not answered
Marked out of 1.00

Flag question

Question text
Arithmetic progression is the sum of the terms of the arithmetic series.

Select one:
True
False
Feedback
The correct answer is 'False'.

Question 10
Not answered
Marked out of 1.00

Flag question

Question text
How many possible output will be produced in a proposition of three statements?

Feedback
The correct answer is: 8

Question 11
Not answered
Marked 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.

Feedback
The correct answer is: argument

Question 12
Not answered
Marked out of 1.00

Flag question

Question text

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

What is the 20th term?

What type of progression this suggest?

Feedback
Your answer is incorrect.
The correct answer is:
Assume the sequence: 1,3,5,7,9, ….
What is the 20th term? [29]
What type of progression this suggest? [Arithmetic ]
Question 13
Not answered
Marked 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
Feedback
Your answer is incorrect.
The correct answer is: Arithmetic Progression

Question 14
Not answered
Marked 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
Feedback
The correct answer is 'True'.
Question 15
Not answered
Marked out of 1.00

Flag question

Question text

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

Select one:
a.
64,16

b.
8,16

c.
32,64

d.
16,64
Feedback
Your answer is incorrect.
The correct answer is: 16,64

Question 16
Not answered
Marked out of 1.00

Flag question

Question text
Identify the propositional logic of the truth table given
Select one:
a.
disjunction

b.
negation

c.
conjunction

d.
implication
Feedback
Your answer is incorrect.
The correct answer is: negation

Question 17
Not answered
Marked out of 1.00

Flag question

Question text
Match the truth tables to its corresponding propositional logic

Choose...
Answer 1

Choose...
Answer 2
 Choose...
Answer 3

Feedback
Your answer is incorrect.

The correct answer is: → Implication, →

Disjunction, → Conjunction

Question 18
Not answered
Marked out of 1.00

Flag question

Question text
match the following formulas to its corresponding sequence

Feedback
Your answer is incorrect.
The correct answer

is: → Geometric

Series, → Double Summation

Question 19
Not answered
Marked out of 1.00

Flag question

Question text
The sum of the geometric progression is called geometric series

Select one:
True
False
Feedback
The correct answer is 'True'.

Question 20
Not answered
Marked out of 1.00

Flag question

Question text
Given the series : 2,5,8,11....
What is the type of progression? blank
What is the sum from 1st to 5th element? blank
Arithmetic Geometric 14 40
Feedback
Your answer is incorrect.
The correct answer is:
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 1
Not answered
Marked 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:
Feedback

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.

The correct answer is: 12

Question 2
Not answered
Marked out of 1.00

Flag question

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

Feedback
The correct answer is: 3

Question 3
Not answered
Marked out of 1.00

Flag question

Question text

A is a which starts and stops at the same vertex.

Feedback
Your answer is incorrect.
The correct answer is:
A [Euler circuit] is a [Euler path] which starts and stops at the same vertex.

Question 4
Not answered
Marked out of 1.00
 Flag question

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.
Feedback
Your answer is incorrect.
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.

The correct answer is: No, a rational r does not exist.

Question 5
Not answered
Marked out of 1.00

Flag question

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

Question 6
Not answered
Marked out of 1.00

Flag question

Question text
A function which renames the vertices.

Select one:
a.
non-isomorphism
b.
isomorphism
Feedback
Your answer is incorrect.
The correct answer is: isomorphism

Question 7
Not answered
Marked out of 1.00

Flag question

Question text
Which of the following statements is NOT TRUE?

Select one:
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.
Any tree with at least two vertices has at least two vertices of degree two.

c.
Let T be a tree with v vertices and e edges. Then e v − 1.
Feedback
Your answer is incorrect.
The correct answer is: Any tree with at least two vertices has at least two vertices of degree
two.

Question 8
Not answered
Marked out of 1.00

Flag question

Question text
Answer is the simplest style of proof.

Feedback
The correct answer is: Direct Proof

Question 9
Not answered
Marked 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.
obtuse triangle
 b.
isosceles triangle

c.
scalene triangle
Feedback
Your answer is incorrect.
(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 correct answer is: isosceles triangle

Question 10
Not answered
Marked 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)
Feedback
Your answer is incorrect.
The correct answer is: P → Q = ¬Q → ¬P

Question 11
Not answered
Marked out of 1.00

Flag question

Question text

The tree elements are called

Feedback
Your answer is incorrect.
The correct answer is:
The tree elements are called [nodes]

Question 12
Not answered
Marked 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.
Feedback
Your answer is incorrect.
The correct answer is: If your journey by train takes less than two hours, then you don’t
travel to London.

Question 13
Not answered
Marked out of 1.00

Flag question

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

Answer:
 Feedback

The correct answer is: 4

Question 14
Not answered
Marked out of 1.00

Flag question

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

Select one:
 True
False
Feedback
The correct answer is 'False'.

Question 15
Not answered
Marked out of 1.00

Flag question

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

Select one:
True
False
Feedback
The correct answer is 'True'.

Question 16
Not answered
Marked 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.
Subgraph
 b.
Walk

c.
Vertex coloring
Feedback
Your answer is incorrect.
The correct answer is: Walk

Question 17
Not answered
Marked out of 1.00

Flag question

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

Select one:
a.
depth first search.

b.
breadth first search

c.
spanning tree
Feedback
Your answer is incorrect.
The correct answer is: breadth first search

Question 18
Not answered
Marked out of 1.00

Flag question
 Question text
An undirected graph G which is connected and acyclic is called ____________.

Select one:
a.
forest

b.
cyclic graph

c.
tree

d.
bipartite graph
Feedback
Your answer is incorrect.
The correct answer is: tree

Question 19
Not answered
Marked out of 1.00

Flag question

Question text
As soon as one vertex of a tree is designated as the blank , then every other vertex on the
tree can be characterized by its position relative to the root.
tree root edge
Feedback
Your answer is incorrect.
The correct answer is:
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.

Question 20
Not answered
Marked out of 1.00
 Flag question

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

Feedback
The correct answer is: Proof by contradiction

Question 1
Correct
Mark 1.00 out of 1.00

Flag question

Question text

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

36
Answer:
Feedback
The correct answer is: 36

Question 2
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, 6, 7}

{1, 2, 3, 4, 5, 6, 7}

{3, 4, 5}
Feedback
Your answer is correct.
The correct answer is: {1, 2, 3, 4, 5, 6, 7}

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

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

Feedback
The correct answer is: factorial

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text
 Answer the following:

4
f (1) =

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

Find an element n of the domain such

3
that f = n.

Feedback
Your answer is correct.
The correct answer is:

Answer the following:

f (1) = [4]

What is the element n in the domain such as f = 1 [2]

Find an element n of the domain such

that f = n. [3]

Question 5
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
Feedback
The correct answer is 'False'.

Question 6
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?
720

Feedback
The correct answer is: 720

Question 7
Correct
Mark 1.00 out of 1.00

Flag question

Question text
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.

2
How many people like apples only?

26
How many people like only one of the three?

Feedback
Your answer is correct.
The correct answer is:
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? [2]
How many people like only one of the three? [26]

Question 8
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.
21100

c.
210

d.
244000
Feedback
Your answer is correct.
The correct answer is: 210

Question 9
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 multiples of three

b.
All numbers except 3

c.
3,6,9,12 only

d.
3,4,5,6,7,8,9,10
 e.
1,2,3
Feedback
Your answer is correct.
The correct answer is: all multiples of three

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text

Determine the number of elements in A U B.

18

Feedback
The correct answer is: 18

Question 11
Correct
Mark 1.00 out of 1.00

Flag question

Question text
 Find f (1).

Select one:
a.
4

b.
1

c.
3

d.
2
Feedback
Your answer is correct.
The correct answer is: 4

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is a rule that assigns each input exactly one output
function

Feedback
The correct answer is: function

Question 13
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 thumb

b.
Rule of function

c.
Rule of four
Feedback
Your answer is correct.
The correct answer is: Rule of four

Question 14
Correct
Mark 1.00 out of 1.00

Flag question

Question text

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
24
 Feedback
Your answer is correct.
The correct answer is:

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 15
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?

720
Answer :
Feedback
Your answer is correct.
The correct answer is:
In how many different ways can the letters of the word 'OPTICAL' be arranged so that the
vowels always come together?
Answer : [720]
Question 16
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.
Additive principle

b.
Commutative principle

c.
Distributive principle
Feedback
Your answer is correct.
The correct answer is: Additive principle

Question 17
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 .
recurrence
Feedback
Your answer is correct.
The correct answer is:
For a function f : N → N, a [recursive] definition consists of an [initial condition] together
with a [recurrence relation] .

Question 18
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:

{5, 6, 7}

{1, 2, 3}

{3, 4, 5}

{1, 2, 6, 7}
Feedback
Your answer is correct.
The correct answer is: {3, 4, 5}

Question 19
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
Feedback
The correct answer is 'False'.

Question 1
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 Broncos will win the Super Bowl or I’ll eat my hat.

Molecular Conjunction

Feedback
Your answer is correct.
The correct answer is:
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.
[Molecular] [Conjunction]

Question 2
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.

Atomic N/A

Feedback
Your answer is correct.
The correct answer is:
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.
[Atomic] [N/A]

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text

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 statement is FALSE
The square and the triangle are both green.
Feedback
Your answer is correct.
The correct answer is:
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 statement is FALSE]

Question 4
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}

{1, 2, 3, 4, 5, 6, 7}

{3, 4, 5}

{1, 2}
Feedback
Your answer is correct.
The correct answer is: {1, 2}

Question 5
Incorrect
Mark 0.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.

Atomic
• Customers must wear shoes.

Feedback
Your answer is incorrect.

The correct answer is:

Determine whether the sentence below is an atomic statement, a molecular statement, or
not a statement at all.
• Customers must wear shoes. [Not a Statement]

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

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

Feedback
The correct answer is: 8

Question 7
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.

Atomic N/A

Feedback
Your answer is correct.
The correct answer is:
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.
[Atomic] [N/A]

Question 8
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).

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

Molecular Conditional

Feedback
Your answer is correct.
The correct answer is:
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.
[Molecular] [Conditional]

Question 9
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:

{3, 4, 5}

{5, 6, 7}

{1, 2, 3}

{1, 2, 6, 7}
 Feedback
Your answer is correct.
The correct answer is: {3, 4, 5}

Question 10
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.

Atomic
• The customers wore shoes.

Feedback
Your answer is correct.
The correct answer is:
Determine whether the sentence below is an atomic statement, a molecular statement, or
not a statement at all.
• The customers wore shoes. [Atomic]

Question 11
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).

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

 Molecular Conditional

Feedback
Your answer is correct.
The correct answer is:
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.
[Molecular] [Conditional]

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

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

Feedback
The correct answer is: 3

Question 13
Correct
Mark 1.00 out of 1.00

Flag question

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

Feedback
The correct answer is: 90

Question 14
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:

{3, 4, 5}

{1, 2, 3, 4, 5, 6, 7}

{1, 2, 3, 5, 6, 7}

{1, 2, 6, 7}
Feedback
Your answer is correct.
The correct answer is: {1, 2, 3, 4, 5, 6, 7}

Question 15
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
Feedback
The correct answer is 'False'.

Question 16
Correct
Mark 1.00 out of 1.00

Flag question

Question text

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 statement is FALSE

The square and the triangle are both blue.

Feedback
Your answer is correct.
The correct answer is:
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 statement is FALSE]
Question 17
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,
0
10}

Feedback
The correct answer is: 0

Question 18
Incorrect
Mark 0.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
Atomic
socks.

Feedback
Your answer is incorrect.
The correct answer is:
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 19
Correct
Mark 1.00 out of 1.00

Flag question

Question text

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 statement is TRUE

If the triangle is not green, then the square is not blue.
Feedback
Your answer is correct.
The correct answer is:
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 statement is TRUE]

Question 20
Correct
Mark 1.00 out of 1.00

Flag question

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

Feedback
The correct answer is: 21