Fourteen university computer science courses distilled into version-controlled LaTeX cheat sheets, algorithmic proofs, exam solutions, and lab codebases. Reproducible down to the equation, dual-compiled for print and OLED display, and directly linkable to the exact PDF page anchor.
Section 2.4 • Recurrence Relations • Page 14
Let $a \ge 1$ and $b > 1$ be constants, and $f(n)$ an asymptotically positive function. Given the recurrence relation:
If $c < \log_b a$, then leaf computation dominates: $T(n) = \Theta(n^{\log_b a})$.
schemi_algoritmi.pdf#page=14
Filter by academic semester or topic to access page-anchored PDF cheat sheets, LaTeX source preambles, oral exam banks, and solved past exam papers.
Interact directly with core computer science theorems from the archive. Solve recurrences, inspect asymptotic bounds, examine language classes, and model Nyquist sampling.
\islight Conditional Macro.
Every cheat sheet in the repository compiles directly from a single master .tex source file. Defining \def\islight{true} generates an ivory paper PDF for physical print, while commenting it out produces an obsidian OLED dark mode PDF.
\def\islight{true}
Definition 2.3 (Congruence Modulo n):
Let $a, b \in \mathbb{Z}$ and $n \in \mathbb{Z}^+$. We say that $a$ is congruent to $b$ modulo $n$, denoted:
This relation partitions $\mathbb{Z}$ into $n$ distinct disjoint equivalence classes within $\mathbb{Z}/n\mathbb{Z}$.
Theorem 2.4 (Bézout's Identity):
For any non-zero integers $a$ and $b$, there exist integers $x, y \in \mathbb{Z}$ such that:
Coefficients $(x, y)$ can be computed in time $O(\log(\min(a, b)))$ via the Extended Euclidean Algorithm.
Examine the architectural principles that make University Archive durable, searchable, and mathematically exact across academic years.
Unlike ordinary repositories that merely store raw files, every course folder provides a curated Markdown table of contents with page-anchored URLs. Clicking any topic immediately opens your PDF reader to the exact target page:
Exam revision overhead drops from endless scrolling to an instantaneous lookup.
Maintaining separate light and dark files leads to divergence. With the \islight macro, colors, theorems, and margins adapt dynamically without formula duplication.
Every summary aligns rigorously with the syllabus of the Department of Information Engineering and Computer Science (DISI) at Università di Trento.
These notes and solutions aren't rough drafts—they are the exact materials utilized to pass rigorous university examinations with distinction. Published open-source for community inspection, corrections, and pull requests.
How raw university coursework transforms into reference-grade mathematical documentation.
Class notes, official slides, lab codebases, and past problem sets are systematically distilled into modular conceptual units.
Formulas are authored in standard AMS-LaTeX. The \islight macro generates identical light paper and dark OLED PDFs.
Every chapter and topic is mapped to its exact PDF page anchor, eliminating search friction during revision.
Committed and published open-source on GitHub for current students and future cohorts to fork, build, and verify.
No TeX installation is required to read the pre-compiled notes. If you wish to modify formulas, execute the commands below.
git clone https://github.com/mirconegri/University.git
cd University/3rd_semester/algoritmi/schemi && open schemi_algoritmi_1.pdf
All cheat sheets are pre-compiled and tracked in Git. Zero TeX dependencies required for reading.
Whether you are preparing for an oral exam in Algoritmi, reviewing RISC-V pipelining hazards in Calcolatori, or exploring functional lambda calculus, the archive is ready.