Coding & Skills
204 articles in this topic
Arrays in C: Declaration, Initialization and Worked Examples
Learn how C arrays behave through exact contents, safe loop bounds, function calls and two-dimensional traversal. A complete program traces sum, average and maximum.
Object Oriented Technology Explained: Four Pillars, Worked Java Examples, GATE and Interview Patterns
Build object oriented technology on one running Java example. Learn the four pillars, trace exact outputs, and separate overloading from overriding.
C++ Tutorial: The Complete Learning Path from First Program to STL
Learn C++ in the order that makes difficult ideas manageable. This roadmap gives you six stages, practical checkpoints and a clear route into exam and placement practice.
Approaches to AI: The Four Approaches, a Worked Rational-Agent Example, and How Exams Test Them
Separate the four classic approaches to AI, score a rational vacuum agent step by step, and learn the distinctions that matter in exams and interviews.
Functions in C: Call by Value vs Simulated Call by Reference and the Swap Question Family
See why a normal C swap changes only local copies, then trace the pointer version and the aliasing, increment, array, struct, and lifetime traps around it.
HTML Interview Questions for Freshers: Semantic Tags, Forms and the Attributes That Get Tested
Learn the HTML details interviews actually probe, from semantic landmarks and form submission to script loading, labels, and accessibility.
Classic Programs in C, Java and Python
Learn six placement-programming methods through one clean implementation each. The focus is logic, edge cases, complexity and porting, not memorised code.
Python Output-Based Questions: 13 Solved Snippets
Trace 13 compact Python snippets on references, slices and mutation. Each example gives the output first and then explains the object-level reason.
Construct a Binary Tree from Traversals
Use inorder splits and preorder roots to rebuild a binary tree, then learn the BST shortcut and the cases where traversal data is not unique.
Banker's Algorithm for GATE: Safe Sequence Numericals with Full Allocation-Max-Need Matrices
Learn the safety algorithm through a five-process matrix, count every safe sequence, and repair an unsafe state with the smallest possible resource addition.
String Handling in Java: String Pool, Immutability and Fresher-Test Questions
Where Java strings actually live, why they never change, and how == vs equals() decides service-company output questions. A String pool and heap diagram, a step-by-step worked trace, StringBuilder performance, and four fresher-test output questions with worked answers.
Page Replacement Algorithms for GATE: FIFO, LRU and Optimal with Belady's Anomaly Explained
One shared reference string traced fault by fault through FIFO, LRU and Optimal page replacement with 3 frames, then re-run under FIFO with 4 frames to demonstrate Belady's anomaly. Includes the counting rules GATE expects, why LRU beating FIFO is a tendency and not a theorem, and the stack-algorithm property that makes LRU and Optimal immune to the anomaly.