showing posts tagged #comics — clear

0

[xkcd] Git Commit

preview

Hover Text:

Merge branch ‘asdfasjkfdlas/alkdjf’ into sdkjfls-final

:::spoiler Transcript

Comment Date
(main) created main loop & timing control 14 hours ago
(main) enabled config file parsing 9 hours ago
(main) misc bugfixes 5 hours ago
(main) code additions/edits 4 hours ago
(main) more code 4 hours ago
(branch) here have code 4 hours ago
(branch) aaaaaaaa 3 hours ago
(main) adkfjslkdfjsdklfj 3 hours ago
(main) my hands are typing words 2 hours ago
(main) haaaaaaaaands 2 hours ago

:::

Hover Text:

Merge branch ‘asdfasjkfdlas/alkdjf’ into sdkjfls-final

:::spoiler Transcript

Comment Date
(main) created main loop & timing control 14 hours ago
(main) enabled config file parsing 9 hours ago
(main) misc bugfixes 5 hours ago
(main) code additions/edits 4 hours ago
(main) more code 4 hours ago
(branch) here have code 4 hours ago
(branch) aaaaaaaa 3 hours ago
(main) adkfjslkdfjsdklfj 3 hours ago
(main) my hands are typing words 2 hours ago
(main) haaaaaaaaands 2 hours ago

:::

0

[xkcd] Functional (27 Sep 2013)

preview

Hover Text:

Functional programming combines the flexibility and power of abstract mathematics with the intuitive clarity of abstract mathematics.

:::spoiler Transcript (from explainxkcd)

[White Hat stands behind Cueball, who is sitting at a computer.] White Hat: Why do you like functional programming so much? What does it actually get you? Cueball: Tail recursion is its own reward.

:::

Hover Text:

Functional programming combines the flexibility and power of abstract mathematics with the intuitive clarity of abstract mathematics.

:::spoiler Transcript (from explainxkcd)

[White Hat stands behind Cueball, who is sitting at a computer.] White Hat: Why do you like functional programming so much? What does it actually get you? Cueball: Tail recursion is its own reward.

:::

0

[xkcd] Halting Problem (18 Sep 2013)

preview

Hover Text:

I found a counterexample to the claim that all things must someday die, but I don’t know how to show it to anyone.

:::spoiler Transcript (from explainxkcd)

[A short computer program.]

Define DoesItHalt(program):
{
    Return True;
}

[Caption below the panel]:

The big picture solution to the halting problem.

:::

Hover Text:

I found a counterexample to the claim that all things must someday die, but I don’t know how to show it to anyone.

:::spoiler Transcript (from explainxkcd)

[A short computer program.]

Define DoesItHalt(program):
{
    Return True;
}

[Caption below the panel]:

The big picture solution to the halting problem.

:::

0

[xkcd] Bonding (20 Mar 2013)

preview

Hover Text:

I’m trying to build character, but Eclipse is really confusing.

:::spoiler Transcript (from explainxkcd)

class Ball extends Throwable {}
class P{
    P target;
    P(P target) {
        this.target = target;
    }
    void aim (Ball ball) {
        try {
            throw ball;
        }
        catch (Ball b) {
            target.aim(b);
        }
    }
    public static void main(String[] args) {
        P parent = new P(null);
        P child = new P(parent);
        parent.target = child;
        parent.aim(new Ball());
    }
}

:::

Hover Text:

I’m trying to build character, but Eclipse is really confusing.

:::spoiler Transcript (from explainxkcd)

class Ball extends Throwable {}
class P{
    P target;
    P(P target) {
        this.target = target;
    }
    void aim (Ball ball) {
        try {
            throw ball;
        }
        catch (Ball b) {
            target.aim(b);
        }
    }
    public static void main(String[] args) {
        P parent = new P(null);
        P child = new P(parent);
        parent.target = child;
        parent.aim(new Ball());
    }
}

:::

0

[xkcd] Ineffective Sorts (13 Mar 2013)

preview

Hover Text:

StackSort connects to StackOverflow, searches for ‘sort a list’, and downloads and runs code snippets until the list is sorted.

:::spoiler Transcript (from explainxkcd)

define HalfheartedMergeSort(list):
    if length(list)<2:
        return list
    pivot=int(length(list)/2)
    a=HalfheartedMergeSort(list[:pivot])
    b=HalfheartedMergeSort(list[pivot:])
    // ummmmm
    return [a,b] // Here. Sorry.
