cs1501-fall-08-test-3

cs1501-fall-08-test-3 - CS1501 Fall 2008 Test-3...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS1501 — Fall 2008 — Test-3 Instructions: Complete your work on this test booklet and put your fnal answers on the answer sheet. Put your name and email on both the test booklet and the answer sheet and hand them to the instructor. Only the answer sheet will be graded. You may separate the answer sheet From the test. Name: Email:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem 1, 10 Points Construct an optimal binary search tree for the nodes A , B , C , D , and E , and frequencies f ( A ) = 1, f ( B ) = 2, f ( C ) = 1, f ( D ) = 100, and f ( E ) = 1. Problem 2, 10 Points Construct the digital search tree that results from the insertions A=00001 , B=00010 , R=10010 , and S=10011 . Compare bits left-to-right as you move down the tree, branch left on 0 , and branch right on 1 . Problem 3, 10 Points Construct the radix search trie that results from the insertions A=00001 , B=00010 , R=10010 , and S=10011 . Compare bits left-to-right as you move down the tree, branch left on 0 , and branch right on 1 .
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

cs1501-fall-08-test-3 - CS1501 Fall 2008 Test-3...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online