DSA Group 2 (Heaps Quiz)

DSA Group 2 (Heaps Quiz)

University

8 Qs

quiz-placeholder

Similar activities

Determining System Requirements

Determining System Requirements

University

11 Qs

INTO Artificial Intelligence

INTO Artificial Intelligence

University - Professional Development

10 Qs

Let's Play Together

Let's Play Together

University - Professional Development

10 Qs

basic computer design

basic computer design

University

10 Qs

Network Management Week 14

Network Management Week 14

University

10 Qs

How Safe are you? (Disclaimer: I do not own these questions)

How Safe are you? (Disclaimer: I do not own these questions)

University

10 Qs

QUIZZ 1 : DATABASE FUNDAMENTALS

QUIZZ 1 : DATABASE FUNDAMENTALS

University

10 Qs

Machine Learning (Introduction)

Machine Learning (Introduction)

University

10 Qs

DSA Group 2 (Heaps Quiz)

DSA Group 2 (Heaps Quiz)

Assessment

Quiz

Computers

University

Practice Problem

Medium

Created by

Thed Palting

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

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

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

Removes the maximum element from Max Heap.

getMax()

extractMax()

insert()

extractMin()

2.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

It returns the root element of Min Heap.

getMin()

extractMin()

getMax()

insert()

3.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

These are all the importance of Heap in programming EXCEPT:

Efficient Priority Queues

File Compression

Memory Management

Garbage Collection

4.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

A Heap is a special Tree-based data structure in which the tree is a complete binary tree where the value of each parent node is either higher or lower than the value of its child nodes.

True

False

5.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

These are all the various uses of Heap EXCEPT:

Sorting Algorithms

Dynamic Programming

Load Balancing

None of the above

6.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

it is a complete binary tree in which the value in each internal node is smaller

than or equal to the values in the children of that node.

Min Heap

Max Heap

7.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

It is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node.

Min Heap

Max Heap

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?