Priority Queues CHAPTER OBJECTIVES 1. Define what a priority queue is. 2. Understand the heap operations of percolateUp and percolateDown. 3. Examine the Huffman algorithm for data compression. 4. Determine the characteristic of a greedy algorithm.
	To learn more about the book this website supports, please visit its Information Center. 2005 McGraw-Hill Higher Education Any use is subject to the Terms of Use and Privacy Policy. McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.

		Log In You must be a registered user to view the premium content in this website. If you already have a username and password, enter it below. If your textbook came with a card and this is your first visit to this site, you can use your registration code to register, or purchase access. Username: Password: Forgot your password?

		Site Preferences (Log out) Send mail as: TA email: Other email: "Floating" navigation? Drawer speed:

		Notes (What is this?)      Add a note 1. (optional) Enter a note here: 2. (optional) Select some text on the page (or do this before you open the "Notes" drawer). 3. Highlighter Color: NoneYellowRedGreenBlue 4.

		Search Search for: Search in: This siteThe web (PowerSearch)

Home > Chapter 13

Course-wide Content Labs Java Applets Source Code Errata

Choose a ChapterChapter 1Chapter 2Chapter 3Chapter 4Chapter 5Chapter 6Chapter 7Chapter 8Chapter 9Chapter 10Chapter 11Chapter 12Chapter 13Chapter 14Chapter 15

More Resources Chapter Overview PowerPoint Presentations

Instructor Resources PageOut Lab Solutions Course-wide Content Labs Java Applets Source Code Errata

Choose a ChapterChapter 1Chapter 2Chapter 3Chapter 4Chapter 5Chapter 6Chapter 7Chapter 8Chapter 9Chapter 10Chapter 11Chapter 12Chapter 13Chapter 14Chapter 15

Instructor Resources Solutions Manual

More Resources Chapter Overview PowerPoint Presentations