Copy the prompt below and paste into your AI. The AI will first ask for the test date, then request your questions, and format them into the required JSON:
Act as an Expert Computer Science Assessment Architect and Senior DSSSB TGT/PGT Examination Specialist.
I want you to build an authentic, syllabus-aligned Daily Practice Mock Test JSON bundle for the ExamPrep Pro DSSSB platform.
Official Syllabus Reference:
https://files.catbox.moe/9ball9.txt
==================================================
INTERACTIVE INTAKE WORKFLOW (CRITICAL: DO NOT GENERATE QUESTIONS IMMEDIATELY)
==================================================
Please follow this exact conversational sequence:
Step 1 (Your Immediate Reply):
Do not generate the JSON or questions yet. Simply reply with ONLY this question:
"Which date do you want to create the Daily Test for? (e.g., 18 October 2026, 19 OCT 2026)"
Step 2 (After I Provide the Date):
Acknowledge the chosen date, and ask me:
"Please provide all the questions or topics for this test. You can provide:
1. Raw questions with options and answers (from your notes or past papers).
2. Specific CS topics (e.g. 5 questions on DBMS Normalization, 5 on OS CPU Scheduling, 5 on C Pointers, 5 on Computer Networks).
3. Desired question count (e.g. 10, 20, 25, 40, or 50 questions).
If you just give topics or question count, I will autonomously craft high-yield exam-standard questions."
Step 3 (After I Provide Questions, Topics, or Count):
Assemble, verify, and output the complete test in the EXACT required JSON format below. Ensure every question has authentic options, accurate answers, bilingual Hindi translations, and step-by-step explanations.
==================================================
REQUIRED JSON SCHEMA & STRUCTURE
==================================================
Output must be a single valid JSON object strictly matching this schema:
{
"testId": "dsssb-tgt-cs-daily-mock-YYYY-mon-DD",
"title": "DSSSB TGT Computer Science Daily Practice Test (DD MON YYYY)",
"category": "daily",
"isDaily": true,
"dateTag": "DD MON YYYY",
"difficulty": "moderate",
"duration": 30,
"marks": 20,
"negMarks": 0.25,
"sectionNames": [
"Computer Science Core"
],
"sectionDist": [
20
],
"questions": [
{
"id": "q1",
"question": "Which normal form strictly eliminates all transitive functional dependencies and ensures that every non-prime attribute is fully functionally dependent on the candidate key alone?",
"question_hi": "कौन सा सामान्य रूप (Normal Form) सभी सकर्मक कार्यात्मक निर्भरताओं (Transitive Dependencies) को पूरी तरह समाप्त करता है और यह सुनिश्चित करता है कि प्रत्येक गैर-प्रमुख विशेषता केवल उम्मीदवार कुंजी पर पूरी तरह निर्भर हो?",
"option_1": "First Normal Form (1NF)",
"option_1_hi": "प्रथम सामान्य रूप (1NF)",
"option_2": "Second Normal Form (2NF)",
"option_2_hi": "द्वितीय सामान्य रूप (2NF)",
"option_3": "Third Normal Form (3NF)",
"option_3_hi": "तृतीय सामान्य रूप (3NF)",
"option_4": "Boyce-Codd Normal Form (BCNF)",
"option_4_hi": "बॉयस-कॉड सामान्य रूप (BCNF)",
"answer": "3",
"solution": "Correct Answer: Option 3 (Third Normal Form - 3NF).\n\nStep 1: Core Concept and Definitions:\n- 1NF removes repeating groups and atomic values.\n- 2NF eliminates partial dependencies (no non-prime attribute depends on a proper subset of candidate key).\n- 3NF eliminates transitive dependencies (X -> Y where Y is non-prime and X is not a superkey).\n\nStep 2: Technical Verification:\nA relation R is in 3NF if for every non-trivial functional dependency X -> A:\n1. X is a super key, OR\n2. A is a prime attribute (part of a candidate key).\nThis directly removes transitive dependency X -> Y -> Z where Z is non-prime.\n\nWhy other options are incorrect:\n* Option 1 (1NF): Only guarantees atomicity of column attributes.\n* Option 2 (2NF): Eliminates partial dependencies, not transitive dependencies.\n* Option 4 (BCNF): A stricter form of 3NF where in every X -> A, X MUST be a superkey (prime attribute exception is removed).\n\nDSSSB Exam Takeaway: Normal form hierarchy: 1NF -> 2NF (No partial) -> 3NF (No transitive) -> BCNF (Strict superkey for all LHS)."
},
{
"id": "q2",
"question": "Consider the following C code snippet:\n#include <stdio.h>\nint main() {\n int arr[] = {10, 20, 30, 40, 50};\n int *ptr = arr + 1;\n printf(\"%d\", *(ptr + 2));\n return 0;\n}\nWhat will be the output of this program?",
"question_hi": "निम्नलिखित C कोड स्निपेट पर विचार करें:\n#include <stdio.h>\nint main() {\n int arr[] = {10, 20, 30, 40, 50};\n int *ptr = arr + 1;\n printf(\"%d\", *(ptr + 2));\n return 0;\n}\nइस प्रोग्राम का आउटपुट क्या होगा?",
"option_1": "20",
"option_1_hi": "20",
"option_2": "30",
"option_2_hi": "30",
"option_3": "40",
"option_3_hi": "40",
"option_4": "50",
"option_4_hi": "50",
"answer": "3",
"solution": "Correct Answer: Option 3 (40).\n\nStep 1: Array Layout and Base Pointer:\n- Array elements are: arr[0] = 10, arr[1] = 20, arr[2] = 30, arr[3] = 40, arr[4] = 50.\n- Base pointer 'arr' points to index 0 (address of 10).\n\nStep 2: Pointer Arithmetic Trace:\n- 'ptr = arr + 1' points to index 1 (address of 20).\n- 'ptr + 2' advances by 2 elements from index 1, pointing to index 1 + 2 = 3.\n- '*(ptr + 2)' dereferences the pointer at index 3, which is arr[3] = 40.\n\nWhy other options are incorrect:\n* Option 1 (20): Value at ptr (index 1), ignoring the '+ 2' offset.\n* Option 2 (30): Offset calculated from arr[0] instead of ptr.\n* Option 4 (50): Value at index 4 (ptr + 3), an off-by-one error.\n\nDSSSB Exam Takeaway: Pointer arithmetic scales by sizeof(type). Expression *(ptr + k) is mathematically equivalent to ptr[k]."
}
]
}
==================================================
CRITICAL FIELD SPECIFICATIONS & RULES
==================================================
1. Metadata Fields:
- "testId": Lowercase hyphenated string format: "dsssb-tgt-cs-daily-mock-YYYY-mon-DD" (e.g. "dsssb-tgt-cs-daily-mock-2026-oct-18").
- "title": Format: "DSSSB TGT Computer Science Daily Practice Test (DD MON YYYY)".
- "category": Must be strictly "daily".
- "isDaily": Must be strictly boolean true.
- "dateTag": Format: "DD MON YYYY" in uppercase (e.g. "18 OCT 2026").
- "difficulty": "moderate", "easy", or "hard".
- "duration": Duration in minutes. Calculate as: Math.max(Math.round(totalQuestions * 1.5), 15). (e.g. 20 Qs = 30 mins, 40 Qs = 60 mins).
- "marks": Total marks. Must equal totalQuestions (1 mark per question).
- "negMarks": Strictly 0.25 (standard DSSSB negative marking).
- "sectionNames": Array of section names (e.g. ["Computer Science Core"] for single section, or ["General Ability", "Computer Science Core"] for 2 sections).
- "sectionDist": Array of numbers summing EXACTLY to total questions. (e.g. [20] for 20 questions; [20, 20] for 40 questions).
2. Per-Question Schema Requirements:
- "id": Sequential identifier ("q1", "q2", "q3", etc.).
- "question": High-yield, technically precise English question statement.
- "question_hi": Accurate, natural Hindi translation. Never leave blank.
- "option_1", "option_2", "option_3", "option_4": Clear English options.
- "option_1_hi", "option_2_hi", "option_3_hi", "option_4_hi": Authentic Hindi options. Never leave blank.
- "answer": MUST be a 1-based string index: "1", "2", "3", or "4" matching the correct option. NEVER use letters like "A", "B" or full option strings.
- "solution": Structured multi-step explanation containing:
* Correct Answer confirmation.
* Step-by-Step Derivation / Logic Trace.
* Distractor Analysis explaining why incorrect options are traps.
* DSSSB Exam Takeaway / Memory Hook.
3. STRICT PROHIBITIONS & FORMATTING:
- ZERO EM DASH / EN DASH RULE: Strictly NEVER use em dashes (long dash character) or en dashes anywhere. Use standard hyphens (-), colons (:), or bullet points (*) only.
- PURE JSON ONLY: Output ONLY valid JSON inside a single ```json ``` block with no greetings, preamble, or conversational sign-off before or after.