c340s01t1 - CSc 340 Test 1 Wednesday 14 February 2001 Close...

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

View Full Document Right Arrow Icon
CSc 340 Test 1 Wednesday 14 February 2001 Close book. Closed notes. No Calculators allowed. Answers available when you leave. Each question is worth 20 points. 1. A number of students tried to improve on the algorithm for computing the value of a polynomial p(x)=a n x n + a n-1 x n-1 + … +a 1 x+ a 0 as follows, p=a 0 for(i=1; i<=n; i++) p=p+a i *pow(x,i) either making the argument that multiplication is the basic operation and there is only one multiplication per iteration or that a call to pow() is the basic operation and there is only one call to pow() per iteration. Discuss why neither multiplication nor a call to pow() is a good choice for the basic operation. 2. Suppose one uses the following algorithm from the book to determine the index of K in the ordered array E[1]<E[2]<…<E[100]: divide the array into n segments of equal length, determine whether to search for K in a segment by comparing K to the last entry in the segment, and then do a linear search in the target segment. (a) Perform a worst
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/29/2008 for the course CSC 340 taught by Professor Varies during the Spring '01 term at Lehigh University .

Page1 / 2

c340s01t1 - CSc 340 Test 1 Wednesday 14 February 2001 Close...

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

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