Some Data Structures
This data structure operates using the LIFO principle.
What is a stack?
C is usually a compiled programming language.
What is true?
This UNIX utility is best suited for listing the entries of a directory.
What is ls?
This data structure is well-suited for performing breadth-first-search.
What is a queue?
This is what prevents the following code snippet from crashing.
int x = 0;
int y = 5;
if (x && y / x > 5 ) {
return true;
}
What is short-circuit evaluation?
This tree traversal is well-suited for freeing allocated memory for a tree.
What is postorder traversal?
The following code snippet is a well-defined statement in the C language.
int x = 6;
func(x++, ++x);
What is false?
This data structure grants O(1) insert and O(1) lookup on average, assuming it is created with enough entries for some workload.
What is hash table?
This is the value of the following variable, assuming it was defined in a global scope.
int x;
What is 0?
This data structure is space efficient and is well-suited for representing the truth or falseness for a set of items.
What is a bit vector?
The following code snippet is well-defined in the C language.
int i = 0;
i = i++;
What is false?
This is the time complexity of looking up in a binary search tree that isn't necessarily balanced.
This is Brian Zhao's favorite data structure.
What is a mutex?