大学课程

Bright university whiteboard scene in a sunny classroom. A cheerful illustrated state-diagram fills the whiteboard showing colorful circles labeled q0, q1, q2 connected by clean directed arrows with input labels "0" and "1". A double-circle marks the accept state. Below the diagram, the neat label "DFA" appears. A student points enthusiastically at the transition arrows, textbooks and a laptop open on a well-lit desk nearby, everything rendered in clear, optimistic colors against a white background.

A bright university whiteboard filled with a clean complexity ladder diagram. Colorful horizontal bands stack upward labeled P, NP, PSPACE, EXPTIME in bold distinct colors — blue, green, orange, red. A cheerful illustrated professor points to arrows showing strict containment between levels. Small clock icons mark Time Hierarchy and storage cylinder icons mark Space Hierarchy. Sunlit classroom, neat chalk annotations showing f(n) ⊊ g(n) relationships, clear daylight atmosphere.

A bright university lab setting with large windows letting in natural daylight. A whiteboard displays a clean dynamic programming grid matrix with letters "ACGT" along the axes and highlighted diagonal alignment path in teal. Nearby, a 3D protein ribbon structure model sits on a desk beside an open laptop showing a colorful DNA double helix. Labeled arrows read "gap penalty," "match score," connecting the algorithm grid to a stylized sequence alignment result below.

A bright, sunlit computer science classroom with a large whiteboard displaying a colorful Conway's Game of Life grid — white cells and vivid teal alive cells forming a recognizable glider pattern mid-motion. Cheerful arrows show the glider shifting one step right-downward across three time steps labeled t=0, t=1, t=2. A friendly professor points enthusiastically at the evolving pattern, with small rule diagrams nearby showing neighbor-count boxes labeled "Live" and "Die."

A bright university whiteboard classroom bathed in natural window light. A professor's hand sketches a clean graph on the whiteboard: labeled vertices V1–V6 connected by bold edges forming a network. Nearby, smaller diagrams show a decision tree and a state-transition diagram with arrows. A desk holds open textbooks annotated "NP-Hard" and "O(log n)". Color-coded sticky notes label subgraphs "connectivity," "clique," and "path." Chalk dust floats in warm afternoon sunlight.

Bright university lecture hall with large sunlit windows. A cheerful professor points to a clean whiteboard displaying a colorful nested-oval diagram: innermost oval labeled **P** (yellow), surrounded by **NP** (orange), then **PSPACE** (green), then **EXPTIME** (blue), each progressively larger. A vertical arrow beside it reads "More Resources →". Students at desks sketch notes, looking engaged and curious under warm daylight.

A bright university whiteboard in a sunny classroom displays a clean Büchi automaton diagram: circular states labeled q₀, q₁, q₂ connected by curved arrows with alphabet symbols, one state circled twice indicating an acceptance condition. A cheerful professor gestures toward an infinity symbol (ω) beside the diagram. Colorful chalk annotations show an infinite word "abaab…→∞" streaming rightward. Books labeled "Formal Languages" sit stacked on a well-lit desk nearby.

A bright university whiteboard scene in a sunlit classroom. A clean diagram shows three labeled boxes — "FPT," "W[1]," "W[2]" — connected by arrows in a crisp complexity hierarchy. Beside it, a colorful graph with highlighted nodes illustrates a short path parameterized by k=3. A student points enthusiastically at a shrinking problem kernel, depicted as a large node cluster compressing into a small tidy circle labeled "kernel." Formula f(k)·n^c glows in blue marker.

A bright university lecture hall scene bathed in warm daylight. A large whiteboard displays the RSA formula: "e·d ≡ 1 (mod φ(n))" with arrows connecting labeled boxes: "Public Key (e,n)" and "Private Key (d)". A giant padlock splits into two puzzle pieces labeled "Easy to Multiply" and "Hard to Factor." Two large primes "p×q=n" appear beside a cracked brick wall representing computational difficulty. Clean blues, yellows, and greens throughout.

