The Basics + Turtle
Turtle command to put the pen up.
What is turtle.up()?
The case that stops a recursive call.
What is a base case?
The Big-O time complexity of Insertion Sort.
What is O(N^2)?
A FIFO/LILO structure.
What is a Queue?
A node that has no parent.
What is a root node?
A function that returns an int based on the fields of an object.
What is a Hash Function?
Definition of a "fruitful function".
What is a function with a return value?
A loop that runs until a condition is no longer true.
What is a while loop?
The worst case time complexity of Merge Sort.
What is O(NLogN)?
A FILO/LIFO structure.
What is a Stack?
A tree where the value of the left child is always less than the value of the parent and the value of the right child is always greater than the value of the parent.
What is a Binary Search Tree?
Two different ways to deal with collisions
What are Open Addressing and Chaining?
The value of a string indexed at -1.
What is the string's last character?
A type of function where the last thing that happens is the recursive call.
What is a Tail Recursive function?
The average time complexity of Quick Sort.
What is O(NLogN)?
The fields of a Queue as discussed in class.
What are front, back, and size?
A statement that declares an immutable dataclass.
What is @dataclass(frozen=True)?
The time complexity of Open Addressing Hashtable functions given that the table does not rehash
What is O(N)?
Import statement used to call turtle functions without typing 'turtle.' before the function.
What is 'from turtle import *'?
A function used to generate a list of numbers to iterate through.
What is the range function?
The data set that makes quick sort perform its worst.
What is a reverse ordered list?
The complexity of pushing, popping, peaking and getting the size of a stack.
What is O(1)? (In the context of Stack operation)
The tree traversal that visits the parent node last.
What is post-order traversal?
Technique used to always ensure O(1) operations with open addressing
What is rehashing?
Ouput of:
print( 5, "x", 2, sep="" ) ?
What is: 5x2 ?
The error you get when you recursive infinitely.
What is 'Maximum Recursion Depth Exceeded' or 'Stack Overflow'?
The time complexity of Binary Search.
What is O(LogN)? (In the context of Binary Search)
The complexity of enqueing a node to a Priority Queue.
What is O(N)?
The import statement necessary to declare the mutable LinkNode dataclass.
What are the statements:
from dataclasses import dataclass
from typing import Any, Union?
You have a hash function that returns the length of the string. The location of the string "Yoo this is the last SI session" in a hash table with a capacity of 3.
What is Index 1?