Update (September 2026): the 2026 BCI and SCI exams were held on 22–23 August 2026. This subject stays
free to browse until the next cycle. MeritPrep now also covers
Rajasthan CET 2026 — chapter 1 of every subject and the whole Basic Computer subject are free.
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 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 syllabus. Each chapter is split into microtopics, each with a lesson, a bank of MCQs and spaced-repetition flashcards, so you can learn, test and revise topic by topic.
Chapter 1
7 microtopics · 70 MCQs · 28 flashcards
DSA Fundamentals
- Abstract Data Type (ADT) — concept · Stack ADT · Queue ADT · List ADT
- Algorithm — definition · properties · classification (recap)
- Asymptotic Notation — Big-O · Omega · Theta · little-o
- Best / Worst / Average case · amortized analysis intro
- Data Structure classification — Linear vs Non-Linear · Primitive vs Composite · Static vs Dynamic
- Recursion fundamentals · stack frames · tail recursion · recap
- Time complexity · Space complexity — intuition · why we measure
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
- Array vs Linked List — memory · access · insert/delete · application fit
- Doubly Linked List · Circular Linked List — variants and use cases
- LL operations — reverse · find middle · detect loop (Floyd's algo)
- Singly Linked List — node structure · insert · delete · traverse
- Sparse Matrix · Polynomial representation using LL · recap
Chapter 3
7 microtopics · 70 MCQs · 28 flashcards
Stacks & Queues
- Stack — LIFO Principle, basic operations (push/pop/peek)
- Stack — Array vs Linked List implementation
- Stack Applications — function calls · undo · infix→postfix
- Queue — FIFO Principle, basic operations (enqueue/dequeue)
- Queue — Array vs Linked List implementation
- Queue variants — Circular · Double-ended · Priority
- Stacks + Queues recap, comparisons, exam-tip cheat sheet
Chapter 4
7 microtopics · 70 MCQs · 28 flashcards
Trees
- AVL Tree — balance factor · LL/RR/LR/RL rotations
- B-Tree · B+ Tree intro (cross-link to DBMS Indexing)
- Binary Search Tree (BST) — properties · insert · search · delete (3 cases)
- Binary Tree Traversals — Inorder · Preorder · Postorder · Level-order
- Binary Tree types — full · complete · perfect · skewed · strict · max nodes formula
- Heap — Min-Heap / Max-Heap · Heapify · Insert / Delete-min · Build-heap O(n)
- Tree terminology — root · parent · child · sibling · leaf · height · depth · level · degree
Chapter 5
7 microtopics · 70 MCQs · 28 flashcards
Graphs
- 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)
- Graph terminology — vertex · edge · directed/undirected · weighted · degree · cycle · connected component
- Minimum Spanning Tree — Prim's vs Kruskal's
- Shortest Path — Dijkstra's algorithm (single-source · non-negative weights)
- Topological Sort + Applications · recap
Chapter 6
7 microtopics · 70 MCQs · 28 flashcards
Sorting & Searching
- Bubble Sort — algorithm · trace · complexity · stable · in-place
- Heap Sort (build-heap + extract-max) · Counting / Radix sort intro
- Linear Search vs Binary Search — complexity · prerequisites
- Merge Sort — divide-and-conquer · merge step · complexity proof
- Quick Sort — partition · pivot choices · worst case n² · avg n log n
- Selection Sort · Insertion Sort — when insertion beats others
- Sorting Comparison Table — time/space/stable/in-place/adaptive · recap
Chapter 7
7 microtopics · 72 MCQs · 28 flashcards
Hashing & Symbol Tables
- Algorithm Design overview — Brute Force · Divide & Conquer · Greedy · DP · Backtracking
- Collision Resolution — Open Addressing (linear · quadratic · double hashing)
- Collision Resolution — Separate Chaining (linked lists at each bucket)
- Dynamic Programming intro — Fibonacci memoization · 0/1 Knapsack (light)
- Greedy intro — coin change · activity selection
- Recap · BCI cheat sheet · time-complexity table for all DSA topics
- Symbol Tables & Hashing — hash function · hash table · load factor
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?
Every Computer Instructor subject — this one included — is free to browse in full until the next recruitment cycle is announced: no account, no payment. MeritPrep's paid courses are now the Rajasthan CET tracks; see pricing.
How does this prepare me for the BCI 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.