Bright university whiteboard classroom bathed in morning sunlight. A cheerful professor points to a clean whiteboard showing three color-coded columns: "DFA/NFA" (blue finite automaton diagram with states and arrows), "↔" (bold black), and "Regex" (green expressions: `ε`, `a|b`, `ab*`). Curved arrows connect automaton states to matching regex patterns. Students at desks look engaged. Labels read "Kleene's Theorem" at top, "Concatenation · Union | · Star *" below.

A bright, sunlit computer science classroom with two large whiteboards side by side. The left whiteboard shows "LL Parsing" with a tree growing downward from a root node labeled "S," arrows pointing top-to-bottom in cheerful blue. The right shows "LR Parsing" with a tree built upward from leaves in warm orange. A smiling student stands between them holding a tokenized string "a+b*c," with colorful stack and input-buffer diagrams floating nearby.

Bright university study space bathed in warm afternoon sunlight. A large whiteboard displays an interconnected web of polynomial equations—x²+y=3, xy²−z=1—with colored arrows linking shared variables, forming a glowing network diagram. Curved solution surfaces intersect elegantly in a 3D sketch nearby. Complexity class labels NP, P sit in cheerful colored bubbles. Students gesture enthusiastically at the board, markers in hand, surrounded by open textbooks and coffee cups.

Bright university lecture hall with large whiteboards showing a clean diagram: a Venn-style complexity chart labeling "P ⊆ BQP" with cheerful colored regions in sky-blue and sunny yellow. A confident student at a glowing (well-lit) quantum circuit board marks "√N vs N" speedup comparison. Floating quantum spheres labeled "|0⟩" and "|1⟩" orbit above a magnifying glass highlighting one item in a grid of 16 squares — Grover's search visualized clearly.

A bright university lecture hall scene bathed in warm daylight. A large whiteboard displays a bold number like **561 = 3 × 11 × 17** with branching factor trees in clean blue marker. Nearby, a timeline arrow labeled **P → AKS** shows algorithmic progression. A focused student examines a number line with circled primes: **2, 3, 5, 7, 11, 13**. Colored complexity bubbles labeled **P**, **NP**, **BPP** float nearby on cream background.

A bright university lecture hall bathed in warm afternoon light. A confident instructor points to a large clean whiteboard showing a flowchart: a padlock icon connected by arrows to labeled boxes reading "Integer Factorization," "Discrete Log," and "P vs NP?" Color-coded complexity tiers — green for polynomial-time, red for hard problems — illustrate security boundaries. Students lean forward engaged, laptops open, notebooks filled with clean diagrams. Sunlit windows frame the optimistic academic atmosphere.

A bright university lecture hall, sunlit through tall windows. A large whiteboard displays two labeled boxes — "Problem A" and "Problem B" — connected by a bold curved arrow labeled "Poly-time Reduction f(x)." A confident professor points to a clean complexity diagram showing nested circles labeled "P," "NP," and "NP-Complete." Color-coded transformation steps using geometric shapes illustrate input mapping. Students take notes, engaged and curious.

A bright, sunlit computer science classroom with a large whiteboard showing a clean network diagram: five labeled nodes (N1–N5) connected by colorful arrows representing message passing. A cheerful student at a standing desk sketches a Raft consensus timeline with leader election steps labeled. Sticky notes mark "log replication" and "majority quorum." Warm golden light fills the room, bookshelves visible behind. Small complexity notation "O(log n)" appears neatly on the whiteboard corner.

A bright university classroom setting with a large whiteboard showing two key diagrams side by side: a simplified Turing machine tape with read/write head on the left, and a diagonal matrix grid with checkmarks and X marks illustrating Cantor's diagonalization argument on the right. A student points enthusiastically at the board where "HALTS?" with a bold question mark connects both diagrams, while sunlight streams through tall windows illuminating stacked textbooks and a laptop displaying looping pseudocode.

A bright university whiteboard filled with two clean automaton diagrams side by side, labeled "NFA" and "DFA," connected by a bold arrow marked "Subset Construction." Circular states with arrows show transitions: the NFA has branching dashed paths and ε labels, while the DFA shows single clean solid arrows between states. Color-coded state bubbles — blue, orange, green — on a crisp white background with warm sunlight streaming through a classroom window.

