All pages
Appearance
- 0.0.0 About this Wiki
- 1.1.1 Definition and Scope
- 1.1.2 Problem-Solving Focus
- 1.1.3 Interdisciplinary Nature
- 1.2.1 Early Calculating Devices (Abacus, Pascaline, Leibniz Wheel)
- 1.2.2 Analytical Engine (Babbage & Lovelace)
- 1.2.3 Alan Turing: The Brilliant Mind Who Shaped Our Digital World
- 1.2.3 Early Electronic Computers (ENIAC, UNIVAC)
- 1.2.5 Transistors & Integrated Circuits
- 1.2.6 Personal Computers & the Internet
- 1.3.1 Ada Lovelace, Alan Turing, Grace Hopper, Dennis Ritchie, Linus Torvalds, etc.
- 1.4.1 Theoretical CS, Algorithms, Data Structures, AI, ML, Cybersecurity, Networking, etc.
- 1.5 How a Computer Works
- 10.0 Artificial Intelligence (AI) & Machine Learning
- 10.1.1. Phases (Requirements, Design, Implementation, Testing, Deployment, Maintenance)
- 10.1.2 Applications of AI
- 10.1 Introduction to AI
- 10.1 Software Development Life Cycle (SDLC)
- 10.2.1 Supervised Learning (Regression, Classification)
- 10.2.2 Unsupervised Learning (Clustering, Dimensionality Reduction)
- 10.2.3 Reinforcement Learning
- 10.2 Types of Machine Learning
- 10.3.1 Linear Regression, Logistic Regression
- 10.3.2 Decision Trees, Random Forests
- 10.3.3 Support Vector Machines (SVM)
- 10.3.4 K-Means Clustering
- 10.3 Common ML Algorithms
- 10.4.1 Perceptrons, Layers
- 10.4.2 Activation Functions
- 10.4.3 Backpropagation (High-level)
- 10.4.4 Convolutional Neural Networks (CNNs)
- 10.4.5 Recurrent Neural Networks (RNNs)
- 10.4 Neural Networks & Deep Learning (Basic Concepts)
- 10.5.1 Basic tasks and applications
- 10.5.2.1 Generative Pre-trained Transformers (GPT)
- 10.5.2 Large Language Models (LLMs)
- 10.5 Natural Language Processing (NLP) / Computer Vision (CV)
- 13.5 Ethical AI & Societal Impact
- 16.61 Harvard CS50 (2023) Full Computer Science University Course
- 2.1.1 Binary Numbers (Bits, Bytes)
- 2.1.2 Number Systems (Decimal, Binary, Octal, Hexadecimal)
- 2.1.3 Character Encoding (ASCII, Unicode, UTF-8)
- 2.1.4 Image, Audio, and Video Representation (Basic)
- 2.2.1 AND, OR, NOT, XOR, NAND, NOR gates
- 2.2.2 Truth Tables
- 2.2.3 Boolean Expressions & Simplification
- 2.3.1 Definition of an Algorithm
- 2.3.2 Characteristics of Good Algorithms
- 2.3.3 Representing Algorithms (Flowcharts, Pseudocode)
- 2.4.1 Decomposition
- 2.4.2 Pattern Recognition
- 2.4.3 Abstraction
- 2.4.4 Algorithms
- 3.0 Programming Fundamentals
- 3.1.1 Procedural Programming
- 3.1.2 Object-Oriented Programming (OOP) - Basic Concepts
- 3.1.3 Functional Programming (Basic Concepts)
- 3.1 Programming Paradigms
- 3.2.1 Primitive Data Types (Integers, Floats, Booleans, Characters)
- 3.2.2 Reference Data Types (Strings, Objects)
- 3.2.3 Variable Declaration and Initialization
- 3.2 Data Types & Variables
- 3.3.2 Looping Constructs (for, while, do-while)
- 3.3 Control Structures
- 3.4.1 Definition and Purpose
- 3.4.2 Parameters and Return Values
- 3.4.3 Scope
- 3.4 Functions/Methods
- 3.5.1 Arrays (One-dimensional, Multi-dimensional)
- 3.6.1 Types of Errors (Syntax, Runtime, Logic)
- 3.6.2 Exception Handling (try-catch)
- 3.6.3 Debugging Techniques and Tools
- 4.0 Data Structures Algorithms (DSA)
- 4.1.1.2 Linked Lists (Singly, Doubly, Circular)
- 4.1.1.3 Stacks (LIFO)
- 4.1.1.4 Queues (FIFO, Priority Queues)
- 4.1.1 Linear Data Structures
- 4.1.2.1 Trees (Binary Trees, Binary Search Trees, AVL Trees, Red-Black Trees)
- 4.1.2.2 Graphs (Directed, Undirected, Weighted)
- 4.1.2.3 Hash Tables (Hashing Functions, Collision Resolution)
- 4.1.2.4 Heaps (Min-Heap, Max-Heap)
- 4.1.2 Non-Linear Data Structures
- 4.1 Data Structures
- 4.2.1.1 Bubble Sort, Selection Sort, Insertion Sort
- 4.2.1.2 Merge Sort, Quick Sort (Divide and Conquer)
- 4.2.1.3 Heap Sort, Radix Sort
- 4.2.1 Sorting Algorithms
- 4.2.2.1 Linear Search
- 4.2.2.2 Binary Search
- 4.2.2 Searching Algorithms
- 4.2.3.1 Breadth-First Search (BFS)
- 4.2.3 Graph Algorithms
- 4.2 Algorithms
- 5.0 Computer Architecture & Organization
- 5.1.1 Arithmetic Logic Unit (ALU)
- 5.1.2 Control Unit (CU)
- 5.1.3 Registers
- 5.1.4 Instruction Cycle (Fetch, Decode, Execute, Store)
- 5.1 CPU Components
- 5.2.1 Cache Memory (L1, L2, L3)
- 5.2.2 RAM (Random Access Memory)
- 5.2.3 ROM (Read-Only Memory)
- 5.2.4 Virtual Memory (Basic Concept)
- 5.2 Memory Hierarchy
- 5.3.1 I/O Devices and Controllers
- 5.3.2 Polling, Interrupts, DMA
- 5.3 Input/Output Systems
- 5.4.1 RISC vs. CISC
- 5.4 Instruction Sets
- 5.5 Assembly Language (Basic Concepts)
- 5.6 How a Computer Works
- 6.0 Operating Systems (OS)
- 6.1 Role and Functions of an OS
- 6.2.1 Processes vs. Threads
- 6.2.2 Process States
- 6.2.3 CPU Scheduling Algorithms (FCFS, SJF, Priority, Round Robin)
- 6.2.4 Inter-Process Communication (IPC)
- 6.2.5 Synchronization (Semaphores, Mutexes)
- 6.2 Process Management
- 6.3.1 Paging, Segmentation
- 6.3.2 Virtual Memory
- 6.3.3 Page Replacement Algorithms
- 6.3 Memory Management
- 6.4.1 File Organization, Directory Structures
- 6.4.2 File Allocation Methods
- 6.4 File Systems
- 6.5.1 Conditions for Deadlock
- 6.5.2 Deadlock Prevention, Avoidance, Detection, Recovery
- 6.5 Concurrency & Deadlock
- 7.0 Images & Graphics
- 7.0 Networking & Internet
- 7.1.1 OSI Model (7 Layers)
- 7.1.1 Pixels and Resolution
- 7.1.2 How Computers See Color (RGB, basic idea)
- 7.1.2 TCP/IP Model (4/5 Layers)
- 7.1 Network Models
- 7.1 What is a Digital Image?
- 7.2.1 HTTP/HTTPS, FTP, SMTP, POP3, IMAP
- 7.2.1 JPG (for photos)
- 7.2.2 PNG (for graphics, transparency)
- 7.2.2 TCP (Reliable, Connection-Oriented)
- 7.2.3 GIF (for simple animations, limited colors)
- 7.2.3 UDP (Unreliable, Connectionless)
- 7.2.4 IP (Internet Protocol)
- 7.2.5 DNS (Domain Name System)
- 7.2 Image File Formats
- 7.2 Protocols
- 7.3.1 Bus, Star, Ring, Mesh
- 7.3.1 Creating Images (drawing, 3D models - simple concepts)
- 7.3 Computer Graphics: Making Digital Art
- 7.3 Network Topologies
- 7.4.1 HTML, CSS, JavaScript (Client-side)
- 7.4.2 Web Servers, APIs
- 7.4 Web Technologies (Basic Overview)
- 9.0 Software Engineering
- 9.1.1. Phases (Requirements, Design, Implementation, Testing, Deployment, Maintenance)
- 9.1.2 Models (Waterfall, Iterative, Spiral)
- 9.1 Software Development Life Cycle (SDLC)
- 9.2.1 Scrum, Kanban
- 9.2.2 User Stories, Sprints
- 9.2 Agile Methodologies
- 9.3.1 Git (Basic Commands: clone, add, commit, push, pull, branch, merge)
- 9.3.2 GitHub/GitLab/Bitbucket (Remote Repositories)
- 9.3 Version Control
- 9.4.1 Unit Testing, Integration Testing, System Testing, Acceptance Testing
- 9.4.2 Test-Driven Development (TDD)
- 9.4 Software Testing
- 9.5.1 Creational (Singleton, Factory)
- 9.5.2 Structural (Adapter, Decorator)
- 9.5.3 Behavioral (Observer, Strategy) X. Artificial Intelligence (AI) & Machine Learning (ML)
- 9.5 Design Patterns
- Basic Data Structures
- Computational Thinking
- Conditional Statements (if, else if, else, switch)
- Error Handling & Debugging
- Introduction to Computer Science
- Main Page
- Software Testing
- Strings (Manipulation, Common Operations)