Discrete Structures 2
Discrete Structures 2
Answer:
Translate the expression to predicate logic:
“No students are allowed to carry guns.”
Answer:
Answer: False
Which symbol is used as the existential quantifier?
Answer:
Translate the expression to predicate logic:
“Some problems are difficult.”
Answer:
Translate the following statement into a logical
expression:
You are to use the following predicates:
M(x): x is a MATH233 student
L(x): x loves art
“Some MATH233 students love art.”
Answer:
Answer: False
Which symbol is used as the universal quantifier?
Answer:
Translate the following statement into a logical
expression:
You are to use the following predicates:
M(x): x is a MATH233 student
L(x): x loves art
“Some students love art.”
Answer:
Answer: True
is:
Answer: True
This is a statement that is always false.
Answer: contradiction
Translate the following statement into a logical
expression:
You are to use the following predicates:
M(x): x is a MATH233 student
L(x): x loves art
“Some students are enrolled in MATH233.”
Answer:
Let p, q, and r be the following propositions:
P: You get an A on the final exam
Q: You do every exercise in the book.
R: You get an A in this class.
Write the following formula using p, q, and r and
logical connectives.
“You get an A in this class, but you do not do every
exercise in the book.”
Answer:
Midterms:
Answer: Pseudograph
What type of graph is depicted below?
Answer: Simple Graph
How many different passwords are possible if each
password consists of six characters where each
character is either an uppercase letter, a lowercase
letter, or a digit, and at least one digit must be
included in the password? (Note: There are 26
letters and 10 digits)
Answer: 62 – 52⁶
How many terms does the binomial expansion of
(2x+3)⁹⁹ has?
Answer: 100
How many different license plates are available if
the license plate pattern consists of four letters that
cannot be repeated and followed by three digits
that can be repeated? (Assume that all letters are
uppercase and the digits are 0, 1, … 9)
Answer: 26 · 25 · 24 · 23 · 10³
If you give a proof by mathematical induction of the
statement that 2n &ge= n², for all integers n ≥ 4, the
basis step requires you to prove that which of the
following is true?
Answer: 2⁴ ≥ 4²
How many bit strings of length four do not have two
consecutive 1s?
Answer: 8
“A simple graph with 15 vertices with each having a
degree of 5 can exist.” This statement is ________.
Answer: False
Suppose you are hired by a company at an initial
salary of $30,000. At the end of each year you
receive a 3% raise, plus an addition of $1000 on
your base salary. Let an equal your salary at the end
of n years with the company. Find a recurrence
relation for an.
Answer: An = 1.03an-1 + 1000
Suppose you want to use the principle of
mathematical induction to prove that 1 + 2 + 22 +
23 + 23 + … + 2n = + 2n+1 – 1 for all positive integers
n. Which of these is the correct implication p(k) ->
P(k+1) to be used in the inductive step?
Answer: 1 + 2 + 2² + 2³ + … + 2k = 2k+1 – 1 -> 1 + 2 +
2² + 2³ + … + 2k + 2k+1 = 2k+2 – 1
Let S = {x, y, z} be a sample space of an experiment
with outcomes x, y, and z. List all the events of this
experiment.
Answer:
An experiment consists of casting a pair of dice and
observing the number that falls uppermost on each
die. We may represent each outcome of the
experiment by an ordered pair of numbers, the first
representing the number that appears uppermost
on the first die and the second representing the
number that appears uppermost on the second die.
Consider the sample space
Answer: Yes
Refer to the graphs below:
Answer: The graphs are isometric.
As part of a quality-control procedure, an inspector
at Bristol Farms randomly selects ten eggs from
each consignment of eggs he receives and records
the number of broken eggs.
Describe the event F that at least nine eggs are
broken.
Answer:
.
Are the events F and G complementary?
Answer: no
An experiment consists of casting a pair of dice and
observing the number that falls uppermost on each
die. We may represent each outcome of the
experiment by an ordered pair of numbers, the first
representing the number that appears uppermost
on the first die and the second representing the
number that appears uppermost on the second die.
Consider the sample space
Determine the event that the sum of the numbers
falling uppermost is greater than or equal to 7.
Answer: {(1, 6), (2, 5), (2, 6), (3, 4), (3, 5), (3, 6), (4,
3), (4, 5), (4, 6), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6), (6,
1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}
A study of deaths in car crashes from 1986 to 2002
revealed the following data on deaths in crashes by
day of the week.
Find the empirical probability distribution
associated with these data.
Day of Sunday Monday Tuesday Wednesday
the
Week
Average 131 97 94 99
Number
of
Deaths
Day of the Thursday Friday Saturday
Week
Average 103 135 157
Number of
Deaths
Answer: Day of the Week Sunday Monday
Tuesday Wednesday Probability 0.161 0.119
0.115 0.121 Day of the Week Thursday Friday
Saturday Probability 0.126 0.165 0.192
The number of cars entering a tunnel leading to an
airport in a major city over a period of 200 peak
hours was observed and the following data were
obtained.
Answer:
An experiment consists of tossing a coin, rolling a
die, and observing the outcomes. Describe the
event “A head is tossed and an odd number is
rolled.”
Answer:
Answer: Yes
The following breakdown of a total of 18,686
transportation fatalities that occurred in 2007 was
obtained from records compiled by the U.S.
Department of Transportation (DOT).
Mode of Car Train Bicycle Plane
Transportation
Number of 16,525 842 698 538
Fatalities
What is the probability that a victim randomly
selected from this list of transportation fatalities for
2007 died in a train or a plane accident? Round
answer to two decimal places.
Answer: 0.07
A time study was conducted by the production
manager of Vista Vision to determine the length of
time (t) in minutes required by an assembly worker
to complete a certain task during the assembly of its
Pulsar color television sets.
Describe a sample space corresponding to this time
study.
Answer:
Finals:
Answer: No
The basic limitation of finite automata is that
Answer: It cannot remember arbitrary large
amount of information.
Which of the following statements about binary
trees is NOT true?
Answer: Every binary tree has at least one node.
If two finite states machine M and N are
isomorphic, then
A. M can be transformed to N, merely re-labelling
its states
B. M can be transformed to N, merely re-labelling
its edges
Which is true?
Answer: A only
How many leaves does it have?
Answer: 4
How many edges does a tree with V vertices have?
Answer: V – 1
Transition function maps.
Answer:
Every tree with at least two nodes has at least two
nodes of what degree?
Answer: 1
Finite automata requires minimum _______
number of stacks.
Answer: 0
A terminal node in a binary tree is called
_______________.
Answer: Leaf