User contributions for Mr. Goldstein

01:4601:46, 10 July 2025 diff hist +339 10.4.5 Recurrent Neural Networks (RNNs) No edit summary Tag: Visual edit
01:3201:32, 10 July 2025 diff hist −65 10.4.5 Recurrent Neural Networks (RNNs) No edit summary Tag: Visual edit
01:1001:10, 10 July 2025 diff hist +44 Main Page No edit summary Tag: Visual edit
01:0901:09, 10 July 2025 diff hist +3,737 N 10.4.5 Recurrent Neural Networks (RNNs) Created page with "=== 10.4.5 Recurrent Neural Networks (RNNs) === Imagine you're telling a story, or listening to one. The words you hear ''now'' make sense because you remember the words you heard ''just before''. If someone says, "The dog barked at the...", you expect the next word to be something like "cat," "mailman," or "stranger," not "sky." Your brain remembers the sequence of words. '''Recurrent Neural Networks (RNNs)''' are a special type of digital "brain" that are designed to..." Tag: Visual edit
01:0801:08, 10 July 2025 diff hist +48 Main Page No edit summary Tag: Visual edit
01:0701:07, 10 July 2025 diff hist +1,979 N 10.4.4 Convolutional Neural Networks (CNNs) Created page with "=== 10.4.4 Convolutional Neural Networks (CNNs) === Imagine you're looking for your friend in a crowded school hallway. You're not just looking at the whole crowd at once; you're probably scanning for their face, their hair color, or the specific backpack they carry. You're looking for ''patterns'' or ''features'' in different parts of the scene. '''Convolutional Neural Networks (CNNs)''' are a special type of digital "brain" that are really, really good at doing someth..." current Tag: Visual edit
01:0601:06, 10 July 2025 diff hist +40 Main Page No edit summary Tag: Visual edit
01:0601:06, 10 July 2025 diff hist +1,875 N 10.4.3 Backpropagation (High-level) Created page with "=== 10.4.3 Backpropagation (High-level) === Imagine you're playing a game, like throwing a ball at a target. At first, you might miss a lot. But after each try, you think about what went wrong: Was your arm too high? Did you throw too hard? You then adjust how you throw the ball for your next try. Over time, you get better and better at hitting the target! In computer science, especially with something called "neural networks" (which are like digital "brains" that learn..." current Tag: Visual edit
01:0501:05, 10 July 2025 diff hist +90 Main Page No edit summary Tag: Visual edit

