University of Luxembourg.

A focused summary of computational science topics including optimization methods, Newton’s method, BFGS, L-BFGS, line search, constraints, and Lagrange multipliers. Useful for revision in numerical optimization and computational methods courses.

A compact security cheat sheet covering core topics such as confidentiality, integrity, availability, access control, authentication, buffer overflows, SQL injection, XSS, CSRF, and cryptography basics. Useful for quick revision and exam prep.

A practical cheat sheet for programming fundamentals focused on functions, recursion, list processing, and common functional programming patterns. Useful as a quick reference for exercises and exam preparation.

A structured summary of reliable software-intensive systems covering dependability, fault prevention and tolerance, safety and security, validation and verification, formal methods, fault containment regions, FMEA, fault tree analysis, redundancy, ISO 26262, and software-defined vehicles. Strong revision aid for critical systems courses.

A compact and useful NLP summary covering text preprocessing, tokenization, stemming, lemmatization, vector space models, BoW, TF-IDF, PMI, Naive Bayes, logistic regression, and text classification. Perfect for revision before exams.

A detailed Human-Computer Interaction summary covering user interfaces, input devices, sensing principles, displays, haptics, pointing techniques, interaction techniques, and design objectives. Ideal for HCI exam revision and lecture review.

A structured Software Engineering summary covering layered architecture, event-driven systems, microservices, microkernel and space-based architecture, plus testing fundamentals, V-model, regression testing, dynamic testing, and continuous integration. Excellent for revision and coursework review.

A concise but complete Discrete Mathematics summary covering sums and products, combinatorics, generating functions, pigeonhole principle, inclusion-exclusion, probability, asymptotic analysis, and Stirling’s formula. Great for fast revision and exam preparation.

A compact discrete mathematics cheat sheet with essential formulas for counting, permutations, combinations, generating functions, binomial theorem, pigeonhole principle, and inclusion-exclusion. Great for last-minute exam review.

A clear and exam-focused summary of algorithm complexity and data structures, covering Big-O analysis, sorting algorithms, recurrence relations, binary search trees, AVL trees, and red-black trees. A useful revision sheet for algorithms and data structures courses.