Discrete Mathematics Cs6105

Discrete Mathematics (CS6105)
BS Information Technology (AMA Computer University)
Studocu is not sponsored or endorsed by any college or university

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)
Discrete Math Final Quiz 1
The child of a child of a vertex is called
-grandchild
It is the switching the hypothesis and conclusion of a conditional statement.
-converse
Try contrapositive
The number of simple digraphs with |V | = 3 is
Answer: 512
A graph F is a if and only if between any pair of vertices in F there is at most Answer:
forest , one path
Match the following properties of trees to its definition.
Proposition 4.2.3
Answer:
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. -False
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.

-True
The number of edges incident to a vertex.
-Degree of a vertex
Indicate which, if any, of the following graphs G = (V, E, φ), |V | = 5, is not connected. Answer:
φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )
The given graph is planar.
-False
If two vertices are adjacent, then we say one of them is the parent of the other, which is called the
of the parent
-child
A connected graph with no cycles.
-tree
How many spanning trees are possible in the given
figure? Answer: 2
Two graphs that are the same are said to be
-isomorphic
The minimum number of colors required in a proper vertex coloring of the graph. -Chromatic
number
Indicate which, if any, of the following three graphs G = (V, E, φ), |V | = 5, is not isomorphic to any of the
other two.
Answer: φ = (A {1,3} B {2,4} C {1,2} D {2,3} E {3,5} F {4,5} )

Discrete Math Midterm Exam 47/50
A function which renames the vertices.
-isomorphism
If n is a rational number, 1/n does not equal n-1.
-True
Does a rational r value for r2 =6 exist?
-No, a rational r does not exist.
An undirected graph G which is connected and acyclic is called . -tree
Which of the following the logic representation of proof by contrapositive?
-P → Q = ¬Q → ¬P
For all n in rational, 1/n ≠ n - 1
-True
As soon as one vertex of a tree is designated as the , then every other vertex on the tree can
be characterized by its position relative to the root.
-root
The tree elements are called
-nodes
Proofs that is used when statements cannot be rephrased as implications. -Proof
by contradiction

It is an algorithm for traversing or searching tree or graph data structures. -breadth
first search
Which of the following statements is NOT TRUE?
-Any tree with at least two vertices has at least two vertices of degree two.
Find the contrapositive of the given statement.
If you travel to London by train, then the journey takes at least two hours.
-If your journey by train takes less than two hours, then you don’t travel to London
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?
-isosceles triangle
What is the minimum height height of a full binary tree?
Answer: 3
What is the matching number for the following graph?
Answer: 4
is the simplest style of proof.
-Direct proof
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
-walk
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
Answer: 2 wrong
Identify the propositional logic of the truth table given
Answer: negation
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 not give me a cow.
Answer: Neither
De Morgan's law is used in finding the equivalence of a logic expression using other logical functions.
Answer: True
A is a which starts and stops at the same vertex.
Answer: Euler's circuit, Euler's path
¬P Q is equivalent to :
Answer: P → Q
Given the diagram, answer the following questions :
How many people takes tea and wine? Answer: 32
How many people takes coffee but not tea and wine? Answer: 45
What is the difference of persons who take wine and coffee to the persons who the persons who takes
tea only? Answer: 15
IN combinations, the arrangement of the elements is in a specific order.
Answer: False

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
Find the cardinality of R = {20,21,...,39, 40}
|R|=
Answer: 21
Find the cardinality of S = {1, {2,3,4},0}
|S|=
Answer: 3
Let A = {3, 4, 5}. Find the cardinality of P(A).
Answer: 8
The cardinality of {3, 5, 7, 9, 5} is 5.
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90

Find |A ∩ B| when A = {1, 3, 5, 7, 9} and B {2, 4, 6, 8, 10}
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
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
Suppose P and Q are the statements:
P: Jack passed math.
Q: Jill passed math.
Translate "¬(P ν Q) → Q" into English.
Select one:
-If Jack or Jill did not pass math, then Jill passed math.
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.
-True
negation).

