Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Lecture Notes on Priority Queue ADT | COMP SCI 367, Study notes of Data Structures and Algorithms

University of Wisconsin (UW) - MadisonData Structures and Algorithms

W7(b) Lecture Notes (Skrentny) Material Type: Notes; Class: Introduction to Data Structures; Subject: COMPUTER SCIENCES; University: University of Wisconsin - Madison; Term: Spring 2014;

Typology: Study notes

2013/2014

Uploaded on 03/11/2014

kmfischer3
kmfischer3 🇺🇸

12 documents

1 / 9

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Copyright 2014 Jim Skrentny CS 367 L14 - 1
CS 367 Announcements
Thursday, March 6, 2014
Homework h5 assigned tomorrow
Program p2 due 10 pm Sunday, March 9th
• submit java files to your “in” directory
• make sure to name your source files as specified in th submission section
• verify that you’ve submitted the correct files (ls, more, javac, java)
• partners? only ONE submits source but BOTH submit README.txt
Program p3 assigned this weekend
Last Time
• exam mechanics
• sample questions
• Q&A
Today
Priority Queue ADT
• concept
• operations
• implementation options
Trees Intro
Heap Data Structure
• concept
• heap implementations & complexity
Next Time
Recursion
• recursion vs. iteration
• call stack tracing
• writing recursive code
• execution tree tracing
pf3
pf4
pf5
pf8
pf9

Partial preview of the text

Download Lecture Notes on Priority Queue ADT | COMP SCI 367 and more Study notes Data Structures and Algorithms in PDF only on Docsity!

Thursday, March 6, 2014^ CS 367 Announcements

Homework h5 assigned tomorrow Program p2 due 10 pm Sunday, March 9th • submit java files to your “in” directory

  • • make sure to name your source files as specified in th submission sectionverify that you’ve submitted the correct files (ls, more, javac, java)

Program p3 assigned this weekend^ •^ partners? only ONE submits source but BOTH submit README.txt Last Time • exam mechanics

  • • sample questionsQ&A

Today Priority Queue ADT

  • • conceptoperations
  • Trees Intro implementation options Heap Data Structure • concept
  • heap implementations & complexity Next Time Recursion
  • • recursion vs. iterationcall stack tracing
  • • writing recursive codeexecution tree tracing

Priority Queue ADT

Priorities

Concept

Operations

Options for Implementing a Priority Queue ADT

data structure insert^ removeMax^ notes

unordered array

ordered array

chain of nodes^ unordered

chain of nodes^ ordered

Tree Terminology

  1. Which is the root?
  2. How many leaves are there?
  3. How many nodes are in the right branch/subtree of B?
  4. Which is the parent of G?
  5. How many children does E have (degree of E)?
  6. Which is the sibling of E?
  7. How many descendants does B have?
  8. What are the ancestors of C?
  9. What is the length of the path from B to D?
  10. What is the height of the tree?
  11. What is the depth/level of J?

A B C D

E

F

G

H

J I

Inserting into a Max Heap

Algorithm

Given the following max heap:

 Show the heap after inserting 36:

 Show the heap after inserting 57:

Inserting into a Max Heap (cont.)

Heap Class Instance Variables: privateprivate Comparable[]int nextLoc; items;

Pseudo-code public void insert(Comparable data) {

Complexity