Computer Science
Computer Science covers data structures, algorithms, operating systems, computer networking, and software engineering. Build your CS foundation here.
Tutorials in This Section
Learning Path
flowchart LR
A[Algorithms] --> B[Data Structures]
B --> C[Operating Systems]
B --> D[Computer Networks]
A --> E[Software Engineering]
B --> F[Memory Management]
F --> G[Concurrency]
D --> H[Networks Deep Dive]
Built by the developers of Doda Browser, DodaZIP, and Durga Antivirus Pro.
Pages in this section
Algorithms Explained — Complete Beginner's Guide
Learn algorithms from scratch: Big O notation, linear vs binary search, bubble sort vs merge sort. Includes Python code examples and real-world application in security scanners.
✓ LiveData Structures Explained — Arrays, Linked Lists, Stacks & Queues
Learn fundamental data structures: arrays, linked lists, stacks, and queues. Simple Python implementations with real-world examples of how they power everything from undo to print queues.
✓ LiveOperating Systems Explained — A Beginner's Guide
Learn operating systems from the ground up: process management, memory management, file systems, and how Linux and Windows manage hardware and software resources.
✓ LiveComputer Networks Explained — Beginner's Guide
Learn computer networking: OSI model, TCP/IP, HTTP, DNS. Understand how data travels from your browser to a server and back, with security insights on each layer.
✓ LiveSoftware Engineering Explained — Complete Beginner's Guide
Learn software engineering: SDLC, waterfall vs agile, version control with Git, testing types, and how professional teams build reliable software at scale.
✓ LiveOS Concepts Explained — Processes, Threads & Scheduling Algorithms
Learn OS fundamentals: processes vs threads, CPU scheduling algorithms (FCFS, SJF, Round Robin, Multi-level), context switching, and process state diagrams with Python examples.
✓ LiveMemory Management Explained — Paging, Segmentation & Virtual Memory
Master memory management: paging, segmentation, virtual memory, TLB, and page replacement algorithms (FIFO, LRU, Optimal). Includes Python page fault calculator examples.
✓ LiveFile Systems Explained — FAT, NTFS, ext4 & Inode Structure
Learn file systems in depth: FAT, NTFS, ext4 architecture, inodes, directories, file allocation methods. Includes ext4 inode structure diagram and Python simulation.
✓ LiveDBMS Concepts Explained — Relational Model, Normalization & ACID
Learn DBMS fundamentals: relational model, normalization (1NF-5NF), ACID properties, transactions, concurrency control, and indexing with practical SQL examples.
✓ LiveCompiler Design Explained — Lexical Analysis, Parsing & Code Generation
Learn compiler design: lexical analysis, top-down vs bottom-up parsing, AST, semantic analysis, code generation, and optimization passes with a Python expression parser example.
✓ LiveComputer Architecture Explained — CPU Pipeline, Cache & RISC vs CISC
Master computer architecture: CPU pipeline (fetch-decode-execute), L1/L2/L3 cache hierarchy, RISC vs CISC, and instruction-level parallelism with Python simulations.
✓ LiveNetwork Protocols Explained — TCP, UDP, IP Addressing & DNS
Master network protocols: TCP vs UDP, three-way handshake, flow & congestion control, IP addressing, subnetting, ARP, and DNS resolution with Python examples.
✓ LiveDatabase Normalization Explained — 1NF to 5NF, BCNF & Denormalization
Learn database normalization: functional dependencies, 1NF through 5NF and BCNF, denormalization tradeoffs. Includes full example normalizing a table through all forms.
✓ LiveTransaction Management Explained — ACID, Concurrency Control & Recovery
Master transaction management: ACID implementation, concurrency control (2PL, timestamp, MVCC), deadlock detection, and ARIES recovery with write-ahead logging examples.
✓ LiveCryptography Basics Explained — Symmetric vs Asymmetric, Hashing & Signatures
Learn cryptography basics: symmetric vs asymmetric encryption, hash functions, digital signatures, certificates, and TLS. Includes Python examples with the cryptography library.
✓ LiveConcurrency & Parallelism Explained — Threads, Mutexes & Deadlock Prevention
Learn concurrency vs parallelism: threads vs processes, mutexes, semaphores, deadlock prevention, lock-free data structures, Go goroutines, and async/await patterns.
✓ LiveCompiler Design Basics — Lexing, Parsing & Code Generation
Learn compiler design from scratch: lexical analysis with regex, recursive descent parsing, AST construction, type checking, intermediate code, and optimization passes.
✓ LiveComputer Networks Deep Dive — TCP Congestion Control, DNS, TLS & QUIC
Deep dive into computer networks: TCP Reno/Cubic/BBR, DNS resolution, TLS 1.3 handshake, HTTP/2 multiplexing vs HTTP/3 QUIC, CIDR subnetting, NAT traversal, BGP, and CDN architecture.
✓ LiveComputational Complexity — P vs NP, Reductions & Complexity Classes
Learn computational complexity: Big O/Theta/Omega, P vs NP, NP-completeness, SAT reductions, space complexity, amortised analysis, approximation algorithms, and the full complexity class hierarchy.
✓ Live