Super Study Guide

The “Super Study Guide” delves into the intricacies of Python programming speed considerations, AI applications with short-term memory in databases, data augmentation for machine learning models, and the importance of dynamic data in enterprise AI architectures. It explores the challenges of static data libraries in the context of generative AI and emphasizes the need for understanding over simple indexing. The guide also highlights the significance of context, precision in search mechanisms, and the utilization of advanced technologies like Spark, EMR, and Airflow for building responsive knowledge base engines.

Mathematical concepts

Super Study Guide

Combinatorics Factorial The factorial n ! n! n ! of a given integer n n n is defined as follows: n ! ≜ n × ( n − 1 ) × . . . × 2 × 1 \boxed{n!\triangleq n\times(n-1)\times...\times2\times1} n ! ≜ ...

Arrays and strings

Super Study Guide

Arrays Definition An array A A A is a data structure of fixed size n n n that stores elements a 0 , . . . , a n − 1 a_{0}, ..., a_{n-1} a 0 , ... , a n − 1 in a sequential way. Each element a ...

Stacks and queues

Super Study Guide

Stacks Definition A stack s s s is a data structure that deals with elements s 1 , . . . , s n s_1, ..., s_{n} s 1 , ... , s n in a Last In First Out (LIFO) order. In order to do that, it uses...

Classic problems

Super Study Guide

Traveling salesman Given n n n cities c 1 , . . . , c n c_1, ..., c_n c 1 , ... , c n , the traveling salesman problem (TSP) is a classic problem that aims at finding the shortest path that visi...

Advanced trees

Super Study Guide

Self-balancing trees Definition A self-balancing tree is a BST that keeps its height in O ( log ⁡ ( n ) ) \mathcal{O}(\log(n)) O ( lo g ( n )) by maintaining specific properties. Examples of such ...

Trees

Super Study Guide

General concepts Definition A tree is a DAG with the following properties: Incoming edge: There is exactly one node that has no incoming edge, and that node is called the root. Each of the other n...

Graphs

Super Study Guide

General concepts Definition A graph G G G is defined by its vertices V V V and edges E E E and is often noted G = ( V , E ) G = (V, E) G = ( V , E ) . The following table summarizes the two main t...

Search algorithms

Super Study Guide

Basic search Linear search Linear search is a basic search method often used when the relative ordering of elements is not known, e.g. in unsorted arrays. It has a complexity of O ( n ) \mathcal{O...

Algorithmic concepts

Super Study Guide

Overview Algorithm Given a problem, an algorithm A \mathcal{A} A is a set of well-defined instructions that runs in a finite amount of time and space. It receives an input I I I and returns an out...

Linked lists

Super Study Guide

Singly linked lists Definition A singly linked list is a data structure composed of nodes, where each node carries the information of: a value v v v a next \texttt{next} next field, that points to...

Advanced graph algorithms

Super Study Guide

Spanning trees Definition A spanning tree of an undirected graph G = ( V , E ) G=(V, E) G = ( V , E ) is defined as a subgraph that has the minimum number of edges E ′ ⊆ E E'\subseteq E E ′ ⊆ E re...

Sorting algorithms

Super Study Guide

General concepts In this part, arrays of n n n elements are visually represented as histograms. The height of each bar represents the value of the associated element in the array. Sorting algorithm ...