Percent Increase and Decrease Quiz - Page 5
140+ results
Filters
Grade
Subject
Format
Resource type
Standard
Language
Programs & methods
![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
AVL Tree Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how self-balancing trees work by breaking down AVL Trees from concept to full C++ implementation. Perfect For Data Structures & Algorithms, C++ Programming, Computer Science & ICT Lessons. Learners see why ordinary BSTs degrade into linked lists, how height imbalance is detected, and how rotations restore balance automatically—ensuring fast search, insertion, and deletion at all times. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Streams and File Handling Complete Lesson | Object Oriented Programming ( C++ )
This lesson introduces students to Streams and File Handling in C++. It is designed for AP Computer Science, Intro to C++, Object-Oriented Programming, College CS1/CS2, homeschool advanced programming, and coding bootcamps. ────────── ⋆⋅☆⋅⋆ ────────── ✨✨ What Students Will Learn ✨✨ ✔ Stream Classes (istream, ostream, iostream) ✔ Stream Hierarchy & Inheritance ✔ ios Base Class & Stream Buffer ✔ Input and Output Stream Functions ✔ Disk File I/O with ifstream, ofstream, fstream ✔ Formatted File
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Analysis of Algorithm Complete Lesson | Operations, Diagrams & Examples Included
This lesson teaches students how to think about algorithm efficiency, not just how to code. Learners understand why some solutions scale and others fail, and how to compare algorithms independent of hardware, language, or input data. It moves from intuition to rigor—bridging real program timing with mathematical analysis—so students can predict performance before implementation. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What an algorithm is vs a program vs
10th - 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
Database Security and Access Control Full Lesson | Database Management System
This is a Complete lesson on Database Security and Access Control, covering authentication, authorization, access control, encryption, auditing, and real-world security risks. Ideal for Computer Science, ICT, IT Fundamentals, Database Systems, and AP CS–aligned courses. Designed to help students understand HOW databases protect sensitive data from unauthorized access, using real MySQL commands, security scenarios, and industry-aligned best practices. ────────── ⋆⋅☆⋅⋆ ────────── What’s In
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Queue Complete Lesson | Operations, Diagrams & Examples Included
This lesson gives students a clear, practical understanding of the Queue data structure, showing how FIFO systems work, how queues are implemented, and where they are used in real computing systems. Learners see queues as both a concept and a working C++ implementation, removing confusion around insertion/removal rules, memory limits, and design choices. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ️✏️ What a Queue is and why it exists ✏️ The FIFO (First In, Fir
10th - 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
Stored Procedures and Functions Complete Lesson | Database Management System
This lesson provides a complete foundation on Stored Procedures and Functions in MySQL, covering procedure creation, parameters, execution, functions, and real-world database logic implementation. Ideal for Computer Science.Designed to help students understand HOW logic is stored, reused, and secured inside the database, using clear syntax, step-by-step examples, and realistic employee-database scenarios. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Stored Procedures and Functions
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
SQL Constraints and Indexing Complete Lesson | Database Management System
This lesson provides a complete understanding of SQL Constraints and Indexing, covering data integrity rules, database keys, constraint types, cascading actions, and performance optimization using indexes.Designed to help students understand HOW databases enforce correctness and improve performance, using real-world table designs, full SQL examples, and practical integrity-violation scenarios. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full SQL Constraints and Indexing Slide Deck💡 D
10th - 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
Database Design and Normalization Complete Lesson | Database Management System
This lesson provides a complete foundation in Database Design and Normalization, covering data redundancy, functional dependencies, normalization forms (1NF–BCNF), and real-world design decisions. Designed to help students understand WHY good database design matters before writing SQL, using clear tables, step-by-step decompositions, and exam-ready normalization examples. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Database Design & Normalization Slide Deck💡 Detailed Teacher No
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Backup and Recovery Complete Lesson | Database Management System
This lesson provides a complete foundation in Database Backup and Recovery, covering backup types, recovery techniques, mysqldump usage, automation, and disaster recovery planning. Ideal for Computer Science, ICT, IT Fundamentals, Database Systems, and AP CS–aligned courses. Designed to help students understand HOW databases protect data from loss and ensure availability, using real MySQL commands, step-by-step backup and restore workflows, and business-ready disaster recovery examples.
10th - 12th, 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
Huffman’s Algorithm Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how real-world data compression works by walking through Huffman’s Algorithm from concept to full C++ implementation. Learners see how character frequencies drive compression, how a binary tree is constructed using a priority queue, and how variable-length binary codes are generated—exactly the techniques used in text compression and image formats like JPEG. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What Huffman Coding is and w
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
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
Linked Lists Complete Lesson | Operations, Diagrams & Examples included
This lesson gives students a clear, practical understanding of Linked Lists by showing how they are built, how they work in memory, and how they are used in real systems. Perfect For Data Structures & Algorithms, C++ Programming, Computer Science and ICT. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ Problem with Sequential Memory Allocation in Arrays✏️ Key Advantages of Linked Lists✏️ Types of Linked Lists✏️ Creating and Managing Linked Lists in C++✏️ Defining
10th - 12th, Adult Education, 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
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
Stem cells and cell differentiation — Cells, DNA & Genetics (Grades 6–8)
🧪 Help students connect DNA and heredity to real-world traits with standards-based questions and thoughtful prompts. 📌 **Topics Included:** • Stem cells and cell differentiation • Enzymes as proteins • Multiple alleles and blood types • Speciation and genetics • Cells dna and genetics big picture review • Dna repair mechanisms • Sex determination and chromosomes • Genetics and cell cycle control • Genetics and evolution integration review • Genetic feedback mechanisms ⭐ **Perfect For:** • Bell
6th - 8th
Anatomy, Biology, Other (Science)
Showing 97-120 of 140+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands