Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion docs/autopilot.md
Original file line number Diff line number Diff line change
Expand Up @@ -61,7 +61,8 @@ The owner's priority since 2026-11-03: proper exam practice. The design, decisio
- 4c is done for every course except Logic Design and Computer Architecture (inline practice, owner's decision pending), Algorithm Design (owner's) and Advanced Software Engineering (its authors').
- [ ] 4d. Set `lesson`/`section` on the migrated quiz questions. Counted 2026-11-19: 262 untagged in 9 courses.
- [x] Computer Organization 10, Microprocessors 10, Computer Architecture 6, Computer Networks 27, Data Structures 28: 81 tagged. (PR #104, stacked on #102)
- [ ] Still untagged: Computational Mathematics 83, Discrete Mathematics 42, Logic Design 40, Algorithm Design 16.
- [x] Discrete Mathematics 42, Logic Design 40, Algorithm Design 16: 98 tagged (5 with `lesson` only, where no single heading teaches the idea). (PR #105, stacked on #104)
- [ ] Still untagged: Computational Mathematics 83.
- [ ] 5. Generated questions (subnets, scheduling, Big-O first).
- [ ] 6. Account sync for review cards and exam attempts.

Expand Down Expand Up @@ -96,6 +97,7 @@ Nothing. The exam-stack block (since 2026-11-06, over #68's inline practice ques

Newest first. One line per run: date and run, what was done, PR link, merged or open.

- 2026-11-19 10:40 (run B): exam phase 4d, second batch: tagged 98 quiz questions in Discrete Mathematics, Logic Design and Algorithm Design with the lesson and section that teach each (lesson only for 5 where no one heading does). Algorithm Design is the owner's course: only tags were added, no wording changed. Left: Computational Mathematics' 83. PR #105, open, stacked on #104.
- 2026-11-19 06:10 (run A): exam phase 4d started. Tagged 81 migrated quiz questions in five courses with the lesson (and, where one heading teaches it, the section) that teaches each, checked against the lesson text. The bank test confirms every lesson and heading exists. PR #104, open, stacked on #102.
- 2026-11-18 10:40 (run B): exam phase 4c, the last two courses: Data Structures +20 and Computer Networks +9, numbers checked by script (g[2][1] at 1036, 31 copies for 17 doubling appends, ring back at index 1, heap parent of 9 is 4, 10 ms over 2,000 km, cwnd 16 after 4 slow-start round trips). Next exam phase: 4d, tagging the 259 migrated quiz questions with `lesson` and `section`. PR #102, open, stacked on #101.
- 2026-11-18 06:10 (run A): the owner merged everything on 2026-11-17 (the exam stack #90 to #96, #86, #92, #99, #100), so this phase branches from main again. Exam phase 4c, Discrete Mathematics: +26 questions over all 17 taught lessons (precedence, vacuous truth, contrapositive vs converse, nested quantifiers, composition order, partial orders, proof setups, the base case, strong induction, invariant checks, sum and product rules, binomial and Pascal, pigeonhole, K₇, Euler vs Hamiltonian, tree height, expectation, birthday pairs), numbers checked by script. PR #101, open.
Expand Down
30 changes: 30 additions & 0 deletions src/content/algorithm-design-and-analysis/questions.ts
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q1",
quiz: "sorting-quiz",
lesson: "selection-and-bubble-sort",
section: "selection-sort-find-the-smallest-put-it-first",
prompt: "You run Selection Sort on [4, 1, 3, 2]. What does the array look like after the first pass completes?",
options: [
{ id: "a", text: "[1, 4, 3, 2]" },
Expand All @@ -20,6 +22,7 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q2",
quiz: "sorting-quiz",
lesson: "selection-and-bubble-sort",
prompt: "What is the best-case time complexity of Bubble Sort when implemented with an early-exit 'swapped' flag?",
options: [
{ id: "a", text: "O(n)" },
Expand All @@ -33,6 +36,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q3",
quiz: "sorting-quiz",
lesson: "insertion-sort",
section: "why-its-the-best-of-the-simple-sorts",
prompt: "Your data is almost sorted: each element is at most a few positions away from its sorted spot. Which simple quadratic sort completes in nearly O(n) linear time?",
options: [
{ id: "a", text: "Insertion sort, because each element only shifts a few positions" },
Expand All @@ -46,6 +51,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q4",
quiz: "sorting-quiz",
lesson: "selection-and-bubble-sort",
section: "stability",
prompt: "Which of the following sorting algorithms is NOT stable?",
options: [
{ id: "a", text: "Selection sort" },
Expand All @@ -59,6 +66,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q5",
quiz: "sorting-quiz",
lesson: "merge-sort",
section: "divide-and-conquer",
prompt: "Which two sorting algorithms use the divide and conquer paradigm?",
options: [
{ id: "a", text: "Merge sort and Quick sort" },
Expand All @@ -72,6 +81,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q6",
quiz: "sorting-quiz",
lesson: "merge-sort",
section: "merge-sort-in-one-paragraph",
prompt: "Unlike Selection, Bubble, and Insertion sort, standard array-based Merge Sort is NOT in-place. What is its auxiliary space complexity?",
options: [
{ id: "a", text: "O(n), because temporary arrays must be allocated to hold elements during merging" },
Expand All @@ -85,6 +96,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q7",
quiz: "sorting-quiz",
lesson: "quick-sort",
section: "analysis-it-depends-on-the-pivot",
prompt: "Quick sort selects the first element as the pivot. Why does it degrade to O(n²) time on an array that is already sorted?",
options: [
{ id: "a", text: "The pivot is always the smallest remaining element, leaving unbalanced splits of 0 and n − 1 elements at each level" },
Expand All @@ -98,6 +111,7 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/sorting-quiz/q8",
quiz: "sorting-quiz",
lesson: "insertion-sort",
prompt: "Which of the following sorting algorithms sorts entirely in place with O(1) auxiliary data memory while also achieving O(n) best-case performance on already sorted input?",
options: [
{ id: "a", text: "Insertion sort" },
Expand All @@ -111,6 +125,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q1",
quiz: "final-quiz",
lesson: "linear-and-binary-search",
section: "binary-search-throw-away-half",
prompt: "What does binary search require that linear search doesn't?",
options: [
{ id: "a", text: "The array must have no duplicates" },
Expand All @@ -124,6 +140,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q2",
quiz: "final-quiz",
lesson: "linear-and-binary-search",
section: "binary-search-throw-away-half",
prompt: "Roughly how many comparisons does binary search need, in the worst case, on a sorted array of 1,000,000 elements?",
options: [
{ id: "a", text: "About 20" },
Expand All @@ -137,6 +155,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q3",
quiz: "final-quiz",
lesson: "euclid-gcd",
section: "euclids-idea",
prompt: "Using Euclid's algorithm, what is gcd(60, 24)?",
options: [
{ id: "a", text: "6" },
Expand All @@ -150,6 +170,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q4",
quiz: "final-quiz",
lesson: "bfs-and-dfs",
section: "breadth-first-search-ripples-in-a-pond",
prompt: "Which data structure does breadth-first search (BFS) use to decide what to visit next?",
options: [
{ id: "a", text: "A stack" },
Expand All @@ -163,6 +185,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q5",
quiz: "final-quiz",
lesson: "bfs-and-dfs",
section: "analysis",
prompt: "What is the time complexity of BFS and DFS on a graph stored as an adjacency list?",
options: [
{ id: "a", text: "O(V)" },
Expand All @@ -176,6 +200,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q6",
quiz: "final-quiz",
lesson: "greedy-and-mst",
section: "the-greedy-approach",
prompt: "Each choice a greedy algorithm makes must be feasible, locally optimal, and…",
options: [
{ id: "a", text: "Reversible" },
Expand All @@ -189,6 +215,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q7",
quiz: "final-quiz",
lesson: "greedy-and-mst",
section: "kruskals-algorithm-join-the-forest",
prompt: "In Kruskal's algorithm, what happens to the next cheapest edge if both of its ends are already in the same tree?",
options: [
{ id: "a", text: "It is rejected, because it would create a cycle" },
Expand All @@ -202,6 +230,8 @@ export const questions: Question[] = [
{
id: "algorithm-design-and-analysis/final-quiz/q8",
quiz: "final-quiz",
lesson: "dynamic-programming",
section: "breaking-it-into-subproblems",
prompt: "In the 0/1 knapsack table, item i (weight wᵢ, value vᵢ) fits in capacity w. What is V[i, w]?",
options: [
{ id: "a", text: "V[i−1, w] + vᵢ" },
Expand Down
Loading
Loading