The University of Copenhagen Discrete Math and Algorithms

This deck is my own personal active recall questions for the Discrete Math and Algorithms course at The University of Copenhagen. They are not the prettiest and some of the cards may be a tad confusing since they are specific to the books we use (B. Kolby, R.C. Busby, and S.C. Ross Discrete mathematical structures & T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein Introduction to Algorithms), but they might be useful to some people, so have at it! Edit 24/9/2022: Changed deck AnkiWeb page. Added Material for week three of the course (KBR 1.1-1.4, and lecture notes). Tried to make cards prettier by having them be all latex if any latex element is used.

Sample Data

Front	How can you define the “running time” of an algorithm and what is a simplification you can make in runtime analysis that keeps in line with the RAM model?
Back	We can define the runtime as the total number of steps executed by the algorithm. This may change in different scenarios, such as the worst or best case for a given algorithm. Unless you are comparing two algorithms with the same asymptotic runtime (same order of growth) the exact values of the number of steps executed on each line largly become irrelevant. Therefor they are abstracted (simplified) into the form of ci where i is the number for the line of code.
Tags	AlgorithmAnalysis Algorithms ComputerScience RAM-model RuntimeAnalysis

Front	What is a sequence?
Back	A sequence can be both a finite or infinite sequence. Any sequence is a collection of linearly ordered elements. (That is they can each be assigned an integer value starting form the left most having index 1. and each after having an index higher.).
Tags	Definition DiscreteMath Math Sequences

Front	How is an array's contents stored in the memory of an RAM?
Back	As sequential spaces, so it can be stored anywhere, but the elements are stored in order right next to each other.
Tags	ComputerScience RAM-model