A bright university whiteboard classroom bathed in warm sunlight. A large, clean diagram shows a Boolean circuit: labeled input nodes x₁, x₂, x₃ feeding into cheerful rounded AND, OR, and NOT gates in blue, orange, and green, connected by clean wire paths to an output node. Annotations mark "size = 7 gates" and "depth = 3" in bold. A sticky note reads "P/poly" beside a polynomial curve sketch.

Bright university whiteboard in a sunlit classroom, showing a clean Petri net diagram with labeled circles (places P1–P4) containing bold black dots as tokens, connected by directed arrows to filled rectangles (transitions T1–T2). A cheerful illustrated Carl Petri figure points enthusiastically at the diagram. Color-coded arcs in teal and orange highlight token flow paths, with the formal tuple notation "(P, T, F, W, M₀)" written neatly below in crisp marker lettering.

Bright university physics lab, sunlit with large windows. A cheerful illustrated diagram dominates a whiteboard: two glowing spheres labeled **|0⟩** and **|1⟩** merge into one spinning Bloch sphere showing superposition. Nearby, two connected coins mid-flip illustrate entanglement with a bold **"=" ** linking their states. A student points excitedly at a simple circuit diagram comparing classical bits versus qubits, colorful arrows showing parallel probability paths branching outward.

Bright university lecture hall bathed in warm sunlight. A large whiteboard displays a clean circuit diagram labeled "Shor's Algorithm" with quantum gates marked H (Hadamard), QFT, and measurement symbols. A enthusiastic professor points to the factored equation "15 = 3 × 5" with probability peaks shown on a colorful bar graph. Quantum circuit lines branch into parallel paths illustrating superposition. A textbook labeled "RSA & Quantum Cryptography" sits open nearby. Students lean forward engaged, laptops open, coffee cups on desks.

A bright university whiteboard scene showing the Chomsky Hierarchy as a clean nested diagram of four colorful concentric ovals labeled "Regular," "Context-Free," "Context-Sensitive," and "Recursively Enumerable" from innermost to outermost. A friendly illustrated linear bounded automaton tape with bracket markers sits nearby. Sunlit classroom, crisp blues and yellows, clear daylight through windows, students' open notebooks visible at desk edges.

Bright university classroom setting with a large whiteboard bathed in warm daylight. Three parallel horizontal tape strips are drawn side by side, each with distinct colored read/write heads — red, blue, green — sliding independently along cells containing symbols. Arrows show simultaneous head movements. A cheerful diagram labels "Multi-tape TM," "Non-deterministic TM," and "Quantum TM" in bold, with equivalence arrows connecting them. Clean, optimistic, textbook-style illustration with crisp lines and sky-blue accents.

Bright university study space with large windows and warm daylight. A whiteboard displays the formula **K(x) ≤ |p| + c** alongside a compression diagram: a long binary string "01101001110..." shrinking through an arrow into a compact block labeled "shortest program." A friendly robot feeds strings into a funnel; Shannon entropy equation **H = -Σp log p** floats nearby. Color-coded LZ compression blocks stack like colorful bricks, showing redundant patterns highlighted in yellow collapsing into smaller chunks.

A bright, sunlit biology-meets-computer-science classroom illustration showing a cheerful cross-section diagram of nested colorful membranes like Russian dolls — outermost membrane in warm yellow, inner membranes in coral, mint green, and sky blue. Friendly labeled compartments contain small symbolic objects: letters, dots, arrows showing transformation rules. Clean white background with soft shadows. Bold labels read "P System" and small rule notations like "a→b" float neatly inside each membrane region.

Two researchers stand at a large sunlit whiteboard in a bright university lab, one pointing to a diagram showing a "VERIFIER" figure and a "PROVER" figure connected by labeled arrows reading "query" and "response." Between them floats a simplified arithmetic circuit with labeled gates. Surrounding equations include "IP = PSPACE" and checkmarks confirming proof steps. Clean blue-and-white color palette, warm daylight through tall windows.

A bright university whiteboard filled with a clean complexity class diagram showing overlapping circles labeled "P," "BPP," and "RP" in bold colors. A cheerful professor tosses colorful six-sided dice toward a flowchart showing "YES/NO" outputs with small percentage labels like "≥2/3 correct." Sunlit classroom, students watching eagerly, arrows connecting randomized decision paths, small coin-flip icons scattered throughout the organized diagram.

