Homework 6 Practice Problems on Data Structures and Algorithms | CMPSC 465, Assignments of Computer Science

Material Type: Assignment; Class: Data Structures and Algorithms; Subject: Computer Science; University: Penn State - Main Campus; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 09/24/2009

koofers-user-ia3
koofers-user-ia3 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMPSC 465, Spring 2009, Homework 6
Due: Monday,after the break, in class or before 2 pm on the following Tuesday (drop-
offbox will be in front of IST 337 when the deparment is closed).
Solveexercises 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,inthe book, m,the relationship is
2t=m).

Partial preview of the text

Download Homework 6 Practice Problems on Data Structures and Algorithms | CMPSC 465 and more Assignments Computer Science in PDF only on Docsity!

CMPSC 465, Spring 2009, Homework 6

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 ).