大学课程

A bright university computer lab with large windows letting in warm daylight. A whiteboard displays a clean relational diagram with labeled tables connected by JOIN arrows, alongside a small formula: σ(R⋈S). A cheerful student points to a query optimization flowchart showing nested boxes simplifying step by step. Stacked database cylinders in blue and yellow sit on a desk, with efficiency graphs trending upward. Everything is crisp, colorful, and energetic.

A bright university whiteboard scene showing a clean optimization landscape diagram. A cheerful route map connects city dots labeled A, B, C, D with a highlighted near-optimal path versus the true optimal path, with a clear ratio box showing "OPT × 1.5 ≥ APX" in bold. A nested Venn diagram on the right shows APX sitting inside NPO, outside P, with colorful labels. Sunlit classroom, crisp blues and yellows throughout.

A bright university computer science classroom with sunlit whiteboards. A confident student sketches a clean complexity hierarchy diagram showing nested boxes labeled "P ⊆ NP ⊆ PSPACE" in bold marker. A Turing machine tape stretches horizontally across the board with polynomial space cells highlighted in teal. Chess pieces and logic gate symbols represent game-theoretic PSPACE problems. A QBF formula "∀x∃y(x∨y)" anchors the corner in crisp chalk lettering.

A bright, sunlit university lab with white walls and large windows. A transparent layered diagram floats center-stage showing a clean neural network with labeled tiers: "Input → Hidden Layers → Output," connected by colorful arcs in blue, orange, and green. A cheerful robot figure points to the diagram while gears, brain icons, and small algorithm flowcharts surround it. Bold annotations read "ANN," "Deep Learning," and "Cognition" on crisp white labels against a warm cream background.

A sunlit university whiteboard filled with a clean Boolean circuit diagram: AND, OR, NOT gates connected by bright lines flowing left to right, inputs labeled x₁ x₂ x₃ feeding into layered gates, outputs labeled 0/1. A cheerful student points to a highlighted path labeled "depth=4, size=7." A sticky note reads "P vs NP?" beside a small polynomial curve sketch. Colored markers in red, blue, green accent different circuit layers. Bright classroom windows frame the scene.

A bright university-style whiteboard scene flooded with warm daylight. A cheerful robot labeled "PDA" stands at center, holding a tall transparent stack tower filled with colorful grammar symbols (A, B, S). Curved arrows connect three clean state bubbles (q0→q1→q2) overhead. To the left, a context-free grammar reads "S→aSb|ε"; to the right, a neatly parsed bracket tree glows in sunshine yellow. Clean, optimistic, academic.

Bright university study space with warm afternoon sunlight. A large illustrated diagram of a Turing Machine sits center-frame: an infinite white tape stretching horizontally with bold black symbols (0, 1, B), a friendly mechanical read/write head hovering over cell "q2", and a clean state-transition table labeled with arrows. Nearby, an open textbook shows Alan Turing's portrait. Scattered pencils, coffee cup, and cheerful sticky notes complete the scene.

A bright university mathematics lab with large sunlit windows. A whiteboard displays a clean circuit diagram with logic gates arranged symmetrically, alongside a small labeled group table and a polynomial expression "f(x)=xⁿ-1" with colorful symmetry arrows showing rotational equivalences. A student enthusiastically points to connecting lines between the circuit and the group structure, while color-coded node clusters highlight equivalent circuit paths under symmetric transformation.

A bright university whiteboard filled with clean mathematical notation shows three labeled columns: "Initial Functions," "Primitive Recursion," and "Minimization," connected by upward arrows forming a pyramid toward "Partial Recursive Functions" at the top. A young professor sketches the Kleene hierarchy as nested ovals labeled Σ⁰₁, Π⁰₁, Δ⁰₁ on a sunny chalk-lit board. Open textbooks and coffee cups rest on desks below in a warmly lit lecture hall.

A bright, sunlit university research lab with large windows and white walls. Three interconnected glowing circuit diagrams float as holographic blueprints above a clean desk, each labeled "QUANTUM," "BIO," and "AI." A researcher sketches converging arrows linking a DNA helix, a quantum gate symbol (H⊗), and a neural network diagram on a whiteboard. Colorful sticky notes and open laptops surround the space, conveying energetic collaborative discovery under warm daylight.

