Category Archives: Final Exam Review

1. Prove using induction: 1 + 3 + 5 +···+ (2n − 1) = n^2 2. Give a big-O estimate for the number of operations (where an operation is an addition or multiplication) used in this segment of an algorithm: … Continue reading →

a) Using quick sort, sort 3, 5, 7, 8, 1, 9, 2, 4, 6. Show each step. b) Count the number of comparisons in 1a a) Set up a binary tree for the following list, in the given order, using … Continue reading →

1.Describe an algorithm that takes as input a list of n integers and finds the location of the last even integer or returns 0 if there are no even integers on the list 2. Show that f(x)=x²+x+1 is O (x²) … Continue reading →

Final Exam Review  Section 11.2 # 6 Howmany weighings of a balance scale are needed to find a lighter counterfeit coin among four coins? Describe an algorithm to find the lighter coin using this number of weighings. Section 11.2 #8 … Continue reading →

Describe in words how the binary search algorithm works and give a example how it works. Use pseudo code to describe an algorithm for finding the largest and second largest element in a list Build a binary search tree for … Continue reading →

Final Review   Good luck to everyone!

1)List all the steps used to search for 9 in the sequence 1, 3, 4, 5, 6, 8, 9, 11 using a) linear search.                                 … Continue reading →

There are no answers to this as yet but I will probably post them Monday afternoon.Final_review