Responsible Academic Integrity — EduFAZE rejects unreliable AI text detectors. We evaluate genuine understanding through conversational step-by-step viva questions.
Non-Punitive Understanding Check
🛡 AI Academic Integrity & Viva Coach
Demonstrate your mastery through interactive viva questions. Defend your design decisions and demonstrate authentic comprehension without false accusations.
📝 Submitted Work: CS201 Assignment 2 (QuickSort vs MergeSort)
Submitted: Oct 14, 2026 • Grade: 88/100 (Pending Viva Verification)
Excerpt from submitted code & report:
"Implemented Lomuto partitioning with randomized pivot selection to prevent worst-case O(n^2) degradation on partially sorted arrays. Memory auxiliary overhead is O(1) in-place."
"Implemented Lomuto partitioning with randomized pivot selection to prevent worst-case O(n^2) degradation on partially sorted arrays. Memory auxiliary overhead is O(1) in-place."
🤖 AI Viva Follow-up Question #1 of 2
"You stated that randomized pivot selection prevents worst-case O(n^2). Can you explain a scenario where even a randomized QuickSort could still theoretically hit O(n^2) time, and how the recursion call stack depth behaves?"
Tip: Focus on probability of choosing extrema pivots repeatedly and stack overflow risk.
📋 Demonstrated Understanding Records
Verified by faculty review • Recorded on your Learning Passport
| Assignment | Course | Defense Mode | Demonstration Score | Teacher Review |
|---|---|---|---|---|
| Binary Search Tree Balancing | Data Structures (CS201) | Interactive Viva (3 questions) | Strong Mastery (92%) | ✓ Dr. Dev Kumar |
| Calculus Definite Integral Limits | Calculus II (MA202) | Step-by-step proof walkthrough | Competent (78%) | ✓ Dr. Dev Kumar |