CS Fundamentals
263 articles in this topic
C Programming by Yash Sir: Complete Guide with Worked Examples
Build C from evaluation rules to pointers with worked output traces, a recursion call stack, memory diagrams, common traps, and a clear route into exam and placement practice.
Data Link Layer Access Control: Medium Access Protocols with Worked Examples
Understand where access control sits inside the MAC sublayer, compare random, controlled and channelized access, and solve the ALOHA and CSMA/CD calculations students commonly mix up.
Intro to Compilers (Compiler Design): The Six Phases Traced with Worked Examples
Follow position = initial + rate * 60 through lexical, syntax and semantic analysis, intermediate code, optimisation, and target code. The worked trace turns six memorised phase names into one visible pipeline.
Propositional and Predicate Logic in Discrete Mathematics: From Truth Tables to Quantifiers
Build logic from atomic propositions to nested quantifiers, with complete truth tables, canonical forms, countervaluations, and finite-domain checks.
Coal India MT Eligibility and Selection Process: What the Notification Actually Says
Use the current Coal India notification to verify your degree, percentage, age and selection route before you prepare for a CBT or depend on a GATE score.
SQL Window Functions Explained: ROW_NUMBER, RANK, and DENSE_RANK with Interview Problems
See why window functions preserve rows, then calculate three ranking columns on the same tied-score table.
Regular Language Properties: Closure, Decision Tests, and Worked Examples
Connect closure properties, decision tests, and proof tools through product automata, pumping arguments, Myhill-Nerode reasoning, and checked string traces.
Register Transfer and Microoperations in COA: RTL Notation, Bus Design, and Every Microoperation Type with Worked Examples
RTL becomes easy when you treat every statement as parallel hardware action at one clock edge. This guide works through buses, subtraction, bit masks, insertion, and signed shifts.
Combinational Circuits in Digital Electronics: Design, MUX, Decoders and Worked Examples
Learn a repeatable method for converting a logic specification into a verified combinational circuit, then apply it to adders, multiplexers, decoders, parity and hazards.
Dynamic Memory Allocation in C: malloc, calloc, realloc and the Bugs Exams Test
Follow one resizable integer array from allocation to release. The worked trace explains byte counts, preserved values, uninitialised elements and the safe temporary-pointer pattern.
Cyber and Info Security in Computer Networks: Complete Guide with Worked RSA and Diffie-Hellman Examples
Build the topic from security goals to firewalls, then hand-calculate RSA encryption, an RSA signature, and a Diffie-Hellman shared secret. Includes exam traps and an interview-ready TLS explanation.
Intermediate Code Generation in Compiler Design: Three-Address Code, Quadruples, Triples and Worked Examples
Learn how a compiler produces intermediate code, represents it as quadruples or triples, removes repeated work with a DAG, and handles control flow.