Programming Fundamentals
Data Structures
Algorithms & Big-O
Computer Hardware & Systems
Internet & Networking
100

In programming, this stores a value that can change while a program is running.

What is a variable?

100

This data structure stores elements in an ordered sequence and allows them to be accessed using an index.

What is an array?

100

This algorithm searches through a list one element at a time until it finds what it is looking for.

What is linear search?

100

This component executes instructions and performs calculations for a computer.

What is the CPU?

100

This protocol is commonly used to retrieve web pages from a server.

What is HTTP?

200

This programming structure repeatedly executes a block of code while a condition is true.

What is a loop?

200

This data structure follows the principle of “Last In, First Out.”

What is a stack?

200

This algorithm can search a sorted list in O(log n) time by repeatedly cutting the search space in half.

What is binary search?

200

Unlike a hard drive or SSD, this type of memory loses its contents when the computer is turned off.

What is RAM?

200

This system translates domain names like google.com into IP addresses.

What is DNS?

300

What is the output?

x = 10
x = x + 5
print(x)

What is 15?

300

This data structure follows the principle of “First In, First Out,” like people waiting in a line.

What is a queue?

300

Which has the better Big-O complexity for searching a sorted array: linear search or binary search?

What is binary search?

300

This component is designed specifically to perform large numbers of parallel calculations and is commonly used for graphics and machine learning.

What is a GPU?

300

This number identifies a device on a network and commonly looks like 192.168.1.10 in IPv4.

What is an IP address?

400

What is the output?

x = 3

if x > 5:
    print("A")
elif x > 2:
    print("B")
else:
    print("C")

What is B?

400

You need to frequently add and remove elements from both ends of a collection. Which data structure would be particularly appropriate?

What is a deque (double-ended queue)?

400

An algorithm takes 1 second to process 100 items using O(n²) operations. Ignoring constant factors, approximately how long would you expect it to take for 200 items?

What is 4 seconds?

400

A program has 4 GB of RAM available but attempts to use more memory than that. The operating system can use this technique to temporarily move memory data to storage.

What is virtual memory?

400

You type a website's domain name into your browser. Before your computer can communicate with the server, it generally needs to determine the server's IP address. What system helps accomplish this?

What is DNS?

500

A loop runs once for every element in a list. Inside that loop, another loop also runs once for every element in the same list. If the list contains n elements, what is the approximate time complexity?

What is O(n²)?

500

You need to repeatedly check whether a username exists in a collection, and you want average-case constant-time lookup. Which data structure would be a strong choice?

What is a hash table/hash map?

500

You have an unsorted array and need to find its largest value. What is the best possible Big-O time complexity for this task?

What is O(n)?

500

A CPU has 8 cores. Does that automatically mean a single-threaded program will run 8 times faster? Explain why or why not.

No. A single-threaded program generally cannot take full advantage of all 8 cores; multiple cores are most useful when work can be performed in parallel.

500

HTTPS is essentially HTTP combined with this security protocol, which encrypts data transmitted between a browser and a server.

What is TLS (Transport Layer Security)?

M
e
n
u