There is an entire class of interesting tricks that can be performed by using math knowledge. In this master thesis, a variety of tricks and different applications relying on de Bruijn sequences are explored. Chapter 1 starts with a card trick that relies on graph theory, finite fields, and combinatorics[5]. The definition of de Bruijn sequences is given and some methods of construction are described; one of the methodes that should be emphasized is the construction using de Bruijn graph. Also, the answer to the question of the number of de Bruijn sequences is given. In Chapter 2, applications of de Bruijn sequences are described; in robotic vision, in cryptography for the creation of a corrupting string [3], for DNA reconstruction and for calculating the distance between two DNA strings[4] (for which the use of the de Bruijn graph is remarkably practical). Chapter 3 goes back to card tricks which are executed based on, for example, the rule of product, and they include the generalization of de Brujin sequences, that is, what is defined as universal cycles. Chapter 4 gives the program realization of de Bruijn sequences. The program is made in the programming language C# and has the ability to check whether the default string is de Bruijn sequence, print the elements needed to construct a de Bruijn graph and print de Bruijn strings for given parameters (length of the alphabet \(n\) and order of sequence \(k\))[6].