Main Page
Appearance
Table of Contents
1.0 Introduction to Computer Science
1.1 What is Computer Science?
- 1.1.1 Definition and Scope
- 1.1.2 Problem-Solving - Computational Thinking
- 1.1.3 Interdisciplinary Nature
1.2 History of Computing
- 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.4 Early Electronic Computers (ENIAC, UNIVAC)
- 1.2.5 Transistors & Integrated Circuits
- 1.2.6 Personal Computers & the Internet
1.3 Key Figures in Computer Science
1.4 Branches of Computer Science
2.0 Foundational Concepts
2.1 Data Representation
- 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 Boolean Algebra & Logic Gates
- 2.2.1 AND, OR, NOT, XOR, NAND, NOR gates
- 2.2.2 Truth Tables
- 2.2.3 Boolean Expressions & Simplification
2.3 Algorithms & Pseudocode
- 2.3.1 Definition of an Algorithm
- 2.3.2 Characteristics of Good Algorithms
- 2.3.3 Representing Algorithms (Flowcharts, Pseudocode)
2.4 Computational Thinking
- 2.4.1 Decomposition
- 2.4.2 Pattern Recognition
- 2.4.3 Abstraction
- 2.4.4 Algorithms
3.0 Programming Fundamentals
3.1 Programming Paradigms
- 3.1.1 Procedural Programming
- 3.1.2 Object-Oriented Programming (OOP) - Basic Concepts
- 3.1.3 Functional Programming (Basic Concepts)
3.2 Data Types & Variables
- 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.3 Control Structures
- 3.3.1 Conditional Statements (if, else if, else, switch)
- 3.3.2 Looping Constructs (for, while, do-while)
3.4 Functions/Methods
- 3.4.1 Definition and Purpose
- 3.4.2 Parameters and Return Values
- 3.4.3 Scope
3.5 Basic Data Structures
- 3.5.1 Arrays (One-dimensional, Multi-dimensional)
- 3.5.2 Strings (Manipulation, Common Operations)
3.6 Error Handling & Debugging
- 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 Data Structures
- 4.1.1 Linear Data Structures:
- 4.1.1.1 Arrays (Fixed-size, Dynamic Arrays)
- 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.2 Non-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.2 Algorithms
- 4.2.1 Sorting Algorithms:
- 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.2 Searching Algorithms:
- 4.2.2.1 Linear Search
- 4.2.2.2 Binary Search
- 4.2.3 Graph Algorithms:
- 4.2.3.1 Breadth-First Search (BFS)
- 4.2.3.2 Depth-First Search (DFS)
- 4.2.3.3 Dijkstra's Algorithm (Shortest Path)
- 4.2.3.4 Minimum Spanning Trees (Prim's, Kruskal's)
- 4.2.4 Dynamic Programming:
- 4.2.4.1 Memoization, Tabulation
- 4.2.4.2 Common DP Problems (Fibonacci, Knapsack)
- 4.2.5 Recursion:
- 4.2.5.1 Base Cases, Recursive Steps
- 4.2.5.2. Tail Recursion
- 4.2.6 Greedy Algorithms
- 4.2.1 Sorting Algorithms:
- 5.0 Computer Architecture & Organization
- 5.1 CPU Components
- 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.2 Memory Hierarchy
- 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.3 Input/Output Systems
- 5.3.1 I/O Devices and Controllers
- 5.3.2 Polling, Interrupts, DMA
- 5.4 Instruction Sets
- 5.4.1 RISC vs. CISC
- 5.5 Assembly Language (Basic Concepts)
- 5.1 CPU Components
- 6.0 Operating Systems (OS)
- 6.1 Role and Functions of an OS
- 6.1.1 Resource Management, Process Management, Memory Management, File Management
- 6.2 Process Management
- 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.3 Memory Management
- 6.3.1 Paging, Segmentation
- 6.3.2 Virtual Memory
- 6.3.3 Page Replacement Algorithms
- 6.4 File Systems
- 6.4.1 File Organization, Directory Structures
- 6.4.2 File Allocation Methods
- 6.5 Concurrency & Deadlock
- 6.5.1 Conditions for Deadlock
- 6.5.2 Deadlock Prevention, Avoidance, Detection, Recovery
- 7.0 Networking & Internet
- 7.1 Network Models
- 7.1.1 OSI Model (7 Layers)
- 7.1.2 TCP/IP Model (4/5 Layers)
- 7.1 Network Models
- 7.2 Protocols
- 7.2.1 HTTP/HTTPS, FTP, SMTP, POP3, IMAP
- 7.2.2 TCP (Reliable, Connection-Oriented)
- 7.2.3 UDP (Unreliable, Connectionless)
- 7.2.4 IP (Internet Protocol)
- 7.2.5 DNS (Domain Name System)
- 7.3 Network Topologies
- 7.3.1 Bus, Star, Ring, Mesh
- 7.4 Web Technologies (Basic Overview)
- 7.4.1 HTML, CSS, JavaScript (Client-side)
- 7.4.2 Web Servers, APIs
- 8.0 Databases
- 8.1 Database Types
- 8.1.1 Relational Databases (SQL)
- 8.1.2 NoSQL Databases (Key-Value, Document, Column-Family, Graph)
- 8.2 Relational Database Concepts
- 8.2.1 Tables, Rows, Columns
- 8.2.2 Primary Keys, Foreign Keys
- 8.2.3 Relationships (One-to-One, One-to-Many, Many-to-Many)
- 8.3 SQL (Structured Query Language)
- 8.3.1 CRUD Operations (SELECT, INSERT, UPDATE, DELETE)
- 8.3.2 JOINs, Subqueries
- 8.3.3 Data Definition Language (DDL)
- 8.3.4 Data Manipulation Language (DML)
- 8.4 Database Design
- Normalization (1NF, 2NF, 3NF, BCNF)
- Entity-Relationship (ER) Diagrams
- 8.5 Database Management Systems (DBMS)
- Examples (MySQL, PostgreSQL, Oracle, SQL Server) IX. Software Engineering
- 8.1 Database Types
- 9.0 Software Engineering
- 9.1 Software Development Life Cycle (SDLC)
- Phases (Requirements, Design, Implementation, Testing, Deployment, Maintenance)
- Models (Waterfall, Iterative, Spiral)
- 9.2 Agile Methodologies
- Scrum, Kanban
- User Stories, Sprints
- 9.3 Version Control
- Git (Basic Commands: clone, add, commit, push, pull, branch, merge)
- GitHub/GitLab/Bitbucket (Remote Repositories)
- 9.4 Software Testing
- Unit Testing, Integration Testing, System Testing, Acceptance Testing
- Test-Driven Development (TDD)
- 9.5 Design Patterns
- Creational (Singleton, Factory)
- Structural (Adapter, Decorator)
- Behavioral (Observer, Strategy) X. Artificial Intelligence (AI) & Machine Learning (ML)
- 9.1 Software Development Life Cycle (SDLC)
- 10.0 Artificial Intelligence (AI) & Machine Learning
- 10.1 Introduction to AI
- Strong AI vs. Weak AI
- Applications of AI
- 10.2 Types of Machine Learning
- Supervised Learning (Regression, Classification)
- Unsupervised Learning (Clustering, Dimensionality Reduction)
- Reinforcement Learning
- 10.3 Common ML Algorithms
- Linear Regression, Logistic Regression
- Decision Trees, Random Forests
- Support Vector Machines (SVM)
- K-Means Clustering
- 10.4 Neural Networks & Deep Learning (Basic Concepts)
- Perceptrons, Layers
- Activation Functions
- Backpropagation (High-level)
- Convolutional Neural Networks (CNNs)
- Recurrent Neural Networks (RNNs)
- 10.5 Natural Language Processing (NLP) / Computer Vision (CV)
- Basic tasks and applications
- 10.1 Introduction to AI
- 11.0 Cybersecurity
- 11.1 Fundamentals of Security
- Confidentiality, Integrity, Availability (CIA Triad)
- Authentication, Authorization, Accounting (AAA)
- 11.2 Common Threats & Attacks
- Malware (Viruses, Worms, Ransomware)
- Phishing, Social Engineering
- Denial of Service (DoS) / Distributed Denial of Service (DDoS)
- Man-in-the-Middle Attacks
- 11.3 Cryptography
- Symmetric vs. Asymmetric Encryption
- Hashing
- Digital Signatures
- 11.4 Network Security
- Firewalls, Intrusion Detection/Prevention Systems (IDS/IPS)
- Virtual Private Networks (VPNs)
- 11.5 Web Security
- Cross-Site Scripting (XSS)
- SQL Injection
- Cross-Site Request Forgery (CSRF) XII. Theoretical Computer Science
- 11.1 Fundamentals of Security
- 12.0 Theoretical Computer Science
- 12.1 Automata Theory
- Finite Automata (DFAs, NFAs)
- Regular Expressions
- Context-Free Grammars & Pushdown Automata
- 12.2 Computability Theory
- Turing Machines
- Church-Turing Thesis
- Halting Problem (Undecidability)
- 12.3 Complexity Theory
- Time and Space Complexity (Big O Notation revisited)
- P, NP, NP-Complete, NP-Hard XIII. Emerging Topics & Future Trends
- 12.1 Automata Theory
- 13.0 Emerging Topics and Future Trends
- 13.1 Quantum Computing
- Basic Principles (Superposition, Entanglement)
- Qubits, Quantum Gates
- 13.2 Blockchain & Distributed Ledger Technologies
- Decentralization, Cryptocurrencies
- Smart Contracts
- 13.3 Cloud Computing
- IaaS, PaaS, SaaS
- Public, Private, Hybrid Clouds
- 13.4 Big Data
- Volume, Velocity, Variety
- Hadoop, Spark (Basic Concepts)
- 13.5 Ethical AI & Societal Impact
- Bias in AI, Privacy Concerns
- AI Safety and Governance
- 13.1 Quantum Computing
- 6.1 Role and Functions of an OS
Consult the User's Guide for information on using the wiki software.