CS Fundamentals
261 articles in this topic
Coding Questions for GATE CS: Trace Outputs and Complexity Step by Step
Learn a reliable way to solve coding output and complexity questions. Three fully traced C examples cover loops, mutation, recursion and operation counts.
IP Addressing in Computer Networks: Classes, Subnetting, CIDR, and Worked Examples for GATE
Build IP addressing from its 32-bit foundation through classful ranges, subnetting, VLSM, CIDR aggregation, and longest prefix match with checked examples.
CLR(1) Parser and Canonical LR(1) Items: Worked Closure, GOTO and Parse Table
Build a CLR(1) parser from one small grammar. Follow every closure, GOTO, table entry, and stack action until ccdd is accepted.
Introduction to Graphs: Loops, Parallel Edges and Adjacent Vertices with Worked Examples
Build every basic graph term from one five-vertex example. Track a loop and parallel edges correctly, audit the degree sum, then simplify the graph.
Process Management in Operating Systems: States, PCB and Scheduling Worked Examples
Connect the process lifecycle, PCB, queues and dispatcher, then calculate FCFS and Round Robin metrics through one complete scheduling example.
Transaction Management in DBMS: ACID, Serializability, Locking and Recovery
Learn to trace DBMS transactions from operation sequences to precedence graphs, recovery rules, lock protocols, timestamp checks, and crash handling.
Turing Machine Basics and Design: Step-by-Step Worked Example for GATE
Build a deterministic single-tape TM that decides L = {0^n1^n | n >= 1}. Follow every move on 0011, test rejection cases, and connect the design to correctness and halting.
COA for GATE: An 8-Week Topic-by-Topic Preparation Plan
Study Computer Organization and Architecture in prerequisite order with an adjustable 80-hour plan, checked numericals, timed practice, and a practical recovery rule.
Synchronous Counter Design: A MOD-6 JK Flip-Flop Worked Example
Build a MOD-6 synchronous up counter from its state sequence to its JK input equations, then verify valid states, recovery paths, and clock timing.
C Function Basics MCQs: 10 Solved Questions on Prototypes, Calls and Parameters
Solve 10 C function MCQs, then use the explanations to separate declarations, definitions, copied arguments, return values, static locals and scope.
Computer Networks for GATE: Syllabus Areas, Weightage Pattern and How to Prepare
Learn what CN covers in GATE, where its questions tend to come from, and how to sequence the subject. Includes verified subnetting and stop-and-wait examples.
Compiler Design for GATE: A 6-Week Topic-by-Topic Study Plan
Follow a fixed eight-hour weekly clock through compiler phases, parsing, translation, runtime storage, optimisation and mixed revision.