DATA STRUCTURES
This data structure stores elements in a contiguous block of memory and is accessed using indices
What is an ArrayList?
The result if number = 1234 is...
if (number % 2 == 0) {
cout << "I love BSCS";
} else {
cout << "BSCS is cool";
}What is I love BSCS?
This is the basic unit of information in computing, which can only be 0 or 1
What is a bit
The CS Department is mainly located in this building on campus
What is the Joyce Cummings Center? (JCC)
This data structure consists of nodes where each node points to the next one
What is a Linked List?
This code snippet does...
for (int i = 0; i < n / 2; i++) {
int temp = list[i];
list[i] = list[n - 1 - i];
list[n - 1 - i] = temp;
}
What is reverse a list?
In programming, this is used to store data like numbers or text for later use.
What is a variable?
This professor currently teaches the Intro to Computer Science course, CS 11
Elyse Cornwall
This data structure follows the Last-In-First-Out (LIFO) principle
What is a Stack?
The result of the array = {64, 34, 25, 12} is....
for (int i = 0; i < arraySize - 1; i++) {
for (int j = 0; j < arraySize - i - 1; j++) {
if (array[j] > array[j + 1]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
What is {12, 25, 34, 64}?
Used to repeat actions without having to write the same code over and over.
What is a Loop?
This hub, located at 20 Professors Row, aims to promote the academic success for those historically excluded in STEM
What is the Center for STEM Diversity?
This data structure processes elements in the order they were added, following the First-In-First-Out (FIFO) principle
What is a Queue?
This code snippet....
int evaluateArray(int arr[], int size) {
int result = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] > result) {
result = arr[i];
}
}
return result;
}
What is finds the max value in a list?
What is it when a function calls itself?
What is recursion
The department chair for Tufts Computer Science
Who is Jeffrey Foster?
This data structure stores key-value pairs to provide efficient lookups, insertions, and deletions
What is a Hashmap?
The resulting bool when str = "rotator" is...
bool doodoo = true;
for (int i = 0; i < str.size() / 2; i++) {
if (str[i] != str[str.size() - 1 - i]) {
doodooo = false;
break;
}
}
What is true?
This is a named block of code you can call to perform a specific task, often with inputs and outputs.
What is a function?
This is the BEST CS Club at Tufts!
What is Black Students in Computer Science?