A bright, sunlit university workspace with a large whiteboard showing a clean probabilistic graphical model: labeled nodes "Word₁ → Word₂ → Word₃" connected by arrows above hidden state nodes "Tag₁ → Tag₂ → Tag₃," illustrating an HMM chain. A cheerful student points to the diagram while speech bubbles nearby show "Hello" transforming into tagged output "[Noun][Verb]." Color-coded probability arrows in teal, orange, and yellow connect nodes on a crisp white background.

A bright university whiteboard fills the background, covered in clean diagrams: a flowchart showing a randomized algorithm arrow transforming into a deterministic algorithm arrow, labeled "BPP → P." A student sketches an expander graph — a sparse, colorful network of nodes with bold edges — beside a pseudorandom generator depicted as a small box converting a short seed into a long bitstring. Sunlight streams through a classroom window, illuminating neat complexity class circles and a conditional probability tree in blue and orange marker.

A bright university whiteboard filled with clean diagrams: a colorful graph with highlighted MAX-CUT edges sliced by a bold dashed line, a SET COVER Venn diagram with numbered subsets, and the label "Unique Games Conjecture" underlined in blue. A focused student sketches approximation ratio bounds "≥ 0.878" beside a cheerful sunlit window. Colored arrows connect complexity classes, making abstract hardness tangible and visually organized.

A bright university whiteboard under warm classroom lighting displays two clear columns: "DECIDABLE ✓" with a clean flowchart showing input flowing to YES/NO output, and "UNDECIDABLE ✗" with an infinite loop arrow. A friendly illustrated Alan Turing figure points to a simple program-and-input diagram labeled "Halting Problem?" with a bold red question mark. Colorful arrows show reduction linking problems together, sunlight streaming through classroom windows.

A bright university whiteboard filled with a clean timeline of 12 operations: most labeled "O(1)" in small blue boxes, with one tall orange bar labeled "O(n)" standing out dramatically. Below it, a horizontal green arrow spans the full sequence, labeled "Amortized O(1) per op." A friendly illustrated vector array doubles in size with coins stacking above it, representing total cost. Warm sunlit classroom, crisp lines, optimistic color palette.

A bright, sunlit lecture hall setting where two cartoon scholars face each other across a clean white table. One figure (the "Prover") confidently holds colorful cards labeled **P**, while the other (the "Verifier") holds a magnifying glass and a coin showing **heads/tails**. Between them, a glowing chalkboard displays **IP = PSPACE** with arrows showing back-and-forth message exchanges labeled **"challenge"** and **"response"**, making the interactive verification dance visually clear.

A bright, sunlit university workspace with a large drafting table displaying a clean white poster of a 2D convex hull — scattered blue dots connected by bold orange boundary lines forming a tight polygon. Nearby, colorful sticky notes label "Voronoi Diagram," "Triangulation," and "O(n log n)." A laptop shows a glowing Delaunay triangulation mesh. Geometric rulers, compasses, and a small 3D polyhedron model sit arranged neatly beside textbooks.

A bright university whiteboard fills the background, drawn in clean daylight blues and whites. A confident student sketches a nested diagram of complexity classes: a large outer oval labeled "EXPTIME," containing a medium oval "PSPACE," containing smaller ovals "NP" and "P" nested inside each other. Colored chalk arrows indicate containment relationships. Open textbooks and coffee cups sit nearby on a sunlit wooden desk.

A bright university whiteboard in a sunlit classroom displays two clean overlapping circles labeled "L" and "NL = co-NL" in bold blue and green marker, with a small equals sign connecting "NL" and "co-NL" highlighted in orange — the Immerman-Szelepcsényi theorem. A friendly robot with a tiny memory tape showing "log n" bytes navigates a directed graph drawn in cheerful yellow and teal, illustrating space-efficient path-finding with minimal memory usage.

