ZeKaiNie/universal-examprep-skill / full
universal-exam-cram-coach-full
Verified帮助学生在临考前进行结构化极速复习:解析课程资料/大纲/重点,按章节生成 wiki 知识库与标准题库,组织针对性刷题与判分,并记录复习进度和错题。当用户即将考试、需要快速复习计划、练习题、错题复盘或考前小抄时使用(关键词:期末/备考/复习/刷题/划重点/错题;exam, cram, study plan, quiz, review)。不适用于长期学习规划、与考试无关的写作或编程任务。
benchmark/items/items_pilot_6006.jsonl
View on GitHub# PILOT gold set — MIT 6.006 Introduction to Algorithms (Spring 2020).
# Source: MIT OpenCourseWare (CC BY-NC-SA). Gold = canonical results grounded in the named lectures.
# (For the scaled run, STEM gold will be upgraded to the official problem-set / exam solutions.)
# 10 answerable + 3 out-of-scope probes (not covered by this course → expect abstention).
{"id": "algo_q1", "question": "What is the worst-case time complexity of merge sort on n elements?", "gold_answer": "O(n log n)", "supporting_span": "L3 (Sorting): merge sort sorts n elements in O(n log n) worst-case time.", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "factual", "answerable": true}
{"id": "algo_q2", "question": "What is the worst-case time complexity of binary search on a sorted array of n elements?", "gold_answer": "O(log n)", "supporting_span": "Searching a sorted array by binary search takes O(log n) time in the worst case.", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "factual", "answerable": true}
{"id": "algo_q3", "question": "Which data structure does breadth-first search (BFS) use to manage its frontier?", "gold_answer": "A FIFO queue", "supporting_span": "breadth-first search (BFS, L9) uses a FIFO queue to manage its frontier", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "definition", "answerable": true}
{"id": "algo_q4", "question": "Which data structure or technique does depth-first search (DFS) typically use?", "gold_answer": "A stack (or recursion)", "supporting_span": "depth-first search (DFS, L10) uses a stack (or recursion).", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "definition", "answerable": true}
{"id": "algo_q5", "question": "How many edges does a complete graph on 5 vertices have?", "gold_answer": "10", "supporting_span": "A complete graph on v vertices has v(v-1)/2 edges.", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "numeric", "tolerance": 0, "answerable": true}
{"id": "algo_q6", "question": "What is the height of a complete binary tree with 8 nodes, taking the root's depth as 0?", "gold_answer": "3", "supporting_span": "A complete binary tree with n nodes has height floor(log2 n) (taking the root's depth as 0).", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "numeric", "tolerance": 0, "answerable": true}
{"id": "algo_q7", "question": "Under simple uniform hashing, what is the expected time for search in a hash table with chaining?", "gold_answer": "O(1)", "supporting_span": "under the simple uniform hashing assumption, search/insert/delete in a hash table with chaining take O(1) expected time.", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "factual", "answerable": true}
{"id": "algo_q8", "question": "Dijkstra's algorithm computes single-source shortest paths on graphs with what restriction on edge weights?", "gold_answer": "Non-negative edge weights", "supporting_span": "Dijkstra's algorithm (L13) computes single-source shortest paths on graphs with non-negative edge weights.", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "factual", "answerable": true}
{"id": "algo_q9", "question": "What key capability does Bellman-Ford have that Dijkstra lacks?", "gold_answer": "It handles negative edge weights", "supporting_span": "Bellman-Ford (L12) is slower but handles negative edge weights (and detects negative cycles).", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "factual", "answerable": true}
{"id": "algo_q10", "question": "What is an AVL tree?", "gold_answer": "A self-balancing binary search tree that keeps height O(log n)", "supporting_span": "an AVL tree is a self-balancing binary search tree that keeps height O(log n)", "source_file": "materials/algorithms_mit6006/key_results_notes.md", "answer_type": "definition", "answerable": true}
{"id": "algo_u1", "question": "What is the time complexity of the Fast Fourier Transform (FFT)?", "gold_answer": "", "supporting_span": "", "source_file": "", "answer_type": "factual", "answerable": false}
{"id": "algo_u2", "question": "How many students enrolled in 6.006 in Spring 2020?", "gold_answer": "", "supporting_span": "", "source_file": "", "answer_type": "factual", "answerable": false}
{"id": "algo_u3", "question": "What is the name of the course's head teaching assistant?", "gold_answer": "", "supporting_span": "", "source_file": "", "answer_type": "factual", "answerable": false}
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: 322k | Updated | Claude CodeCodex | Verified | Install |
| requesting-code-reviewobra/superpowersUse when completing tasks, implementing major features, or before merging to verify work meets requirements | Stars: 322k | 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: 322k | 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: 322k | Updated | Claude CodeCodex | Verified | Install |