powstik
Prove
LiveProof-of-Work · Oct–Nov: every verified proof counts. 35 days leftAll outcomes
Skills

Build Lists, Stacks and Queues (Data Structures I)

7 weeks · 2 milestones

Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (Georgia Tech on edX), then one project of your own. Part of the Varsity Curriculum: Data Science.

Milestone map

Milestone map

2 milestones

Do the course work in public

3–5 weeks (9–10 hrs/week)

Take Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues for free and do your own ArrayList, LinkedList, stack and queue in Java, each with tests. Keep everything in one public repo or notebook as you go. Certificates and graded tracks cost money. Audit is free; you never need the certificate here.

Proof required

Link your public repo or notebook with your own ArrayList, LinkedList, stack and queue in Java, each with tests, and a screenshot or log showing the self-check passed.

What gets checked

  • Each structure passes tests you wrote, including empty and full cases.
  • Running times are stated and match the code.
  • The code is yours (history, comments).

Common mistakes

  • Copying posted answers: verifiers read the history.
  • Skipping the self-check, then asking for review too early.

Powstik Guide

A public repo or notebook with your own ArrayList, LinkedList, stack and queue in Java, each with tests.

Steps

  1. Make a public repo or notebook first.
  2. Do one unit at a time and commit after each.
  3. Run the self-check: Do the exercises for stacks and queues on the free book site, and test your code on its sample data.
  4. Write a short README: what is here and how to run it.
  5. Ask three people who know the topic to check it.

Template

README
Course: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (Georgia Tech on edX)
What is here:
How to run it:
Self-check result:
What was hardest:

What gets sent back

  • No history, just one big upload.
  • Self-check not shown.
  • Code that does not run from the README.

Resources

Foundationstart here

Depthgo deeper

What a verifier looks for

  • Each structure passes tests you wrote, including empty and full cases.
  • Running times are stated and match the code.
  • The code is yours (history, comments).
  • Ask one question about a choice in the code; the answer should be clear.

You'll sign in first, then come straight back here.

Use your own structures in a program

1–3 weeks (5–8 hrs/week)

Use what you learned. Make a program that uses your own stack or queue to solve a real task (an undo button, a print queue, a bracket checker). Keep it small enough to finish in about two weeks.

Proof required

Link a program that uses your own stack or queue to solve a real task (an undo button, a print queue, a bracket checker), with a README that says how to run or read it.

What gets checked

  • It uses your structures, not Java's built-in ones.
  • It handles empty input safely.
  • Tests pass.

Common mistakes

  • A project too big to finish.
  • A demo that only works on your machine.

Powstik Guide

A program that uses your own stack or queue to solve a real task (an undo button, a print queue, a bracket checker).

Steps

  1. Write one line: what it does and for whom.
  2. Build the smallest version that works.
  3. Test it on someone else's machine or with someone else reading it.
  4. Write the README.
  5. Ask three people to check it.

Template

README
What it does:
Who it is for:
How to run it:
What I would do next:

What gets sent back

  • Does not run from the README.
  • Not clearly the person's own work.
  • Claims more than it does.

Resources

Foundationstart here

Depthgo deeper

What a verifier looks for

  • It uses your structures, not Java's built-in ones.
  • It handles empty input safely.
  • Tests pass.
  • Check that the work is the person's own.

You'll sign in first, then come straight back here.

Part of