asg7 - a) Compress the string sequence...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COP 3530 Assignment 7 Due: 14 th Oct 2009 1. Given a hash table with 13 buckets (b = 13), and a hash function f(k) = k % b, insert the elements whose keys are: 52, 53, 114, 128, 12, 105, 147, 60, 139, 27, 92 in this order. Use linear probing to resolve collisions. a) Draw the hash table after the last insert. b) What is the loading density of your table after the last insert? c) What is the maximum number of buckets examined in the unsuccessful search of your table? d) What is the maximum number of buckets examined in the successful search? e) Draw the hash table after the operation remove(53). 2. Start with an LZW compression dictionary that has the entries (a,0) and (b,1)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a) Compress the string sequence "ababbabbba". For each character encountered, draw the code table following the encoding of each character. The initial configuration is shown below. Complete the remaining process. Initial Configuration Code 0 1 Key a b Compressed string = null b) Decompress the code sequence "0214016". For each code encountered, draw the decode table following the decoding of each code. The initial configuration is shown below. Complete the remaining process. Initial Configuration Code 0 1 Key a b Decompressed string = null...
View Full Document

This note was uploaded on 01/15/2010 for the course COP 3530 taught by Professor Davis during the Fall '08 term at University of Florida.

Ask a homework question - tutors are online