Lições — Faculdade

A bright university study space with large sunlit windows. A student stands at a clean whiteboard divided into four colorful labeled sections: "Direct Proof," "Contrapositive," "Contradiction," and "Induction," each showing compact symbolic steps with arrows connecting logical statements. Colorful sticky notes and open textbooks surround a laptop. Small diagrams show "P→Q" equivalence charts and a domino-chain illustration for induction, rendered in bold, cheerful primary colors.

A bright university lab setting with a large whiteboard displaying a clean logic circuit diagram in bold blue lines — AND, OR, and NOT gates connected in sequence, labeled clearly. A student points to a truth table with values 0s and 1s in crisp black ink. Sunlit workspace shows circuit breadboards, colored wires, and a glowing laptop displaying "A AND B = 1." Formula "A·B + C" written neatly nearby.

A bright university whiteboard scene showing a clean directed graph with labeled nodes A–G connected by arrows. On the left, a DFS path glows in warm orange, tracing deep along one branch with a small illustrated stack below. On the right, a BFS path spreads in sky blue, expanding level by level with a queue diagram beneath. Sunlit classroom, crisp lines, cheerful and organized.

A bright, sunlit whiteboard in a modern university classroom displays a clean graph diagram: six colorful circles labeled V1–V6 connected by bold arrows and lines forming both directed and undirected edges. Alongside, small cheerful icons illustrate DFS and BFS traversal paths highlighted in orange and blue respectively. A friendly robot character points to the notation "G = (V, E)" written neatly above, with textbooks and a laptop visible on a well-lit desk nearby.

Bright university classroom setting, large whiteboard displaying a clean diagram: two labeled ovals marked "A (Domain)" and "B (Codomain)" connected by neat arrows illustrating injective, surjective, and bijective mappings with small colored dots as elements. A student points enthusiastically at the notation "f: A → B" written boldly above. Sunlight streams through tall windows, textbooks and laptops open on desks below.

A bright university whiteboard scene flooded with warm daylight. A clean directed graph network is drawn in bold colors: nodes labeled **S** (source, green) and **T** (sink, orange) connected by blue arrows with capacity numbers (10, 7, 5, 3) along edges. A red dashed line slices through the network marking the **Min Cut**. Bold annotation reads **Max Flow = Min Cut**. Graph paper notebook and coffee cup sit nearby.

A bright, sunlit university classroom with whiteboards covered in clean, colorful logic diagrams. A cheerful illustrated professor points to a large truth table showing columns labeled **P**, **Q**, **P∧Q** with rows of T/F values in bold blue and red. Surrounding the board, friendly icons represent connectives: interlocking circles for AND, a fork symbol for OR, a flipped arrow for NOT. Warm yellow lighting, tidy desks, optimistic academic energy throughout.

Bright university classroom whiteboard filled with clean Venn diagrams: two overlapping circles labeled **A = {1,2,3}** and **B = {2,3,4}**. The union region glows sunny yellow, intersection glows coral-orange, with neat labels **A ∪ B** and **A ∩ B**. A cheerful student points to the diagram with a marker. Daylight streams through tall windows. Color-coded notation **A - B = {1}** written clearly beside. Crisp, airy, optimistic atmosphere.

A bright university classroom whiteboard displays a clean, colorful tree data structure diagram in daylight. A large green-circled root node labeled "Root" branches into child nodes, with BST values like 50, 30, 70, 20, 40 arranged in clearly ordered positions. Color-coded arrows show in-order traversal path in orange. Side annotations label "Height=3," "Depth," and "Leaf Nodes" in bold cheerful typography. Sunlight streams through windows onto the clean white board.

Bright university computer science classroom bathed in warm daylight. A large whiteboard displays a clear RSA key diagram: a padlock splitting into labeled "Public Key" and "Private Key" arrows. A confident student at a modern desk encrypts a message card reading "Hello" → scrambled ciphertext, while colorful wall posters illustrate substitution cipher letter-swap grids and four labeled shields: "Confidentiality, Integrity, Authentication, Non-Repudiation." Clean blues, whites, and yellows throughout.

A bright university classroom with large sunny windows. A cheerful whiteboard displays four labeled proof strategies in bold colors: "Direct," "Contrapositive," "Contradiction," and "Induction." A student confidently points to a clean algebraic chain: "2m + 2n = 2(m+n) ✓" showing even-integer addition. Colorful arrows connect each proof type to matching logical symbols and small diagrams, with a neat domino-row illustration beneath "Induction," all on a crisp white background.

