
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Data Structures and Algorithms; Subject: Computer Science; University: Penn State - Main Campus; Term: Spring 2009;
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Due: Monday, after the break, in class or before 2 pm on the following Tuesday (drop- off box will be in front of IST 337 when the deparment is closed).
Solve exercises from the textbook: On page 229, 1 and 2 (heap construction and checking, remember that in the book heaps have the maximum at the root, not the minimum). On page 246, 10 (post office location, use problem of computing median), On page 276, 3 and 4 (on B-trees, in class we used t , in the book, m , the relationship is 2 t = m ).