Long pages
Appearance
Showing below up to 50 results in range #1 to #50.
- (hist) 1.3.1 Ada Lovelace, Alan Turing, Grace Hopper, Dennis Ritchie, Linus Torvalds, etc. [41,708 bytes]
- (hist) 1.2.5 Transistors & Integrated Circuits [27,171 bytes]
- (hist) 1.2.3 Alan Turing: The Brilliant Mind Who Shaped Our Digital World [26,441 bytes]
- (hist) Main Page [19,239 bytes]
- (hist) 1.5 How a Computer Works [15,122 bytes]
- (hist) 1.1.3 Interdisciplinary Nature [12,617 bytes]
- (hist) 2.1.2 Number Systems (Decimal, Binary, Octal, Hexadecimal) [11,791 bytes]
- (hist) 5.6 How a Computer Works [11,698 bytes]
- (hist) 1.1.1 Definition and Scope [9,568 bytes]
- (hist) 2.2.1 AND, OR, NOT, XOR, NAND, NOR gates [8,400 bytes]
- (hist) 1.2.1 Early Calculating Devices (Abacus, Pascaline, Leibniz Wheel) [8,076 bytes]
- (hist) Introduction to Computer Science [7,682 bytes]
- (hist) 1.4.1 Theoretical CS, Algorithms, Data Structures, AI, ML, Cybersecurity, Networking, etc. [7,304 bytes]
- (hist) 1.1.2 Problem-Solving Focus [6,761 bytes]
- (hist) 2.1.1 Binary Numbers (Bits, Bytes) [6,526 bytes]
- (hist) 2.1.4 Image, Audio, and Video Representation (Basic) [5,945 bytes]
- (hist) 2.1.3 Character Encoding (ASCII, Unicode, UTF-8) [5,649 bytes]
- (hist) 1.2.3 Early Electronic Computers (ENIAC, UNIVAC) [5,170 bytes]
- (hist) 2.2.3 Boolean Expressions & Simplification [5,105 bytes]
- (hist) 10.3.4 K-Means Clustering [4,957 bytes]
- (hist) 1.2.2 Analytical Engine (Babbage & Lovelace) [4,925 bytes]
- (hist) 2.3.3 Representing Algorithms (Flowcharts, Pseudocode) [4,307 bytes]
- (hist) 2.2.2 Truth Tables [4,241 bytes]
- (hist) Conditional Statements (if, else if, else, switch) [4,128 bytes]
- (hist) 10.5.2.1 Generative Pre-trained Transformers (GPT) [4,101 bytes]
- (hist) 5.1 CPU Components [4,093 bytes]
- (hist) 2.3.2 Characteristics of Good Algorithms [4,039 bytes]
- (hist) 10.4.5 Recurrent Neural Networks (RNNs) [4,014 bytes]
- (hist) 4.1.2.1 Trees (Binary Trees, Binary Search Trees, AVL Trees, Red-Black Trees) [3,890 bytes]
- (hist) 3.6.1 Types of Errors (Syntax, Runtime, Logic) [3,632 bytes]
- (hist) 3.6.3 Debugging Techniques and Tools [3,558 bytes]
- (hist) 5.3.2 Polling, Interrupts, DMA [3,545 bytes]
- (hist) 10.5.1 Basic tasks and applications [3,541 bytes]
- (hist) 3.3.2 Looping Constructs (for, while, do-while) [3,472 bytes]
- (hist) 5.4.1 RISC vs. CISC [3,440 bytes]
- (hist) 10.3.2 Decision Trees, Random Forests [3,414 bytes]
- (hist) 10.3.1 Linear Regression, Logistic Regression [3,295 bytes]
- (hist) 5.5 Assembly Language (Basic Concepts) [3,241 bytes]
- (hist) 3.6.2 Exception Handling (try-catch) [3,142 bytes]
- (hist) 13.5 Ethical AI & Societal Impact [3,092 bytes]
- (hist) 5.0 Computer Architecture & Organization [3,086 bytes]
- (hist) 10.1.2 Applications of AI [3,038 bytes]
- (hist) Strings (Manipulation, Common Operations) [3,004 bytes]
- (hist) 4.1.1.2 Linked Lists (Singly, Doubly, Circular) [2,983 bytes]
- (hist) 3.2.1 Primitive Data Types (Integers, Floats, Booleans, Characters) [2,973 bytes]
- (hist) 3.2.3 Variable Declaration and Initialization [2,911 bytes]
- (hist) 10.2.3 Reinforcement Learning [2,905 bytes]
- (hist) 1.2.6 Personal Computers & the Internet [2,864 bytes]
- (hist) 10.2.2 Unsupervised Learning (Clustering, Dimensionality Reduction) [2,847 bytes]
- (hist) 3.1.2 Object-Oriented Programming (OOP) - Basic Concepts [2,813 bytes]