Skip to content

ZeKaiNie/universal-examprep-skill / full

universal-exam-cram-coach-full

Verified

帮助学生在临考前进行结构化极速复习:解析课程资料/大纲/重点,按章节生成 wiki 知识库与标准题库,组织针对性刷题与判分,并记录复习进度和错题。当用户即将考试、需要快速复习计划、练习题、错题复盘或考前小抄时使用(关键词:期末/备考/复习/刷题/划重点/错题;exam, cram, study plan, quiz, review)。不适用于长期学习规划、与考试无关的写作或编程任务。

FileKindSize
.gitattributesother1.5 KB
.github/workflows/ci.ymlconfig1.9 KB
.gitignoreother659 B
AGENTS.mdmarkdown38.8 KB
CHANGELOG.en.mdmarkdown25.5 KB
CHANGELOG.mdmarkdown20.5 KB
CONTRIBUTING.mdmarkdown5.1 KB
CONTRIBUTING.zh.mdmarkdown4.9 KB
LICENSEother1.0 KB
README.mdmarkdown24.5 KB
README.zh.mdmarkdown22.8 KB
SKILL.mdskill md10.4 KB
assets/exam-panic.pngbinary934.2 KB
benchmark/.gitignoreother1.2 KB
benchmark/README.en.mdmarkdown12.7 KB
benchmark/README.mdmarkdown10.8 KB
benchmark/REPORT.en.mdmarkdown7.1 KB
benchmark/REPORT.mdmarkdown6.4 KB
benchmark/aggregate_matrix.pyscript16.3 KB
benchmark/behavior_smoke/README.en.mdmarkdown9.9 KB
benchmark/behavior_smoke/README.mdmarkdown7.4 KB
benchmark/behavior_smoke/fixtures/mini_course/references/assets/venn_prompt.svgother677 B
benchmark/behavior_smoke/fixtures/mini_course/references/quiz_bank.jsonconfig4.5 KB
benchmark/behavior_smoke/fixtures/mini_course/references/wiki/ch1_stack_queue.mdmarkdown447 B
benchmark/behavior_smoke/fixtures/mini_course/references/wiki/ch2_trees.mdmarkdown493 B
benchmark/behavior_smoke/fixtures/mini_course/study_plan.mdmarkdown550 B
benchmark/behavior_smoke/fixtures/mini_course/study_progress.mdmarkdown429 B
benchmark/behavior_smoke/fixtures/mini_course/study_state.jsonconfig390 B
benchmark/behavior_smoke/fixtures/mini_course_nostate/references/assets/venn_prompt.svgother677 B
benchmark/behavior_smoke/fixtures/mini_course_nostate/references/quiz_bank.jsonconfig3.2 KB
benchmark/behavior_smoke/fixtures/mini_course_nostate/references/wiki/ch1_stack_queue.mdmarkdown447 B
benchmark/behavior_smoke/fixtures/mini_course_nostate/references/wiki/ch2_trees.mdmarkdown493 B
benchmark/behavior_smoke/fixtures/mini_course_nostate/study_plan.mdmarkdown550 B
benchmark/behavior_smoke/fixtures/mini_course_nostate/study_progress.mdmarkdown429 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_chat_auto_pdf_bad.txtmarkdown433 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_chat_good.txtmarkdown462 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_chat_not_persisted_bad.txtmarkdown186 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_one_shot_good.txtmarkdown490 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_one_shot_persist_bad.txtmarkdown605 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_one_shot_probe_error_bad.txtmarkdown507 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_visual_native_good.txtmarkdown495 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_visual_preflight_failed_bad.txtmarkdown487 B
benchmark/behavior_smoke/mock/sample_outputs/artifact_mode_visual_subscription_guess_bad.txtmarkdown507 B
benchmark/behavior_smoke/mock/sample_outputs/hint_skip_offer.txtmarkdown349 B
benchmark/behavior_smoke/mock/sample_outputs/language_ask_good.txtmarkdown461 B
benchmark/behavior_smoke/mock/sample_outputs/language_ask_missing_line.txtmarkdown270 B
benchmark/behavior_smoke/mock/sample_outputs/language_ask_unglossed.txtmarkdown211 B
benchmark/behavior_smoke/mock/sample_outputs/language_persist_good.txtmarkdown216 B
benchmark/behavior_smoke/mock/sample_outputs/language_persist_noncanonical.txtmarkdown157 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_bilingual.txtmarkdown261 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_bilingual_explicit.txtmarkdown372 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_bilingual_negated.txtmarkdown306 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_question.txtmarkdown224 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_silent.txtmarkdown364 B
benchmark/behavior_smoke/mock/sample_outputs/language_urgent_wrong_language.txtmarkdown262 B
benchmark/behavior_smoke/mock/sample_outputs/notebook_persist_chat_only.txtmarkdown952 B
benchmark/behavior_smoke/mock/sample_outputs/notebook_persist_good.txtmarkdown744 B
benchmark/behavior_smoke/mock/sample_outputs/progress_after_confusion.mdmarkdown395 B
benchmark/behavior_smoke/mock/sample_outputs/progress_after_mistake.mdmarkdown403 B
benchmark/behavior_smoke/mock/sample_outputs/provenance_answer.txtmarkdown492 B
benchmark/behavior_smoke/mock/sample_outputs/quiz_output_good.txtmarkdown351 B
benchmark/behavior_smoke/mock/sample_outputs/quiz_output_invented.txtmarkdown317 B
benchmark/behavior_smoke/mock/sample_outputs/resume_message.txtmarkdown224 B
benchmark/behavior_smoke/mock/sample_outputs/scope_override_good.txtmarkdown258 B
benchmark/behavior_smoke/mock/sample_outputs/scope_override_missing.txtmarkdown127 B
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_ai_answer_good.txtmarkdown1.2 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_formula_first.txtmarkdown1.1 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_good.txtmarkdown1.2 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_liberal_good.txtmarkdown1.4 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_missing_warn.txtmarkdown608 B
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_no_source.txtmarkdown1.1 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_optin_closers.txtmarkdown1.5 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_skip_ask.txtmarkdown948 B
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_unlabeled_source.txtmarkdown517 B
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_unsolicited_closers.txtmarkdown1.5 KB
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_warn_title.txtmarkdown581 B
benchmark/behavior_smoke/mock/sample_outputs/time_budget_1day_bad.txtmarkdown340 B
benchmark/behavior_smoke/mock/sample_outputs/time_budget_1day_bank_checkpoint.txtmarkdown341 B
benchmark/behavior_smoke/mock/sample_outputs/time_budget_1day_good.txtmarkdown695 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_answer_after_prompt.txtmarkdown264 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_answer_before_prompt.txtmarkdown264 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_answer_side_first.txtmarkdown261 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_answer_text_before_prompt.txtmarkdown243 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_good.txtmarkdown232 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_missing_asset.txtmarkdown182 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_path_only.txtmarkdown163 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_prose_before_image.txtmarkdown234 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_question_label_late_asset.txtmarkdown250 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_unlabeled_solution_before_prompt.txtmarkdown233 B
benchmark/behavior_smoke/mock/sample_outputs/visual_first_unsafe_url.txtmarkdown178 B
benchmark/behavior_smoke/mock/sample_outputs/window_recheck_bad.txtmarkdown346 B
benchmark/behavior_smoke/mock/sample_outputs/window_recheck_good.txtmarkdown665 B
benchmark/behavior_smoke/mock/sample_outputs/window_recheck_recall_only_bad.txtmarkdown333 B
benchmark/behavior_smoke/mock/sample_outputs/window_recheck_test_good.txtmarkdown580 B
benchmark/behavior_smoke/mock/sample_outputs/workspace_confirm_good.txtmarkdown797 B
benchmark/behavior_smoke/mock/sample_outputs/workspace_confirm_silent.txtmarkdown453 B
benchmark/behavior_smoke/mock/sample_outputs/zero_basic_explain.txtmarkdown1.2 KB
benchmark/behavior_smoke/mock/sample_outputs/zero_basic_legacy_only.txtmarkdown442 B
benchmark/behavior_smoke/mock/sample_transcript.jsonlother517 B
benchmark/behavior_smoke/mock/state_after_confusion.jsonconfig203 B
benchmark/behavior_smoke/mock/state_after_mistake.jsonconfig215 B
benchmark/behavior_smoke/run_behavior_smoke.pyscript97.2 KB
benchmark/behavior_smoke/scenarios.jsonconfig12.7 KB
benchmark/calibrate.pyscript7.3 KB
benchmark/calibrate_matrix.pyscript20.0 KB
benchmark/calibration/README.en.mdmarkdown3.2 KB
benchmark/calibration/README.mdmarkdown2.6 KB
benchmark/calibration/kappa_n24_summary.jsonconfig1.5 KB
benchmark/config.example.jsonconfig431 B
benchmark/config.matrix.example.jsonconfig1.1 KB
benchmark/docs/coverage-matrix.en.mdmarkdown17.6 KB
benchmark/docs/coverage-matrix.mdmarkdown15.2 KB
benchmark/docs/img/hard_algo_correct_en.svgother2.7 KB
benchmark/docs/img/hard_algo_correct_zh.svgother2.7 KB
benchmark/docs/img/hard_algo_hallu_en.svgother2.7 KB
benchmark/docs/img/hard_algo_hallu_zh.svgother2.7 KB
benchmark/docs/img/hard_psyc_correct_en.svgother2.7 KB
benchmark/docs/img/hard_psyc_correct_zh.svgother2.7 KB
benchmark/docs/img/hard_psyc_hallu_en.svgother2.7 KB
benchmark/docs/img/hard_psyc_hallu_zh.svgother2.7 KB
benchmark/docs/img/oos_algo_abst_en.svgother2.7 KB
benchmark/docs/img/oos_algo_abst_zh.svgother2.7 KB
benchmark/docs/img/oos_psyc_abst_en.svgother2.7 KB
benchmark/docs/img/oos_psyc_abst_zh.svgother2.7 KB
benchmark/docs/img/realexam_algo_correct_en.svgother2.7 KB
benchmark/docs/img/realexam_algo_correct_zh.svgother2.7 KB
benchmark/docs/judge-calibration.en.mdmarkdown13.1 KB
benchmark/docs/judge-calibration.mdmarkdown9.9 KB
benchmark/docs/materials_sources.en.mdmarkdown3.2 KB
benchmark/docs/materials_sources.mdmarkdown2.7 KB
benchmark/docs/matrix_pipeline.en.mdmarkdown9.5 KB
benchmark/docs/matrix_pipeline.mdmarkdown8.4 KB
benchmark/docs/related_benchmarks.en.mdmarkdown5.5 KB
benchmark/docs/related_benchmarks.mdmarkdown4.6 KB
benchmark/docs/running-real-runs.en.mdmarkdown10.0 KB
benchmark/docs/running-real-runs.mdmarkdown8.0 KB
benchmark/docs/test_tiers.en.mdmarkdown7.7 KB
benchmark/docs/test_tiers.mdmarkdown6.8 KB
benchmark/docs/testing-audit.en.mdmarkdown17.2 KB
benchmark/docs/testing-audit.mdmarkdown14.6 KB
benchmark/docs/testing-walkthrough.en.mdmarkdown23.5 KB
benchmark/docs/测试流程详解.mdmarkdown19.0 KB
benchmark/drift/README.en.mdmarkdown14.6 KB
benchmark/drift/README.mdmarkdown12.3 KB
benchmark/drift/convert_session_log.pyscript12.9 KB
benchmark/drift/docs/live_agent_pilot.mdmarkdown6.6 KB
benchmark/drift/fixtures/live_logs/good_session.expected.jsonlother1.5 KB
benchmark/drift/fixtures/live_logs/good_session.mdmarkdown1.6 KB
benchmark/drift/fixtures/live_logs/live_smoke_golden.jsonlother2.2 KB
benchmark/drift/fixtures/live_logs/live_smoke_golden.mdmarkdown2.3 KB
benchmark/drift/fixtures/mini_course_long/references/quiz_bank.jsonconfig1.3 KB
benchmark/drift/fixtures/mini_course_long/references/wiki/ch1_stack_queue.mdmarkdown541 B
benchmark/drift/fixtures/mini_course_long/references/wiki/ch2_trees.mdmarkdown413 B
benchmark/drift/fixtures/mini_course_long/study_plan.mdmarkdown426 B
benchmark/drift/fixtures/mini_course_long/study_progress.final.bad.mdmarkdown151 B
benchmark/drift/fixtures/mini_course_long/study_progress.final.good.mdmarkdown272 B
benchmark/drift/fixtures/mini_course_long/study_progress.initial.mdmarkdown151 B
benchmark/drift/fixtures/mini_course_long_state/references/quiz_bank.jsonconfig1.3 KB
benchmark/drift/fixtures/mini_course_long_state/references/wiki/ch1_stack_queue.mdmarkdown541 B
benchmark/drift/fixtures/mini_course_long_state/references/wiki/ch2_trees.mdmarkdown413 B
benchmark/drift/fixtures/mini_course_long_state/study_plan.mdmarkdown426 B
benchmark/drift/fixtures/mini_course_long_state/study_progress.final.bad.mdmarkdown151 B
benchmark/drift/fixtures/mini_course_long_state/study_progress.final.good.mdmarkdown272 B
benchmark/drift/fixtures/mini_course_long_state/study_progress.initial.mdmarkdown151 B
benchmark/drift/fixtures/mini_course_long_state/study_state.jsonconfig145 B
benchmark/drift/run_drift.pyscript79.7 KB
benchmark/drift/run_live_smoke.pyscript26.4 KB
benchmark/drift/scenarios/live_smoke_basic.jsonconfig681 B
benchmark/drift/scenarios/long_session_basic.jsonconfig793 B
benchmark/drift/scenarios/long_session_state.jsonconfig994 B
benchmark/drift/scenarios/mode_urgent_no_questions.jsonconfig1.1 KB
benchmark/drift/scenarios/window_persist.jsonconfig1.0 KB
benchmark/drift/templates/live_session_template.mdmarkdown1.3 KB
benchmark/drift/templates/live_smoke_turns.jsonconfig1.6 KB
benchmark/drift/transcripts/bad_checkpoint_reset.jsonlother877 B
benchmark/drift/transcripts/bad_goal_drift.jsonlother226 B
benchmark/drift/transcripts/bad_plan_drift.jsonlother729 B
benchmark/drift/transcripts/bad_progress_loss.jsonlother1013 B
benchmark/drift/transcripts/bad_provenance_drift.jsonlother583 B
benchmark/drift/transcripts/bad_quiz_invention.jsonlother590 B
benchmark/drift/transcripts/bad_urgent_1day_questions.jsonlother840 B
benchmark/drift/transcripts/bad_wiki_overread.jsonlother430 B
benchmark/drift/transcripts/good_session.jsonlother5.5 KB
benchmark/drift/transcripts/good_session_state.jsonlother7.0 KB
benchmark/drift/transcripts/good_session_urgent_1day.jsonlother2.8 KB
benchmark/drift/transcripts/window_persist_session.jsonlother7.3 KB
benchmark/fixtures/mini_course_matrix/.gitignoreother250 B
benchmark/fixtures/mini_course_matrix/config.jsonconfig394 B
benchmark/fixtures/mini_course_matrix/items.jsonlother1.6 KB
benchmark/fixtures/mini_course_matrix/materials/_combined.txtmarkdown502 B
benchmark/fixtures/mini_course_matrix/raw_ws/lecture01.mdmarkdown379 B
benchmark/fixtures/mini_course_matrix/skill_ws/references/wiki/ch01_minios.mdmarkdown485 B
benchmark/gen.pyscript13.0 KB
benchmark/items/README.en.mdmarkdown3.3 KB
benchmark/items/README.mdmarkdown2.6 KB
benchmark/items/items.example.jsonlother2.0 KB
benchmark/items/items_algo_full_q.jsonlother13.5 KB
benchmark/items/items_pilot_6006.jsonlother4.5 KB
benchmark/items/items_pilot_psyc110.jsonlother4.5 KB
benchmark/items/items_psyc_full_q.jsonlother7.5 KB