A bright university lecture hall with large whiteboards showing a clean Venn diagram: a big circle labeled "PSPACE" containing smaller nested circles "NP" and "P" in warm yellow, blue, and green. A cheerful professor points to a QBF formula "∀x∃y(x∨y)" written clearly beside a stylized Turing Machine diagram with labeled tape squares showing polynomial space usage. Sunlight streams through tall windows illuminating the colorful diagram.

A bright university whiteboard filled with a clean Venn diagram: a large circle labeled "NP" containing a smaller circle labeled "P" — both in bold, cheerful colors. A student sketches a graph with highlighted shortest-path arrows (labeled "Dijkstra's") inside the P circle, while another writes "SAT: (x∨y)∧(¬x∨z)" in the NP region. A glowing question mark sits at the boundary with "P=NP?" Sunlit classroom, clean lines, optimistic energy.

A bright, sunlit network diagram spread across a large whiteboard in a modern classroom. Colorful nodes (labeled A, B, C, D) connect via bold paths with annotated weights (3, 7, 2, 5). A highlighted shortest path glows yellow between two nodes. Small formula boxes show "d(v) = min" nearby. Routers illustrated as friendly geometric shapes sit at key intersections, with arrows indicating optimized data flow across the clean white background.

Bright university whiteboard classroom bathed in warm daylight. A large Venn diagram drawn in clean marker shows two labeled regions: "DECIDABLE" (green, containing small icons of arithmetic equations and neat checkmarks) and "UNDECIDABLE" (red, containing a looping arrow symbol representing the Halting Problem). A friendly illustrated Turing Machine tape runs across the bottom with binary symbols. Sunlit, clean, optimistic academic setting with crisp bold labels.

A bright university whiteboard scene in a sunlit classroom. Two cartoon figures face each other across a clean desk: a "VERIFIER" (holding a checklist) and a "PROVER" (wearing a graduation cap). Bold arrows labeled "QUERY?" and "ANSWER!" bounce between them. A colorful complexity ladder on the board shows stacked boxes: P → NP → IP → MIP with cheerful connecting arrows. Dice nearby represent probabilistic choices. Blue sky visible through the window.

A bright university whiteboard scene flooded with warm daylight. A confident student sketches a classic Turing machine diagram with tape and head, then draws an arrow pointing to a glowing golden "Oracle" box hovering above it, labeled "ORACLE." Surrounding the board: colorful nested circles representing computational hierarchies, with labels "Turing," "Hypercomputation," and a question mark bubble. Clean chalk-style illustrations on crisp white background, energetic and curious atmosphere.

Bright university whiteboard scene in a sunlit classroom. A friendly robot labeled "PDA" stands at center with a transparent cylindrical stack beside it showing stacked colored tokens (a, b, $). An input tape feeds symbols left-to-right into the robot. A clean diagram shows the 7-tuple components labeled: Q (state bubbles), Σ (input tape), Γ (stack symbols), δ (transition arrows), q₀, Z, F — all in bold cheerful colors on white background.

Bright university whiteboard classroom flooded with afternoon sunlight. A large illustrated Chomsky hierarchy pyramid dominates the board, labeled "Regular → Context-Free → Context-Sensitive → Unrestricted" in clean colored tiers. A cheerful student points to a finite state machine diagram with labeled nodes and arrows spelling parsed English words. Nearby, probability values annotate parse tree branches. Books, colorful sticky notes, and a laptop showing grammar diagrams surround the energetic scene.

A bright university whiteboard lab scene bathed in warm daylight. A large whiteboard displays a clean logical formula "P∧Q→R" with a branching decision tree beneath it, nodes labeled "SAT / UNSAT." A friendly robot mascot sits at a glowing monitor showing a colorful DPLL search tree with green "✓" and red "✗" branches. Sticky notes read "CDCL," "SMT," and "clause learning." Books and coffee cups surround an enthusiastic student pointing triumphantly at a solved satisfiability proof.