The Broncos will win the Super Bowl or I’ll eat my hat.
-Molecular, conjunction (correct answer?)
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
statement at all.
The customers wore shoes and they wore socks.
-Molecular
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 a cow.
-Contrapositive
Which of the following translates into “Jack and Jill both passed math” into symbols?
Select one:
-P Λ Q
If the triangle is green, then the square is blue.
-True (not necessarily true dapat to eh)

If you will give me a cow, then I will not give you magic beans.
-Converse
You will give me a cow and I will not give you magic beans.
-Contrapositive
negation).
Everybody needs somebody sometime.
-Atomic , N/A
The square and the triangle are both green.
-false
If you will not give me a cow, then I will not give you magic beans.
-Converse
negation).
We can have donuts for dinner, but only if it rains.

-Molecular , conditional
negation).
Every natural number greater than 1 is either prime or composite.
-Molecular, Conditional
The square and the triangle are both blue.
-false
statement at all.
The customers wore shoes.
-Atomic
If I will give you magic beans, then you will give me a cow.
-Neither
The square is not blue or the triangle is green.
-False

Discrete Math Prelim Quiz 2 match the following
formulas to its corresponding sequence
geometric double
summation
(a) Translate “Jack and Jill both passed math” into symbols.
-di masagutan lol
A sequence that involves a common difference in identifying the succeeding terms.
-Arithmetic Progression

Answer: 4
Answer: P → Q = ¬Q → ¬P
Proofs that is used when statements cannot be rephrased as implications.
-Proof by contradiction
Which of the following statements are equivalent to the implication, “if you win the lottery, then you will
be rich,”?
-It is necessary for you to win the lottery to be rich.
-You will be rich if you win the lottery.
-It is sufficient to win the lottery to be rich.

What is the missing term?
3,9, ,81....
Answer: 27
Solve for the value of n in :
−4= n+7 over 6
Answer: -31
What is the line covering number of for the following graph?
Answer: 3
The sum of the geometric progression is called geometric series

-True
A graph is complete if there is a path from any vertex to any other vertex.
-False
Given the series : 2,5,8,11....
What is the type of progression? (Answer: Arithmetic)
What is the sum from 1st to 5th element? (Answer:
40)
¬(P Q) is logically equal to which of the following
expressions? Answer: ¬P ¬Q
-isomorphism
is the simplest style of proof
-direct proof
The geometric sequences uses common in finding the succeeding terms
-factor
Match the truth tables to its corresponding propositional logic

Deduction rule is an argument that is not always right.
-False
negation).
-Atomic, N/A
Select one:

-True
negation).
-Molecular, conjunction
statement at all.
Customers must wear shoes.
-Not a statement
statement at all.
-Molecular
-Contrapositive

Select one:
-P Λ Q
-True
-Converse
-Contrapositive
negation).
-Atomic , N/A
-False

-Converse
negation).
negation).
-false
statement at all.
-Atomic

-Neither
-False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=
Answer: 3

Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
Discrete Math Exercise 3
It is a rule that assigns each input exactly one output
-function
GIven the function:
f : Z → Z defined by f(n) = 3n
Which of the following is a possible range of the function?
-all multiples of three
Rule that states that every function can be described in four ways: algebraically (a formula),
numerically (a table), graphically, or in words.
-Rule of four

Consider the function f : N → N given by f (0) 0 and f (n + 1) f (n) + 2n + 1. Find f (6). Answer:
36
For a function f : N → N, a definition consists of an together with a
Answer: recursive, initial condition, recurrence relation
The 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. -range
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 -bijection
The of a a subset B of the codomain is the set f −1 (B) {x X : f (x) B}. -
inverse image
Answer the following:
f(1) = (Answer: 4)
What is the element n in the domain such as f(n) = 1 (Answer: 2)
Find an element n of the domain such that f (n) = n (Answer: 3)
surjective and injecive are opposites of each other.
-False
Discrete Mathematics Exercise 4
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.

-Additive principle
Determine the number of elements in A U B.
Answer: 18
Additive principle states that if given two sets A and B, we have |A × B| |A| · |B|. -False
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? (Answer: 2)
How many people like only one of the three? (Answer: 26)
How many people takes tea and wine? =32
How many people takes coffee but not tea and wine? =45

