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.

Course Introduction: The Science of Hard Problems — Complexity Theory Notes

Welcome to Complexity Theory

Algorithms courses ask: how fast can we solve this problem? Complexity theory asks the deeper question: how fast can this problem possibly be solved — by any algorithm, ever? It is the study of the inherent difficulty of computational problems, and it contains the most famous open question in computer science: does P equal NP?

The journey of this course

How this course is organised

Syllabus block	Lessons that cover it
Basics of computational complexity, time & space complexity, Big-O	Unit 1 → "Time, Space & Big-O Notation"
Problem classification: P, NP, NP-hard, NP-complete	Unit 1 → "The Complexity Classes"
Polynomial-time reductions (introduction)	Unit 1 → "Polynomial-Time Reductions"
Turing machines and variants	Unit 2 → "Turing Machines & Their Variants"
Non-deterministic computation	Unit 2 → "Non-deterministic Computation"
Circuit complexity, random access machines	Unit 2 → "Circuit Complexity & the RAM Model"
Complexity of sorting, searching, graph algorithms	Unit 2 → "Complexity of Concrete Algorithms"
Cook–Levin theorem	Unit 3 → "The Cook–Levin Theorem"
SAT, 3-SAT, CLIQUE	Unit 3 → "The Classic NP-Complete Problems"
Techniques for proving NP-completeness	Unit 3 → "Proving NP-Completeness"
P vs NP statement & consequences of P = NP	Unit 4 → "P vs NP & What P = NP Would Mean"
PSPACE and other classes, beyond polynomial time	Unit 4 → "PSPACE & the Wider Class Zoo"
Approximation algorithms, interactive proofs	Unit 4 → "Living with Hardness"

Why this subject matters to you

It tells you when to stop looking for a fast algorithm. Recognising that a scheduling/routing/packing problem is NP-complete saves weeks of doomed optimisation and points you to approximations and heuristics instead.
It underpins security. All of modern cryptography rests on complexity assumptions — RSA is safe only because we believe factoring is hard.
It is a placement/interview differentiator. "Is this problem NP-complete, and how would you cope?" is a real senior-engineer interview question.
It is intellectually spectacular. P vs NP carries a million-dollar prize and would reshape mathematics, AI and medicine if resolved.

Prerequisites

You should know	Why
Asymptotic notation from Data Structures	We sharpen and formalise it
Basic graph terminology (vertex, edge, path, clique)	Reductions live on graphs
Propositional logic (AND/OR/NOT, truth tables)	SAT is the central problem
Finite automata (helpful, not mandatory)	Turing machines extend them

How to study this course

Learn the definitions cold. Half the exam marks are for stating P, NP, NP-hard, NP-complete, reductions and Cook–Levin precisely. Sloppy definitions lose marks fast.
Practise reductions on paper. Reductions are the "problems" of this subject — the gadget constructions in Unit 3 must be reproduced, not just recognised.
Keep a "class membership" table. Every time you meet a problem (sorting, SAT, CLIQUE, TQBF...), note its class. The table is your revision sheet.
Always check both directions. An NP-completeness proof needs membership in NP and NP-hardness — students routinely forget the first half.

Notation you will use all semester

Symbol	Reading	First appears
O, Ω, Θ, o, ω	asymptotic upper / lower / tight / strict bounds	Unit 1
{0,1}*	the set of all finite binary strings	Unit 1
L ⊆ {0,1}*	a language = a decision problem's YES-set	Unit 1
A ≤ₚ B	A polynomial-time reduces to B ("A no harder than B")	Unit 1
⟨G⟩, ⟨M, x⟩	a standard string encoding of the object(s)	Units 1–2
δ	transition function of a machine	Unit 2
φ, ψ	Boolean formulas	Unit 3
OPT(x)	value of the optimal solution of instance x	Unit 4

What a typical end-term paper looks like

Question style	Typical marks	Where it is trained
"Define P / NP / NP-hard / NP-complete and relate them"	5–8	Unit 1
"Prove f(n) = O(g(n))" / derive the complexity of a code fragment	4–6	Unit 1
"Design a Turing machine for L; analyse its time and space"	6–8	Unit 2
"State and prove (or sketch) the Cook–Levin theorem"	8–10	Unit 3
"Prove problem X is NP-complete" (a gadget reduction)	8–10	Unit 3
"Consequences of P = NP" / short notes on PSPACE, IP, approximation	5–8	Unit 4

Two habits this table should trigger immediately: definitions are recall marks (bank them early), reductions are practice marks (earn them on paper, weekly — they cannot be crammed).

A four-week study plan that works

Week 1 — Unit 1: memorise the five asymptotic definitions; rebuild the class diagram from memory; write five O/Ω/Θ proofs with explicit constants.
Week 2 — Unit 2: trace the {0ⁿ1ⁿ} machine by hand; write the verifier ⟺ NTM equivalence argument once without notes.
Week 3 — Unit 3: reproduce the Cook–Levin outline; write the SAT → 3-SAT and 3-SAT → CLIQUE reductions from a blank page.
Week 4 — Unit 4 + revision: the class map, the P = NP consequences table, one approximation proof — then attack the revision lesson's question bank.

Self-check before you begin

Can you state, without looking, the difference between solving a problem and verifying a proposed solution?
Why does a 2ⁿ-time algorithm not become practical when computers get 1000× faster?
What two things must be shown to prove a problem NP-complete?
Which unit of this course proves the first NP-complete problem exists, and what is that problem?