Posts

Showing posts from December, 2025
Image
How I Blocked Explicit Ads in Yahoo Mail Inbox (uBlock Origin) While using Yahoo Mail , I encountered an obscene and inappropriate image advertisement displayed directly inside my inbox. This was not an email , but a visual display ad inserted into the mailbox interface. What Appeared in the Yahoo Mail Inbox Before installing any ad blocker, an explicit and obscene image appeared inside the Yahoo Mail inbox. For content safety and privacy reasons, the image is not shown in this post. There was no option within Yahoo Mail to block, hide, or report this specific ad. ✅ The Solution That Actually Worked: uBlock Origin Installing the uBlock Origin browser extension immediately removed these inbox ads. Free and lightweight No configuration required Works instantly after installation Installing uBlock Origin from the Chrome Web Store Steps I Used: Open the Chrome Web Store Search for uBlock Origin Install the extension ...

How to Back Up Your University Google Account (Google Takeout)

Image
How to Back Up Your University Google Account (Google Takeout) Quick steps you can paste into a Blogspot post. Back up your emails, Drive files, and contacts before your account is deleted. Open Google Takeout Visit takeout.google.com and make sure you are signed in with your university account. Click Deselect all Google selects almost everything by default. Click Deselect all so you only export what you need. Select what to export Choose only the important items: Mail — all Gmail messages (MBOX) Drive — all files you own in My Drive Contacts — saved contacts Optional: Photos, Keep, Calendar only if you use them. Click Next step At the bottom of the page, press Next step to set export options. Choose export settings Recommended settings: ...

How to Add Binary Numbers in Cyclic Codes: Why 0101 + 1111 = 1010

In cyclic codes and other linear block codes used in digital communications, binary addition does not follow the normal carry-based binary arithmetic. Instead, it uses modulo-2 addition , also known as the bitwise XOR operation . This method is simple, fast, and widely used in error-detecting and error-correcting algorithms. Understanding Modulo-2 (XOR) Addition Modulo-2 addition works bit by bit, and it does not generate carries. This means each bit is added independently, using the rules: 0 ⊕ 0 = 0 0 ⊕ 1 = 1 1 ⊕ 0 = 1 1 ⊕ 1 = 0 In short, XOR outputs 1 only when the bits are different. Example: 0101 + 1111 Let’s add the two binary numbers using modulo-2 addition: 0101 ⊕ 1111 ------- 1010 Step-by-Step Table Bit Pair Operation Result 0 ⊕ 1 0 + 1 (mod 2) 1 1 ⊕ 1 1 + 1 (mod 2) 0 0 ⊕ 0 0 + 0 (mod 2) 0 1 ⊕ 0 ...