1.
Prove that every graph has an even number of odd degree vertices.
File Format: PDF/Adobe Acrobat - View as HTML Page 1. Prove that every graph has an even number of odd degree vertices.
2.
Deleting a key in a hash table with linear probing is more ...
File Format: PDF/Adobe Acrobat - View as HTML Deleting a key in a hash table with linear probing is more complicated than insertion. Explain why we can’t simply remove the key from its location in the ...
3.
Providence Rent-a-Wreck wants to provide computerized driving ...
File Format: PDF/Adobe Acrobat - View as HTML Providence Rent-a-Wreck wants to provide computerized driving directions to its customers. The driving directions are a sequence of statements of the ...
4.
A telephone network diagram is a weighted graph where the vertices ...
File Format: PDF/Adobe Acrobat - View as HTML two given vertices of a telephone network diagram. For example, in the telephone network diagram shown below, v. 1 v. 2 v. 4 is a path ...
5.
We have introduced two data structures for representing a graph ...
File Format: PDF/Adobe Acrobat - View as HTML We have introduced two data structures for representing a graph: adjacency matrix and adjacency lists and we have said that in some cases an ...
6.
Encode the following string using the Huffman encoding scheme ...
File Format: PDF/Adobe Acrobat - View as HTML Encode the following string using the Huffman encoding scheme. Also, draw the Huffman trie that gives the encoding. LILLEHAMMER.
7.
Use extendible hashing to insert the sequence of keys
File Format: PDF/Adobe Acrobat - View as HTML Use extendible hashing to insert the sequence of keys. HASHTABLEISFUN into an initially empty table. Draw all intermediate results. As in the example shown ...
8.
Let F be an ASCII file containing n total characters. Suppose that ...
File Format: PDF/Adobe Acrobat - View as HTML Let F be an ASCII file containing n total characters. Suppose that in scan- ning F we have found (roughly) equal occurrences of each of the 256 ASCII ...
9.
An independent set of a graph G = ( V, E ) is a subset I of V such ...
File Format: PDF/Adobe Acrobat - View as HTML for any u ∈ V − M. In other words, adding any other vertex to M creates a set that is not independent. Every graph has a maximal independent set. (Can you ...
10.
Use extendible hashing to insert the sequence of keys
File Format: PDF/Adobe Acrobat - View as HTML Use extendible hashing to insert the sequence of keys. HASHTABLEISFUN into an initially empty table. Draw all intermediate results. ...