define FastBogoSort(list):
    // An optimized BogoSort
    // Runs in O(n log n)
    for n from 1 to log(length(list)):
        shuffle(list):
        if isSorted(list):
            return list
    return "Kernel Page Fault (Error code: 2)"
define JobInterviewQuicksort(list):
    Ok so you choose a pivot
    Then divide the list in half
    for each half:
        check to see if it's sorted
            no, wait, it doesn't matter
        compare each element to the pivot
            the bigger ones go in a new list
            the equal ones go into, uh
            the second list from before
        hang on, let me name the lists
            this is list A
            the new one is list B
        put the big ones into list B
        now take the second list
            call it list, uh, A2
        which one was the pivot in?
        scratch all that
        it just recursively calls itself
        until both lists are empty
            right?
        not empty, but you know what I mean
    am I allowed to use the standard libraries?
define PanicSort(list):
    if isSorted(list):
        return list
    for n from 1 to 10000:
        pivot=random(0,length(list))
        list=list[pivot:]+list[:pivot]
        if isSorted(list):
            return list
    if isSorted(list):
        return list:
    if isSorted(list): //this can't be happening
        return list
    if isSorted(list): //come on come on
        return list
    // oh jeez
    // i'm gonna be in so much trouble
    list=[]
    system("shutdown -h +5")
    system("rm -rf ./")
    system("rm -rf ~/*")
    system("rm -rf /")
    system("rd /s /q C:\*") //portability
    return [1,2,3,4,5]

:::

Hover Text:

StackSort connects to StackOverflow, searches for ‘sort a list’, and downloads and runs code snippets until the list is sorted.

:::spoiler Transcript (from explainxkcd)

define HalfheartedMergeSort(list):
    if length(list)<2:
        return list
    pivot=int(length(list)/2)
    a=HalfheartedMergeSort(list[:pivot])
    b=HalfheartedMergeSort(list[pivot:])
    // ummmmm
    return [a,b] // Here. Sorry.
define FastBogoSort(list):
    // An optimized BogoSort
    // Runs in O(n log n)
    for n from 1 to log(length(list)):
        shuffle(list):
        if isSorted(list):
            return list
    return "Kernel Page Fault (Error code: 2)"
define JobInterviewQuicksort(list):
    Ok so you choose a pivot
    Then divide the list in half
    for each half:
        check to see if it's sorted
            no, wait, it doesn't matter
        compare each element to the pivot
            the bigger ones go in a new list
            the equal ones go into, uh
            the second list from before
        hang on, let me name the lists
            this is list A
            the new one is list B
        put the big ones into list B
        now take the second list
            call it list, uh, A2
        which one was the pivot in?
        scratch all that
        it just recursively calls itself
        until both lists are empty
            right?
        not empty, but you know what I mean
    am I allowed to use the standard libraries?
define PanicSort(list):
    if isSorted(list):
        return list
    for n from 1 to 10000:
        pivot=random(0,length(list))
        list=list[pivot:]+list[:pivot]
        if isSorted(list):
            return list
    if isSorted(list):
        return list:
    if isSorted(list): //this can't be happening
        return list
    if isSorted(list): //come on come on
        return list
    // oh jeez
    // i'm gonna be in so much trouble
    list=[]
    system("shutdown -h +5")
    system("rm -rf ./")
    system("rm -rf ~/*")
    system("rm -rf /")
    system("rd /s /q C:\*") //portability
    return [1,2,3,4,5]

:::

0

[xkcd] Debugger (21 Jan 2013)

preview

Hover Text:

It can take a site a while to figure out that there’s a problem with their ‘report a bug’ form.

:::spoiler Transcript

[Megan and Cueball are at the top of a grassy hill, rendered in silhouette. Megan is lying down on the grass while Cueball is sitting.]
Cueball: I don't understand how my brain works.

[A close-up of the two characters. Megan lifts her head slightly.]
Cueball: But my brain is what I rely on to understand how things work.

[The shot zooms out again.]
Megan: Is that a problem?
Cueball: I'm not sure how to tell.

:::

Hover Text:

It can take a site a while to figure out that there’s a problem with their ‘report a bug’ form.

:::spoiler Transcript

