Boost your Grades with us today!
MAT 2051 Unit 6 Quiz 3 How many times does the computer print the string “Hello”?
MAT 2051 Unit 6 Quiz 3 How many times does the computer print the string “Hello”?
Unit 6 Quiz 3
Question 1 How many times does the computer print the string “Hello”?
i = 2
while (i < 4) {
print (“Hello”)
i = i + 1}:
Answers:
a. 1.
b. 2.
c. 3.
d. 4.
Question 2Which of the following is O(n)?
Answers:
a. 3n + 1.
b. n * log(n).
c. n * n + n.
d. None of the above.
Question 3 If each of the following describes the run time of an algorithm, which of the following could have the longest run time?
Answers:
a. O(nlog(n)).
b. O(n!).
c. O(n/2).
d. O(n * n).
Question 4What does the following algorithm return?
f(n){
if (n< 2)
return 1
else
return f(n – 1) * n:
Answers:
a. n!
b. The maximum divisor of n.
c. (n – 1)!
d. n 2.
.Question 5 Given that S_n denotes the number of n-bit strings that do not contain the pattern 00, what are the initial conditions?
Answers:
a. S_1 = 2, S_2 =3.
b. S_1 = 1, S_2 =2.
c. S_1 = 0, S_2 =2.
d. None of the above.
Given Example 10.4.4 and Theorem 10.4.5 in the textbook, explain how you would transform the matching problem into a maximal flow problem.
Once you complete question 5, use the already known linear program that solves the maximal flow problem. Show all of your work and how you are doing the reduction.
Show all of your work and include references for resources you use to complete the assignment.
Hint 1: Transform the matching problem into a matching network, and then find the maximal flow to this network.
Hint 2: The goal here is to learn that, while problems might appear different, they are often the same. Knowing how to transform a new problem into a known problem can save a lot of solving time. Use the Internet and your textbook.
Review the Linear Programming, Reduction, and Max Flow Networks Scoring Guide to understand how the assignment will be graded.
MAT 2051 Unit 6 Quiz 3 How many times does the computer print the string “Hello”? Grading Rubric Guidelines
Performance Category | 10 | 9 | 8 | 4 | 0 |
Scholarliness
Demonstrates achievement of scholarly inquiry for professional and academic decisions. |
|
|
|
|
|
Performance Category | 10 | 9 | 8 | 4 | 0 |
Application of Course Knowledge –
Demonstrate the ability to analyze, synthesize, and/or apply principles and concepts learned in the course lesson and outside readings and relate them to real-life professional situations |
|
|
|
|
|
Performance Category | 5 | 4 | 3 | 2 | 0 |
Interactive Dialogue
Replies to each graded thread topic posted by the course instructor, by Wednesday, 11:59 p.m. MT, of each week, and posts a minimum of two times in each graded thread, on separate days. (5 points possible per graded thread) |
|
Summarizes what was learned from the lesson, readings, and other student posts for the week. |
|
|
|
Minus 1 Point | Minus 2 Point | Minus 3 Point | Minus 4 Point | Minus 5 Point | |
Grammar, Syntax, APA
Note: if there are only a few errors in these criteria, please note this for the student in as an area for improvement. If the student does not make the needed corrections in upcoming weeks, then points should be deducted. Points deducted for improper grammar, syntax and APA style of writing. The source of information is the APA Manual 6th Edition |
|
|
|
|
|
0 points lost | -5 points lost | ||||
Total Participation Requirements
per discussion thread |
The student answers the threaded discussion question or topic on one day and posts a second response on another day. | The student does not meet the minimum requirement of two postings on two different days | |||
Early Participation Requirement
per discussion thread |
The student must provide a substantive answer to the graded discussion question(s) or topic(s), posted by the course instructor (not a response to a peer), by Wednesday, 11:59 p.m. MT of each week. | The student does not meet the requirement of a substantive response to the stated question or topic by Wednesday at 11:59 pm MT. |