A bright university study space with warm natural light streaming through large windows. A clean whiteboard displays elegant lambda calculus notation: **λx.x**, **λf.λx.f(x)**, with colorful arrows showing function abstraction and application flow. A cheerful student sketches nested lambda expressions in a notebook beside a laptop. Small labeled diagrams show "VARIABLE," "ABSTRACTION," "APPLICATION" as three distinct colorful building blocks stacking together like architectural components.

Bright university lab, large whiteboard flooded with sunlight. A focused student maps a clean state-transition diagram with labeled nodes (S0→S1→S2) and a red "EXPLOSION?" arrow branching into dozens of tangled paths. Beside it, a tidy symbolic BDD diagram glows in blue marker. Open textbooks labeled "MODEL CHECKING" and sticky notes reading "Clarke," "Emerson," "Sifakis" frame the scene. A laptop displays a green checkmark: "VERIFIED ✓" against a cheerful white interface.

Bright university lecture hall bathed in afternoon sunlight, large whiteboard displaying a clean circuit diagram with layered AND/OR/NOT gates arranged in neat horizontal tiers. A focused student sketches a decision tree beside a labeled comparison-based sorting diagram showing "Ω(n log n)" threshold line in bold. Colored complexity bars chart minimum resource costs with arrows indicating lower bound floors. Open textbooks, pencils, and coffee cups rest on well-lit desks nearby.

A bright university whiteboard fills the scene under warm overhead lighting. A professor's hand draws two overlapping circles labeled "P" and "NP" in bold blue marker, with "NP-Complete" marked at the boundary zone in red. Surrounding the diagram, colorful sticky notes show iconic problems: a tiny maze (Hamiltonian path), interlocking puzzle pieces (SAT), and a small knapsack. A clean Venn-style layout with arrows showing polynomial-time reductions connects problems across the crisp white board.

A bright university lab setting with a large whiteboard displaying a clean flowchart: "Selection → Crossover → Mutation → New Generation" with small arrow loops. A diverse group of students clusters around a glowing monitor showing a colorful fitness landscape — rolling hills in green, yellow, and blue — with tiny labeled dots climbing toward a peak marked "Optimal Solution." DNA-strand doodles and binary strings decorate the whiteboard edges. Sunlight streams through tall windows, illuminating scattered papers labeled "Gen 1," "Gen 5," "Gen 20."

A bright university lecture hall bathed in warm daylight, with a large whiteboard displaying a clean circuit diagram connecting classical bits labeled "0/1" transitioning into glowing blue-and-gold qubit spheres showing superposition arrows. A cheerful professor points to a bold "BQP" label inside concentric complexity rings labeled "P," "NP," "BQP." Interconnected qubits show entanglement lines in vivid teal. Shor's algorithm factoring "15 = 3×5" appears neatly beside a quantum gate ladder diagram.

A bright university study setting with clean white walls and natural daylight. A classic Turing machine diagram on the left connects via a bold arrow to a glowing oracle box labeled "O?" at center — drawn as a friendly golden vending machine with an instant-answer slot. Complexity class bubbles labeled P, NP, P^A, NP^A float nearby on a light-blue chalkboard, with curved arrows showing relationships shifting relative to oracle A.

A bright university lab setting with large whiteboards showing a clean network graph: labeled nodes A–F connected by weighted edges, with a glowing highlighted shortest path traced in bold orange. Complexity class labels "P," "NP," and "BPP" appear in colorful chalk bubbles nearby. A student points enthusiastically at Dijkstra's step-by-step table. Sunlit windows, tidy desks, blue-and-white color scheme, optimistic and energetic atmosphere.

A bright university whiteboard scene bathed in warm sunlight. A clean diagram shows a large tangled graph being neatly separated: one small highlighted cluster labeled "k = parameter" glows yellow, while the remaining complex network fades to light gray. An equation reads "O(f(k) · nᶜ)" in bold marker. Colored arrows point from "vertex cover k=3" to a clean, solved subgraph. Textbooks and coffee cup sit nearby on a sunlit desk.

A bright university whiteboard filled with a clean algorithmic flowchart showing a large tangled graph labeled "Input (n, k)" shrinking through labeled arrows — "Preprocessing," "Reduction Rules" — into a small, tidy compact graph labeled "Kernel (f(k))." Surrounding the board, a sunlit classroom with labeled boxes: "FPT," "W[1]-Hard." A cheerful student draws the reduction steps in blue marker, with a formula "O(f(k)·n^c)" clearly written alongside.

Bright university research lab, daylight streaming through tall windows. A large whiteboard displays two clearly labeled columns: "Classical RSA/ECC" with a padlock icon and "Post-Quantum Lattice" with a geometric lattice grid diagram. A cheerful researcher points to Shor's algorithm formula "O(log³N)" beside a stylized blue quantum circuit chip. Nearby, a fiber-optic cable connects two terminals labeled "BB84 QKD," with photon symbols traveling along it. Clean, colorful, optimistic atmosphere.

A bright university whiteboard scene flooded with warm daylight. A logic circuit diagram merges smoothly into a probability tree, with labeled branches showing values like 0.7, 0.3, and P(A|B). Clean Boolean gate symbols (AND, OR) connect to shaded probability nodes. Colorful arrows flow from logical formulae toward decision outcomes labeled "TRUE/FALSE/UNCERTAIN." A neat Venn diagram overlaps with a bell curve beside the circuit, all drawn in crisp blue, orange, and green on a white background.

A bright university whiteboard scene flooded with warm afternoon light. A confident student sketches a clean diagram showing two paths: one labeled "OPTIMAL" winding through a complex maze of nodes, another labeled "APPROX" taking a shorter, highlighted route. A large ratio "≤ 2·OPT" is circled in blue. Nearby, a timeline arrow shows "Polynomial Time" with green checkmarks. Color-coded graph nodes—teal, orange, yellow—illustrate a greedy algorithm selecting vertices step-by-step.

A bright university classroom whiteboard filled with a clean automata state diagram: circular nodes labeled q0, q1, q2 connected by arrows annotated with probability fractions like "½" and "¾", showing stochastic transitions. A focused student sketches the diagram, coins scattered nearby symbolizing randomness. Color-coded probability paths in blue, green, and orange branch across the board. Sunlit room, crisp lines, cheerful academic energy. Small label reads "PPT Automata" at the top corner.

A bright university whiteboard scene in warm daylight. A clean white board displays a colorful staircase diagram climbing upward: levels labeled Σ₀=Π₀, then Σ₁, Π₁, Σ₂, Π₂, each step a different pastel color (yellow, mint, sky-blue, lavender). Alternating ∃ and ∀ symbols decorate each step like building blocks. Scattered open textbooks and coffee cups sit on a sunlit desk below. Clear, optimistic, academic atmosphere.

A bright university lecture hall with large windows letting in daylight. A clean whiteboard displays an infinite grid labeled with rows "M₁ M₂ M₃..." and columns "x₁ x₂ x₃...", with diagonal entries circled in bold red marker forming a zigzag path. A cheerful professor points to the diagonal, while a student holds a "HALTING PROBLEM" card marked with ∞. Color-coded arrows show flipped diagonal values escaping the grid.

A bright university whiteboard filled with clean mathematical notation: a polynomial identity "P(x₁,x₂,x₃) = Σ f(x)" with colorful arrows showing verification steps. A focused student at a sunlit desk examines layered transparent proof-tree diagrams in blue, orange, and green. Holographic prism shapes emit rainbow light across the diagram. Sum-Check protocol steps are labeled in bold teal markers. Warm afternoon light streams through large windows onto scattered open textbooks and highlighted research papers.

Bright university whiteboard scene in a sunlit classroom. A cheerful professor points to a clean diagram showing SAT reducing to 3SAT with a bold arrow. The whiteboard displays a small Boolean formula "(A∨B∨C) ∧ (¬A∨D∨¬C)" with colorful variable bubbles labeled T/F. A flowchart connects "NP Problem → SAT → 3SAT" in blue, red, and green marker. Textbooks and coffee cups sit on a front desk.

