{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

scan0028

# scan0028 - SDSU Fall 2006.e 4(ZS—662 ’ Parallel...

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SDSU Fall 2006 .e 4 (ZS—662 ’ Parallel Algorithms ,{ . PRACTICE EXAM #1 (100 points; problems are equally weighted) PROBLEM #1 Indicate whether each statement below is TRUE or FALSE by circling the appropriate letter Cr] ir) Ifa problem can be solved in 0(10g N) time by a PRAM with N2 EREW ‘ L/ processors, then the same problem can be solved in 0(N log N) time by a PRAM with N common CRC W, processors. _ 5 {Ta} T2) F The largest element in any unsorted array of N nonnegative integers can be determined in O( 1 ) time by a PRAM with N2 common CRCW processors. ﬂ . ”“k G @ The largest element in any unsorted array of N2 nonnegative integers can be N ) time by a PRAM with N common CRQW ﬂ . . 10gN (fail 5g}. 0;; ﬁ( N .Kl/(czfﬂ processors and 0(N2) auxiliary memory. fried"? W‘” “jig Np 51(qu f”) determined in O( F If a problem can be solved in 0( log log N ) time by a PRAM with N BREW processors, then the same problem can be solved in 0( log log N) time by a PRAM with N common CRCW processors. each of which is strictly less than N 3 , can be determined in 0(1) time by a PRAM with N common CRCW processors. F N nonnegative integers can be summed in O(log N) time by a PRAM with N EREW processors. 1 5-2 @ f’ F l The largest element in an unsorted array of N nonnegative integers, ﬂ Cl) (E) N nonnegative integers can be summed in 0(log N) time by a PRAM with N EREW processors. [3-3 .. logN s @ Q N nonnegative integers can be summed in 0(log N) time by a PRAM with N CREW processors. 7417/ ﬂare mm” M EV 59“ Z“? (161%!)— {)7 log N . aeew l l @j Thg-second—largest element in any unsorted array of N nonnegative integers can be determined in O(loglog N) time using a PRAM with N common CRCW processors. V lag“) ,i; CM’W’L‘ 7;, 1 36% M . T (/F} If sequential algorithm A requires execution of 1200 instructions, 600 of which must be performed sequentiallyiso that‘§(_)% of algorithm A's code cannot be parallelized), then according tdéindahl's LEW: the maximum speedup possible from parallelizing algorinnn A across 16 processors is therefore 8 . ...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern