CS Fundamentals
263 articles in this topic
Turing Machines in Theory of Computation: Design, Worked Trace and Decidability
A six-state Turing machine for L = {0^n1^n}: built from the seven-tuple, traced move by move on 0011 to XXYY and q_accept, then proved a decider rather than only a recogniser.
Floating Point Representation in COA: IEEE 754 Explained with Worked Examples
Learn the IEEE 754 single-precision layout through two complete conversions, then understand hidden bits, biased exponents, special values, and rounding errors.
Digital Systems and Boolean Algebra Basics: Complete Guide with a Worked Example
Connect bits, truth tables, Boolean laws, canonical forms, K-maps, and gates by following one three-input function from specification to a simplified circuit.
C Programming for GATE: Syllabus Areas, Weightage Pattern and How to Prepare
Understand where C fits in GATE CS, what exam questions test, and how to build reliable tracing skills through pointers, recursion and structured practice.
Data Link Layer Error Control in Computer Networks: Concepts, CRC, Hamming and Worked Examples
Build error control from first principles, then work through parity, CRC, Hamming code and checksum using bits you can verify by hand.
Lexical Analysis in Compiler Design: Tokens, Patterns, and DFA-Based Scanning with Worked Examples
Learn how a scanner turns source characters into tokens, how token patterns become DFAs, and how longest match, lookahead, and token-counting questions work.
Relations in Discrete Mathematics: Properties, Posets and Worked Examples
Build relations from Cartesian products, test their properties mechanically, and solve equivalence, partial-order, closure, and counting questions with exact examples.
Inter-Process Communication for GATE: Shared Memory, Message Passing and Pipes Compared
Learn who moves the data and who provides synchronization in each IPC model, then test the distinction through six carefully adjudicated statements.
CNF and GNF for GATE: CFG Simplification and Normal-Form Conversion, Step by Step
Run epsilon, unit and useless-production removal in the right order, convert one full grammar to CNF, and verify the two derivation-count formulas.
Theory of Computation (TOC): Complete Guide with Worked Examples
Connect the main ideas of TOC through worked examples, from alphabets and DFA traces to grammars, stacks, Turing machines and decidability.
Control Unit Design in COA: Hardwired vs Microprogrammed, with Worked Examples
Build control unit design from timed micro-operations. Work through a fetch and LOAD sequence, derive control signals, and size horizontal and vertical microcode.
Digital Electronics for GATE: Official Syllabus Map, Weightage Logic and Prep Order
Turn the compact GATE CS Digital Logic syllabus into a practical study sequence, then learn how to audit past-paper weightage without treating it as a forecast.