Quizbowl CS Structures I

Move-to-front heuristic

Linked Lists

“XOR” variation reduces to one

Linked Lists

Constructed from cons cells containing car and cdr fields

Linked Lists

Several layered together is a “skip”

Linked Lists

Nodes connected in sequential order

Linked Lists

Donald Knuth popularized as “dancing”

Linked Lists

Store colliding keys

Linked Lists

“Circular” version w/ roots of Fibonacci heap

Linked Lists

Hitotumata-Noshita technique

Linked Lists

GDPR requires consent for

Cookies

“Authentication” type

Cookies

Session hijacking steals

Cookies

Max-Age/Expires attributes

Cookies

“Zombie” type recreates themselves when deleted

Cookies

Nodes are greater/less than children

Heap

O(n log n)

Heap

Implementation of priority queue

Heap

Prim’s/ Dijkstra’s algorithm

Heap

Binomial type makes merging efficient

Heap

Series of linked nodes

Trees

“binary-search” types

Trees

“Struct” command and specification of left v. right

Trees

Defined using mutual recursion

Trees

Transverse by using breadth-first search

Trees

Day–Stout–Warren algorithm

Trees

optimized by performing rotate and flip operations upon inserting new values

Trees

Balance factors equal the difference of descendants’ heights

Trees

“Red-black” type

Trees

“Minimum spanning” type

Trees

Traversed by in/pre/post-order

Trees

“Tango” type

Trees

Velsky and Landis created one type

Trees

“k-d(imensional)” type

Trees

“Self-balance”

Trees

Can be “walked through”

Trees

“Oct/quad-” types

Trees

Isomorphic to acrylic graphs

Trees

Zig-zag or zag-zag shapes

Trees

Kruskal’s algorithm computes ___

Trees

Prim’s algorithm

Trees

Ukkoken’s algorithm

Trees

Kraft’s inequality

Trees

“Polygonal map” type

Trees

Reiser filesystem

Trees

“Dancing” type

Trees

“AVL” type

Trees

Lamport signatures

Trees

Heap sort

Trees

“B/B-star” type

Trees

“Huffman” type

Trees

“Merkle hash” type

Trees

Clojure and Haskell

Functions

Constructors

Functions

“Recursive” types

Functions

init in Python

Functions

Anonymous inline examples called lambdas

Functions

Asynchronous examples use callbacks

Functions

Arrow operator

Functions

Currying

Functions

Virtual examples overridden by derived class

Functions

Dynamic scooping

Functions

Implemented using heaps

Queues

Opposite of stacks

Queues

First-in-first-out data structures

Queues

Finite types can be operated in constant time using circular buffer

Queues

Lindley equation

Queues

Kendall’s notation

Queues

Pagoda is abstract form of subclass of __

Queues

.png, .jpeg, gif

Images

Raster versions

Images

SVG

Images

XCF

Images

Atkinson/Floyd-Steinberg dithering

Images

Domain Name System (DNS)

IP address

4 hexadecimal digits

IP Address

DHCP assigns “dynamic” values for

IP Address

“V4” and “v6” types

Protocols

Self-reference beginning w/ 127

Protocols

Van Jacobson developed congestion control algorithm for

Protocols

Namesake “wars”

Protocols

ActivityPub is “federated” example of

Protocols

“Nesting”

Loops

Continue keyword

Loops

Optimized via unrolling and vectorization

Loops

Incorrectly implemented in fencepost error

Loops

Break keyword escapes ___

Loops

Written “in the wrong direction”

Loops

Contrasted w/ recursion

Loops

“Each” type

Loops

Hoisting

Loops

Fork bombs replicate via ___

Loops

“Enhanced” type in Java

Loops

Broken up via “fission”/”fusion”

Loops

Speed increased via Duff’s device

Loops

Control instructions

Loops

PERFORM statement

Loops

Tail recursion

Loops

Replaced by iterators

Loops

Contain body and condition

Loops

“Relational” versions queried using SQL

Databases