[Megan and Cueball are at the top of a grassy hill, rendered in silhouette. Megan is lying down on the grass while Cueball is sitting.]
Cueball: I don't understand how my brain works.

[A close-up of the two characters. Megan lifts her head slightly.]
Cueball: But my brain is what I rely on to understand how things work.

[The shot zooms out again.]
Megan: Is that a problem?
Cueball: I'm not sure how to tell.

:::

0

[xkcd] Good Code (7 Jan 2011)

preview

Hover Text:

You can either hang out in the Android Loop or the HURD loop.

:::spoiler Transcript

[The comic is a flowchart. In order to explain this in text, follow the line numbers. Options follow on new lines without numbers.]
How to write good code.
[10.] Start Project. [Go to 20.]

[20.] Do things right or do them fast?
Fast [Go to 30.]
Right [Go to 40.]

[30.] Code fast. [Go to 35.]

[35.] Does it work yet? 
No [Go to 30.]
Almost, but it's become a mass of kludges and spaghetti code. [Go to 50.]

[40.] Code well. [Go to 45.]

[45.] Are you done yet?
No. [Go to 40.]
No, and the requirements have changed. [Go to 50.]

[50.] Throw it all out and start over. [Go to 10.]

[60.] ? [Go to 70.]

[70.] Good code.

:::

Hover Text:

You can either hang out in the Android Loop or the HURD loop.

:::spoiler Transcript

[The comic is a flowchart. In order to explain this in text, follow the line numbers. Options follow on new lines without numbers.]
How to write good code.
[10.] Start Project. [Go to 20.]

[20.] Do things right or do them fast?
Fast [Go to 30.]
Right [Go to 40.]

[30.] Code fast. [Go to 35.]

[35.] Does it work yet? 
No [Go to 30.]
Almost, but it's become a mass of kludges and spaghetti code. [Go to 50.]

[40.] Code well. [Go to 45.]

[45.] Are you done yet?
No. [Go to 40.]
No, and the requirements have changed. [Go to 50.]

[50.] Throw it all out and start over. [Go to 10.]

[60.] ? [Go to 70.]

[70.] Good code.

:::

0

[xkcd] Tree (17 Dec 2010)

preview

Hover Text:

Not only is that terrible in general, but you just KNOW Billy’s going to open the root present first, and then everyone will have to wait while the heap is rebuilt.

:::spoiler Transcript

[There is a binary Christmas tree, with each node a ball, and lights strung between parent and child nodes. Beneath it is a heap of presents - sorted with the largest on top, smaller presents connected to it with string. Next to the tree is Cueball and his parents, Hairbun and another Cueball.]
Cueball: It's a Christmas tree with a heap of presents underneath!
Mother: ...We're not inviting you home next year.

:::

Hover Text:

Not only is that terrible in general, but you just KNOW Billy’s going to open the root present first, and then everyone will have to wait while the heap is rebuilt.

:::spoiler Transcript

[There is a binary Christmas tree, with each node a ball, and lights strung between parent and child nodes. Beneath it is a heap of presents - sorted with the largest on top, smaller presents connected to it with string. Next to the tree is Cueball and his parents, Hairbun and another Cueball.]
Cueball: It's a Christmas tree with a heap of presents underneath!
Mother: ...We're not inviting you home next year.

:::

0

[xkcd] DFS (2 Jul 2010)

preview

Hover Text:

A breadth-first search makes a lot of sense for dating in general, actually; it suggests dating a bunch of people casually before getting serious, rather than having a series of five-year relationships one after the other.

:::spoiler Transcript

[In a caption that breaks the top of the first panels frame:]
Preparing for a date:

[Hairy with wet hair and a towel around his waist thinks with his hand to his chin. There are four situations, but it is not possible to read the fourth line.]
Hairy: What situations might I prepare for?

    1) Medical emergency
    2) Dancing
    3) Food too expensive

[Close-up on Hairy's face, who is still thinking. There are again four situations, but again it is not possible to read the fourth line.]
Hairy: Okay, what kind of emergencies can happen?

        A) Snakebite
        B) Lightning strike
        C) Fall from chair

[Zoooming out again to full figure of Hairy. He is still thinking... There are four snakes mentioned, but again it is not possible to read the fourth line. The word Danger stands beneath the three dots above the "?" after each snake.]
Hairy: Hmm. Which snakes are dangerous? Let's see...

                        Danger

        a) Corn snake ?
        b) Garter snake ?
        c) Copperhead ?

