OS
Operating System
This is the year UOP was founded
1851
A chunk of code stored in a block that you can use over and over again
What is a function?
This company, whose founder is often compared to a lizard, recently rebranded under this name
Meta
In Java:
String s = null;
s.equals("Hello World");
NullPointerException
HTML
HyperText Markup Language
Associate Professor of Mathematics John Mayberry has worked closely with coach James Graham to apply sports analytics to this sport, which UOP is famous for.
Water Polo
A programming paradigm based on the concept of "objects", which can contain data and code
What is Object Oriented Programming?
South Korea is suing this tech giant after it allegedly increased internet traffic too much.
Netflix
In Python:
arr = [1, 2]
print(arr[2])
IndexError
OOP
Object Oriented Programming
This was one of the two locations that UOP used to be located at
Santa Clara or San Jose
An area of memory for storing temporary data. This, like its corresponding data structure, follows a last-in-first-out policy.
What is the stack?
This MANGA company is notorious for its unrepairable hardware.
Apple
In Java:
List<Integer> list = new ArrayList<>();
LinkedList<Integer> linkedList = (LinkedList<Integer>) list;
ClassCastException
USB
Universal Serial Bus
The adventurous main character of this famous film franchise teaches at a university which uses UOP as a film set
Indiana Jones
In C-like languages, function and class declarations belong here.
What is a header (.h) file?
This alternative to GCP controls 33 percent of the cloud infrastructure market.
Amazon Web Services
In Python:
a = 500
b = 1000
c = a * b
d = 1 / (c - a * b)
ZeroDivisionError
ADT
Abstract Data Type
A Master's Degree in computer science was first offered during this year
2021
The method for measuring an algorithm's efficiency against other algorithms.
What is Big O Complexity?
This board game whose champion, Lee Sedol, was defeated by an AI is also a C-like programming language developed by Google.
Go
In Java:
private int fibonacci(int n) {
if(n == 0) return 1;
return fibonacci(n - 1) + fibonacci(n - 2);
}
StackOverflowError