benchmark/items/items_algo_full_q.jsonl

View on GitHub
{"id": "algo_L01_a", "question": "According to Lecture 1, for an input of n = 1000, how many operations does a quadratic Θ(n^2) algorithm perform (as given in the running-time table)?"}
{"id": "algo_L01_b", "question": "In Lecture 1, what is the name of the model of computation used in this class?"}
{"id": "algo_L02_a", "question": "According to Lecture 2, an operation is said to have amortized cost T(n) under what condition on the total cost of k operations?"}
{"id": "algo_L03_a", "question": "In Lecture 3, the recurrence tree for merge_sort is described as a complete binary tree whose depth is log₂ n. For an input of n = 8 elements, what is the depth of this recurrence tree?"}
{"id": "algo_L03_b", "question": "According to Lecture 3, a sort is called \"in place\" if it uses how much extra space?"}
{"id": "algo_L04_a", "question": "In Lecture 4, if keys are ten-letter names and one bit is used per name, approximately how many terabytes of space does a direct access array require?"}
{"id": "algo_L04_b", "question": "According to Lecture 4, what is the term for the situation when there always exist keys a, b such that h(a) = h(b)?"}
{"id": "algo_L05_a", "question": "In Lecture 5, what is the worst-case running-time lower bound for any comparison sort of an array of n elements?"}
{"id": "algo_L05_b", "question": "According to Lecture 5, when radix sort uses tuple sort with auxiliary counting sort to sort tuples (a, b) for u < n^2 (sorting first b then a), what constant multiple of n is its stated running time, i.e. the running time is O(?n)?"}
{"id": "algo_L06_a", "question": "According to Lecture 6, how many pointers does each node of a binary tree have?"}
{"id": "algo_L06_b", "question": "In Lecture 6, what is the BST Property that a Binary Search Tree must satisfy at every node?"}
{"id": "algo_L07_a", "question": "According to Lecture 7, using the stated recurrence F(0) = 1, F(1) = 2, and F(h) = 1 + F(h-1) + F(h-2) for the fewest nodes in any height-h height-balanced tree, what is the value of F(2)?"}
{"id": "algo_L07_b", "question": "In Lecture 7, the skew of a node is defined as a difference of two subtree heights. The height of which subtree is subtracted from which?"}
{"id": "algo_L08_a", "question": "According to Lecture 8, using the implicit complete binary tree index arithmetic for a binary heap, what is the array index of the left child of the node at index 4 (i.e., the value of left(4))?"}
{"id": "algo_L08_b", "question": "In Lecture 8, what is the Max-Heap Property at node i, stated in terms of Q[i] and its children j?"}
{"id": "algo_L09_a", "question": "According to Lecture 9, by which lemma is the sum over all vertices of their degrees, ∑_{u ∈ V} deg(u), bounded above by 2|E|, allowing a graph to be stored in Θ(|V| + |E|) space?"}
{"id": "algo_L09_b", "question": "In Lecture 9, in the base case of breadth-first search the source vertex s forms level set L0; what is the value of the distance δ(s, s) assigned in that base case?"}
{"id": "algo_L10_a", "question": "According to Lecture 10, if G = (V, E) is a DAG, what kind of ordering is obtained by reversing a finishing order produced by Full-DFS?"}
{"id": "algo_L10_b", "question": "In Lecture 10, how many directed edges does the example directed graph G2 have?"}
{"id": "algo_L11_a", "question": "In Lecture 11, when initializing DAG Relaxation, to what numeric value is the distance estimate d(s, s) of the source vertex s set?"}
{"id": "algo_L11_b", "question": "According to Lecture 11, what is a negative-weight cycle defined to be?"}
{"id": "algo_L12_a", "question": "According to Lecture 12, what is the running time of the Bellman-Ford algorithm for single-source shortest paths on a general graph with arbitrary edge weights?"}
{"id": "algo_L12_b", "question": "In Lecture 12, in the worked Bellman-Ford example with source a, what is the 2-edge distance δ₂(a, c) (i.e., the value δ(a₀, c₂) in the k=2 row of the k-edge distance table)?"}
{"id": "algo_L13_a", "question": "According to Lecture 13, when the graph is sparse (|E| = Θ(|V|)), which priority queue implementation for Q′ yields the O(|V| log |V|) running time for Dijkstra's algorithm?"}
{"id": "algo_L13_b", "question": "In Lecture 13, in the Dijkstra example on graph G with vertices s, a, b, c, d, what is the final shortest-path distance δ(s, b) from the source s to vertex b?"}
{"id": "algo_L14_a", "question": "In Lecture 14, what is the total running time of Johnson's Algorithm, expressed in big-O notation?"}
{"id": "algo_L14_b", "question": "According to Lecture 14, when constructing the augmented graph in Johnson's Algorithm, what weight is assigned to the directed edge added from the new vertex to each vertex v in V?"}
{"id": "algo_L15_a", "question": "According to Lecture 15, who coined the term \"dynamic programming\"?"}
{"id": "algo_L15_b", "question": "In Lecture 15, how many cases (options inside the max) does the dynamic-programming Bowling relation B(i) consider for the first pin?"}
{"id": "algo_L16_a", "question": "In Lecture 16, for the Longest Common Subsequence example with A = hieroglyphology and B = michaelangelo, what is the length of a longest common subsequence?"}
{"id": "algo_L16_b", "question": "According to Lecture 16, in the Longest Increasing Subsequence (LIS) dynamic program, what does the subproblem x(i) represent?"}
{"id": "algo_L17_a", "question": "In Lecture 17, the dynamic program for Single-Source Shortest Paths (using subproblems δ_k(s, v) = shortest path weight using at most k edges) is identified as which classic algorithm?"}
{"id": "algo_L17_b", "question": "According to Lecture 17, in the Arithmetic Parenthesization example, what is the maximum value obtainable by parenthesizing the expression 7 + 4 × 3 + 5?"}
{"id": "algo_L18_a", "question": "According to Lecture 18, what is the running time of the dynamic-programming algorithm for the Rod Cutting problem?"}
{"id": "algo_L18_b", "question": "In Lecture 18, for the Subset Sum example, how many subproblems does the top-down (memoized) approach actually solve by computing only the reachable subproblems?"}
{"id": "algo_L19_a", "question": "According to Lecture 19, what is the name of the first NP-complete problem, to which every decision problem is reducible?"}
{"id": "algo_L19_b", "question": "In Lecture 19, the reduction from 3-Partition to Rectangle Packing transforms each integer a_i into a 1 x a_i rectangle and sets the target rectangle dimensions according to a stated rule. Given an instance of 9 integers, what is the value of the first dimension (n/3) of the target rectangle?"}
{"id": "algo_L20_a", "question": "In Lecture 20, how many follow-on courses are listed under \"Next Steps\"?"}
{"id": "algo_L20_b", "question": "According to Lecture 20, what does \"pseudopolynomial\" mean?"}
{"id": "algo_PS1_a", "question": "In Problem Set 1, Problem 1-2(a), you are given a sequence data structure D supporting build(X) in O(n) time and insert_at(i,x) / delete_at(i) each in O(log n) time, where n is the number of items stored. Using only these operations, you implement reverse(D, i, k), which reverses the order of the k items starting at index i. What is the worst-case running time of this reverse algorithm in terms of k and n?"}
{"id": "algo_PS1_b", "question": "In Problem Set 1, Problem 1-3 (Binder Bookmarks), the database stores n pages in a static array of size 3n with two bookmarks A and B and supports read_page(i) in O(1), shift_mark in O(1), and move_page(m), which moves the page in front of one bookmark to be in front of the other (rebuilding the whole structure when the separation invariant breaks). What is the running time of move_page(m), and is it worst-case or amortized?"}
{"id": "algo_PS2_a", "question": "In Problem Set 2, Problem 2-1(c), you must solve the recurrence T(n) = 2 T(n/3) + 5n lg n (assume T(1) = Theta(1)), giving the tightest bound. What is the tight asymptotic solution for T(n)?"}
{"id": "algo_PS2_b", "question": "In Problem Set 2, Problem 2-2(b), you have a static array A of pointers to n comparable objects where each pairwise comparison costs Theta(log n) time (reads/writes are constant). Among selection sort, insertion sort, and merge sort, which sorting algorithm should be chosen to best sort them?"}
{"id": "algo_PS3_a", "question": "In Problem Set 3, Problem 3-2(c): students choose IDs and are then hashed to one of n rooms using a function chosen uniformly at random from the universal hash family H = {h_{ab}(k) = ((ak + b) mod p) mod n}. Two students cannot guarantee being roommates; what is the highest probability they can achieve of being assigned the same room? Give the answer in terms of n."}
{"id": "algo_PS3_b", "question": "In Problem Set 3, Problem 3-1(b): the keys A = [47, 61, 36, 52, 56, 33, 92] are inserted into a size-7 hash table using hash function h(k) = ((10k + 4) mod c) mod 7 for a positive integer c. What is the smallest value of c such that no collisions occur when inserting all keys from A?"}
{"id": "algo_PS4_a", "question": "In Problem Set 4, Problem 4-1(a): A Set Binary Tree T satisfies the binary search tree property but is not height-balanced. The official solution identifies exactly which nodes are not height-balanced and gives each node's skew. List the keys of the not-height-balanced nodes together with their skews."}
{"id": "algo_PS4_b", "question": "In Problem Set 4, Problem 4-2(b): Given the array [701, 253, 24, 229, 17, 22] drawn as a complete binary tree, the task is to state whether the tree is a max-heap, a min-heap, or neither. According to the official solution, which is it?"}
{"id": "algo_PS5_a", "question": "In Problem Set 5, Problem 5-2 (Power Plants), you are given the list of wires connecting n power plants and n^2 buildings (every building is powered by exactly one plant). To pick the plant whose generator backs up the most buildings, you model the network as an undirected graph and find connected components. What is the worst-case running time of the official O(...) algorithm?"}
{"id": "algo_PS5_b", "question": "In Problem Set 5, Problem 5-6 (6.006 Tilt), a Tilt board is an n x n grid of obstacles, sliders, and empty squares; a move tilts the board in one of the four cardinal directions. According to the official solution, what is the maximum number r of distinct successor configurations a single board configuration B can have (i.e., the maximum number of configurations reachable from B with one move)?"}
{"id": "algo_PS6_a", "question": "In Problem Set 6, Problem 6-2 (Short Circuits): given a weighted directed graph G=(V,E,w) and source s where, for every vertex v, some minimum-weight path from s to v uses at most k edges, the official solution asks for an algorithm finding all shortest-path weights. What is the running time of that algorithm (as stated in the solutions)?"}
{"id": "algo_PS6_b", "question": "In Problem Set 6, Problem 6-1, you run DAG Relaxation / Dijkstra on the DAG G from source vertex s. The resulting shortest-path distances are δ(s,a)=6, δ(s,b)=2, δ(s,c)=4, δ(s,e)=5, δ(s,f)=7. What is the shortest path weight δ(s,d) from s to vertex d?"}
{"id": "algo_PS7_a", "question": "In Problem Set 7, Problem 7-3 (Odd Paths), you are given a weighted directed acyclic graph G = (V, E, w) with integer edge weights and two vertices s, t, and must determine the number of paths from s to t having odd weight. According to the official solution's dynamic programming approach, what is the running time of the algorithm?"}
{"id": "algo_PS7_b", "question": "In Problem Set 7, Problem 7-4 (Pizza Partitioning), Liza and her brother take turns choosing slices of a pizza cut into 2n sectors with integer tastiness values, and Liza wants to maximize the tastiness she can guarantee herself. According to the official solution's running time analysis (which precomputes all subarray tastiness values and solves the subproblems), what is the total running time of the algorithm?"}
{"id": "algo_PS8_a", "question": "In Problem Set 8, Problem 8-2 (Splits Bowling): given a sequence of n pins each with integer value v_i, where the player may knock down a single pin (scoring v_i), two adjacent pins i and i+1 (scoring v_i·v_{i+1}), or two pins i and j>i+1 as a 'split' once all pins strictly between them are already knocked down (scoring v_i·v_j), what is the running time of the official dynamic-programming algorithm for computing the maximum possible score? Give the asymptotic running time using O() notation."}
{"id": "algo_PS8_b", "question": "In Problem Set 8, Problem 8-2 (Splits Bowling), the official solution categorizes the requested running time of its dynamic-programming algorithm as one of: polynomial, pseudopolynomial, or exponential in the size of the input. Which category is it?"}
{"id": "algo_p01", "question": "How many students enrolled in 6.006 in Spring 2020?"}
{"id": "algo_p02", "question": "What is the name of the head teaching assistant for 6.006?"}
{"id": "algo_p03", "question": "What minimum grade does a student need to pass 6.006?"}
{"id": "algo_p04", "question": "On what calendar date is the 6.006 Spring 2020 final exam scheduled?"}
{"id": "algo_p05", "question": "How many minutes long is the final exam for 6.006?"}
{"id": "algo_p06", "question": "What is the office location (building and room) of Professor Erik Demaine?"}
{"id": "algo_p07", "question": "What is the worst-case time complexity of the Fast Fourier Transform (FFT)?"}
{"id": "algo_p08", "question": "What is the worst-case time complexity of quicksort?"}
{"id": "algo_p09", "question": "What is the asymptotic time complexity of Karatsuba's integer multiplication algorithm?"}
{"id": "algo_p10", "question": "In which year was Dijkstra's shortest-path algorithm originally published?"}
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 implementationStars: 323kUpdated Claude CodeCodexVerifiedInstall
requesting-code-reviewobra/superpowersUse when completing tasks, implementing major features, or before merging to verify work meets requirementsStars: 323kUpdated Claude CodeCodexVerifiedInstall
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 fallbackStars: 323kUpdated Claude CodeCodexVerifiedInstall
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 alwaysStars: 323kUpdated Claude CodeCodexVerifiedInstall