A bright university lecture hall scene with large sunny windows. A friendly illustrated Turing machine diagram dominates a clean whiteboard: a long horizontal tape with cells containing symbols (0, 1, B), a labeled read/write head arrow pointing at one cell, and a neat state-transition table showing states q0→q1. A cheerful student sketches the diagram at a wooden desk surrounded by colorful textbooks, sunlight streaming across the room.

Bright university computer science classroom, sunny white background. Three cheerful labeled containers side by side: a tall cylinder labeled "STACK (LIFO)" with colorful blocks stacked inside and an arrow showing the top block being "popped" out; a horizontal tube labeled "QUEUE (FIFO)" with blocks entering one end and exiting the other; a flat grid labeled "ARRAY [0][1][2][3]" with numbered colored squares. Clean, bold, optimistic colors throughout.

A bright, sunlit computer science classroom whiteboard displays a colorful sorting visualization: a cheerful horizontal row of numbered blocks (5, 3, 8, 1, 4) with curved arrows showing adjacent swaps labeled "Bubble O(n²)." Beside it, a clean bar chart grows progressively taller left-to-right for insertion sort. Color-coded sticky notes in yellow, coral, and teal label each algorithm. A student's hand points enthusiastically with a marker.

A bright, sunlit whiteboard in a modern university classroom. A confident student points to a clean proof written in organized blue marker: base case box labeled "n=1: S(1)=1 ✓", then an arrow leading to the inductive step box showing "Assume S(k)=k(k+1)/2, prove S(k+1)". Below, a colorful staircase diagram with numbered steps 1, 2, 3, 4 visually represents the growing sum, blocks stacking neatly upward in coral, teal, and yellow.

Bright university computer science classroom with large whiteboards divided into three sunny sections. Left panel shows "BRUTE FORCE" with a cartoon figure checking every path on a small city map, exhausted but thorough. Center panel shows "GREEDY" with a figure confidently grabbing the largest coin each step along a clear path. Right panel shows "DIVIDE & CONQUER" with a problem block splitting into smaller identical sub-blocks like a fractal tree. Clean daylight, bold colors.

A bright, sunlit university classroom whiteboard filled with clean colorful diagrams: two overlapping circles labeled **A** and **B** showing union (∪) shaded in warm yellow and intersection (∩) in orange. Nearby, cheerful arrows connect dots between two sets illustrating a relation, with small tags reading "reflexive," "symmetric." A friendly function mapping diagram shows **f: A→B** with neat blue arrows. Textbooks, coffee cups, and marker pens rest on a clean desk below.

A bright, sunlit university study room with a clean whiteboard showing the formula **P(n,r) = n! / (n-r)!** in bold marker. Five colorful hardcover books sit on a wooden shelf labeled **n=5**; three are being lifted out and arranged in a neat row on a desk below, labeled **r=3**. Numbered arrows show **5×4×3 = 60** possible orderings, with small book icons demonstrating distinct sequences.

Bright university whiteboard in a sunny classroom, filled with a clean complexity graph showing curves labeled O(1), O(log n), O(n), O(n²), plotted on clearly marked x-axis "n" and y-axis "time." A cheerful student points to the curves with a marker, color-coded lines rising at different rates. Small compiler gear icons sit beside algorithm pseudocode snippets. Natural daylight streams through large windows behind.

A bright, sunlit university classroom whiteboard filled with a clean FSM diagram: three labeled circles — "S0," "S1," "S2" — connected by bold colored arrows showing transitions, with small input labels "0" and "1" along each arrow. A cheerful student points enthusiastically at the diagram with a marker. Beside the main diagram, two mini-charts compare "DFSM" (single arrow per input) versus "NFSM" (branching arrows), drawn in contrasting blue and orange. Warm natural light floods the scene.

A bright university lecture hall with large windows letting in afternoon sunlight. A cheerful professor points to a clean whiteboard showing a probability diagram: a sample space Ω containing labeled outcome bubbles, an arrow labeled "X" mapping outcomes to a number line (0, 1, 2, 3), and the formula E[X] = Σ x·P(x) in bold. Colorful connecting lines link outcomes to values. Students at desks look engaged, laptops open, notebooks filled with neat probability trees.