Bright university lecture hall bathed in warm daylight, large whiteboard displaying a clean Venn diagram showing overlapping complexity classes labeled "P," "BQP," and "NP" in bold colorful marker. A cheerful professor gestures toward quantum circuit diagrams showing Shor's and Grover's algorithms as simple flowcharts. Glowing teal qubits illustrated as friendly interconnected spheres float beside classical binary bits, visually demonstrating superposition and entanglement through colorful curved arrows on a crisp white background.

Bright university classroom setting, large whiteboard showing a clean CFG parse tree for a simple arithmetic expression. The tree root labeled **S** branches into non-terminals **E**, **+**, **E**, which further split into terminals like **3**, **×**, **5**. Nearby, a 4-tuple notation reads **(V, Σ, R, S)** with color-coded boxes distinguishing terminals (blue) from non-terminals (orange). Sunlight streams through windows, open textbooks and laptops visible on desks.

A bright, sunlit university study room where two students sit across a clean white table. One student (the "Prover") holds a colorful sealed envelope labeled "SECRET," confidently gesturing. The other student (the "Verifier") examines a glowing green checkmark card labeled "TRUE ✓" with an impressed expression. Between them, a transparent barrier shows only "VALID" passing through — no secret leaks. A cheerful diagram on the wall shows: Prover → Statement → Verifier, with a padlock icon and "Zero Knowledge" label in bold teal letters.

A bright university lecture hall bathed in afternoon sunlight, whiteboard filled with a clean diagram showing a proof certificate tape labeled "NP Proof" being spot-checked by a magnifying glass hovering over just three highlighted random bits. Nearby, a colorful flowchart connects "PCP Theorem" to "Inapproximability" with bold arrows. A confident student points to the board while colleagues take notes, books open, sunlight streaming through tall windows.

A bright university lecture hall with large sunny windows. A clean whiteboard displays two side-by-side diagrams: a single-arrow "Deterministic TM" path versus a branching tree of arrows labeled "NDTM" with multiple transitions per node. A cheerful professor points to the branching tree. Color-coded state bubbles (q0, q1, q2) connected by labeled arrows show symbol-transition pairs. Warm daylight fills the room.

A bright university lecture room with large windows letting in morning sunlight. A cheerful whiteboard displays a clean branching computation tree: a root node labeled "START" splits into two paths, each splitting again, forming a neat tree with leaf nodes marked "ACCEPT" or "REJECT" in green and red. A small label reads "NTIME(n)" beside an arrow indicating tree depth. Colored chalk highlights each level of branching, showing exponential growth visually.

A bright university whiteboard filled with clean diagrams shows a smiling robot student analyzing a PAC learning curve graph, with labeled axes "Time" and "Accuracy" in bold colors. Surrounding the board: neat O(n²) and ε/δ notation boxes, a glowing green "feasibility zone" shaded region, and colorful arrows showing computational bounds shrinking toward optimal. Sunlit classroom, tidy desks, optimistic blue-and-yellow palette throughout.

A bright, sunlit university lab with two workstations connected by a glowing fiber-optic line. On the left monitor, a clean diagram shows a qubit as a sphere (Bloch sphere) with labeled axes. Between the stations, illustrated photons travel as small colored arrows in horizontal/vertical and diagonal orientations representing BB84 polarization states. A chalkboard behind clearly labels "BB84," "⊕ basis," "⊗ basis," and a simple eavesdropper detection alert icon with a red "?" — cheerful, optimistic, airy white walls.

A bright, sunlit university lab with large windows. A researcher stands at a glowing whiteboard sketching an ACT-R architecture diagram: labeled modules ("Perception," "Memory," "Decision") connected by clean arrows forming a flowchart. Nearby, a monitor displays a neural network diagram with nodes and weighted edges. Open textbooks labeled "Psychology," "Neuroscience," and "CS" fan out on a tidy desk. Warm amber daylight fills the modern space, conveying collaborative, optimistic scientific inquiry.

Bright university seminar room with large windows letting in sunlight. A clean whiteboard displays a colorful 2×2 payoff matrix labeled "Player A / Player B" with bold numbers and circled Nash Equilibrium entries. Three students cluster around a glowing laptop showing a network graph with nodes labeled "Strategy 1," "Strategy 2." A complexity diagram connects boxes reading "PPAD" and "Nash Equilibrium" with arrows. Textbooks and coffee cups scattered on a light oak table.

