Question: 1. List all the steps used by maximum finding algorithm to find the Maximum of the list 8,12,9,15,2,14 2. Build the Huffman coding for the
1. List all the steps used by maximum finding algorithm to find the Maximum of the list 8,12,9,15,2,14
2. Build the Huffman coding for the string " EXAMAREWELLDONE". What is the total number of bits needed to encode the string?
3. List all the steps used to search for 6 in the sequence 1, 3, 4, 5, 6, 8, 9 using a binary search.
4. Find f(3) and f(4) if f(n) is defined recursively by f(0)=1,f(1)=2, f(2)=3 and f(n)=f(n-1)+f(n-2)+f(n-3) for n>2.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
