cs1501-fall-08-test-2

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

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

View Full Document Right Arrow Icon
CS1501 — Fall 2008 — Test-2 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, Patricia, 10 Points Here is a summary of the Patricia search algorithm: Start at the root and proceed down the tree, using the bit index in each node to tell us which bit to examine in the search key. Go left if that bit is 0, go right if it is 1. Eventually, an upwards link is encountered. Cross the link and return the value in that node. State—in one, short sentence—what major step of the algorithm is missing. Problem 2, Topological Sort, 15 Points A. How many ways can the nodes of graph A be topologically sorted? B. How many ways can the nodes of graph B be topologically sorted? C. Show one way to topologically sort the nodes of graph C.
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.

This note was uploaded on 01/27/2010 for the course CS 1501 taught by Professor Staff during the Fall '08 term at Pittsburgh.

Page1 / 5

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

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