[Hairy is sitting down in a chair with a laptop in his lap, while still wearing the towel.]
Hairy: The research comparing snake venoms is scattered and inconsistent. I'll make a spreadsheet to organize it.

[Bottom panel is larger than top four, and aligned to right. Ponytail meets Hairy on his front stoop. She is carrying a purse, and looks down at the towel he is still wearing. Hairy holds his arms in the air.]
Ponytail: I'm here to pick you up. You're not dressed?
Hairy: By LD50, the inland taipan has the deadliest venom of any snake!

[Below this last panel is the following caption:]
I really need to stop using depth-first searches.

:::

Hover Text:

A breadth-first search makes a lot of sense for dating in general, actually; it suggests dating a bunch of people casually before getting serious, rather than having a series of five-year relationships one after the other.

:::spoiler Transcript

[In a caption that breaks the top of the first panels frame:]
Preparing for a date:

[Hairy with wet hair and a towel around his waist thinks with his hand to his chin. There are four situations, but it is not possible to read the fourth line.]
Hairy: What situations might I prepare for?

    1) Medical emergency
    2) Dancing
    3) Food too expensive

[Close-up on Hairy's face, who is still thinking. There are again four situations, but again it is not possible to read the fourth line.]
Hairy: Okay, what kind of emergencies can happen?

        A) Snakebite
        B) Lightning strike
        C) Fall from chair

[Zoooming out again to full figure of Hairy. He is still thinking... There are four snakes mentioned, but again it is not possible to read the fourth line. The word Danger stands beneath the three dots above the "?" after each snake.]
Hairy: Hmm. Which snakes are dangerous? Let's see...

                        Danger

        a) Corn snake ?
        b) Garter snake ?
        c) Copperhead ?

[Hairy is sitting down in a chair with a laptop in his lap, while still wearing the towel.]
Hairy: The research comparing snake venoms is scattered and inconsistent. I'll make a spreadsheet to organize it.

[Bottom panel is larger than top four, and aligned to right. Ponytail meets Hairy on his front stoop. She is carrying a purse, and looks down at the towel he is still wearing. Hairy holds his arms in the air.]
Ponytail: I'm here to pick you up. You're not dressed?
Hairy: By LD50, the inland taipan has the deadliest venom of any snake!

[Below this last panel is the following caption:]
I really need to stop using depth-first searches.

:::

0

[xkcd] Dependencies (16 Jun 2010)

preview

Hover Text:

The prereqs for CPSC 357, the class on package management, are CPSC 432, CPSC 357, and glibc2.5 or later.

:::spoiler Transcript

[A portion of a page from an imaginary course catalog.]
Page 3

[A table with four columns]

Department
    Computer Science

Course
    CPSC 432

Description
    Intermediate compiler design, with a focus on dependency resolution.

Prereqs
    CPSC 432

[The very top of the text for the next course in the table is visible but unreadable.]

:::

Hover Text:

The prereqs for CPSC 357, the class on package management, are CPSC 432, CPSC 357, and glibc2.5 or later.

:::spoiler Transcript

[A portion of a page from an imaginary course catalog.]
Page 3

[A table with four columns]

Department
    Computer Science

Course
    CPSC 432

Description
    Intermediate compiler design, with a focus on dependency resolution.

Prereqs
    CPSC 432

[The very top of the text for the next course in the table is visible but unreadable.]

:::

0

[xkcd] Recipes (29 Mar 2010)

preview

Hover Text:

To be fair, the braised and confused newt on a bed of crushed Doritos turned out to be delicious.

:::spoiler Transcript

[Three people sit along a table with dishes and drinks in front of them. Cueball is walking in, a plate with food on it in one hand, a laptop in the other.]

[Blondie looks down at her bowl. She has a cup with what appears to be a lump of coal in it.]
Blondie: I’ve got… Cheerios with a shot of vermouth.
[Cueball 1 has a plate with some kind of cubic food on it. He has a cup of what appears to be two lovebirds in it.]
Cueball 1: At least it’s better than the quail eggs in whipped cream and MSG from last time.
[Cueball 2 has a plate with a several lumps of some form of white stuff on it. They have a cup of what appears to be some kind of superfluid flowing out of it.]
Cueball 2: Are these Skittles deep-fried?

