Percent Increase and Decrease Quiz - Page 5
130+ results
Filters
Grade
Subject
Format
Resource type
Standard
Language
Programs & methods
Supports
Hash Tables Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how constant-time data access is achieved using Hash Tables, one of the most powerful and widely used data structures in computer science. Learners understand how keys are transformed into addresses, why collisions occur, and how different collision-resolution strategies work in practice—the same principles used in databases, compilers, and caching systems. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Hash Table is and why
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Algorithm Analysis & Design | Brute Force and Exhaustive Search Complete Lesson
This lesson provides a complete foundation in Brute Force and Exhaustive Search within Algorithm Analysis and Design, covering brute-force strategy, selection sort, bubble sort, linear (sequential) search, brute-force string matching, and exhaustive search for optimization problems including Traveling Salesman Problem, Knapsack Problem, and Assignment Problem. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Brute Force Slide Deck (PPT + PDF)💡 Full Exhaustive Search Slide Deck (PPT +
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
How Convolutional Neural Networks Work and See Images Complete Lesson
This lesson helps students understand HOW CNNs interpret images mathematically and visually, using clear diagrams, X/O image examples, filter matrices, and step-by-step convolution walkthroughs. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full How CNNs Work & See Images Slide Deck (PPT + PDF)💡 Visual CNN architecture diagrams💡 Step-by-step convolution and filtering visuals💡 Worked image-to-feature-map examples💡 Ready for in-person, online, or hybrid classrooms────────── ⋆⋅☆⋅⋆ ───
11th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Priority Queue Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how priority-based data processing works, showing how elements are stored, ordered, and removed based on priority rather than insertion order. Learners understand why priority queues are essential in real systems and how they are implemented using linked lists and heaps, including a full C++ template-based implementation. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Priority Queue is and why it’s used ✏️ Difference between a
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Algorithm Analysis & Design: Limits, Growth Rates & Runtime Analysis
This lesson provides a complete foundation in Orders of Growth within Algorithm Analysis and Design, covering relative rates of growth, logarithmic, polynomial, exponential and factorial functions, limits-based comparisons, L’Hôpital’s Rule, Stirling’s Formula, and Big-O classifications. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Orders of Growth Slide Deck (PPT + PDF)💡 Growth comparison graphs and figures💡 Worked mathematical examples using limits💡 Algorithm runtime estimat
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Algorithm Analysis & Design: Mathematical Analysis of Recursive Algorithms
This lesson provides a complete, concept-clear foundation in the Mathematical Analysis of Recursive Algorithms, covering recurrence relations, basic operation counting, forward and backward substitution, and mathematical evaluation of recursive algorithm efficiency. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Mathematical Analysis of Recursive Algorithms Slide Deck (PPT + PDF)💡 Worked recursive algorithm examples💡 Forward and backward substitution solutions💡 Operation-count
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Merge Sort Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how efficient sorting works at scale using Merge Sort, a classic divide-and-conquer algorithm known for its consistent performance. Learners clearly see how an array is recursively divided, how sorted subarrays are merged, and why Merge Sort outperforms basic sorting algorithms—all supported by a complete C++ implementation. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What Merge Sort is and why it’s efficient ✏️ The Divide & C
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Binary Search Complete Lesson | Operations, Diagrams & Examples Included
This lesson teaches students how efficient searching works by contrasting sequential search with binary search, showing why sorted data enables dramatically faster lookups. Learners clearly see how search space is reduced by half at every step, how indices move during execution, and how binary search achieves logarithmic performance—all supported by a complete C++ program. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What searching algorithms are and why they
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Bubble Sort complete Lesson | Operations, Diagrams & Examples included
This lesson introduces students to how sorting works at the most fundamental level, using Bubble Sort to show how comparisons and swaps gradually bring order to data. Learners clearly see how values move step by step, why multiple passes are required, and how sorting algorithms operate internally—supported by a simple, complete C++ program. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What sorting is and why it’s important ✏️ Core idea behind Bubble Sort✏️ How
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Evaluating Postfix Expression | Operations, Diagrams & Examples included
This lesson shows students how expressions are actually evaluated by computers by breaking down prefix, infix, and postfix notation and implementing a complete postfix expression evaluator using stacks in C++. Instead of memorizing rules, learners see how operator precedence disappears in postfix form and how stacks power real expression evaluation step by step. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ Difference between infix, prefix, and postfix expressio
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Routing Fundamentals & Static Routing | CCNA 200-301 and Networking Lessons
This lesson is on Routing Fundamentals & Static Routing. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it introduces the core concepts of routing and explains how routers determine the best path for data to travel across networks. The lesson also covers static routing, demonstrating how to manually configure routes to control network traffic and ensure reliable communication between devices, helping learners build a solid foundation
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Test-Taking Strategies for Multiple Choice Exams for MS & HS Students
Looking for a no-prep ready-to-go lesson you can run with minimal prep? This Test-Taking Strategies lesson is designed for middle and high school classrooms and can be led easily by the teacher. Students follow along with guided slides, take notes, and practice strategies that improve accuracy on multiple-choice questions—no extra setup required. This resource has been updated in January 2026 with additional pages for the teacher lesson plans and handouts for students. This 30–40 minute lesson h
6th - 12th
ELA Test Prep, For All Subjects, Math Test Prep
CCSS
RI.8.4
, CCRA.R.1
, CCRA.R.4
+1
IPv4 Addressing (Part 2) | CCNA 200-301 Prep and Networking Lessons
This lesson is on IPv4 Addressing (Part 2). Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it provides a deeper understanding of IPv4 addressing through a review and clarification of IP address classes. The lesson guides learners step-by-step on how to determine the maximum number of hosts, network address, broadcast address, first usable address, and last usable address for a given network, helping them strengthen their subnetti
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Virtual Local Area Networks Part 1 | CCNA 200-301 Prep and Networking Lessons
This lesson is on VLANs (Virtual Local Area Networks) – Part 1. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it covers the fundamentals of VLANs, including what a LAN is, broadcast domains, the definition and purpose of VLANs, and how to configure VLANs on Cisco switches. Learners will understand how VLANs segment networks for improved performance, security, and management, forming the foundation for advanced switching concepts. ◇◆
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
OSPF Part-3 | CCNA 200-301 Prep and Networking Lessons
This lesson is on Open Shortest Path First (OSPF) – Part 3. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it covers OSPF network types, OSPF neighbor and adjacency requirements, and OSPF Link-State Advertisement (LSA) types. Students will learn how OSPF functions across different network topologies, the conditions required to form adjacencies, and how LSAs share routing information to maintain an accurate and efficient network topolog
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Virtual Local Area Networks Part 3 | CCNA 200-301 Prep and Networking Lessons
This lesson is on VLANs (Virtual Local Area Networks) – Part 3. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it covers advanced VLAN topics including Native VLAN configuration on a router, Wireshark traffic analysis, and Layer 3 (Multilayer) Switching. Learners will explore how routing between VLANs operates, how to analyze VLAN traffic, and how multilayer switches integrate routing and switching for high-performance enterprise netw
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Virtual Local Area Networks Part 2 | CCNA 200-301 Prep and Networking Lessons
This lesson is on Virtual Local Area Networks (VLANs) – Part 2. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it covers advanced VLAN concepts including what trunk ports are, the purpose of trunk ports, 802.1Q encapsulation, how to configure trunk ports, and Router on a Stick (ROAS). Learners will understand how VLANs communicate across multiple switches and routers, enabling inter-VLAN connectivity and efficient network segmentat
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Virtual Local Area Networks Part 2 | CCNA 200-301 Prep and Networking Lessons
This lesson is on Virtual Local Area Networks (VLANs) – Part 2. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it covers advanced VLAN concepts including what trunk ports are, the purpose of trunk ports, 802.1Q encapsulation, how to configure trunk ports, and Router on a Stick (ROAS). Learners will understand how VLANs communicate across multiple switches and routers, enabling inter-VLAN connectivity and efficient network segmentat
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Life of a Packet | CCNA 200-301 Prep and Networking Lessons
This lesson is on Life of a Packet. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it explains how a data packet travels through a network, from the moment it leaves the source device until it reaches its destination. The lesson clearly illustrates each stage of the process, including encapsulation, addressing, routing, and delivery, helping learners understand how information moves efficiently and securely across networks. ◇◆◇◆◇◆◇
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
Switch Interfaces | CCNA 200-301 Prep and Networking Lessons
This lesson is on Switch Interfaces. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, or CompTIA Network+), it explains the different types of interfaces found on network switches and their functions. The lesson covers topics such as access ports, trunk ports, and management interfaces, helping learners understand how switches connect and communicate with other devices, manage traffic within a network, and support efficient network design and configuration
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
IPv6 Part 2 | CCNA 200-301 Prep and Networking Lessons
This lesson is on IPv6 – Part 2. Ideal for ICT, Computer Science, Networking, or certification prep (CCNA, CompTIA Network+, or CCNP), it continues from Part 1 with a deeper look into IPv6 address configuration, including Modified EUI-64 address generation, and explains the different IPv6 address types such as Global Unicast, Unique Local, Link-Local, Multicast, and other specialized addresses used in modern IPv6 networks. ◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆ Things we’ll coverIPv6 address configurati
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: The Ultimate CCNA & Networking BUNDLE [ From Zero to Network Pro ]
AP® U.S. History Period 8 Topic 8.8: The Vietnam War Lecture & Activity
This AP U.S. History Period 8.8 Vietnam War Lesson Materials resource is designed to help teachers deliver a focused, engaging, and classroom-ready lesson on one of the most important topics in Period 8. This set includes materials that pair with your Vietnam War lecture slides and gives students structured opportunities to stay engaged, think critically, and process key historical developments throughout the lesson. The resource is built to support both teacher-led instruction and active studen
9th - 12th
Asian Studies, U.S. History, World History
AP® U.S. History Period 8 Topic 8.2: Early Cold War Lecture, Slides, & Activity
Bring Period 8.2 to life with this engaging AP U.S. History Early Cold War lesson designed to help students understand the major developments from 1945–1953. This resource gives you a strong combination of direct instruction, note-taking support, and historical thinking practice so students can build both content knowledge and argument skills. The included materials center on the origins of the Early Cold War and feature a competing perspectives activity on Hiroshima and Nagasaki, making this le
9th - 12th
U.S. History
Algorithm Analysis and Design: Foundations, GCD Algorithms & Numerical Methods
This lesson provides a complete foundation in GCD Algorithms and Numerical Methods, covering Euclid’s Algorithm, the Middle-School GCD algorithm, time complexity analysis, and numerical root-finding using the Newton–Raphson method. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full GCD Algorithms & Numerical Methods Slide Deck (PPT + PDF)💡 Worked GCD examples💡 Time complexity comparisons💡 Newton–Raphson numerical method walkthroughs💡 Ready for in-person, online, or hybrid classroo
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Showing 97-120 of 130+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands