AI Mentor for Computer Science Students

Every bug you squash today is one less to explain in the viva tomorrow.

An engineering student asks Sumantrak™

“explain time complexity of merge sort for viva”

O(n log n): every level of the recursion does O(n) work merging, and there are log n levels since the array halves each time. Why it matters for viva: examiners often follow up with "why not O(n)?", say it plainly: you can't sort by looking at each element once, you need comparisons across the whole array, and log n splits is the minimum needed to get there.

Free course

Sumantrak™ Fundamentals of AI

8 modules, 40 short lessons in English, Marathi or Hindi, an exam and a certificate. Open to Computer Science students in the first and second year.

Subjects Sumantrak™ covers for Computer Science

Distributed SystemsCompiler DesignSystem DesignMachine LearningCloud ComputingTOCOOP with JavaDBMSCNData StructuresOSDigital LogicPhysicsEngineering Graphics

Also helps with GATE CS prep, same subject matter, exam-focused framing.

Set up my Computer Science mentor

Free to start, no card required.

Other branches