1. What is the time complexity of quicksort in the average case?
2. In Python, what is the difference between "is" and "=="?
3. Which data structure provides O(1) average time complexity for search, insert, and delete operations?
4. What does the "yield" keyword do in Python?
5. Which algorithm is commonly used to find the shortest path in a weighted graph?
6. What is the time complexity of inserting an element in a balanced binary search tree (like AVL)?
7. In Python, what is the main difference between a list and a tuple?
8. Which of the following sorting algorithms is stable?
9. In Big-O notation, what does O(1) represent?