Python Variable and List Operations Quiz

Study Notes

Python Variable Errors

Check variable names for case sensitivity.
Ensure variable names are not Python keywords.
Variable names should not contain spaces, commas, or symbols.
Variable names cannot begin with a digit.

Lab 4: List Operations

Inserting at the back: Constant time complexity (O(1)).
Inserting at the front: Linear time complexity (O(n)).
Time complexities (from best to worst): O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ), O(n!).

Lab 6: Sorting Algorithms

Bubble Sort: Compares adjacent elements and swaps if necessary.
- Best case: O(n).
- Worst case: O(n²).
Selection Sort: Finds the minimum element and swaps it.
- All cases: O(n²).
Insertion Sort: Inserts elements into their correct position in a sorted sub-list.
- Best case: O(n).
- Worst case: O(n²).
All sorting algorithms have a space complexity of O(1).
Best Choices:
- Insertion Sort: Good for small or nearly sorted arrays.
- Bubble Sort: Not ideal for large datasets.
- Selection Sort: Avoid due to always being O(n²).
Merge Sort: Fastest sorting algorithm; O(n log n) time complexity.
Stability:
- Insertion and Bubble sorts are stable.
- Selection sort is not stable.
Adaptability:
- Insertion Sort: Adaptable for nearly sorted data.
- Bubble Sort: Slightly adaptable for nearly sorted data.
- Selection Sort: Not adaptable. Used to minimize writes.

Lab 7: Indexing

Array indexes start at 0.
Array index end must be minus one.

Lab 8: Linear Search

Linear search (sequential search) checks each element until the target is found.
Does not require a sorted list.

Lab 9: Binary Search

Binary search requires a sorted list.
It repeatedly divides the search interval in half.
Time Complexities:
- Linear search: O(n).
- Binary search: O(log₂ n).

Lab 10: Tuple Immutability

Tuples are immutable; you cannot change their elements.
Attempting to change a tuple element will result in an error.

Lab 11: Variable Identity

Assigning a variable to another: c = a creates a reference (same identity).
Slicing a list or using a new index: d = a[:] creates a new object (different identity).

Lab 12: List Sorting Methods

sort(): Modifies the original list in-place (same identity).
sorted(): Creates a new sorted list (different identity).

Description

Test your knowledge on Python variable naming rules and list operations. This quiz covers variable case sensitivity, time complexities of list insertion, and sorting algorithms. Challenge yourself to see how well you understand these fundamental concepts in Python.