22:0222:02, 9 July 2025 diff hist +734 N 4.2.1.3 Heap Sort, Radix Sort Created page with "=== 4.2.1.3 Heap Sort, Radix Sort === * '''Heap Sort:''' This algorithm uses a special data structure called a "heap." A heap is like a tree where each "parent" item is always bigger (or smaller) than its "children" items. Heap Sort builds this special tree, then repeatedly takes the largest (or smallest) item from the top of the heap and puts it into the sorted list. * '''Radix Sort:''' Imagine you're sorting a big stack of student IDs, which are numbers. Instead of co..." current Tag: Visual edit
22:0022:00, 9 July 2025 diff hist +104 Main Page No edit summary Tag: Visual edit
21:5521:55, 9 July 2025 diff hist +1,470 N 4.2.1.2 Merge Sort, Quick Sort (Divide and Conquer) Created page with "=== 4.2.1.2 Merge Sort, Quick Sort (Divide and Conquer) === These two algorithms use a powerful idea called "Divide and Conquer." * '''Divide and Conquer:''' This strategy means you break a big problem into smaller, easier-to-solve pieces. You solve the small pieces, and then you combine the solutions to solve the original big problem. * '''Merge Sort:''' *# '''Divide:''' You keep splitting your list of items in half until you have many tiny lists, each with only one it..." current Tag: Visual edit
21:5421:54, 9 July 2025 diff hist +1,244 N 4.2.1.1 Bubble Sort, Selection Sort, Insertion Sort Created page with "=== 4.2.1.1 Bubble Sort, Selection Sort, Insertion Sort === These are some of the simpler ways to sort things: * '''Bubble Sort:''' Think of bubbles rising in water. In Bubble Sort, you go through a list, compare two items next to each other, and if they're in the wrong order, you swap them. You keep doing this over and over, and the largest (or smallest) items "bubble up" to their correct place in the list. It's a bit like sorting cards by repeatedly swapping any two a..." current Tag: Visual edit
21:5321:53, 9 July 2025 diff hist +356 N 4.2.1 Sorting Algorithms Created page with "== 4.2.1 Sorting Algorithms == Have you ever had a messy pile of toys and wanted to put them in order, maybe from smallest to largest, or by color? That's what '''sorting algorithms''' do for computers! They take a list of items (like numbers, words, or even pictures) and arrange them in a specific order, like from smallest to largest, or alphabetically." current Tag: Visual edit
21:5121:51, 9 July 2025 diff hist +535 N 4.2 Algorithms Created page with "== 4.2 Algorithms == Imagine you have a recipe for baking cookies. That recipe tells you exactly what ingredients to use and what steps to follow, in order, to get your delicious cookies. In computer science, an '''algorithm''' is very similar! It's a set of clear, step-by-step instructions that a computer can follow to solve a problem or complete a task. Algorithms are super important because they are the "brains" behind all the apps, games, and websites you use every..." current Tag: Visual edit
21:3521:35, 9 July 2025 diff hist +43 Main Page No edit summary Tag: Visual edit
21:3421:34, 9 July 2025 diff hist +3,241 N 5.5 Assembly Language (Basic Concepts) Created page with "== 5.5 Assembly Language (Basic Concepts) == You know how computers understand instructions in their very own "instruction set" (those tiny commands like "add," "move," "store")? Well, these instructions are actually stored inside the computer as long strings of 0s and 1s, called '''machine code'''. Trying to program directly in 0s and 1s would be incredibly difficult for a human! Imagine trying to write an essay only using dots and dashes. That's where '''Assembly Lang..." current Tag: Visual edit
21:0921:09, 9 July 2025 diff hist −137 5.4.1 RISC vs. CISC No edit summary current Tag: Visual edit
20:4920:49, 9 July 2025 diff hist +4 Main Page No edit summary Tag: Visual edit
20:4920:49, 9 July 2025 diff hist +3,577 N 5.4.1 RISC vs. CISC Created page with "=== 5.4.1 RISC vs. CISC === When computer engineers design a CPU's instruction set, they usually follow one of two main philosophies: RISC or CISC. It's like deciding if our robot should have a few very simple commands or many complicated ones. # '''RISC (Reduced Instruction Set Computer):''' #* '''Idea:''' Think of this like a chef who has many simple, quick tools (like a knife, a spoon, a whisk). Each tool does one basic job very fast. To make a fancy meal, the chef c..." Tag: Visual edit
20:4220:42, 9 July 2025 diff hist −13 5.4 Instruction Sets No edit summary current Tag: Visual edit
20:1720:17, 9 July 2025 diff hist +1,639 N 5.4 Instruction Sets Created page with "== 5.4 Instruction Sets == Imagine you're trying to give commands to a robot. If the robot only understands simple commands like "move forward," "turn left," "pick up," and "drop," that's its basic set of instructions. It can't understand "make me a sandwich" as one command; you'd have to break that down into many tiny steps. In a similar way, a computer's CPU (its brain) doesn't understand high-level programming languages like Python or Scratch directly. Instead, it un..." Tag: Visual edit
20:1220:12, 9 July 2025 diff hist 0 Main Page No edit summary Tag: Visual edit
20:1020:10, 9 July 2025 diff hist +106 Main Page No edit summary Tag: Visual edit
20:0820:08, 9 July 2025 diff hist −11 5.3.2 Polling, Interrupts, DMA No edit summary current Tag: Visual edit
20:0120:01, 9 July 2025 diff hist +3,556 N 5.3.2 Polling, Interrupts, DMA Created page with "=== 5.3.2 Polling, Interrupts, DMA === The CPU is incredibly fast and busy, so it needs smart ways to communicate with I/O devices without wasting too much time. Imagine the CPU is a very important manager, and I/O devices are employees who sometimes need the manager's attention. There are a few different ways this communication can happen: # '''Polling:''' #* '''How it works:''' This is like the manager (CPU) constantly asking ''each'' employee (I/O device) one by one,..." Tag: Visual edit
19:4919:49, 9 July 2025 diff hist +107 Main Page No edit summary Tag: Visual edit
19:4919:49, 9 July 2025 diff hist −226 5.3.1 I/O Devices and Controllers No edit summary current Tag: Visual edit
19:1519:15, 9 July 2025 diff hist +2,825 N 5.3.1 I/O Devices and Controllers Created page with "=== 5.3.1 I/O Devices and Controllers === When we talk about Input/Output, we're really talking about two main things: the devices themselves and the special helpers that let them talk to the CPU. '''I/O Devices''' are the physical gadgets you use to put information into your computer or get information out. You use them every day! * '''Input Devices:''' ** '''Keyboard:''' For typing words and numbers. ** '''Mouse/Trackpad:''' For pointing, clicking, and moving things..." Tag: Visual edit
19:1419:14, 9 July 2025 diff hist +29 Main Page No edit summary Tag: Visual edit
19:1319:13, 9 July 2025 diff hist +2,575 N 5.3 Input/Output Systems Created page with "== 5.3 Input/Output Systems == Imagine your computer is a person who needs to talk to the world and take in information. How does it do that? It uses '''Input/Output (I/O) Systems'''. "Input" is how information and commands get ''into'' the computer. Think about typing on a keyboard, clicking a mouse, or using a microphone to record your voice. All of these are ways you give input to the computer. "Output" is how the computer gives information ''back'' to you or to othe..." current Tag: Visual edit
18:4918:49, 9 July 2025 diff hist −64 5.2.4 Virtual Memory (Basic Concept) No edit summary current Tag: Visual edit
18:4418:44, 9 July 2025 diff hist +41 Main Page No edit summary Tag: Visual edit
18:4318:43, 9 July 2025 diff hist +2,510 N 5.2.4 Virtual Memory (Basic Concept) Created page with "=== 5.2.4 Virtual Memory (Basic Concept) === Imagine your computer has a certain amount of RAM (its "working desk"). What happens if you try to open so many programs or files that they all can't fit on that desk at the same time? Your computer doesn't just crash! Instead, it uses a clever trick called '''Virtual Memory'''. Virtual Memory is like your computer "borrowing" some extra space from your long-term storage device (usually your hard drive or SSD, which is normal..." Tag: Visual edit
18:4118:41, 9 July 2025 diff hist +70 Main Page No edit summary Tag: Visual edit
18:4018:40, 9 July 2025 diff hist −55 5.2.3 ROM (Read-Only Memory) No edit summary current Tag: Visual edit
18:2918:29, 9 July 2025 diff hist +2,505 N 5.2.3 ROM (Read-Only Memory) Created page with "=== 5.2.3 ROM (Read-Only Memory) === While RAM is like your computer's temporary desk where information comes and goes, '''ROM''' (which stands for '''Read-Only Memory''') is more like a permanent instruction manual or a set of rules engraved into the computer's foundation. As its name suggests, "Read-Only" means that the computer can read information from it, but it generally cannot easily write new information to it or change what's already there. Here's why ROM is so..." Tag: Visual edit
18:2618:26, 9 July 2025 diff hist +36 Main Page No edit summary Tag: Visual edit
18:2618:26, 9 July 2025 diff hist +2,265 N 5.2.2 RAM (Random Access Memory) Created page with "=== 5.2.2 RAM (Random Access Memory) === '''RAM''' (pronounced like "ram") stands for '''Random Access Memory''', and it's one of the most important types of memory in your computer. You can think of RAM as your computer's main "working desk" or "short-term memory." When you open a program, surf the internet, edit a document, or play a game, all the information that the computer needs to actively work with right now is loaded into RAM. Why is it called "Random Access"?..." current Tag: Visual edit
18:1918:19, 9 July 2025 diff hist −60 5.2.1 Cache Memory (L1, L2, L3) No edit summary current Tag: Visual edit
18:1218:12, 9 July 2025 diff hist +1,863 5.2.1 Cache Memory (L1, L2, L3) No edit summary Tag: Visual edit
18:1018:10, 9 July 2025 diff hist −47 5.2 Memory Hierarchy No edit summary current Tag: Visual edit
18:0518:05, 9 July 2025 diff hist +1,283 5.2 Memory Hierarchy No edit summary Tag: Visual edit
17:5717:57, 9 July 2025 diff hist +1,625 5.1.4 Instruction Cycle (Fetch, Decode, Execute, Store) →5.1.4 Instruction Cycle (Fetch, Decode, Execute, Store) current Tag: Visual edit
17:4917:49, 9 July 2025 diff hist −52 5.1.3 Registers No edit summary current Tag: Visual edit
17:4417:44, 9 July 2025 diff hist +1,513 5.1.3 Registers No edit summary Tag: Visual edit
17:4217:42, 9 July 2025 diff hist +1,491 5.1.2 Control Unit (CU) No edit summary current Tag: Visual edit
17:2017:20, 9 July 2025 diff hist 0 5.1.1 Arithmetic Logic Unit (ALU) No edit summary current Tag: Visual edit
17:1917:19, 9 July 2025 diff hist +1,406 5.1.1 Arithmetic Logic Unit (ALU) No edit summary Tag: Visual edit
17:1517:15, 9 July 2025 diff hist −310 5.1 CPU Components No edit summary current Tag: Visual edit

10 July 2025

9 July 2025