cs102-1

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

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

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

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

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

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

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

Choose all valid syntax for an operator used on a Queue data structure?

• dequeue()
• front()
• enqueue()
• top()

Choose all valid syntax for an operator used on a Stack data structure?

• pop()
• top()
• push()
• front()

In this sorting algorithm, we locate the smallest element from the given list and swap it with the element currently placed on the first position. ​Then, we find the second smallest element from the list and swap it with the element currently placed on the second position. ​The process continues until we get the sorted list.

• Selection Sort
• Insertion Sort
• Radix Sort
• Shell Sort