Heap Sort

Heap Sort

12th Grade

11 Qs

quiz-placeholder

Similar activities

1.1 Computer Systems Essential Knowledge

1.1 Computer Systems Essential Knowledge

9th - 12th Grade

15 Qs

Lourdes Amaranta Ayala Gracia

Lourdes Amaranta Ayala Gracia

8th Grade - University

10 Qs

Evaluation # 1 - 7th Grade

Evaluation # 1 - 7th Grade

1st - 12th Grade

15 Qs

Python Fundamentals -2

Python Fundamentals -2

11th - 12th Grade

10 Qs

ICT Computer Basics pt1

ICT Computer Basics pt1

10th - 12th Grade

12 Qs

Kuis Dadakan ;)

Kuis Dadakan ;)

10th Grade - University

15 Qs

ICT as Social Change

ICT as Social Change

12th Grade

10 Qs

HTML & Google Site Seatwork

HTML & Google Site Seatwork

12th Grade

10 Qs

Heap Sort

Heap Sort

Assessment

Quiz

Computers

12th Grade

Practice Problem

Medium

Created by

romaysa i

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

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

11 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a binary tree?

A structure with nodes connected by edges

A tree that maintains a specific order between parent and child nodes.

A sublist created from values in an array

2.

FILL IN THE BLANK QUESTION

20 sec • 1 pt

How many children can each node have?

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the root node in a binary tree?

The node with no parent

The node with no children

4.

FILL IN THE BLANK QUESTION

1 min • 1 pt

What is a heap?

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does heapify do?

Bring the greatest number to the top of the heap

Move the greatest number to the bottom of the heap

Remove the greatest number from the bottom of the heap

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What happens to a number after it's removed from a heap?

It gets sorted into its place in the array

It gets moved to the end of the array

It moves to the beginning of the array

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the notation for heap sort's best-case scenario?

O(n log n)

O(n log 2)

O(log n)

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?