Arrays, linked lists, stacks, queues, trees (BST, AVL, B-trees), graphs (BFS, DFS, Dijkstra), sorting algorithms (Quick, Merge, Heap), and hashing — every topic the BCI 2026 paper asks about, with worked examples and timing analysis.
Free preview: Chapter 1 of this subject is fully free — read every lesson, attempt every MCQ, review every flashcard. No sign-up required to read; sign in to save progress.
Syllabus & chapters
Aligned to the official RSSB BCI 2026 syllabus. Each chapter has 7 microtopics with English and Hindi lessons, 10 MCQs per microtopic, 4 spaced-repetition flashcards per microtopic, and a 15-question chapter mock test.
Chapter 1
7 microtopics · 70 MCQs · 28 flashcards
DSA Fundamentals
- Algorithm — definition · properties · classification (recap)
- Abstract Data Type (ADT) — concept · Stack ADT · Queue ADT · List ADT
- Data Structure classification — Linear vs Non-Linear · Primitive vs Composite · Static vs Dynamic
- Time complexity · Space complexity — intuition · why we measure
- Asymptotic Notation — Big-O · Omega · Theta · little-o
- Best / Worst / Average case · amortized analysis intro
- Recursion fundamentals · stack frames · tail recursion · recap
Chapter 2
7 microtopics · 70 MCQs · 28 flashcards
Arrays & Linked Lists
- 1D Array — declaration · addressing formula · access in O(1)
- 2D Array — Row-major vs Column-major · address calculation
- Singly Linked List — node structure · insert · delete · traverse
- Doubly Linked List · Circular Linked List — variants and use cases
- Array vs Linked List — memory · access · insert/delete · application fit
- LL operations — reverse · find middle · detect loop (Floyd's algo)
- Sparse Matrix · Polynomial representation using LL · recap
Chapter 3
0 microtopics · 0 MCQs · 0 flashcards
Stacks & Queues
Chapter 4
7 microtopics · 70 MCQs · 28 flashcards
Trees
- Tree terminology — root · parent · child · sibling · leaf · height · depth · level · degree
- Binary Tree types — full · complete · perfect · skewed · strict · max nodes formula
- Binary Tree Traversals — Inorder · Preorder · Postorder · Level-order
- Binary Search Tree (BST) — properties · insert · search · delete (3 cases)
- AVL Tree — balance factor · LL/RR/LR/RL rotations
- B-Tree · B+ Tree intro (cross-link to DBMS Indexing)
- Heap — Min-Heap / Max-Heap · Heapify · Insert / Delete-min · Build-heap O(n)
Chapter 5
7 microtopics · 70 MCQs · 28 flashcards
Graphs
- Graph terminology — vertex · edge · directed/undirected · weighted · degree · cycle · connected component
- Graph Representation — Adjacency Matrix vs Adjacency List (space/time tradeoffs)
- Graph Traversal — BFS (queue-based · level-order)
- Graph Traversal — DFS (stack/recursion · cycle detection · topological sort prep)
- Shortest Path — Dijkstra's algorithm (single-source · non-negative weights)
- Minimum Spanning Tree — Prim's vs Kruskal's
- Topological Sort + Applications · recap
Chapter 6
7 microtopics · 70 MCQs · 28 flashcards
Sorting & Searching
- Linear Search vs Binary Search — complexity · prerequisites
- Bubble Sort — algorithm · trace · complexity · stable · in-place
- Selection Sort · Insertion Sort — when insertion beats others
- Merge Sort — divide-and-conquer · merge step · complexity proof
- Quick Sort — partition · pivot choices · worst case n² · avg n log n
- Heap Sort (build-heap + extract-max) · Counting / Radix sort intro
- Sorting Comparison Table — time/space/stable/in-place/adaptive · recap
Chapter 7
7 microtopics · 72 MCQs · 28 flashcards
Hashing & Symbol Tables
- Symbol Tables & Hashing — hash function · hash table · load factor
- Collision Resolution — Separate Chaining (linked lists at each bucket)
- Collision Resolution — Open Addressing (linear · quadratic · double hashing)
- Algorithm Design overview — Brute Force · Divide & Conquer · Greedy · DP · Backtracking
- Greedy intro — coin change · activity selection
- Dynamic Programming intro — Fibonacci memoization · 0/1 Knapsack (light)
- Recap · BCI cheat sheet · time-complexity table for all DSA topics
How MeritPrep helps you crack Data Structures and Algorithms
- Microtopic depth: Each concept is broken into a 5-minute focused lesson with worked examples and diagrams, not 50-page chapters.
- RSSB pattern MCQs: Every MCQ is written in the style of past Paper II questions, with detailed explanations.
- Spaced repetition: Flashcards enter your Daily Review queue with intervals tuned to keep concepts fresh through exam day.
- Mock tests: 15-Q chapter mocks plus full-syllabus mocks for Data Structures and Algorithms when you're ready.
- Bilingual: Every lesson is available in both English and Hindi.
Frequently asked questions
Is Data Structures and Algorithms content free to read?
Chapter 1 of this subject is fully free, and the entire DBMS subject is free. To unlock the rest of Data Structures and Algorithms and every other BCI subject, get BCI Full Access for ₹1,499 — valid through 22 August 2026 (BCI Paper II exam day).
How does this prepare me for the BCI 2026 exam?
The Data Structures and Algorithms chapters mirror the official BCI Paper II syllabus exactly. Past-year questions (PYQs) are tagged on relevant MCQs so you know which topics are highest-yield. The combination of focused microtopic lessons, RSSB-pattern practice, and spaced repetition is designed for the exam format.
Is content available in Hindi?
Yes — every lesson, MCQ, and flashcard has a Hindi version. Toggle between English and Hindi from the language button at the top of the app.