ZeKaiNie/universal-examprep-skill / full
universal-exam-cram-coach-full
Verified帮助学生在临考前进行结构化极速复习:解析课程资料/大纲/重点,按章节生成 wiki 知识库与标准题库,组织针对性刷题与判分,并记录复习进度和错题。当用户即将考试、需要快速复习计划、练习题、错题复盘或考前小抄时使用(关键词:期末/备考/复习/刷题/划重点/错题;exam, cram, study plan, quiz, review)。不适用于长期学习规划、与考试无关的写作或编程任务。
benchmark/behavior_smoke/fixtures/mini_course_nostate/references/quiz_bank.json
View on GitHub[
{
"id": "mc_q1",
"chapter": 1,
"type": "choice",
"question": "栈(stack)的存取顺序是下列哪一种?",
"options": ["A. 先进后出(LIFO)", "B. 先进先出(FIFO)", "C. 随机存取", "D. 优先级最高先出"],
"answer": "A",
"explanation": "栈只在一端(栈顶)压入/弹出,故先进后出(LIFO)。",
"source": "teacher"
},
{
"id": "mc_q2",
"chapter": 1,
"type": "subjective",
"question": "用一句话说明队列(queue)与栈在存取顺序上的区别。",
"answer": "队列先进先出(FIFO),从队尾入、队头出;栈先进后出(LIFO),只在栈顶进出。",
"keywords": ["先进先出", "FIFO", "队头", "队尾"],
"explanation": "对比两种线性结构的存取端与顺序。",
"source": "teacher"
},
{
"id": "mc_q3",
"chapter": 1,
"type": "fill_blank",
"question": "队列的存取顺序简称是____(英文缩写)。",
"answer": "FIFO",
"explanation": "First In First Out,先进先出。",
"source": "material"
},
{
"id": "mc_q4",
"chapter": 2,
"type": "true_false",
"question": "判断:一棵高度为 h 的二叉树最多有 2^(h+1) - 1 个节点(根的高度记为 0)。",
"answer": true,
"explanation": "满二叉树时取最大节点数 2^(h+1)-1。",
"source": "teacher"
},
{
"id": "mc_q5",
"chapter": 2,
"type": "diagram",
"question": "画出将 [2, 1, 3] 依次插入二叉搜索树(BST)后的最终形态。",
"answer": "根为 2,左子为 1,右子为 3。",
"diagram_type": "binary_search_tree",
"render_hint": "先按 BST 插入算法逐个插入得到结构再画;以老师课上画法(是否画空节点)为准。",
"explanation": "画图题应先跑标准插入算法得到结构再画,禁止凭记忆手绘。",
"source": "teacher"
},
{
"id": "mc_q6",
"chapter": 2,
"type": "code",
"question": "用 Python 实现一个支持 push/pop 的栈类 Stack(基于 list)。",
"answer": "class Stack:\n def __init__(self):\n self._d = []\n def push(self, x):\n self._d.append(x)\n def pop(self):\n return self._d.pop()",
"language": "python",
"expected_behavior": "push 后再 pop 应返回最后压入的元素;空栈 pop 抛出 IndexError。",
"tests": ["s = Stack(); s.push(1); s.push(2); assert s.pop() == 2"],
"ai_generated": true,
"source": "ai_generated",
"explanation": "AI 生成的参考实现,需与老师/教材实现核对。"
},
{
"id": "vis_q1",
"chapter": 1,
"type": "choice",
"question": "请根据题面图判断阴影区域表示哪一个集合关系。",
"options": ["A. A 与 B 的交集", "B. A 与 B 的并集", "C. 只属于 A 的部分", "D. 只属于 B 的部分"],
"answer": "A",
"explanation": "题面图中阴影位于两个圆重叠区域,表示 A 与 B 的交集。",
"source": "teacher",
"requires_assets": true,
"question_text_status": "full",
"assets": [
{
"path": "references/assets/venn_prompt.svg",
"role": "figure",
"type": "diagram",
"caption": "Venn prompt"
}
]
}
]
Related skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| receiving-code-reviewobra/superpowersUse when receiving code review feedback, before implementing suggestions, especially if feedback seems unclear or technically questionable - requires technical rigor and verification, not performative agreement or blind implementation | Stars: 323k | Updated | Claude CodeCodex | Verified | Install |
| requesting-code-reviewobra/superpowersUse when completing tasks, implementing major features, or before merging to verify work meets requirements | Stars: 323k | Updated | Claude CodeCodex | Verified | Install |
| using-git-worktreesobra/superpowersUse when starting feature work that needs isolation from current workspace or before executing implementation plans - ensures an isolated workspace exists via native tools or git worktree fallback | Stars: 323k | Updated | Claude CodeCodex | Verified | Install |
| verification-before-completionobra/superpowersUse when about to claim work is complete, fixed, or passing, before committing or creating PRs - requires running verification commands and confirming output before making any success claims; evidence before assertions always | Stars: 323k | Updated | Claude CodeCodex | Verified | Install |