Data Structures
This data structure is typically implemented with arrays or linked lists. Its main functionality is the easy retrieval of the last element inserted into the structure.
What is a Stack?
This object-oriented programming language is intended to let programmers write once, run anywhere using its own virtual machine is owned by Oracle.
What is Java?
This algorithm can traverse the entire data structure to find a target element. It can be used with either a sorted or an unsorted array.
What is Linear Search?
This data structure is typically implemented with linked lists. Its main functionality is the easy retrieval of the oldest element inserted into the structure.
What is Queue?
This language is widely used in machine learning and as an introductory programming language. Designed by Guido Van Rossum
What is Python?
This algorithm traverses a tree by visiting all nodes on a level before moving onto the next
What is Breadth First Search?
This data structure orders its entries by key-value pairs, allowing quick searches.
The second most popular programming language according to TIOBE. Used to implement operating systems, device drivers, and protocol stacks. Used on supercomputers to microcontrollers and embedded systems.
What is C?
This search algorithm works by repeatedly dividing the search interval in half.
What is Binary Search?
This data structure can be represented as an array and limits the number of child elements any entry is associated with.
A high-level programming language designed for ease of use that was super popular in the late 70's.
What is BASIC?
Merge Sort guarantees this type of time complexity regardless of input order.
What is consistent (or worst-case) O(nlogn) time
This queue utilizes a data structure to maintain a hierarchy of elements.
What is Priority Queue?
This programming language was created by Terry A Davis specifcally for TempleOS. It functions as a language for application development and a scripting language for automating tasks within TempleOS
What is Holy C?
The Floyd-Warshall Algorithm maintains a 2D array of the distance between nodes. Then, the algorithm iterates over all vertices and attempts to find the shortest path between every pair of nodes. This algorithm is an application of this algorithmic technique...
What is Dynamic Programming?