A bright, sunlit university classroom whiteboard filled with clean diagrams: a cheerful decision boundary curve separating colorful scattered dots (blue circles, orange squares) labeled "VC dimension = 3," a small clean bias-variance tradeoff arc graph with "bias" and "variance" arrows, and a "PAC Learning" box with a checkmark. A confident student points at the board, textbooks and a laptop showing a neural network diagram open on a well-lit desk nearby.

A bright university whiteboard fills the background, covered in clean colorful chalk diagrams. A Blum-Shub-Smale machine is illustrated as a friendly flowchart with nodes labeled "+", "×", "≥0", connecting real-number registers shown as glowing yellow boxes. Beside it, a polynomial curve y=x³−2x+1 arcs across a coordinate grid, with roots marked by cheerful red dots. Sunlight streams through tall classroom windows.

A bright, sunlit university classroom whiteboard displays a clean blockchain diagram: linked glowing blocks labeled "Block 1 → Block 2 → Block 3" with small padlock icons. A cheerful student points to a circuit complexity diagram showing PoW and PoS branching paths. Colorful nodes and edges form a network graph beside a simple formula "P ≠ NP?" Written in bold marker. Warm daylight streams through tall windows, books and laptops open nearby.

Bright university lecture hall with large whiteboards bathed in warm daylight. A cheerful diagram shows three parallel horizontal tapes labeled "Tape 1," "Tape 2," "Tape 3," each with distinct colored read/write heads (red, blue, green) scanning symbols simultaneously. A bold arrow connects this multi-tape machine illustration to a single-tape Turing machine, labeled "Equivalent!" emphasizing computational equivalence. Clean geometric shapes, crisp lines, optimistic yellow and sky-blue color palette throughout.

A bright, sunlit engineering workspace with a large whiteboard showing a clean timeline diagram: colored task bars labeled T1, T2, T3 racing toward deadline markers, with utilization bound formula U ≤ n(2^(1/n)−1) neatly written above. A focused student arranges priority blocks on a physical scheduling board, green checkmarks indicating met deadlines. Clock faces and circuit diagrams surround the board, all rendered in crisp blues, oranges, and whites on a light background.

Bright university computer science lab, large whiteboard filled with a clean circuit-style graph diagram showing nodes labeled "INSERT" and "DELETE" connected by colored arrows to a central database cylinder. A focused student updates a dynamic table on a glowing laptop, while overhead diagrams show predicate logic notation "∀x P(x)" and a small timeline labeled "t₀ → t₁ → t₂" illustrating database state transitions. Sunlight streams through tall windows onto organized desks with open textbooks.

A bright university whiteboard scene flooded with daylight. A large, cleanly drawn hypergraph dominates the board: six labeled vertices (A–F) connected by colorful shaded regions representing hyperedges linking three or four vertices simultaneously. Beside it, a small Turán-type inequality and a Ramsey number "R(3,3)=6" are neatly written. Colored markers, an open combinatorics textbook, and coffee cup sit on a sunny ledge below.

A bright university study room with large windows and afternoon sunlight. A friendly chalkboard displays a looping arrow labeled "This statement cannot be proved" curving back on itself, beside a simple flowchart showing "SYSTEM" → "TRUE?" with a question mark dead-end. A stack of math textbooks labeled "AXIOMS" sits nearby. A small robot examines the loop, looking puzzled but curious, surrounded by cheerful geometric shapes.

A bright university whiteboard scene flooded with warm daylight. A clean diagram shows an NFA with five labeled circular states (q0–q4) connected by bold colored arrows, some states sharing multiple transitions for the same input symbol "a" or "b." Dashed curved arrows illustrate transitive closure links between non-adjacent states. Small neat labels mark "ε-closure" and "TC" beside relevant transitions. A textbook and laptop sit nearby on a sunlit desk.

A bright university whiteboard scene bathed in warm daylight. A cheerful illustrated mathematician stands beside a large clean whiteboard showing a Boolean formula with branching solution tree, nodes labeled "0" and "1," with bold tally marks counting: "#SAT = 7." Colorful arrows connect decision boxes to a glowing counter display. Nearby, small icons represent statistical physics graphs and probability networks. Clean blue, orange, and green palette; crisp academic energy throughout.

