cs102-1

cs102-1

University

49 Qs

quiz-placeholder

Similar activities

Python Quiz

Python Quiz

University

45 Qs

Midterm prep 10 gr

Midterm prep 10 gr

10th Grade - University

45 Qs

C PROGRAMMING -II INTERNALS EXAMINATIONS - SEP 2021

C PROGRAMMING -II INTERNALS EXAMINATIONS - SEP 2021

University

50 Qs

Ass3

Ass3

University - Professional Development

50 Qs

ICT in society

ICT in society

5th Grade - University

50 Qs

Software Design Models: Waterfall and Iterative

Software Design Models: Waterfall and Iterative

8th Grade - University

44 Qs

Pagtatapos Isa

Pagtatapos Isa

University

45 Qs

QuizBuzz

QuizBuzz

University

45 Qs

cs102-1

cs102-1

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Team Stella

FREE Resource

AI

Enhance your content in a minute

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

49 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An L-1 (L negative 1) case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is -1​. What is the solution to this rotational case?

double rotate starting with a left rotate followed by a right rotate
double rotate starting with a right rotate followed by a left rotate
single left rotate
single right rotate

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An L1 case occurs when the deleted node is in the left subtree of the closest imbalanced ancestor and the balanced factor of the right child of the ancestor is 1.​ What is the solution to this rotational case?

double rotate starting with a left rotate followed by a right rotate
double rotate starting with a right rotate followed by a left rotate
single left rotate
single right rotate

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An R-1 (R negative 1) case occurs when the deleted node is in the right subtree of the closest imbalanced ancestor and the balanced factor of the left child of the ancestor is -1.​ What is the solution to this rotational case?

double rotate starting with a left rotate followed by a right rotate
double rotate starting with a right rotate followed by a left rotate
single left rotate
single right rotate

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150, 40, 20. What will be the resulting list after the third pass?

30 - 90 - 40 - 20 - 120 - 150 - 200
30 - 40 - 20 - 90 - 120 - 150 - 200
20 - 30 - 90 - 40 - 120 - 150 - 200
30 - 90 - 40 - 120 - 20 - 150 - 200

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Applying Bubble Sort in this given list: 120, 90, 30, 200, 150. How many passes will be needed before the algorithm stops?

3
2
4
5

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Applying Insertion Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

3
2
4
5

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Applying Selection Sort in this given list: 120, 90, 30, 200, 150. How many passes or iterations will be needed before the algorithm stops?

3
2
4
5

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?