Two students at a bright sunlit whiteboard in a modern university classroom. One student (the "Prover") enthusiastically writes a proof while the other (the "Verifier") randomly spot-checks three highlighted lines using a die and magnifying glass. Speech bubbles show a back-and-forth dialogue exchange. A clean diagram labels "IP = PSPACE" with arrows connecting boxes labeled "Prover," "Verifier," and "Random Queries." Warm afternoon light floods through large windows.

A bright university lecture setting with a large whiteboard showing a clean graph: a horizontal axis labeled "ε (accuracy)" and a vertical axis labeled "Runtime," with a smooth curve swooping down as ε increases, labeled "PTAS." Alongside, a colorful knapsack overflowing with labeled items (weights and values) sits on a sunny desk. Two student figures compare solution bars: one marked "Optimal," another nearly identical marked "≤(1+ε)·OPT," highlighting the tight approximation gap visually.

A bright university whiteboard scene bathed in warm daylight. A tall parse tree diagram dominates the center, drawn with clean colorful lines, showing a looping branch highlighted in orange with arrows indicating the "pumped" repeated section. Labeled string segments "u v x y z" sit beneath the tree in distinct colors. Nearby, a cheerful Venn diagram shows CFL closure: green checkmarks beside "Union," "Concatenation," "Kleene★" and red X marks beside "Intersection," "Complement."

Bright university lecture hall bathed in warm daylight, a large whiteboard displaying a clean state-transition diagram with labeled nodes (S0, S1, S2) connected by directed arrows, alongside a simple temporal logic formula "□(p→◇q)". A focused student traces the graph with a pencil while a professor points enthusiastically at a checkmark confirming a verified property. Colorful sticky notes mark "MODEL CHECKING," "THEOREM PROVING," textbooks open nearby on a sunlit desk.

Bright university lecture hall bathed in warm daylight. A large whiteboard displays a clean Venn diagram: nested oval labeled "BPP" sitting inside a larger oval labeled "BQP," both inside "PSPACE." A cheerful professor points to the diagram while quantum circuit diagrams with qubits and gate symbols float nearby. Color-coded complexity rings—yellow, sky-blue, coral—overlap clearly. Students at desks take notes, laptop screens glowing with circuit visualizations in a sunny, optimistic atmosphere.

Bright university whiteboard scene in a sunlit classroom. A professor's hand draws two side-by-side diagrams: left side shows a colorful NFA with states q0, q1, q2 connected by overlapping arrows labeled 'a' and 'b' branching into multiple paths. Right side shows the resulting DFA with subset states labeled {q0}, {q1,q2}, {q0,q2} in clean circles connected by single arrows. A bold arrow labeled "Powerset Construction" bridges both diagrams.

Bright university lab setting, afternoon sunlight streaming through tall windows. A student at a whiteboard draws a clean finite-state diagram: labeled circles connected by arrows showing system states, with small checkmarks confirming valid transitions. A laptop displays a colorful state-space tree with green verified nodes. Sticky notes show temporal logic formulas like "AG(safe)" and "EF(done)". Books and coffee cup nearby. Cheerful, organized, optimistic atmosphere.

A bright university whiteboard in a sunlit classroom displays a smooth 3D surface curve with a clearly labeled constraint curve intersecting it, highlighted in vivid orange. A cheerful student points to the optimal point where the objective function tangentially meets the constraint, labeled "max f(x,y)." Nearby, clean annotations show "∇f = λ∇g" and "KKT conditions." Color-coded arrows indicate feasible regions in blue and gradient directions in yellow against the crisp white background.

A bright, sunlit operations control room with large whiteboards showing a clean job-shop scheduling grid: colored horizontal bars labeled "Job 1," "Job 2," "Job 3" across time slots "T1–T6." Three cheerful students in casual attire point to the chart, one marking an optimal solution path in green. Nearby, a desk shows a laptop with a bar graph comparing "Exact vs. Approximation" runtimes. Post-it notes cluster around constraint boxes. Warm daylight streams through tall windows.