DSA & Algorithms

61 articles in this topic

Physical Security and Cryptography Basics: Controls, Ciphers and Worked Examples

Connect physical and logical security through Lab L-07. Learn layered controls, calculate residual risk, trace XOR, compare SHA-256 outputs and choose the right primitive.

Updated 25 Oct 20265 min readDSA & Algorithms

Array Data Structure: Memory Layout, Operations and Worked Examples

Understand how arrays map indices to memory, then practise address calculation, exact shift counts, searching and dynamic-array growth with worked examples.

Updated 24 Oct 20266 min readDSA & Algorithms

Tree Data Structure: Types, Traversals and a Worked BST Example

Build one nine-node binary search tree, classify its shape, trace four traversals, and work through insertion, search, deletion and complexity checks.

Updated 21 Oct 20266 min readDSA & Algorithms

Graphs in Data Structures: Complete Guide with BFS, DFS and Dijkstra Worked Examples

Learn graph terminology, representations and algorithm selection by tracing one unweighted graph with BFS and DFS, then solving a weighted graph with Dijkstra.

Updated 17 Oct 20266 min readDSA & Algorithms

Physical Security and Cryptography Basics: Controls, Keys and Worked Examples

Learn how physical and cryptographic controls work together, then apply them in a four-asset server-room model and a step-by-step toy RSA example.

Updated 13 Oct 20265 min readDSA & Algorithms

Stack Data Structure: Operations, Applications and Worked Examples

Build a stack from its LIFO rule, trace array and linked-list operations, evaluate a postfix expression, and practise recursion, applications, and common traps.

Updated 8 Oct 20265 min read50 viewsDSA & Algorithms

Queue Data Structure: Operations, Circular Queues and Worked Examples for GATE

Learn queue operations through a five-slot circular queue trace, then connect the same FIFO rule to linked lists, BFS and the two-stack implementation.

Updated 4 Oct 20266 min read79 viewsDSA & Algorithms

Linked List Data Structure: Complete Guide with Pointer Traces and Worked Examples

Learn how linked lists work by tracing every pointer change in core operations, then apply the same invariants to reversal, middle-node search, and cycle detection.

Updated 29 Sep 20266 min readDSA & Algorithms

Data Structures: Types, Operations, Complexity, and Worked Examples

Learn how representations and operation costs shape data-structure choices. Follow one array and linked-list edit sequence, then apply the reasoning to stacks, queues, trees, and hashing.

Updated 25 Sep 20265 min readDSA & Algorithms

Hashing Data Structure: Hash Functions, Collision Resolution and Worked Examples

Trace the same eight keys through separate chaining and linear probing, then learn how tombstones, load factor and rehashing affect correctness and speed.

Updated 24 Sep 20266 min read65 viewsDSA & Algorithms

Data Structure for GATE: Syllabus Map, Past-Paper Weightage and Preparation Order

Map the official GATE Data Structure scope, read the two 2026 CS sessions without turning them into a forecast, and follow a verified 48-hour study order.

Updated 23 Sep 20264 min read91 viewsDSA & Algorithms

Shortest Path Algorithms: Dijkstra, Bellman-Ford and Floyd-Warshall with Worked Examples for GATE CS

Learn the relaxation idea behind shortest paths, trace three core algorithms by hand, and choose the right method from edge weights and source count.

Updated 21 Sep 20265 min readDSA & Algorithms