CS 2606 Data Structures and OOP II Homework #3 - Prof. W. Richardson, Assignments of Data Structures and Algorithms

The instructions and exercises for homework #3 of the cs 2606 data structures and oop ii course, which was offered in spring 2008. The homework includes three programming exercises, each based on a problem from the textbook. The first question asks to determine the next four keys that will be output by the replacement selection algorithm given a specific heap configuration and input. The second and third questions are programming exercises based on problems found on pages 290 and 354 of the textbook, respectively.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-47m
koofers-user-47m 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 2606 Data Structures and OOP II Spring 2008
Homework #3 Due: 6 April, 11:59pm
Name _____________________________
PID ____________
Email ____________
You will submit this homework through the curator system in any format that can be
opened using Microsoft Word or Notepad. If you submit more than one version of your
homework, we will grade the latest one. Make sure that your file contains, at the top of
the document, your name, your ID number, and your email address.
1. The figure below is an example of the replacement selection algorithm.
Input Memory Output
10 ??
27 … ??
33 … ??
54 … ??
Given this configuration of heap and input, what the next 4 keys that will be written
to output?
2. Exercise 8.10 on page 290 of the book.
3. Exercise 10.10 on page 354.
4. Exercise 10.13 on page 354.

Partial preview of the text

Download CS 2606 Data Structures and OOP II Homework #3 - Prof. W. Richardson and more Assignments Data Structures and Algorithms in PDF only on Docsity!

CS 2606 Data Structures and OOP II Spring 2008 Homework #3 Due: 6 April, 11:59pm

Name _____________________________ PID ____________ Email ____________

You will submit this homework through the curator system in any format that can be opened using Microsoft Word or Notepad. If you submit more than one version of your homework, we will grade the latest one. Make sure that your file contains, at the top of the document, your name, your ID number, and your email address.

  1. The figure below is an example of the replacement selection algorithm. Input Memory Output

Given this configuration of heap and input, what the next 4 keys that will be written to output?

  1. Exercise 8.10 on page 290 of the book.
  2. Exercise 10.10 on page 354.
  3. Exercise 10.13 on page 354.