Learn how to approach the Comp251 final assignment with confidence. This guide covers disjoint sets with path compression, maximum passenger flow, minimum spanning tree for metro systems, and trie-based passenger search.
Comp251 final assignmentdisjoint set path compressionunion by rankmaximum spanning treeKruskal's algorithm
A comprehensive tutorial covering the key concepts from multivariable calculus and linear algebra needed for ECE 490, including gradients, Hessians, quadratic forms, log-sum-exp, and matrix decompositions, with timely examples and clear proofs.
ECE 490 homework 0multivariable calculus tutoriallinear algebra for ECE 490gradient and Hessian computationlog-sum-exp function
Step-by-step tutorial to exploit Log4Shell vulnerability in a CTF environment. Learn JNDI injection, LDAP reference server setup, and flag extraction for CS6035 Fall 2025.
Log4Shell exploitCS6035 fall 2025Log4j vulnerabilityJNDI injectionLDAP reference server
Learn how to prove NP-hardness using polytime reductions with MIN-BLOCKS and CLOSE-SOLUTION-3SAT examples. Includes self-reduction techniques for finding solutions using oracles.
Learn key concepts from STAT3006 Assignment 4 on high-dimensional inference, including PCA, factor analysis, autoencoders, and kernel two-sample tests, with practical examples using zip and Golub data sets.
Learn to build a Find Four (Connect Four) game in Python using 2D arrays, loops, and input validation. Perfect for COP3504c students and anyone wanting to practice programming fundamentals with a fun project.
Find Four game PythonConnect Four Python tutorial2D arrays PythonCOP3504c lab 2Python game programming
Learn how to read, process, and write TGA image files in C++ using binary file I/O. This tutorial covers TGA header parsing, pixel data manipulation, and image effects like scaling and color adjustment.
Learn how to design greedy and dynamic programming algorithms for the classic art exhibition platform problem. Includes correctness proofs, counterexamples, and performance analysis.
Learn how to implement normal mapping and shadow mapping in OpenGL from scratch. This tutorial covers TBN matrix construction, tangent space lighting, depth map generation, and PCF soft shadows with practical code examples.
normal mappingshadow mappingOpenGL tutorialtangent spaceTBN matrix
Learn how to design a programmable counter with BCD output for FPGA synthesis. Step-by-step Verilog guide for CDA4203L Lab 3, including top-level integration, simulation, and board demonstration.
Learn practical network monitoring techniques using Snort and Wireshark to detect DDoS, brute-force, web attacks, and botnet traffic. Based on the CS6262 Project 4 assignment from Fall 2025.
Explore key distributed system design concepts including load balancing, chaos engineering, message brokers, and caching, with real-world examples and practical insights for students of computer vision and beyond.
distributed system designload balancingchaos engineeringmessage brokercaching
