Applications of Discrete Mathematics
ludyh6
wk2__math221.docxDiscussion
Applications of Discrete Mathematics
1. Write 80- to 100-word short-answer response to the following:
In your opinion, what was the most challenging topic of this course? Why do you think it was challenging?
Is there anything about the topic you are still confused about? Explain.
2. Write 80- to 100-word short-answer response to the following:
What is a prefix code?
3. Write 80- to 100-word short-answer response to the following:
How can a prefix code be represented by a binary tree?
4. Write 80- to 100-word short-answer response to the following:
Explain how to use preorder, inorder, and postorder traversals to find the prefix, infix, and postfix forms of an arithmetic expression.
5. Write 80- to 100-word short-answer response to the following:
Explain how backtracking can be used to determine whether a simple graph can be colored using n colors.
.
6. Write 80- to 100-word short-answer response to the following:
Describe at least two different applications that require that a minimum spanning tree of a connected weighted graph be found.
7. Write 80- to 100-word short-answer response to the following:
Define a rooted tree and the root of such a tree.
8. Write 80- to 100-word short-answer response to the following:
What is a minimum spanning tree of a connected weighted graph?
APA format requires a concluding paragraph which sums up the whole paper.
Format your paper consistent with APA guidelines.
Discussion
Applications of Discrete Mathematics
1.
Write
8
0
-
to
1
00
-
word short
-
answer response to the following
:
In your opinion, what was the most challenging topic of this course? Why do you think it
was challenging?
Is there anything about the topic you are still confused about? Explain.
2.
Write
8
0
-
to
1
00
-
word short
-
answer response to the following:
What is a prefix code?
3.
Write
80
-
to 1
00
-
word short
-
answer response to the following:
How
can a prefix code be represented by a binary tree?
4.
Write
80
-
to 1
00
-
word short
-
answer response to the following:
Explain how to use preorder, inorder, and postorder
traversals to find the prefix, infix, and
postfix forms of
an arithmetic expression
.
5.
Write
80
-
to 100
-
word short
-
answer response to the following:
Explain h
ow backtracking can be used to determine
whether a simple graph can be colored using
n colors
.
.
6.
Write
80
-
to 100
-
word short
-
answer response to the following:
Describe at least two different appl
ications that require
that a minimum spanning tree of a
connected weighted
graph be found.
7.
Write
80
-
to 100
-
word short
-
answer response to the following:
Define a rooted tree and the root of such a tree.
8
.
Write 80
-
to 100
-
word short
-
answer response to the following:
What is a minimum spanning tree of a connected
weight
ed graph?
APA format requires a concludi
ng paragraph which sums up the whole
paper
.
Format your paper consistent with APA guidelines.
Discussion
Applications of Discrete Mathematics
1. Write 80- to 100-word short-answer response to the following:
In your opinion, what was the most challenging topic of this course? Why do you think it
was challenging?
Is there anything about the topic you are still confused about? Explain.
2. Write 80- to 100-word short-answer response to the following:
What is a prefix code?
3. Write 80- to 100-word short-answer response to the following:
How can a prefix code be represented by a binary tree?
4. Write 80- to 100-word short-answer response to the following:
Explain how to use preorder, inorder, and postorder traversals to find the prefix, infix, and
postfix forms of an arithmetic expression.
5. Write 80- to 100-word short-answer response to the following:
Explain how backtracking can be used to determine whether a simple graph can be colored using
n colors.
.
6. Write 80- to 100-word short-answer response to the following:
Describe at least two different applications that require that a minimum spanning tree of a
connected weighted graph be found.
7. Write 80- to 100-word short-answer response to the following:
Define a rooted tree and the root of such a tree.
8. Write 80- to 100-word short-answer response to the following:
What is a minimum spanning tree of a connected weighted graph?
APA format requires a concluding paragraph which sums up the whole paper.
Format your paper consistent with APA guidelines.
