Turtle
Turtle command to put the pen up.
What is turtle.up()?
The case that stops the recursion.
What is a base case?
The complexity of Insertion Sort.
What is O(N^2)? (In the context of Insertion Sort)
A FIFO/LILO structure.
What is a Queue?
A node that has no parent.
What is a root node?
A function used to set the fill color.
What is fillcolor()?
A loop that runs until a condition is no longer true.
What is a while loop?
The time complexity of the worst case of Merge Sort.
What is O(NLogN)? (In the context of Merge Sort)
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?
Turtle command used to draw a circle of diameter 100.
What is turtle.circle(50)?
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)? (In the context of Quick Sort)
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)?
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 time complexity of Selection Sort.
What is O(N^2)? In the context of Selection Sort?
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?
The code used to draw a circle with a blue outline and a green infill
import turtle as t
t.pencolor('blue')
t.fillcolor('green')
t.begin_fill()
t.circle(100)
t.end_fill()
t.done()
The error you get when you recursive infinitely.
What is 'Maximum Recursion Depth Exceeded'?
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)? (In the context of Priority Queue operations)
The import statement necessary to declare the immutable LinkNode dataclass.
What are the statements:
from dataclasses import dataclass
from typing import Any, Union?