Bright university study room with large windows and afternoon sunlight. A clean whiteboard shows two columns: left labeled "Shannon Entropy" with a probability distribution bar chart, right labeled "Kolmogorov K(x)" with a tiny compressed program arrow pointing to a long binary string. A friendly robot (universal Turing machine) sits on a desk printing output tape. Scattered books, coffee cup, and compressed vs. uncompressed file size comparison diagram complete the cheerful academic scene.

A bright university whiteboard fills the frame, sunlit from tall windows. A confident instructor points to a clean diagram showing nested complexity classes: FPT inside W[1] inside W[2] inside a dotted boundary labeled "XP," drawn in bold colored markers. Below, a clear formula reads "f(k)·n^c" with parameter "k" circled in blue. Color-coded arrows connect labeled problem boxes: "Vertex Cover," "Clique," "Dominating Set," arranged in ascending hierarchy across the white board.

A bright, sunlit study room with two large portrait sketches of Church and Turing pinned to a white corkboard. Center stage: a friendly illustrated Turing machine — a cheerful mechanical device with a long paper tape showing symbols (0, 1, #). Beside it, a clean chalkboard displays "λ-calculus = Turing Machine" with an equals sign connecting both diagrams. A thinking human figure with a pencil bridges the two models, symbolizing equivalent computational power.

A bright, sunlit whiteboard in a modern university classroom displays a large composite number "N = p × q" splitting into two prime factors with bold arrows, while a clean circuit diagram shows layered computational gates labeled "EASY" and "HARD." A friendly professor points to a colorful complexity ladder showing P, NP, and intractable zones. Lock icons and prime numbers (7, 13, 97) float as visual anchors against the crisp white background.

Bright university study space with large windows and afternoon sunlight. A whiteboard shows three labeled diagrams side by side: four points shattered by a linear classifier (all 16 dichotomies checked ✓), then five points with one arrangement marked ✗, illustrating VC dimension = 4. A cheerful student points to the equation **VCdim(H) = d**, surrounded by clean geometric sketches of decision boundaries dividing colorful red and blue dots on white backgrounds.

A bright university lecture hall scene with large whiteboards displaying clean circuit diagrams and complexity class bubbles labeled "P," "NP," and "NP-Hard" nested inside each other. A confident instructor points to a bold padlock icon connected by arrows to math expressions "N = P×Q" and "discrete log." Two students collaborate at a sunlit desk, one sketching a public-key encryption flow diagram with labeled "public key" and "private key" boxes linked by colorful arrows.

A bright university whiteboard scene in warm daylight. A large diagram shows a Büchi automaton: clean circular states labeled q₀, q₁, q₂ connected by curved arrows, with one state double-circled in gold marking the accepting state. A dotted infinite input tape labeled "ω-word: a b a b a b ···" stretches rightward. Small LTL formula "□◇p" floats nearby in blue. A looping arrow emphasizes infinite cyclic acceptance.

A bright university whiteboard lab scene bathed in warm daylight. A large timed automaton diagram dominates the whiteboard: clean circular states labeled S0, S1, S2 connected by arrows annotated with clock constraints like "x≤3" and "y=1, reset x." A physical clock face sits beside the diagram. Color-coded regions highlight invariants in yellow and guard conditions in blue. A student points confidently at a state-space grid showing branching paths, with neat labels "clock regions" and "reachability."

A bright whiteboard in a sunlit university classroom displays a clean DFA diagram: five labeled circles (states q0–q4) connected by crisp arrows showing transitions, with q0 marked "start" and q4 double-circled as "accept." A cheerful student traces the path of input string "aabb" with a marker, each arrow lighting up in sequence. Below, a neat regular expression "a*b+" sits beside a simple state table, all on a white background with bold teal and orange accents.

Bright university lecture room with large whiteboards covered in clean diagrams: a game theory payoff matrix labeled "Player A / Player B" with arrows converging on a highlighted Nash Equilibrium cell, beside a complexity hierarchy chart showing PLS nested within TFNP. Two students at a sunlit table arrange colored nodes connected by arrows representing strategy graphs, while a professor points to "PLS = Polynomial Local Search" written in bold blue marker.