uni
uni copied to clipboard
Published
20 hours ago •
Rafisto
Rafisto
Notes on Algorythmic Computer Science - Wroclaw University of Science and Technology - Informatyka Algorytmiczna - Politechnika Wrocławska
Notes Repository 🚀
I hereby present a treasure trove of resources covering various topics in mathematics and computer science, I have created and gathered during my studies at Wroclaw University of Science and Technology. Whether you're a student looking for study materials, or a curious mind eager to learn, you've come to the right place.
- 📊 Mathematical Analysis 📊. ✨Full semester course notes✨ purely in
LaTeXis a must-have for any aspiring computer-scientist. - 🥶 Discrete Mathematics 🥶:
- 🤔 Algebra 🤔:
- See Groups, Rings and Complex Numbners (polish) - partial lecture notes
- See Linear Algebra (polish) - pre-exam repetition
- See Algebra 2 notes (english) - definitions and theorems
- See Algebra 2 mini notes (polish) - definitions
- 🕳 Procedural Programming 🕳 in
C - 💻 Object-Oriented Programming 💻
Mastering the art of object-oriented programming in
C++andJava(~~help me~~). Exercises:- Exercise List 1 - Prime Number Generator
- Exercise List 2 - Pascal Triangle Row Generator
- Exercise List 3 - Figure Generator
- Exercise List 4 - Java Simple GUI
- Exercise List 5 - Java Figure "Paint"
- Exercise List 6 - Java Threaded Tiles (Concurrent programming)
- Exercise List 7 - CLI for Binary Tree Search in Java and C++
- 📚 Many interesting programs 📚
- Cn Addition table - $C_n: a + b \mod n$
- Zn Addition & Multiplication table - $Z_n: a + b, a * b \mod n$
- Euclidean Algorithm - $gcd(a, b)$
- Extended Euclidean Algorithm - $ax + by = \gcd(a, b)$
- An extravagant function analysis - analysis of $f(n)=\left|{(a,b) \mid 1 \leq a,b \leq n, \gcd(a,b)=1}\right| \cdot n^{-2}$
- RSA Algorithm Exponent Brute-Forcer - Crack RSA exponent
- XOR Cipher - One time pad encryption, decryption, key generation and key swap.
Copyright 2024 © Rafał Włodarczyk
Rafisto