⚡ Franklin Tech Lab
PRINCIPLES OF INFORMATION TECHNOLOGY  ·  4TH NINE WEEKS  ·  WEEK 2
§130.302(c)(9)(E)(F)
// WEDNESDAY, APRIL 1, 2026
ALGORITHMS
& FLOWCHARTS
How computers think in steps — and how we draw it out
// We Will  ·  I Will  ·  §130.302(c)(9)(E)(F)
WE WILL Explore computer programming concepts by identifying algorithms and describing how structured algorithms flow — including linear and iterative patterns visualized with flowcharts.
I WILL Identify and explain the concept of algorithms [§9(E)]  and  describe the flow of a structured algorithm, including linear and iterative instructions such as using a flow chart. [§9(F)]
§130.302(c)(9)(E)(F) — Principles of Information Technology — Franklin High School, EPISD
Franklin High School · EPISD
1 / 18
⚡ Franklin Tech Lab
BELL RINGER — SILENT & INDEPENDENT
§130.302(c)(9)(E)(F)
// WRITE ONE PARAGRAPH — NOTEBOOK OR PAPER — 7 MINUTES
On Monday you learned that every piece of data in a program has a type — string, integer, float, character, or date. Today we go one level deeper: how does a program actually use that data to make decisions and take action?

Think of something you do every morning that involves a decision — like checking the weather before choosing what to wear. In one paragraph: describe the steps in order, identify the decision point, and explain what would happen if the steps were in the wrong order or the decision was skipped entirely.
⏱ 7 minutes  |  Silent  |  Individual  |  Complete sentences  |  One paragraph
PRIOR KNOWLEDGE · SEL · HIGHER ORDER THINKING
Franklin High School · EPISD
2 / 18
⚡ Franklin Tech Lab
TODAY'S PLAN
§130.302(c)(9)(E)(F)
What We're Doing Today
1
BELL RINGER + DEBRIEF
7 min write · 5 min cold-call bridge to today's vocabulary
2
PART 1 — ALGORITHMS IN SOFTWARE
What algorithms are · 3 properties · linear vs. iterative · real examples
3
PART 2 — FLOWCHARTS
6 symbols · reading a flowchart · drawing one · connect to both tracks
4
FRANKLIN TECH LAB ACTIVITY
Tiered cipher vocabulary · multiple choice · match the flowchart symbol
5
EXIT TICKET — WAYGROUND
6 questions · MC + T/F · counts as a grade
Franklin High School · EPISD
3 / 18
⚡ Franklin Tech Lab
PART 1 OF 2
§130.302(c)(9)(E)
// PART 1 OF 2  ·  §130.302(c)(9)(E)
ALGORITHMS
How software thinks in steps — what makes an algorithm an algorithm, how computers use them, and the difference between a list of steps and a true algorithm.
COVERS: Definition · 3 Properties · Linear vs. Iterative · Real-World Examples · Connection to Data Types
Franklin High School · EPISD
4 / 18
⚡ Franklin Tech Lab
PART 1 — ALGORITHMS
§130.302(c)(9)(E)
// DEFINITION
What Is an Algorithm?
Definition An algorithm is a finite, ordered set of instructions designed to solve a specific problem or complete a task. Every program ever written is built from algorithms.
Analogy A recipe is an algorithm. It has a start, numbered steps in a specific order, and an end result. Skip a step or do them out of order — the dish fails.
In Software When you log into an app, an algorithm checks your credentials. When a game renders a frame, an algorithm calculates every pixel. When Netflix recommends a show, an algorithm scored it against your history.
Franklin High School · EPISD
5 / 18
⚡ Franklin Tech Lab
PART 1 — ALGORITHMS
§130.302(c)(9)(E)
// EVERY ALGORITHM MUST HAVE THESE THREE PROPERTIES
FINITE
It must end. An algorithm that runs forever is not an algorithm — it's a bug. Every set of instructions must have a clear stopping point.
Example: "Keep counting up" is NOT finite. "Count from 1 to 10, then stop" IS finite.
ORDERED
Sequence matters. The steps must be in the correct order. Doing step 4 before step 2 may produce the wrong result — or crash the program entirely.
Example: In a login algorithm, you must check the username before checking the password.
UNAMBIGUOUS
Each step must mean exactly one thing. "Do something with the number" is ambiguous. "Add 5 to the number" is unambiguous. Computers cannot guess.
Example: "Make it bigger" fails. "Multiply the value by 2" succeeds.
Franklin High School · EPISD
6 / 18
⚡ Franklin Tech Lab
PART 1 — ALGORITHMS
§130.302(c)(9)(E)(F)
// TWO TYPES OF ALGORITHM FLOW
LINEAR
Steps execute one after another, straight through from start to finish. No branching, no looping. Every step runs exactly once.
// Linear — log in once
1. Get username
2. Get password
3. Check credentials
4. Grant access
5. End
Your morning routine (get up → shower → eat → leave) is usually linear.
ITERATIVE
A step or set of steps repeats based on a condition. The loop runs until the condition is no longer true. Also called a loop.
// Iterative — retry wrong password
1. Get username
2. Get password
3. WHILE credentials wrong:
   3a. Show error
   3b. Get password again