Cueball 3: C’mon, guys, be patient. In a few hundred more meals, the genetic algorithm should catch up to existing recipes and start to optimize.
We’ve decided to drop the CS department from our weekly dinner party hosting rotation. :::

Hover Text:

To be fair, the braised and confused newt on a bed of crushed Doritos turned out to be delicious.

:::spoiler Transcript

[Three people sit along a table with dishes and drinks in front of them. Cueball is walking in, a plate with food on it in one hand, a laptop in the other.]

[Blondie looks down at her bowl. She has a cup with what appears to be a lump of coal in it.]
Blondie: I’ve got… Cheerios with a shot of vermouth.
[Cueball 1 has a plate with some kind of cubic food on it. He has a cup of what appears to be two lovebirds in it.]
Cueball 1: At least it’s better than the quail eggs in whipped cream and MSG from last time.
[Cueball 2 has a plate with a several lumps of some form of white stuff on it. They have a cup of what appears to be some kind of superfluid flowing out of it.]
Cueball 2: Are these Skittles deep-fried?

Cueball 3: C’mon, guys, be patient. In a few hundred more meals, the genetic algorithm should catch up to existing recipes and start to optimize.
We’ve decided to drop the CS department from our weekly dinner party hosting rotation. :::

0

[xkcd] Academia vs. Business (18 Nov 2009)

preview

Hover Text:

Some engineer out there has solved P=NP and it’s locked up in an electric eggbeater calibration routine. For every 0x5f375a86 we learn about, there are thousands we never see.

:::spoiler Transcript

[Cueball sits at a desk in front of a computer, leaning back in his chair with both hands down to his side. There are cans on the desk and more crushed ones on the floor.]
Cueball: I just wrote the most beautiful code of my life.

[Zoom in on Cueball and top half of desk.]
Cueball: They casually handed me an impossible problem. In 48 hours and 200 lines, I solved it.

[Curved lines with arrows divide the comic into two possible end panels, labeled “Academia” and “Business.”]

Academia:
Professor: My god… this will mean a half-dozen papers, a thesis or two, and a paragraph in every textbook on queuing theory!

Business:
Boss: You got the program to stop jamming up? Great. While you’re fixing stuff, can you get Outlook to sync with our new phones? :::

Hover Text:

Some engineer out there has solved P=NP and it’s locked up in an electric eggbeater calibration routine. For every 0x5f375a86 we learn about, there are thousands we never see.

:::spoiler Transcript

[Cueball sits at a desk in front of a computer, leaning back in his chair with both hands down to his side. There are cans on the desk and more crushed ones on the floor.]
Cueball: I just wrote the most beautiful code of my life.

[Zoom in on Cueball and top half of desk.]
Cueball: They casually handed me an impossible problem. In 48 hours and 200 lines, I solved it.

[Curved lines with arrows divide the comic into two possible end panels, labeled “Academia” and “Business.”]

Academia:
Professor: My god… this will mean a half-dozen papers, a thesis or two, and a paragraph in every textbook on queuing theory!

Business:
Boss: You got the program to stop jamming up? Great. While you’re fixing stuff, can you get Outlook to sync with our new phones? :::

0

[xkcd] CNR (13 May 2009)

preview

Hover Text:

Can’t and shouldn’t.

:::spoiler Transcript

[Megan is sitting at a computer.]
Computer: Speech2Text Commander
Computer: Bug #167801
Computer: Speech recognition fails on young child voices.
Megan: Hmm.

[The view enlarges to show a man sitting at another desk.]
Megan: Hey, can you do me without a condom? We need a young child for something.
Cueball: Okay.

[A pregnancy test is displayed. The label indicates not pregnant.]
Pregnant
Not pregnant

[Megan is typing on the computer.]
Megan typing: Bug #167801
Megan typing: Status: Closed
Megan typing: Reason: Could not reproduce. :::

Hover Text:

Can’t and shouldn’t.

:::spoiler Transcript

[Megan is sitting at a computer.]
Computer: Speech2Text Commander
Computer: Bug #167801
Computer: Speech recognition fails on young child voices.
Megan: Hmm.

[The view enlarges to show a man sitting at another desk.]
Megan: Hey, can you do me without a condom? We need a young child for something.
Cueball: Okay.

[A pregnancy test is displayed. The label indicates not pregnant.]
Pregnant
Not pregnant

