MATH 211
MATH 265
PHIL 279
SENG 300
CPSC 231
CPSC 233
CPSC 251
CPSC 331
CPSC 351
CPSC 355
CPSC 413
CPSC 449
CPSC 457
100

I am a list of vectors

What is the matrix?

100

I am the rate of change.

What is the derivative?

100

I am the logical operation represented by  wedge

What is AND?

100

I am a project structure diagram.

What is UML?

100

I am a data type with two values.

What is a Boolean?

100

I am the method called when an object is created.

What is a constructor?

100

I am an unordered list of objects.

What is a set?

100

I am the data structure that follows last in, first out.

What is a stack?

100

I define regular languages.

What is a DFA/NFA?

100

I am the number system with only 0 and 1s.

What is binary?

100

I am an algorithm design principle that breaks tasks into subtasks.

What is divide and conquer?

100

I occur when a function calls itself.

What is recursion?

100

I am the program that is currently executing.

What is a process?

200

I am replace columns with rows and rows with columns.

What is the transpose?

200

I am the accumulation of change.

What is the integral?

200

I am used to determine the truth value of a sentence for every combination of inputs.

What is a truth table?

200

I am the tracking and managing changes to source code.

What is version control?

200

I execute a block of code while a condition remains true.

What is a while loop?

200

I occur when multiple methods have the same name.

What is overloading?

200

I am the four ways of negating a conditional

What is negation, inverse, converse, and contrapositive.

200

I am the data structure that follows first in, first out.

What is a queue?

200

I consist of infinite tape, a read/write head, and a finite number of states.

What is a Turing machine?

200

The register that holds the address of the current instruction?

What is the program counter?

200

I am an algorithm design principle that repeatedly makes the most locally optimal choice.

What is a greedy algorithm?

200

I am the programming language associated with logic programming?

What is Prolog?

200

I am a distinct execution within a process. 

What is a thread?

300

I am the scalar which describes how much a matrix warps space.

What is the determinate?

300

I approach values, but never reach them.

What is the limit?

300

I am the result of both P and  not P being true.

What is a contradiction?

300

The testing of components in isolation to verify that they work as intended?

What is unit testing?

300

I am a reusable block of code.

What is a method / function?

300

I am a class which can only be inherited.

What is an abstract class?

300

I am the proof technique which has a base case and an inductive step.

What is induction?

300

I am the two methods of traversing a graph.

What is DFS/BFS?

300

Transforming one problem into another to show that solving the second can solve the first?

What is a reduction?

300

I am used to store dynamically allocated memory.  

What is the heap?

300

I solve overlapping subproblems once, and save their results for later use.

What is dynamic programming?

300

I am a function which gives the same output for the same input.

What is a pure function?

300

I am the part of the operating system responsible for managing system resources.

What is the kernel?

400

I am the vector which is unchanged after applying a transformation.

What is an eigenvector?

400

I am the point where the concavity of a function changes.

What is a inflection point?

400

I am the logical rule P->Q, P vdash Q

What is modus ponens?

400

I am the agile framework which organizes development into sprints.

What is scrum?

400

I am the index of the first element in a list.

What is 0?

400

I am a class which inherits from another.

What is a subclass?

400

I am the data structure which connects nodes with edges.

What is a graph?

400

I am the sorting algorithm that divides and recursively sorts an array around a pivot.

What is quicksort?

400

This inequality uses the expected value of a random variable to find an upper bound on its probability.

What is Markov's inequality?

400

I am the region of memory used to store local variables.

What is the stack?

400

I am the algorithm used to find the shortest path between two nodes.

What is Dijkstra's algorithm?

400

I delay evaluating an expression until its value is actually needed.

What is lazy evaluation?

400

I occur when the result of a program depends on the timing of another operation.

What is a race condition?

500

I contain 0, am closed under addition, and closed under scalar multiplication.

What is a vector space?

500

I am used to evaluate certain limits involving indeterminate forms.

What is L'Hopital's Rule?

500

I am this rule:

not (A vee B) equiv not A wedge not B

What is De Morgan's Law?

500

I am a unit used to estimate the effort, complexity, and uncertainty of a task.

What is a story point?

500

I am the operator which returns the remainder after division.

What is modulus?

500

I am the four pillars of OOP.

What are encapsulation, abstraction, inheritance, and polymorphism?

500

I am the mascot of this course

Who is fred?

500

I am the algorithm that finds a minimum spanning tree in a graph.

What is Prim's algorithm?

500

I am the problem of determining whether a Turing machine will eventually halt on a given input, a problem proven to be undecidable?

What is the Halting Problem?

500

I am used by a program to request a service from the operating system.

What is a system call?

500

I describe a problem that is both in NP and NP-hard.

What is NP-complete?

500

I am a function that takes another function as an argument and returns one as a result.

What is a higher order function?

500

Mutual exclusion, hold and wait, no preemption, and circular wait are the four necessary conditions for me to occur.

What is deadlock?