tea only? =15
Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed?
Answer: 210
Defined as the product of all the whole numbers from 1 to n. -factorial
In how many different ways can the letters of the word 'OPTICAL' be arranged so that the vowels always
come together?
Answer : 720
IN combinations, the arrangement of the elements is in a specific order. -False
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?
Answer: 720
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.
-True
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.
-Bipartite graph
How many simple non-isomorphic graphs are possible with 3 vertices?
-Answer: 4
is the same truth value under any assignment of truth values to their atomic parts. -Logic
Equivalence

A set of statements, one of which is called the conclusion and the rest of which are called premises. -
argument
Find f (1).
Select one:
Answer: 4
Assume the sequence: 1,3,5,7,9, ….
What is the 20th term? 29
What type of progression this suggest? Arithmetic
What is the 4th and 8th element of a(n)= n^(2) ?
Answer: 16,64
is a function from a subset of the set of integers
-sequence
The study of what makes an argument good or bad.
-logic
-True
Arithmetic progression is the sum of the terms of the arithmetic series.
True
An argument form which is always valid.
-deduction rule

How many possible output will be produced in a proposition of three
statements? Answer: 24
It is a connected graph containing no cycles.
-tree
A statement which is true on the basis of its logical form alone.
-Tautology
A graph in which every pair of vertices is adjacent.
-Complete graph
Every connected graph has a spanning tree.
-True
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique path. -True
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 called
Answer: tree , leaves
A spanning tree that has the smallest possible combined weight.
-minimum spanning tree
A tree is the same as a forest.
-False
Two edges are adjacent if they share a vertex.
-True

An argument is said to be valid if the conclusion must be true whenever the premises are all true. -True
The number of edges incident to a vertex
-Degree of a vertex
Discrete Math Midterm Quiz 2
-isomorphism
-True
An undirected graph G which is connected and acyclic is called . -tree
-P → Q = ¬Q → ¬P
-True
As soon as one vertex of a tree is designated as the , then every other vertex on the tree can
be characterized by its position relative to the root.
-root
The tree elements are called
-nodes

by contradiction
It is an algorithm for traversing or searching tree or graph data structures. -breadth
first search
Which of the following statements is NOT TRUE?
-Any tree with at least two vertices has at least two vertices of degree two.
-If your journey by train takes less than two hours, then you don’t travel to London
-isosceles triangle
Answer: 3
Answer: 4
is the simplest style of proof.
-Direct proof

-walk
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
Answer: 2 wrong
Answer: negation
Answer: Neither
Answer: True
Answer: P → Q

Answer: False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8

Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
negation).
-Atomic, N/A
Select one:

-True
negation).
statement at all.
-Not a statement
statement at all.
-Molecular
-Contrapositive
Select one:
-P Λ Q

-Converse
-Contrapositive
negation).
-Atomic , N/A
-false

-Converse
negation).
negation).
-false
statement at all.
-Atomic
-Neither

-False
geometric double
summation
-di masagutan lol

A sequence that involves a common difference in identifying the succeeding terms. -Arithmetic
Progression
Answer: 4
by contradiction

be rich,”?
3,9, ,81....
Answer: 27
−4= n+7 over 6
Answer: -31

Answer: 3
-True
-False
40)
¬(P 𝗏 Q) is logically equal to which of the following
expressions? Answer: ¬P 𝖠 ¬Q

-isomorphism
-direct proof
-factor
-False

negation).
-Atomic, N/A
Select one:
-True
negation).
statement at all.
-Not a statement

statement at all.
-Molecular
-Contrapositive
Select one:
-P Λ Q
-True
-Converse

-Contrapositive
negation).
-Atomic , N/A
-False
-Converse
negation).
negation).

-false
statement at all.
-Atomic
-Neither
-False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}

Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}

-function
GIven the function:
-Rule of four
36

inverse image
f(1) = (Answer: 4)
-False
-Additive principle
Answer: 18

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.
tea only? =15
Answer: 210
come together?
Answer : 720

Answer: 720
-True
-Bipartite graph
-Answer: 4
Equivalence
argument
Find f (1).
Select one:
Answer: 4
Answer: 16,64

