18 Jul Algorithm Development Quiz
1. Suppose T1(N) = O(f(N)) and T2(N) = O(f(N)). Which of the following are true?
Write the letter for the correct answer in the space below.
QUESTION 2
1. Given two sorted lists, L1, and L2, write a procedure to compute L1 ∩ L2 using only the basic list operations.
QUESTION 3
1. Show the result of:
· Inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree.
· Show the result of deleting the root.
QUESTION 4
1. Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x(mod() 10), show the hash table using linear probing.
QUESTION 5
1. Show the result of inserting keys 1 to 15 in order into an initially empty leftist heap. Complete a table that looks like this:
QUESTION 6
1. Explain when the following should be utilized. Provide a real or hypothetical example of each that is not in the textbook.
· Greedy algorithms
· Divide and Conquer
· Dynamic programming
ALGORITHM DEVELOPMEN
T
QUIZ
QUESTION 1
1.
Suppose T1(N) = O(f(N)) and T2(N) = O(f(N)). Which of the following are true?
Writ
e the letter for the correct answer in the space below.
QUESTION 2
1.
Given two sorted lists, L1, and L2, write a procedure to compute L1
n
L2 using only the
basic list operations.
QUESTION 3
1.
Show the result of:
·
Inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree.
·
Show the result of deleting the root.
QUESTION 4
1.
Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x)
= x(mod() 10), show the hash table using linear probing.
QUESTION 5
1.
Show the result of inserting keys 1 to 15 in order into an initially empty leftist heap. Complete a table
that looks like this:
ALGORITHM DEVELOPMENT QUIZ
QUESTION 1
1. Suppose T1(N) = O(f(N)) and T2(N) = O(f(N)). Which of the following are true?
Write the letter for the correct answer in the space below.
QUESTION 2
1. Given two sorted lists, L1, and L2, write a procedure to compute L1 n L2 using only the
basic list operations.
QUESTION 3
1. Show the result of:
Inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree.
Show the result of deleting the root.
QUESTION 4
1. Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x)
= x(mod() 10), show the hash table using linear probing.
QUESTION 5
1. Show the result of inserting keys 1 to 15 in order into an initially empty leftist heap. Complete a table
that looks like this:
Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Fill in all the assignment paper details that are required in the order form with the standard information being the page count, deadline, academic level and type of paper. It is advisable to have this information at hand so that you can quickly fill in the necessary information needed in the form for the essay writer to be immediately assigned to your writing project. Make payment for the custom essay order to enable us to assign a suitable writer to your order. Payments are made through Paypal on a secured billing page. Finally, sit back and relax.
About Writedemy
We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.
How It Works
To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Are there Discounts?
All new clients are eligible for 20% off in their first Order. Our payment method is safe and secure.