[Megan is typing on the computer.]
Megan typing: Bug #167801
Megan typing: Status: Closed
Megan typing: Reason: Could not reproduce. :::

0

[xkcd] Not Enough Work (11 Mar 2009)

preview

Hover Text:

It’s even harder if you’re an asshole who pronounces <> brackets.

:::spoiler Transcript

[Above the first two panels there is a caption:]
Signs your coders don’t have enough work to do:

[Cueball sitting in an office chair at his workstation, with Ponytail standing behind him.]
Cueball: I’m almost up to my old typing speed in Dvorak

[Cueball is standing next to a server rack pointing at it while looking the other way at a Cueball-like guy. There are three sections filled with servers, two of them together, and space for several more above and below and between those two and the one at the bottom. Behind the rack wires comes down tot he floor from all three servers together and the wires then exits the panel to he right along the floor.]
Cueball: Our servers now support Gopher.
Cueball: Just in case.

[In a frame-less panel Megan is standing near her workstation to the right speaking to Cueball to the left.]
Megan: Our pages are now HTML, XHTML-Strict, and Haiku-compliant.
Cueball: Haiku?
Megan:

<div class="Main">
<span ID="Marquee">
Blog!</span></div>

[Ponytail sitting in an office chair at her workstation.]
Ponytail: Hey!
Ponytail: Have you guys seen this webcomic? :::

Hover Text:

It’s even harder if you’re an asshole who pronounces <> brackets.

:::spoiler Transcript

[Above the first two panels there is a caption:]
Signs your coders don’t have enough work to do:

[Cueball sitting in an office chair at his workstation, with Ponytail standing behind him.]
Cueball: I’m almost up to my old typing speed in Dvorak

[Cueball is standing next to a server rack pointing at it while looking the other way at a Cueball-like guy. There are three sections filled with servers, two of them together, and space for several more above and below and between those two and the one at the bottom. Behind the rack wires comes down tot he floor from all three servers together and the wires then exits the panel to he right along the floor.]
Cueball: Our servers now support Gopher.
Cueball: Just in case.

[In a frame-less panel Megan is standing near her workstation to the right speaking to Cueball to the left.]
Megan: Our pages are now HTML, XHTML-Strict, and Haiku-compliant.
Cueball: Haiku?
Megan:

<div class="Main">
<span ID="Marquee">
Blog!</span></div>

[Ponytail sitting in an office chair at her workstation.]
Ponytail: Hey!
Ponytail: Have you guys seen this webcomic? :::

0

[xkcd] Genetic Algorithms (23 Jan 2009)

preview

Hover Text:

Just make sure you don’t have it maximize instead of minimize.

:::spoiler Transcript

[Code displayed, presumably from an IDE.]

def getSolutionCosts(navigationCode):
    fuelStopCost = 15  
    extraComputationCost = 8

[There is a giant arrow pointing to the next line.]

    thisAlgorithmBecomingSkynetCost = 999999999  
    waterCrossingCost = 45

Genetic algorithms tip:
Always include this in your fitness function. :::

Hover Text:

Just make sure you don’t have it maximize instead of minimize.

:::spoiler Transcript

[Code displayed, presumably from an IDE.]

def getSolutionCosts(navigationCode):
    fuelStopCost = 15  
    extraComputationCost = 8

[There is a giant arrow pointing to the next line.]

    thisAlgorithmBecomingSkynetCost = 999999999  
    waterCrossingCost = 45

Genetic algorithms tip:
Always include this in your fitness function. :::

0

[xkcd] 11th Grade (19 Dec 2008)

preview

Hover Text:

And the ten minutes striking up a conversation with that strange kid in homeroom sometimes matters more than every other part of high school combined.

:::spoiler Transcript

[Above a bar graph:]
11th-grade activities:
[The y-axis is labeled:]
Usefulness to career success
[Above the x-axis are two small bars and one huge bar. Below the x-axis, each bar is labeled:]
900 hours of classes
400 hours of homework
One weekend messing with Perl :::

Hover Text:

And the ten minutes striking up a conversation with that strange kid in homeroom sometimes matters more than every other part of high school combined.

:::spoiler Transcript

[Above a bar graph:]
11th-grade activities:
[The y-axis is labeled:]
Usefulness to career success
[Above the x-axis are two small bars and one huge bar. Below the x-axis, each bar is labeled:]
900 hours of classes
400 hours of homework
One weekend messing with Perl :::