-sequence
-logic
-True
True
Answer: True
Answer: 2
Answer: negation
Answer: Neither
Answer: isosceles triangle

Answer: True
Answer: P → Q
Answer: False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}

|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
negation).
-Atomic, N/A

Select one:
-True
negation).
statement at all.
-Not a statement
statement at all.
-Molecular

-Contrapositive
Select one:
-P Λ Q
-Converse
-Contrapositive
negation).

-Atomic , N/A
-false
-Converse
negation).
negation).
-false

statement at all.
-Atomic
-Neither
-False

geometric double
summation
-di masagutan lol
Progression
-Walk

Answer: 4
by contradiction
be rich,”?

3,9, ,81....
Answer: 27
−4= n+7 over 6
Answer: -31
Answer: 3
-True

-False
40)
-If your journey by train takes less than two hours, then you don’t travel to London.
-isomorphism
-direct proof
The geometric sequences uses common in finding the succeeding terms -factor

-False
negation).
-Atomic, N/A
Select one:

-True
negation).
statement at all.
-Not a statement
statement at all.
-Molecular
-Contrapositive

Select one:
-P Λ Q
-True
-Converse
-Contrapositive
negation).
-Atomic , N/A

-False
-Converse
negation).
negation).
-false
statement at all.
-Atomic

-Neither
-False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=

Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
-function
GIven the function:

-Rule of four
36
inverse image
f(1) = (Answer: 4)
-False

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.
-Additive principle
Answer: 18

tea only? =15
Answer: 210
come together?
Answer : 720
Answer: 720
-True

-Bipartite graph
-Answer: 4
Equivalence
-True
argument
Find f (1).
Select one:
Answer: 4
Answer: True
Answer: 2
Answer: negation

Answer: Neither
Answer: True
Answer: P → Q
Answer: False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)

Answer: {2,3,4,5}
negation).
-Atomic, N/A
Select one:
-True
negation).
statement at all.
-Not a statement

statement at all.
-Molecular
-Contrapositive
Select one:
-P Λ Q
-Converse

-Contrapositive
negation).
-Atomic , N/A
-false
-Converse
negation).
negation).

-false
statement at all.
-Atomic
-Neither
-False
Discrete Math Prelim Quiz 2
match the following formulas to its corresponding sequence
geometric double summation

P: Jack passed
math.
-di masagutan lol
Progression
-Walk
Answer: 4
by contradiction
be rich,”?
3,9, ,81....

Answer: 27
−4= n+7 over 6
Answer: -31
Answer: 3
-True
-False
40)
-isomorphism
-direct proof

-factor
-Conjunction
-Disjunction
-implication
-False
Discrete Mathematics Final Quiz 2
Does this graph have an Euler Path, Euler Circuit, both, or neither?
-Both
How many edges would a complete graph have if it had 6 vertices?

Answer: 15
Circuits start and stop at
-same vertex
A graph has no isolated vertices.
-threshold
Which of the following is false?
-A graph with one odd vertex will have an Euler Path but not an Euler Circuit.
Paths start and stop at the same vertex.
-False
Euler paths must touch all edges.
-True
A graph has two distinct groups where no vertices in either group connecting to members
of their own group
-bipartite
possibly the first and last) is called a path.
-Walk
Tracing all edges on a figure without picking up your pencil or repeating and starting and stopping at
different spots
-Euler circuit

These are lines or curves that connect vertices.
-Edges
When a connected graph can be drawn without any edges crossing, it is called .-
Planar graph
A simple graph has no loops nor multiple edges.
-True
All graphs have Euler's Path
-False
A sequence of vertices such that every vertex in the sequence is adjacent to the vertices before and
after it in the sequence
-Walk
A path which visits every vertex exactly once
-Hamilton path
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}

|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
-function

GIven the function:
-Rule of four
36
inverse image

f(1) = (Answer: 4)
-False
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.
-Additive principle
Answer: 18
tea only? =15

Answer: 210
come together?
Answer : 720
Answer: 720
Answer: True
Answer: 2 wrong
Answer: negation
Answer: Neither

Answer: True
Answer: P → Q
Answer: False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}

Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=
Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
negation).

-Atomic, N/A
Select one:
-True
negation).
statement at all.
-Not a statement
statement at all.

