CS Fundamentals
485 articles in this topic
SLR, CLR and LALR Parsers Compared for GATE: LR Item Sets, Conflicts and Parser Power
All three LR parsers built on one shared grammar: canonical item sets, why SLR(1) hits a shift/reduce conflict that CLR(1) and LALR(1) survive, the 10-vs-14 state count, the reduce/reduce drill grammar, and the exact question patterns GATE uses to test parser power.
Updated 18 Jul 20266 min read182 viewsCompiler Design
Cache Write Policies and Multi-Level Cache Numericals for GATE: AMAT Solved Step by Step
Write-through vs write-back traffic arithmetic and the hierarchical vs simultaneous AMAT formulas, derived once and drilled on L1/L2 GATE-pattern numericals solved step by step.
Updated 18 Jul 20267 min readComputer Organization & Architecture
IBPS SO IT Officer Computer Organization: professional knowledge topics
IBPS SO IT Officer Computer Organization: number systems, Boolean logic, CPU and memory organization, addressing modes and I/O for the Mains PK paper.
Updated 18 Jul 20265 min read168 viewsComputer Organization & Architecture
IBPS SO IT Officer Operating Systems: professional knowledge topics
IBPS SO IT Officer Operating Systems: master processes, CPU scheduling, memory management, deadlock and process synchronization for the Mains PK paper.
Updated 18 Jul 20266 min read170 viewsOperating Systems
IBPS SO IT Officer Networking: professional knowledge topics to master
IBPS SO IT Officer Networking: master the OSI and TCP/IP models, IP addressing, key protocols and network security for the Professional Knowledge paper.
Updated 25 Jul 20265 min read888 viewsComputer Networks
IBPS SO IT Officer DBMS: the professional knowledge topics that matter
The DBMS core of the IBPS SO IT Officer Mains Professional Knowledge paper: the ER model, keys, normalization with a worked example, SQL essentials and transactions, and how each is tested.
Updated 26 Jul 20266 min read1.3k viewsDBMS
C programming for CS teaching exams: the concepts that get tested
C programming for teaching CS exams: data types, operators, control flow, functions and recursion, arrays, pointers and structures, with a worked example.
Updated 18 Jul 20267 min readC Programming & Data Structures
Addressing modes and instruction formats in computer architecture explained
Addressing modes and instruction formats explained: immediate, direct, indirect, indexed and PC-relative effective addresses, and 0/1/2/3-address machines.
Updated 16 Jul 20267 min read370 viewsComputer Organization & Architecture
Floating point representation: IEEE 754 format and arithmetic explained
Computers store real numbers in a fixed number of bits, so they cannot store every real number exactly. Floating point packs a huge range of magnitudes into 32 or 64 bits by trading away some precision, and IEEE 754 is the standard almost every processor follows. This topic is a dependable source of encoding and precision questions, all resting on the same field layout and normalization rule.
Updated 16 Jul 20266 min read378 viewsComputer Organization & Architecture
File systems and disk scheduling in OS: allocation, directories and seek time
A file system is the operating system's answer to a simple-sounding question: where on the disk does each file's data actually live, and how do we find it again quickly? Disk scheduling is the follow-up: when many read and write requests are queued, in what order should the head service them so the disk arm travels least? The two meet in one place: how the file system scatters a file's blocks decides how far the arm travels to read them back. Both are steady exam scorers.
Updated 16 Jul 20265 min read83 viewsOperating Systems
Memory management in OS: paging and segmentation explained
Memory management is how an operating system decides where each process lives in physical memory and maps program addresses to hardware locations. Correct mapping lets many processes share memory safely; bad mapping wastes space through fragmentation or causes invalid access. Most exam questions reduce to one skill: translating a logical address into a physical one.
Updated 16 Jul 20265 min read50 viewsOperating Systems
CPU scheduling algorithms: FCFS, SJF, Round Robin and priority explained
When several processes are ready to run and there is one CPU, the operating system has to choose who goes next. That choice is CPU scheduling, and the algorithm it uses decides how long each process waits and how responsive the system feels. It is almost entirely mechanical: draw a Gantt chart, read off the completion times, and two subtractions give you everything an exam question asks for. Four processes, four algorithms, and the same two averages come out different every time.
Updated 29 Jul 20266 min read351 viewsOperating Systems