Does Siksha Sarovar have an AI chatbot to answer student doubts?

Yes. Siksha Sarovar has a built-in AI Assistant chatbot accessible from a floating button on every page. It understands English, Hindi and Hinglish, handles typos (for example 'pyhtion' or 'certifecate'), and indexes 165+ destinations including every course, lesson, BCA subject, school chapter, competitive exam topic, FAQ and tool. Most queries return direct link cards in under 5 milliseconds. An AI fallback is available for novel questions.

Can I ask the SikshaSarovar chatbot questions in Hindi or Hinglish?

Absolutely. The chatbot is built specifically for Indian students — natural Hinglish queries like 'kaise milega certificate', 'free hai kya', 'pyhtion ke datatype kaha hai', 'kaha se shuru karu' are first-class citizens. The matcher strips Hindi filler words and routes you to the right course, lesson or page.

Is the SikshaSarovar AI chatbot free to use?

Yes. The chatbot is 100% free, requires no signup, and is available on every page. It runs locally in your browser for the vast majority of queries — there is no API cost or usage limit. The optional 'Ask AI' fallback for advanced coding questions uses the Pro AI Tutor.

Is Siksha Sarovar really free?

Yes. Every course, lesson, quiz, online compiler, and notes download is free to use without an account. We offer an optional Pro pass that unlocks longer AI tutor sessions, larger compiler quotas and priority support, but it is not required to learn from the platform. The educational content itself stays free.

Do I need to sign in to use the courses?

No. You can browse any course, read all lessons, run code in the compiler and take quizzes without signing in. Google Sign-In is purely optional and is used only to save your progress, quiz scores and certificate eligibility across devices. We never request access to Gmail, Drive, Calendar, Contacts, or any sensitive Google data.

Are the certificates from Siksha Sarovar recognised?

Our certificates are a record of completion that you can share on LinkedIn or attach to applications, but Siksha Sarovar is an independent platform — not a UGC-recognised university or board. We are upfront about that. The certificate is most useful as a verifiable signal that you have completed the curriculum, not as a substitute for a degree.

Which courses are best for BCA and MCA students?

Our University Curriculum section covers the YMCA BCA/MCA syllabus subject-by-subject — Data Structures, DBMS, Web Based Programming, Computer Networks, Operating Systems, Software Engineering, Data Warehousing and more. Each subject is broken down into the same units your university teaches, with previous year question papers where available.

Can I use Siksha Sarovar to prepare for SSC, UPSC, Banking or Railway exams?

Yes. The Competitive section has dedicated tracks for SSC (CGL, CHSL, MTS), UPSC, IBPS/SBI Banking, RRB Railways and defence exams (NDA, CDS, AFCAT). Topics include quantitative aptitude, reasoning, English grammar, general knowledge and current affairs, written specifically for the Indian exam pattern.

What languages does the online compiler support?

The Siksha Sarovar online compiler supports C, C++, Python, Java, PHP, JavaScript, C# and SQL. The compiler runs your code in a sandboxed environment using Judge0, returns the standard output and error stream, and supports stdin so you can test interactive programs. There is no installation — everything runs in your browser.

How is my personal data handled by Siksha Sarovar?

We follow data minimisation: we collect only what is needed (email, name, profile picture from Google sign-in, and your learning progress). Data is stored on Supabase with HTTPS in transit. We do not sell user data, and we do not use it to train AI models. You can request deletion at any time by emailing contact@sikshasarovar.com — see our Privacy Policy for the full details.

Who founded Siksha Sarovar?

Siksha Sarovar was founded by Rohit Kumar, who serves as CEO and Head Developer. Rohit built the platform to provide free, structured education to students across India — covering programming courses, university notes, school study material and competitive exam preparation.

Unit 3: Example Creating a B-Tree — Data Structure Notes

Step-by-Step B-Tree Creation

Let's build a B-Tree of Order 3.

Max Keys per Node: 2 (M-1)
Max Children per Node: 3 (M)
Overflow: Occurs at 3rd key. Action: Split & Promote Median.

Insert Sequence: 10, 20, 5, 6, 12, 30

Step	Insert	Action	Tree Structure
1	10	Root = [10]	`[10]`
2	20	Add to root	`[10, 20]` (full)
3	5	Overflow! Split. 10 promoted	`[10]` with children `[5]`, `[20]`
4	6	6 < 10, go left	`[5, 6]` as left child
5	12	12 > 10, go right	`[12, 20]` as right child
6	30	Overflow in right! 20 promoted	Root: `[10, 20]`, children: `[5,6]`, `[12]`, `[30]`

Final Structure:

       [10, 20]
      /    |    \
   [5,6] [12]  [30]

B-Tree Deletion

Deletion is more complex than insertion. There are several cases:

Case	Condition	Action
Case 1	Key is in a leaf with enough keys	Simply remove it
Case 2	Key is in an internal node	Replace with predecessor/successor, delete from leaf
Case 3	Leaf has minimum keys (underflow)	Borrow from sibling or merge nodes

Underflow Resolution:

Borrow from Sibling: If an adjacent sibling has more than minimum keys, rotate a key through the parent.
Merge: If no sibling can lend, merge with a sibling and pull down the parent key.

B+ Trees — The Database Favorite

Feature	B-Tree	B+ Tree
Data storage	In ALL nodes (internal + leaf)	Only in leaf nodes
Internal nodes	Store keys + data + pointers	Store keys + pointers only
Leaf nodes	No special linking	Linked together (linked list)
Range queries	Must traverse up and down	Simply scan leaf linked list
Branching factor	Lower (data takes space)	Higher (internal nodes are smaller)
Duplicates	Keys appear once	Keys may appear in internal + leaf
Used by	File systems	Databases (MySQL InnoDB, PostgreSQL)

Why B+ Trees for databases? Range queries (e.g., "find all students with GPA > 3.5") are extremely efficient because leaf nodes are linked sequentially.

Choosing B-Tree Order

Factor	Recommendation
Disk block size	Choose M so one node fits in one disk block
Key size	Larger keys → smaller M
Typical orders	50–200 for databases
Rule of thumb	M = (Block Size) / (Key Size + Pointer Size)