-Molecular
-Contrapositive
Select one:
-P Λ Q
-Converse
-Contrapositive

negation).
-Atomic , N/A
-false
-Converse
negation).
negation).

-false
statement at all.
-Atomic
-Neither
-False

geometric double
summation
-di masagutan lol
Progression
-Walk

Answer: 4
by contradiction
be rich,”?

3,9, ,81....
Answer: 27
−4= n+7 over 6
Answer: -31
Answer: 3
-True

-False
40)
¬(P Q) is logically equal to which of the following
expressions? Answer: ¬P ¬Q
-isomorphism
-direct proof
The geometric sequences uses common in finding the succeeding terms -factor

-False
negation).
-Atomic, N/A
Select one:

-True
negation).
statement at all.
-Not a statement
statement at all.
-Molecular
-Contrapositive

Select one:
-P Λ Q
-True
-Converse
-Contrapositive
negation).
-Atomic , N/A

-False
-Converse
negation).
negation).
-false
statement at all.
-Atomic

-Neither
-False
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A ∩ B
Answer: {3, 4, 5}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A U B
Answer: {1, 2, 3, 4, 5, 6, 7}
Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}
Find A \ B
Answer: {1, 2}
|R|=
Answer: 21
|S|=

Answer: 3
Answer: 8
Answer: False
Find | R | when R = {2, 4, 6,..., 180}
Answer: 90
Answer: 0
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, and C = {2, 3, 5}.
Find A ∩ (B U C)
Answer: {2,3,4,5}
-function
GIven the function:

-Rule of four
36
inverse image
f(1) = (Answer: 4)
-False

-Additive principle
Answer: 18

tea only? =15
Answer: 210
come together?
Answer : 720
Answer: 720
-True

-Bipartite graph
-Answer: 4
Equivalence
-True
argument
Find f (1).
Select one:
Answer: 4
Answer: 16,64
-sequence

-logic
-True
True
False
negation).
-Atomic, N/A
Select one:
-True

negation).
statement at all.
-Not a statement
statement at all.
-Molecular
-Contrapositive
Select one:
-P Λ Q

-True
-Converse
-Contrapositive
negation).
-Atomic , N/A
-False
-Converse

negation).
negation).
-false
statement at all.
-Atomic
-Neither

-False

Discrete Mathematics Cs6105

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Mathematics Cs6105

Uploaded by

Copyright:

Available Formats

Discrete Mathematics (CS6105)

BS Information Technology (AMA Computer University)

Studocu is not sponsored or endorsed by any college or university

The child of a child of a vertex is called

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

The number of simple digraphs with |V | = 3 is

forest , one path

Match the following properties of trees to its definition.

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

The number of edges incident to a vertex.

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

The given graph is planar.

A connected graph with no cycles.

How many spanning trees are possible in the given

Two graphs that are the same are said to be

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

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

A function which renames the vertices.

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

Does a rational r value for r2 =6 exist?

-No, a rational r does not exist.

An undirected graph G which is connected and acyclic is called . -tree

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

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

The tree elements are called

Proofs that is used when statements cannot be rephrased as implications. -Proof

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

Which of the following statements is NOT TRUE?

Find the contrapositive of the given statement.

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

What is the matching number for the following graph?

is the simplest style of proof.

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

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

Identify the propositional logic of the truth table given

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

Answer: Euler's circuit, Euler's path

Given the diagram, answer the following questions :

How many people takes tea and wine? Answer: 32

IN combinations, the arrangement of the elements is in a specific order.

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

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

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

Find the cardinality of R = {20,21,...,39, 40}

Find the cardinality of S = {1, {2,3,4},0}

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

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

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

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

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

The sum of the first 100 odd positive integers.

Suppose P and Q are the statements:

P: Jack passed math.

Q: Jill passed math.

Translate "¬(P ν Q) → Q" into English.

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

Downloaded by Noel Cleofas (cleofasnoel10@gmail.com)

-Molecular, conjunction (correct answer?)

Customers must wear shoes

The customers wore shoes and they wore socks.

Suppose P and Q are the statements:

P: Jack passed math.

Q: Jill passed math.

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