4. Grant access · End
Hitting snooze, retrying a failed login, or counting votes — all iterative.
Franklin High School · EPISD
7 / 18
⚡ Franklin Tech Lab
PART 1 — CONNECTION TO MONDAY
§130.302(c)(9)(D)(E)
// ALGORITHMS PROCESS DATA — DATA HAS TYPES
Monday's lesson and today's lesson are directly connected. Algorithms operate on data. The data type of each value determines what operations the algorithm is allowed to perform.
String An algorithm can search a string, compare it, or split it — but it cannot add two strings as numbers.
"3" + "4" = "34" not 7.
Integer / Float An algorithm can add, subtract, multiply, compare. A decision diamond in a flowchart often compares a numeric value:
score >= 70?
Boolean Every decision in an algorithm — every diamond in a flowchart — evaluates to a Boolean: true or false. That result determines which path the algorithm takes next.
The Point A wrong data type breaks the algorithm. An integer stored as a string can't be compared mathematically. A date stored as a string can't be used in a date comparison. Data types and algorithms are inseparable.
Franklin High School · EPISD
8 / 18
⚡ Franklin Tech Lab
PART 1 — COLD CALL CHECK
§130.302(c)(9)(E)
// THINK — THEN BE READY TO ANSWER
"A student writes these steps for making toast: 1) Eat the toast   2) Put bread in toaster   3) Press the lever   4) Wait for toast to pop up. Which two of the three algorithm properties does this violate — and how would you fix it?"
"A music app plays the next song, checks if shuffle is on, and if it is, picks a random track — then repeats. Is this algorithm linear or iterative? What is the condition that controls the loop?"
Call on 2–3 students per question · Prompt follow-up: "How do you know?" · Connect answers to the definitions on the previous slides
Franklin High School · EPISD
9 / 18
⚡ Franklin Tech Lab
PART 2 OF 2
§130.302(c)(9)(F)
// PART 2 OF 2  ·  §130.302(c)(9)(F)
FLOWCHARTS
The visual language of algorithms — how developers, architects, and IT professionals draw out logic before writing a single line of code.
COVERS: 6 Standard Symbols · Reading a Flowchart · Drawing One · Software vs. Computer Architecture Use · Track Connections
Franklin High School · EPISD
10 / 18
⚡ Franklin Tech Lab
PART 2 — FLOWCHART SYMBOLS
§130.302(c)(9)(F)
// 6 STANDARD SYMBOLS — MEMORIZE THESE
OVAL
Start / End (Terminal)
Every flowchart begins and ends with an oval. Contains the word "Start" or "End".
RECTANGLE
Process
An action or instruction the program performs. Calculate, assign, update, display.
DIAMOND
Decision
A yes/no or true/false question. Always has two exit arrows — one for each answer.
PARALLELOGRAM
Input / Output
Data entering or leaving the system. Keyboard input, screen display, file read/write.
ARROW
Flow Line
Shows the direction the algorithm moves. Connects every symbol in the chart.
CYLINDER
Database / Storage
Represents stored data — a database, file, or persistent storage that the algorithm reads from or writes to.
Franklin High School · EPISD
11 / 18
⚡ Franklin Tech Lab
PART 2 — READING A FLOWCHART
§130.302(c)(9)(F)
// HOW TO READ ANY FLOWCHART
Every flowchart tells a story. Follow these rules and you can read any algorithm visually — even before you understand the code behind it.
  • Always start at the oval marked "Start." There is only one entry point.
  • Follow the arrows. Arrows define sequence — you cannot skip ahead or go backward unless an arrow explicitly takes you there.
  • At every diamond, make a decision. Read the question. Take the YES path or the NO path. Never both.
  • Rectangles tell you what the program does. Read each one as an instruction: "calculate," "store," "display."
  • Parallelograms tell you what goes in or comes out. User types a value → parallelogram. Screen shows a result → parallelogram.
  • Cylinders mean the algorithm is talking to a database. Reading a record or writing one.
  • Stop when you reach the oval marked "End." If you never reach it, the algorithm has a loop — that is intentional or a bug.
Franklin High School · EPISD
12 / 18
⚡ Franklin Tech Lab
PART 2 — WHERE FLOWCHARTS ARE USED
§130.302(c)(9)(F)
// TWO CONTEXTS — SAME TOOL, DIFFERENT SCALE
IN SOFTWARE DEVELOPMENT
Developers draw flowcharts before writing code to plan the logic of a program. It is much cheaper to fix a logic error in a flowchart than in 500 lines of code.
  • Login validation flow
  • Game win/lose condition logic
  • E-commerce checkout process
  • Database query decision path
Track 1 ConnectionYour final website project will have logic — what happens when a user searches, when a form is submitted, when a database query returns no results. Flowcharts help you plan that before writing JavaScript.
IN COMPUTER ARCHITECTURE
Engineers use flowcharts to map how data moves through hardware components — from input devices through the CPU, memory, and storage, to output.
  • CPU instruction execution cycle
  • BIOS boot sequence
  • Memory read/write operation
  • Network packet routing path
