CS Fundamentals
200 articles in this topic
Recurrence Relations for GATE: Solving Linear Recurrences by Characteristic Roots and Generating Functions
Solve one linear recurrence twice, see why both methods agree, and keep discrete-maths recurrences separate from the Master Theorem.
Magnetic Disk Numericals for GATE: Capacity, Seek Time and Transfer Rate Solved
Turn disk geometry into four reliable calculations. One fully specified disk is solved for capacity, rotation time, transfer rate and sector access time.
Cyber Threats and Malware Attacks: Types, Attack Chains and a Worked Incident
Learn to separate vectors, techniques and payloads, classify mixed malware behaviour, calculate exposure, and map controls to each incident stage.
NFA to DFA Conversion for GATE: Subset Construction and State-Count Numericals
Convert two small NFAs into complete DFAs, handle epsilon-closure and the dead state, and separate the reachable state count from the 2^n worst case.
Hardwired vs Microprogrammed Control Unit for GATE: Microinstruction Sizing Numericals Solved
Separate the qualitative comparison from the sizing numerical. Two worked control-store examples show exactly where every microinstruction bit comes from.
Multiplexer Realization for GATE: Implementing Any Boolean Function with a Smaller MUX, Solved
Learn why a smaller MUX is enough for a Boolean function, then wire a complete 4:1 example without guessing any data input.
C Programming Interview Questions for Freshers: The 40 Asked in Vivas and Placement Drives
Prepare 40 common C questions with short interview-safe answers, then learn how to dry-run pointer mutation on a whiteboard.
CSS Box Model, Positioning and z-index Explained with Worked Layout Examples
Calculate a CSS box's real width, choose the right position value, and trace z-index with exact numbers. The examples turn common layout bugs into rules.
Phases of a Compiler for GATE: One Statement Traced Through Every Phase
Follow position = initial + rate * 60 through all six compiler phases. Each step shows the exact artifact, error class and hand-off that GATE can test.
Probability for GATE CS
Translate the wording into events before calculating. Exact dice, Bayes and expectation examples show how to build the denominator and avoid the standard independence trap.
Final Year Placement Preparation Plan: A 90-Day Schedule for Aptitude, Coding and Interviews
Run aptitude, coding and interviews as three connected streams across 90 days. The schedule includes weekly hours, phase checkpoints and a rule for missed days.
Relational Algebra for GATE: Operators, Tuple-Counting and Query Equivalence Drills
Calculate set, join, and outer-join cardinalities on concrete relations, then use selection and projection pushdown without changing query meaning.