CS 4520 Georgia State University Algorithm Design and Analysis Project Need help with the assignment. should not be copied from chegg. should be unique LAST NAME , FIRST NAME
CS 4520/6520 Summer 2020
Homework #2, out of 60 pts
Problem 1 [10pts]. Heapsort
Perform heapsort in the given max-heap, sort from largest to smallest value (descending order).
You should copy-paste template as many times as needed (and disregard extra nodes if they
appear in the template or in your later heaps drawings) and show each step/change.
Take out 11 as the first element in sorted array of numbers. Then place … as a root node. Then…
This is the template to use.
Problem 2 [10pts]. BST, insertion
Insert key 7 as a root for the following binary search tree.
Use left and right rotations as needed. (First, you need to add key 7 to the tree in its correct
place, and then start rotating, as was shown in lecture). Show all steps.
Problem 3 [20pts].
Imagine youre a tourist on Manhattan, and this grid models it. You start at upper left corner
(with coordinates 0,0) and should end up at the bottom right corner (with coordinates 4,4).
Weights on edges indicate how many attractions you will see if you walk on that street/avenue.
Your goal is to see as many attractions as possible.
Fill in the matrices A (values, max numbers of attractions one can see up to that road
intersection) and B (arrows, so one can reconstruct the path).
a) Using greedy approach
B: (copy-paste appropriate arrows) ? ? ? ?
b) Using Dynamic programming
Problem 4 [10pts]. Knapsack problem
You are given 5 items with weights 4,1,3,3,2 and respective values of 10, 7, 8, 9, 11.
Find the most valuable combinations of items that would fit in a knapsack of weight 8, by
constructing a DP table and calculating all values in the table. For the last two rows, show
explicitly how you use the formula from the slides.
(You are asked to do this to show understanding. Usually by performing such task, you finally
get it and see why formula works and is correct and what it actually states
Problem 5 [10pts]. LCS
By constructing a DP table, find the longest common subsequence for the two given sequences:
Your table has to be constructed in a fashion as was done in lecture, and should contain numbers
which represent how many common characters are found by now, and arrows so the LCS is reconstructible.
Answer: LCS is
Purchase answer to see full
Why Choose Us
Top quality papers
We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.
Professional academic writers
We have hired a team of professional writers experienced in academic and business writing. Most of them are native speakers and PhD holders able to take care of any assignment you need help with.
If you feel that we missed something, send the order for a free revision. You will have 10 days to send the order for revision after you receive the final paper. You can either do it on your own after signing in to your personal account or by contacting our support.
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.
Original & confidential
We use several checkers to make sure that all papers you receive are plagiarism-free. Our editors carefully go through all in-text citations. We also promise full confidentiality in all our services.
24/7 Customer Support
Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.
You are welcome to choose your academic level and the type of your paper. Our academic experts will gladly help you with essays, case studies, research papers and other assignments.
Admission help & business writing
You can be positive that we will be here 24/7 to help you get accepted to the Master’s program at the TOP-universities or help you get a well-paid position.
Editing your paper
Our academic writers and editors will help you submit a well-structured and organized paper just on time. We will ensure that your final paper is of the highest quality and absolutely free of mistakes.
Revising your paper
Our academic writers and editors will help you with unlimited number of revisions in case you need any customization of your academic papers