Track 2 ConnectionWhen you diagnose a bad PC build, you are following a decision flowchart: Is power reaching the board? → Is the CPU seated correctly? → Is the RAM in the right slots? Flowcharts are diagnostic tools for IT technicians.
Franklin High School · EPISD
13 / 18
⚡ Franklin Tech Lab
PART 2 — ALGORITHM TO FLOWCHART
§130.302(c)(9)(F)
// SAME ALGORITHM — THREE REPRESENTATIONS
A login validation algorithm can be written as plain English, pseudocode, or a flowchart. All three say the same thing — the format changes, not the logic.
// Plain English
1. Ask the user for a username and password.
2. Check if they match a record in the database.
3. If they match, grant access.
4. If they don't match, show an error and ask again.
5. After 3 failed attempts, lock the account.
// Pseudocode
INPUT username, password
attempts = 0
WHILE attempts < 3:
 IF check_db(u,p) = TRUE:
  GRANT access
  END
 ELSE:
  OUTPUT "Error"
  attempts += 1
LOCK account
// Flowchart describes
Oval: Start
Parallelogram: Input username & password
Cylinder: Check database record
Diamond: Credentials match?
 → YES: Rectangle: Grant access → Oval: End
 → NO: Rectangle: Increment attempts
Diamond: Attempts < 3?
 → YES: Loop back to input
 → NO: Rectangle: Lock account → End
Franklin High School · EPISD
14 / 18
⚡ Franklin Tech Lab
PART 2 — COLD CALL CHECK
§130.302(c)(9)(F)
// THINK — THEN BE READY TO ANSWER
"In a flowchart, a diamond always has two exit arrows. What do those two arrows represent — and what happens to the algorithm if a diamond only has one exit arrow?"
"You're building a Track 2 PC compatibility checker. A user enters a CPU model and the tool tells them if it fits their motherboard socket. Draw in your notebook: what three symbols would appear in that flowchart, in what order, and what would the diamond's question be?"
"When would you see a cylinder in a flowchart? Give one example from Track 1 and one from Track 2."
Track 1: database query for streaming catalog · Track 2: BIOS firmware read from storage chip
Franklin High School · EPISD
15 / 18
⚡ Franklin Tech Lab
VOCABULARY — CIPHER PREVIEW
§130.302(c)(9)(E)(F)
// 8 TERMS YOU WILL DECODE IN THE LAB — CHOOSE YOUR DIFFICULTY LEVEL
Cadet (Caesar +4) · Specialist (Atbash reverse alphabet) · Elite (Keyword cipher)
01ALGORITHM🔒
02FLOWCHART🔒
03LINEAR🔒
04ITERATIVE🔒
05DECISION🔒
06SEQUENCE🔒
07PSEUDOCODE🔒
08CONDITION🔒
Franklin High School · EPISD
16 / 18
⚡ Franklin Tech Lab
NOW — OPEN THE LAB ACTIVITY
§130.302(c)(9)(E)(F)
// FRANKLIN TECH LAB — STEPS
  • Pick up your printed worksheet from Mr. Moreno before you sit down.
  • Open Chrome or Edge on your lab computer.
  • Open today's Franklin Tech Lab activity.
  • Log in with username, Student ID, and period.
  • Choose your cipher level: Cadet · Specialist · Elite. Your choice is recorded on your score sheet.
  • Complete all sections: Vocabulary → Multiple Choice → Flowchart Match.
  • Screenshot or print score sheet → submit to Schoology.
// EXIT TICKET — WAYGROUND
After the Lab Open Wayground and complete the exit ticket. 6 questions — MC and True/False. This is a grade. 7 minutes.
Today's Closing Task Decode vocabulary terms, identify algorithm properties and flow types, and correctly match all 6 flowchart symbols to their names and functions.
Track commitment deadline: TODAY — April 1, 2026
Franklin High School · EPISD
17 / 18
⚡ Franklin Tech Lab
EXIT TICKET — WAYGROUND
§130.302(c)(9)(E)(F)
// 6 QUESTIONS · 7 MINUTES · COUNTS AS A GRADE
// MULTIPLE CHOICE (Q1–Q4)
  • Q1: Which property requires every algorithm to end?
  • Q2: A loop that repeats based on a condition is called ___.
  • Q3: Which flowchart symbol represents a yes/no decision?
  • Q4: What does a parallelogram represent in a flowchart?
// TRUE OR FALSE (Q5–Q6)
  • Q5: A flowchart can only have one diamond (decision) shape. [False]
  • Q6: An algorithm that never ends is still a valid algorithm as long as it is ordered. [False]
After Wayground Submit your score screenshot to Schoology → Period Folder → Week 2 Exit Ticket. You're done for today.
Franklin High School · EPISD
18 / 18
🏠 Home
🖥️ Presentation
⚗️ Lab Activity