Đang tải đề thi...

Computer Science

AP Computer Science: Python Data Structures & Algorithmic Thinking

AuthorThế Toàn Đỗ

High-yield 10-question AP Computer Science practice exam covering hash maps, stacks, queues, recursion, binary search, two-pointer algorithms, slice operations, and sorting complexities.

A

25
Minutes: 10
Questions: 10
Total points: 1
Attempts

Preview the questions

Showing the first 5 of 10 questions. Answers and explanations are shown after submission.

1
In Python, what is the average-case time complexity of looking up a key in a standard dictionary (`dict`), and what underlying data structure enables this?
- A.O(1) average time, backed by an optimized hash table.
- B.O(log n) time, backed by a balanced red-black binary search tree.
- C.O(n) time, backed by a singly linked list with sentinel nodes.
- D.O(n log n) time, backed by a randomized quicksort heap.
2
Consider the Python recursive function: def mystery(n): return 1 if n <= 1 else n * mystery(n - 1). What is the return value of mystery(5) and what occurs when evaluated with mystery(-5)?
- A.Returns 120 for mystery(5); returns 1 for mystery(-5) because -5 <= 1 evaluates to True.
- B.Returns 120 for mystery(5); raises RecursionError for mystery(-5).
- C.Returns 24 for mystery(5); returns 0 for mystery(-5).
- D.Returns 720 for mystery(5); raises TypeError for mystery(-5).
3
Which data structure follows the Last-In, First-Out (LIFO) protocol, and which standard Python collection method provides optimal O(1) push and pop operations for it?
- A.Stack, implemented with list.append() and list.pop().
- B.Queue, implemented with list.insert(0, val) and list.pop().
- C.Priority Queue, implemented with dict.setdefault().
- D.Linked List, implemented with str.replace().
4
Binary search requires that an input array be sorted. If an array contains 1,048,576 (2^20) sorted elements, what is the MAXIMUM number of comparisons required to determine if a target value exists?
- A.21 comparisons
- B.1,024 comparisons
- C.524,288 comparisons
- D.1,048,576 comparisons
5
Given nums = [10, 20, 30, 40, 50, 60, 70] in Python 3, what is the output of the slice operation print(nums[1:6:2])?
- A.[20, 40, 60]
- B.[10, 30, 50]
- C.[20, 30, 40, 50, 60]
- D.[30, 50, 70]

Take the full quiz