Buuble sort and 2d list Quiz

What is the correct way to swap the values of two variables, a and b, in Python?

• a = b and b = a

• a, b = b, a

• swap(a, b)

• a = b + a and b = a - b

Given a 2D list matrix = [[1, 2, 3], [4, 5, 6]], how would you access the number 5?

• matrix[5]

• matrix[2][1]

• matrix[1][1]

• matrix[0][1]

In a bubble sort algorithm, what happens during one pass through the list?

• The smallest element is moved to its final position.

• The list is completely sorted.

• Adjacent elements are compared and swapped if they are in the wrong order.

• The list is divided into two halves.

After the first pass of a bubble sort on the list [3, 7, 2, 1], what will the list look like? (Sorting in ascending order)

• [3, 2, 1, 7]

• [1, 3, 7, 2]

• [2, 1, 3, 7]

• [3, 7, 2, 1]

How do you find the number of rows in a 2D list named grid?

• len(grid[0])

• grid.rows()

• len(grid)

• grid.length

Consider the code: x = 10, y = 20, temp = x, x = y, y = temp. What are the final values of x and y?

• x = 10, y = 20

• x = 10, y = 10

• x = 20, y = 20

• x = 20, y = 10

Which of the following describes the worst-case scenario for bubble sort?

• The list is already sorted.

• The list is sorted in reverse order.

• The list contains duplicate elements.

• The list has an odd number of elements.

What will be printed by the following code? Python grid = [[10, 20], [30, 40]] print(grid[0][1])

• 10

• 20

• 30

• 40

How many passes will a bubble sort algorithm make to sort a list of 5 elements?

• 5

• 4

• 1

• It depends on the initial order of elements.

What is the primary advantage of using a temporary variable for swapping?

• It uses less memory.

• It prevents the loss of one of the original values.

• It runs faster than direct assignment.

• It only works for integers.