MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"lecontinue": "20250711164439|171",
"continue": "-||"
},
"query": {
"logevents": [
{
"logid": 181,
"ns": 0,
"title": "16.61 Harvard CS50 (2023) Full Computer Science University Course",
"pageid": 180,
"logpage": 180,
"revid": 479,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-12T04:07:34Z",
"comment": "Created page with \"<youtube>https://youtu.be/LfaMVlDaQ24?si=O4_ceFH_wwRnN8o0</youtube>\""
},
{
"logid": 180,
"ns": 0,
"title": "4.2.3.1 Breadth-First Search (BFS)",
"pageid": 179,
"logpage": 179,
"revid": 436,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T22:37:14Z",
"comment": "Created page with \"=== 4.2.3.1 Breadth-First Search (BFS) === ''(Difficulty Note: Analogies help here. The \"layers\" concept is important.)'' '''Breadth-First Search (BFS)''' is like exploring a maze by finding everything that's one step away from you, then everything two steps away, then everything three steps away, and so on. It explores \"layer by layer.\" '''How it works (simplified):''' # Start at a specific point (node). # Visit all its direct neighbors (nodes one step away). # Then,...\""
},
{
"logid": 179,
"ns": 0,
"title": "4.2.3 Graph Algorithms",
"pageid": 178,
"logpage": 178,
"revid": 434,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T22:26:20Z",
"comment": "Created page with \"== 4.2.3 Graph Algorithms == ''(Difficulty Note: This is a significant jump in complexity. Focus on graphs as \"connections\" and the purpose of these algorithms.)'' In computer science, a '''graph''' isn't a chart with bars and lines. It's a way to represent connections between different things. Imagine a map where cities are points and roads are lines connecting them. That's a graph! * '''Nodes (or Vertices):''' The individual points or items (like cities, people on a...\""
},
{
"logid": 178,
"ns": 0,
"title": "4.2.2.2 Binary Search",
"pageid": 177,
"logpage": 177,
"revid": 432,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T22:12:14Z",
"comment": "Created page with \"=== 4.2.2.2 Binary Search === ''(Difficulty Note: This is slightly more complex than Linear Search, as it requires sorted data.)'' '''Binary Search''' is a much faster way to find something, but it has a special rule: the list of items '''must be sorted''' (like numbers from smallest to largest, or words alphabetically). It works by repeatedly dividing the list in half. '''How it works:''' # Find the middle item in the sorted list. # Is the middle item the one you're...\""
},
{
"logid": 177,
"ns": 0,
"title": "4.2.2.1 Linear Search",
"pageid": 176,
"logpage": 176,
"revid": 430,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T22:07:54Z",
"comment": "Created page with \"=== 4.2.2.1 Linear Search === ''(Difficulty Note: This is a very intuitive and accessible concept for 7th graders.)'' '''Linear Search''' is the simplest way to find something. It's like looking for a book in a messy pile without any order. You start at the very beginning of the list of items and check each item one by one until you find what you're looking for, or until you reach the end of the list. '''How it works:''' # Start at the first item. # Is this the item y...\""
},
{
"logid": 176,
"ns": 0,
"title": "4.2.2 Searching Algorithms",
"pageid": 175,
"logpage": 175,
"revid": 428,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T22:02:20Z",
"comment": "Created page with \"== 4.2.2 Searching Algorithms == Imagine you have a huge pile of papers, and you're looking for one specific paper with your name on it. How do you find it? You use a '''searching algorithm'''! In computer science, searching algorithms are step-by-step methods that computers use to find a specific piece of information within a larger collection of data. '''Bibliography:''' * '''Searching Algorithm.''' (n.d.). ''GeeksforGeeks''. Retrieved July 11, 2025, from https://www...\""
},
{
"logid": 175,
"ns": 0,
"title": "1.5 How a Computer Works",
"pageid": 174,
"logpage": 174,
"revid": 414,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T18:37:35Z",
"comment": "Created page with \"== How a Computer Works: The Grand Tour! == Imagine a computer isn't just a mysterious box, but a super-smart factory or a busy team of specialized workers. To understand how it works, we're going to take a tour of its most important parts and see how they all work together to make magic happen! At its heart, a computer is a machine that takes in information (input), processes it, stores it, and then gives you back results (output). It's all about following instructions...\""
},
{
"logid": 174,
"ns": 0,
"title": "5.6 How a Computer Works",
"pageid": 173,
"logpage": 173,
"revid": 412,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T18:30:33Z",
"comment": "Created page with \"== How a Computer Works: The Grand Tour! == Imagine a computer isn't just a mysterious box, but a super-smart factory or a busy team of specialized workers. To understand how it works, we're going to take a tour of its most important parts and see how they all work together to make magic happen! At its heart, a computer is a machine that takes in information (input), processes it, stores it, and then gives you back results (output). It's all about following instructions...\""
},
{
"logid": 173,
"ns": 0,
"title": "7.3.1 Creating Images (drawing, 3D models - simple concepts)",
"pageid": 172,
"logpage": 172,
"revid": 409,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T18:14:55Z",
"comment": "Created page with \"==== 7.3.1 Creating Images (drawing, 3D models - simple concepts) ==== Computers create images in a couple of main ways: * '''Vector Graphics:''' Imagine drawing with lines, curves, and shapes that are defined by mathematical formulas. This is how '''vector graphics''' work. Instead of remembering every pixel, the computer remembers the instructions for drawing the shapes (e.g., \"draw a red circle at these coordinates with this radius\"). ** '''Pros:''' Vector graphics c...\""
},
{
"logid": 172,
"ns": 0,
"title": "7.3 Computer Graphics: Making Digital Art",
"pageid": 171,
"logpage": 171,
"revid": 407,
"params": {},
"type": "create",
"action": "create",
"user": "Mr. Goldstein",
"timestamp": "2025-07-11T18:02:17Z",
"comment": "Created page with \"=== 7.3 Computer Graphics: Making Digital Art === Computer graphics isn't just about looking at pictures; it's also about creating them! This field uses computer programs and mathematical calculations to make images, shapes, and entire virtual worlds from scratch.\""
}
]
}
}