Percent Increase and Decrease Quiz - Page 3
84+ results
Filters
Grade
Subject
Format
Resource type
Programs & methods
CSS Step-by-Step Complete Curriculum | Exercises, Activities & Projects Included
This step-by-step CSS curriculum takes students from zero styling knowledge to building responsive, modern layouts with confidence. Built for teachers who want structure, progression, and hands-on practice, this course removes confusion and delivers clear visuals, real examples, and practice at every level. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included💡 Complete CSS Curriculum Slide Deck (PPT + PDF) 💡 7 structured learning levels (beginner → advanced) 💡 Clear diagrams, visuals, and real bro
8th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Object Oriented Programming (OOP) and Exception Handling in python Programming
This lesson delivers a complete, structured introduction to Object-Oriented Programming in Python, combined with error handling, exceptions, multithreading, generators, and core standard libraries. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included💡 Full OOP and Exception Handling slide deck 💡 Step-by-step Python code examples 💡 Real-world class, inheritance, and polymorphism scenarios 💡 Practical error handling and debugging examples 💡 Advanced topics presented in a structured, teachable flow
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Python Programming Loops, Functions, Modules & Packages Step-by-Step Curriculum
This lesson provides a clear, structured continuation of Python fundamentals, focusing on loops, functions, modules, and packages through step-by-step explanations and real Python examples. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included💡 Complete slide deck on loops, functions, modules, and packages 💡 Multiple worked Python examples and practice-style code 💡 Real-world programs (prime check, Fibonacci, guessing game, tables) 💡 Clear progression from basics to reusable, modular code 💡 Ready
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Sorting Algorithms II: Counting Sort, Radix Sort, and Merge Sort with Algorithm
This lesson provides a complete foundation in advanced Sorting Algorithms, covering Counting Sort, Radix Sort, and Merge Sort, including step-by-step execution, divide-and-conquer strategy, non-comparison sorting, and time complexity analysis. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Sorting Algorithms II Slide Deck (PPT + PDF) 💡 Step-by-step visual sorting diagrams💡 Python code implementations💡 Worked sorting examples and traces💡 Ready for in-person, online, or hybrid
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Data Models and ER Diagram Model complete Lesson | Database Management System
This lesson provides a complete, concept-clear foundation on Data Models and the Entity-Relationship (ER) Diagram Model, covering data modeling concepts, ER components, keys, relationships, and cardinality constraints. Designed to help students understand HOW databases are planned and structured before implementation, using clear diagrams, symbols, and real-world modeling examples. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Data Models & ER Diagram Slide Deck💡 Detailed Teacher
9th - 12th, Higher Education
Computer Science - Technology, Instructional Technology
Pattern Searching Algorithms Lesson | Operations, Diagrams & Examples included
This lesson provides a complete foundation in Pattern Searching Algorithms, covering naive pattern searching techniques and regular expressions for text matching, with step-by-step pattern comparisons and Python implementations. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Pattern Searching Algorithms Slide Deck💡 Visual step-by-step pattern matching diagrams💡 Python code implementations💡 Worked pattern matching examples💡 Ready for in-person, online, or hybrid classrooms────
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Searching Algorithms Lesson: Linear, Binary, Jump & Interpolation Search
This lesson provides a complete foundation in Searching Algorithms, covering Linear Search, Binary Search, Jump Search, and Interpolation Search, including step-by-step execution, Python implementations, and time complexity analysis. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Searching Algorithms Slide Deck💡 Visual step-by-step search diagrams💡 Python code implementations💡 Exam-style search problems💡 Ready for in-person, online, or hybrid classrooms────────── ⋆⋅☆⋅⋆ ─────
8th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
![Preview of SQL Joins and Views Complete Lesson | Database Management System [DBMS]](https://ecdn.teacherspayteachers.com/cdn-cgi/image/format=avif,quality=70,width=525,height=525,onerror=redirect/thumbitem/Joins-and-View-Complete-Lesson-Database-Management-System-15107264-1766320897/750f-15107264-1.jpg)
SQL Joins and Views Complete Lesson | Database Management System [DBMS]
This lesson provides a complete understanding of SQL Joins and Views, covering all major join types, advanced join scenarios, UNION operations, and SQL views for data presentation and security. Ideal for Computer Science, ICT, IT Fundamentals, Database Systems, and AP CS–aligned courses. Designed to help students understand HOW data from multiple tables is combined and presented in real databases, using clear diagrams, real-world table examples, and fully worked SQL queries. ────────── ⋆⋅☆⋅
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Binary Search Tree Complete Lesson | Operations, Diagrams & Examples included
This lesson gives students a deep, practical understanding of Binary Search Trees, showing how ordered data is stored, searched, traversed, and modified efficiently using a full C++ implementation. Learners move beyond diagrams to see exact algorithms in action—including searching, traversal strategies, and the hardest operation: deletion—building confidence with one of the most important non-linear data structures. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Heap Data Structure Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how priority-based data structures work internally by breaking down the Heap data structure from concept to full C++ implementation. Learners see how heaps maintain order efficiently, why they are stored as arrays, and how insertion and deletion automatically preserve the heap property—the same logic used behind priority queues and scheduling systems. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Heap is and why it’s used ✏️
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
![Preview of Introduction To Data Structures, Algorithms & Dynamic Array [ Includes C++ ]](https://ecdn.teacherspayteachers.com/cdn-cgi/image/format=avif,quality=70,width=525,height=525,onerror=redirect/thumbitem/Introduction-To-Data-Structures-Algorithms-Dynamic-Array-Includes-C--15078860-1768712090/750f-15078860-1.jpg)
Introduction To Data Structures, Algorithms & Dynamic Array [ Includes C++ ]
This lesson gives learners the mental framework behind why data structures exist, when to use each one, and how to implement them correctly . Perfect For Programming, Coding, Computer Science & ICT classes ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨✏️What data structures are — and why they exist✏️How data organization impacts speed and memory✏️How to choose the right data structure for a problem ✏️Arrays vs Dynamic Arrays — when fixed size fails✏️Array vs Linked
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Computer Science Lesson on Operating System Basics, Types & System Structure
This Curriculum introduces students to the foundations of how computer systems work and how operating systems function. Perfect for ICT, Computer Science, Software Engineering, Networking programs, Diploma/TVET learners, university CS1/CS2 courses, and OS theory classes. This lesson provides clear explanations, diagrams, system architecture visuals, OS history, memory layouts, system types, and real-world examples to help students build a solid conceptual understanding of Operating Systems bef
6th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Introduction to Algorithms: Analysis, Design, Time & Space Complexity and Python
This lesson provides a complete, beginner-friendly introduction to Algorithms, covering algorithm concepts, analysis and design, time and space complexity, algorithm vs pseudocode, major algorithm types, and Python tools (Anaconda, Jupyter, Spyder). ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Introduction to Algorithms Slide Deck (PPT + PDF)💡 Clear visual explanations and diagrams💡 Pseudocode examples💡 Python-based algorithm lab overview💡 Ready for in-person, online, or hybrid
8th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
Doubly Linked List Complete Lesson | Operations, Diagrams & Examples included
This lesson gives students a clear, practical understanding of Doubly Linked Lists, showing how bidirectional data structures work internally and how they are implemented correctly in C++ using dynamic memory and pointers. Learners move beyond theory to see exactly how nodes are connected, updated, and removed, building confidence with pointer-heavy data structures that often confuse students. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Doubly Linked Li
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Algorithm Analysis & Design: Time Complexity and Asymptotic Notations
This lesson provides a complete, concept-clear foundation in Time Complexity and Asymptotic Notations, covering performance analysis, worst-case, best-case, and average-case analysis, Big O, Big Ω, Big Θ notations, and orders of growth. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Time Complexity and Asymptotic Notations Slide Deck (PPT + PDF)💡 Growth comparison graphs💡 Worked Big-O example problems💡 Algorithm analysis case studies💡 Ready for in-person, online, or hybrid cla
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: 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
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
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 ]
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 ]
Showing 49-72 of 84+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands