CS Fundamentals
200 articles in this topic
Grammar in Theory of Computation: Complete Guide with Worked Examples
Learn how grammars generate languages, classify all four Chomsky types, convert a regular grammar to an NFA, detect ambiguity, and use CNF step counts.
Programming the Basic Computer (COA): Instruction Set, Assembly Language and Worked Examples
Learn the Morris Mano Basic Computer by decoding an indirect instruction and assembling a subtraction program from source to final memory values.
Boolean Minimization in Digital Electronics: Laws, K-Maps and Worked Examples
Learn to reduce Boolean expressions with auditable algebra, legal K-map groups, don't-cares, and truth-table checks. Includes complete SOP and POS examples.
Arrays and Strings in C: Array-to-Pointer Decay, sizeof Traps and 2D Address Arithmetic
Learn what an array name means in C, why sizeof changes across a function boundary, and how to calculate 1D and 2D element addresses without guessing.
Application Layer in Computer Networks: Protocols, Worked Examples, and How GATE Tests It
Build a clear application-layer model, work through DNS and HTTP timing problems, revise the major protocols, and avoid the traps that cost easy marks.
Grammar and CFG in Compiler Design: Complete Guide with Worked Examples
Build grammar and CFG concepts from the formal definition to parse trees, parser-ready transformations and LL(1), using one expression grammar throughout.
Discrete Mathematics for GATE: Syllabus, Weightage Context and Preparation Order
Learn where Discrete Mathematics sits in GATE CS, how its syllabus areas connect, and how to cover them through a practical 45-hour study plan.
BTSC Lab Assistant (CS): Eligibility and the Selection and Merit Process
A practical way to verify your BTSC Lab Assistant CS qualification, read the selection clause correctly, and prepare the documents that decide candidature.
SQL Subqueries and Correlated Subqueries: How to Read, Write and Solve Placement-Test Questions
Read nested SQL from the inside out, distinguish once-only and per-row evaluation, and solve common placement questions with one small employee dataset.
Chomsky Hierarchy for GATE: Classifying a Grammar as Regular, Context-Free, Context-Sensitive or Type-0
Classify grammars mechanically from their production forms. Four worked boundary cases show exactly when a grammar moves from regular to CFG, CSG or Type-0.
Coal India Management Trainee (Systems) Syllabus Decoded: the Technical and Aptitude Split
The MT Systems paper is two preparation jobs: a CS core revised for recall speed, and an aptitude half built beside it. The notification settles the numbers.
Shift Registers, Ring and Johnson Counters for GATE: Frequency Division and Timing Numericals Solved
Build a 4-bit ring counter and Johnson counter state by state, then use their mod values to solve frequency-division and maximum-clock questions.