Priority Queues and Heaps

Priority Queues and Heaps

9th - 12th Grade

10 Qs

quiz-placeholder

Similar activities

Access - Lesson 14

Access - Lesson 14

9th - 12th Grade

10 Qs

ICT 10 : Introduction to Adobe Illustrator(CS5)

ICT 10 : Introduction to Adobe Illustrator(CS5)

10th Grade

10 Qs

4.6.4 Logic Gates

4.6.4 Logic Gates

10th Grade - Professional Development

15 Qs

Wee Word Intro

Wee Word Intro

7th - 12th Grade

12 Qs

Know thy Peer-to-Peer

Know thy Peer-to-Peer

12th Grade

10 Qs

TCP/IP & other protocols [A Level]

TCP/IP & other protocols [A Level]

12th Grade

14 Qs

MIL March 8, 2023

MIL March 8, 2023

12th Grade

10 Qs

UNIT 1.8 ELCE

UNIT 1.8 ELCE

10th Grade

14 Qs

Priority Queues and Heaps

Priority Queues and Heaps

Assessment

Quiz

Computers

9th - 12th Grade

Practice Problem

Hard

Used 114+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

Which of the following are min heaps?

A

B

C

D

2.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

The 2 properties of a min heap are _____.

Tree must be full.

Tree must be complete.

Node values are always smaller than their children's values.

Node values are always greater than their children's values.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

How many swaps are made in the min heap when inserting the value 18?

0

1

2

3

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the efficiency of adding to a priority queue using the java.util.PriorityQueue class?

O(n)

O(n log n)

O(1)

O(log n)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What operation has efficiency O(1) using the java.util.PriorityQueue class?

Add

Remove

Peek

6.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Which of the following PriorityQueue<E> methods will throw an exception when used on an empty queue?

E remove()

E peek()

E element()

E poll()

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When removing the root from a min heap, what is the first step?

Replace the root with the next smallest value from the tree

Replace the root with the leaf furthest to the left on the bottom level of the tree

Replace the root with the leaf furthest to the right on the bottom level of the tree

Replace the root with the smallest of its children

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?