Brain teasers
A man builds a rectangular house with all sides facing south. A bear walks by. What color is the bear?
White (the house is at the North Pole, so the bear is a polar bear).
This country consumes more beer per capita than any other in the world.
Czech Republic
This is the Big-O notation for the worst-case time complexity of binary search.
O(log n)
This floppy disk size was the most common in the 1990s for data storage.
3.5 inches
This data structure uses a Last-In-First-Out (LIFO) principle.
Stack
What has keys but can't open locks?
A piano
The world’s longest single uninterrupted train journey starts in this country.
Russia
This design pattern ensures that a class has only one instance and provides a global point of access to it.
Singleton
This search engine, launched in 1996, originally went by the name "Backrub."
This algorithm finds the shortest path between nodes in a weighted graph and was invented in 1956.
Dijkstra's Algorithm
I’m not alive, but I can grow. I don’t have lungs, but I need air. What am I?
Fire
This Indian city is known as the "Silicon Valley of India."
Bangalore
In a relational database, this term describes a situation where inserting or deleting data might cause unintended side effects due to data duplication.
Data redundancy
This programming language, developed in the 1950s, is known as the first high-level language for business applications.
COBOL
This data structure is used to implement priority queues and ensures efficient access to the highest or lowest priority element.
Heap
A man is looking at a photograph of someone. His friend asks, “Who is it?” The man replies, “Brothers and sisters, I have none. But that man’s father is my father’s son.” Who is in the photograph?
His son
This Danish concept emphasizes coziness, comfort, and well-being.
Hygge
In Python, this built-in function allows you to execute a string as code dynamically.
eval()
This early web browser, created in 1993, is credited with popularizing the World Wide Web.
Mosaic
This sorting algorithm has a worst-case time complexity of O(n²) but is known for its simplicity and low overhead.
Bubble Sort
You see a boat filled with people. It hasn’t sunk, but when you look again, you don’t see a single person on the boat. Why?
All the people were married.
This German autobahn is famous for having stretches with no speed limit.
Bundesautobahn
This type of deadlock happens in concurrent programming when a process waits indefinitely for a resource that another process is holding, which is also waiting for the first process.
Circular wait
This company created the first commercially successful relational database management system in 1979.
Oracle
This self-balancing binary search tree guarantees O(log n) time for insertions, deletions, and lookups.
Red-Black Tree