
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
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
1 / 1
This page cannot be seen from the preview
Don't miss anything!

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.
Given this configuration of heap and input, what the next 4 keys that will be written to output?