OMSCS CS7641 (Machine Learning) Review and Tips
A review and tips for the OMSCS CS7641 Machine Learning course, covering assignments, exams, and workload.
A review and tips for the OMSCS CS7641 Machine Learning course, covering assignments, exams, and workload.
Analyzing the probability of self-assignment in a Secret Santa gift exchange using probability bounds and simulations.
Using the traveling salesman problem to find the optimal route for a London pub crawl with Google Directions API.
Explores academic research papers referenced in the .NET runtime and compiler source code, focusing on data structures and optimization algorithms.
A critical guide to programming books, offering specific recommendations and anti-recommendations for topics like algorithms and data structures.
Discusses balancing trendy tech with core programming fundamentals like algorithms and clean code to master software development.
An introductory explanation of permutation patterns, covering basic permutations, slot restrictions, and their relevance to programming and mathematics.
A developer revisits and improves their JavaScript Tic Tac Toe game, focusing on refactoring win-checking logic and adding AI tactics.
A graduate reflects on their 5-year computer engineering master's at Linköping University, covering courses, projects, and personal growth.
A developer explains implementing a percolation system visualization in JavaScript, covering the Union-Find algorithm and project challenges.
A curated list of free, high-quality Python programming books for beginners and experienced developers.
A programmer analyzes whether math classes are useful in a software development career, based on personal experience.
Argues that true data science and innovation require deep mathematical understanding, not just push-button tools, and defends the value of skilled data scientists.
A Ruby programming tutorial on how to write a program to check if a sentence is a pangram and find missing letters.
A programmer shares their excitement about receiving three classic computer science books: Introduction to Algorithms, SICP, and The Pragmatic Programmer.
A Computer Science student reflects on finishing a Java game, enjoying courses like Data Structures, and reading tech/design books.
Analyzes the need for better content filtering on social media feeds like Facebook and Twitter, comparing them to Amazon/Netflix recommendations.
A developer shares their journey revisiting classic algorithms, providing Python implementations of insertion sort and merge sort from the MIT Intro to Algorithms course.
Explores a clever programming technique using uninitialized memory for efficient sparse set operations, turning linear-time tasks into constant-time.