Browse topic-based computer-science practice sets.
3 practice sets · Page 1 of 1
What is the worst-case time complexity of Quick Sort?
O(n log n)
O(n)
O(n²)
O(log n)
Correct Answer: C — O(n²)
Explanation:
Quick Sort's worst case O(n²) occurs when the pivot is always the smallest or largest element (e.g., already sorted array with first element as pivot). Average case is O(n log n).
Which protocol is used to assign IP addresses automatically to devices on a network?
DNS
FTP
DHCP
HTTP
Correct Answer: C — DHCP
Explanation:
DHCP (Dynamic Host Configuration Protocol) automatically assigns IP addresses and other network configuration to devices.
What is the time complexity of accessing an element by index in an array?
O(n)
O(log n)
O(1)
O(n²)
Correct Answer: C — O(1)
Explanation:
Arrays support direct index-based access. The memory address is calculated as base_address + index × element_size, making it O(1).
