Intermediate Python Data Structures Mastery
Assess your understanding of intermediate Python data structures and their applications.
Questions in this quiz
12 questions on Intermediate Python Data Structures Mastery. Work through them here, then start the quiz to answer them and see your score.
1.Which of the following data structures is best suited for implementing a LIFO stack in Python?
- AList
- BSet
- CTuple
- DDictionary
2.What is the time complexity of accessing an element in a Python dictionary?
- AO(log n)
- BO(n)
- CO(n log n)
- DO(1)
3.Which method would you use to add an element to a set in Python?
- Aadd()
- Bextend()
- Cappend()
- Dinsert()
4.How can you remove a key-value pair from a dictionary in Python?
- Aremove()
- Bpop()
- Cdelete()
- Ddiscard()
5.What will be the output of the following code snippet? `a = [1, 2, 3]; b = a; b.append(4); print(a)`
- A[4, 1, 2, 3]
- B[1, 2, 3]
- C[1, 2, 3, 4]
- D[1, 2, 3, 4, 4]
6.Which of the following is true about Python tuples?
- AThey do not support indexing
- BThey are slower than lists
- CThey are mutable
- DThey can contain duplicate elements
7.What is the primary advantage of using a deque over a list for queue operations?
- AFaster append operations
- BFaster append and pop from both ends
- CFaster indexing
- DFaster pop operations
8.Which of the following operations is not supported by Python sets?
- AUnion
- BIndexing
- CDifference
- DIntersection
9.What will be the result of executing `set('abcabc')` in Python?
- A{'abc'}
- B['a', 'b', 'c']
- C('a', 'b', 'c')
- D{'a', 'b', 'c'}
10.Which Python data structure would you use to implement a priority queue?
- AHeapq
- BDictionary
- CSet
- DList
11.What is the result of the operation `{'a': 1, 'b': 2}.get('c', 3)`?
- ANone
- B1
- C3
- D2
12.Which of the following is a characteristic of Python's namedtuple?
- AFields are accessible by name
- BFaster than dictionaries
- CSupports item assignment
- DMutable