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 4: Searching Techniques — Data Structure Notes

Searching: Finding the Needle

Searching is the operation of finding a specific record (Key) in a dataset.

Searching Algorithms — Comparison

Algorithm	Best	Average	Worst	Requires Sorted?	Space
Linear Search	O(1)	O(n)	O(n)	No	O(1)
Binary Search	O(1)	O(log n)	O(log n)	Yes	O(1) iterative
Hashing	O(1)	O(1)	O(n)	No	O(n)

1. Linear Search

Check every element from index 0 to n-1.

Pros: Works on unsorted data. Simple implementation.
Cons: Extremely slow for large data (1 million items = avg 500,000 comparisons).

2. Binary Search

Works only on sorted data. Repeatedly divide the search interval in half.

Worked Example: Find 23 in [2, 5, 8, 12, 16, 23, 38, 56, 72, 91]

Step	Low	High	Mid	arr[Mid]	Action
1	0	9	4	16	23 > 16, go right
2	5	9	7	56	23 < 56, go left
3	5	6	5	23	Found at index 5!

Only 3 comparisons instead of 6 (linear). For 1 million items: max 20 steps.

3. Hashing (The "Instant" Search)

Uses a Hash Function to calculate the storage address directly.

Hash Function: Index = Key % TableSize Example: Store 25 in table of size 10 → 25 % 10 = 5 → Store at Index 5. To Find 25: Calculate 25 % 10 = 5 → Go to Index 5. Found instantly!

Types of Hash Functions

Method	Formula	Example (Key=234, Size=10)
Division	`Key % Size`	234 % 10 = 4
Mid-Square	Square key, extract middle digits	234² = 54756, middle = 47
Folding	Split key into parts, add them	2 + 34 = 36, 36 % 10 = 6
Digit Extraction	Select specific digits	Extract 2nd,4th digits

The Collision Problem

Collision: Two keys map to the same index. E.g., 25 and 35 both map to Index 5.

Collision Resolution Methods

Method	Type	Description	Pros	Cons
Chaining	Open Hashing	Each slot points to a linked list of elements	Simple, no table size limit	Extra memory for pointers
Linear Probing	Closed Hashing	If slot full, try next slot (i+1, i+2...)	Simple, cache-friendly	Primary clustering
Quadratic Probing	Closed Hashing	Try i+1², i+2², i+3²...	Reduces primary clustering	Secondary clustering
Double Hashing	Closed Hashing	Use second hash function for step size	Best distribution	More complex

Chaining vs Open Addressing

Feature	Chaining	Open Addressing
Collision handling	External linked lists	Probe within table
Load factor	Can exceed 1.0	Must be < 1.0
Memory	Extra pointer overhead	No extra pointers
Deletion	Easy (remove from list)	Difficult (needs tombstones)
Performance	Degrades gracefully	Degrades sharply near full

Load Factor (α)

α = Number of Elements / Table Size

Load Factor	Performance Impact
α < 0.5	Excellent — few collisions
0.5 < α < 0.7	Good — acceptable performance
0.7 < α < 1.0	Degrading — many collisions
α > 1.0	Only possible with chaining

Best Practice: Resize (rehash) the table when α exceeds 0.7 to maintain O(1) performance.