CS Fundamentals
263 articles in this topic
Software Sizing: LOC and Function Point Estimation with Worked Examples
LOC and function points answer different sizing questions. Learn both through a four-module LOC estimate, a full function-point calculation, and unit-safe effort conversions.
Computer Organization and Architecture Basics: Complete Guide with Worked Examples
Follow an instruction from bits through the CPU, memory and I/O, then solve exact examples on overflow, CPI, pipelines, cache fields, AMAT and interrupts.
Boolean Expressions in Digital Electronics: Laws, Canonical Forms and Worked Simplification
Learn one Boolean function from notation to truth table, canonical forms, simplification and NAND gates, with checks that expose common errors.
Instruction Formats and Expanding Opcode for GATE: Solved Encoding Numericals
Treat every instruction format as a bit budget. A four-level worked example shows exactly how unused opcode patterns expand into the next instruction class.
Ethernet in the Data Link Layer: Frame Format, CSMA/CD, and Worked GATE Examples
Build Ethernet from its frame fields upward, then solve collision-window, back-off, efficiency, and domain-counting problems with the reasoning shown.
Semantic Analysis and SDT in Compiler Design: Attributes, Worked Examples, and How GATE Tests It
Learn how semantic analysis validates meaning, how SDDs and SDTs evaluate attributes, and how to trace two common exam-style problems to their final answers.
Set Theory in Discrete Mathematics: Operations, Laws and Worked Examples
Build set theory from elements and subsets to algebra, inclusion-exclusion and Cartesian products, with every important result worked out step by step.
Operating System for GATE: Syllabus, Weightage Pattern and Prep Order
See what GATE officially includes under Operating System, how we classified two 2026 CS papers, and how to turn that scope into a 30-hour study plan.
Data Warehousing and Data Mining in DBMS: Star Schema, OLAP Operations and Apriori with Worked Examples
Move from warehouse vocabulary to hand-worked answers. Build a star schema, operate on a data cube, run Apriori, and follow two k-means iterations.
Regular Expressions in Theory of Computation: Rules, Conversions and Worked Examples
Learn what classical regular expressions denote, construct one from a language condition, convert it through NFA and DFA, and check equivalence with worked examples.
Pipelining in COA: Speedup, Hazards, and Worked GATE Examples
Build a clear mental model of pipelining, then use it to solve clock-period, speedup, throughput, efficiency, and hazard questions step by step.
Sequential Circuits in Digital Electronics: Flip-Flops, Registers and a Worked Mod-4 Counter
Learn to trace sequential logic edge by edge, then design and verify a two-bit synchronous counter using state tables, D-input equations and timing constraints.