Percent Increase and Decrease Quiz - Page 4
110+ results
Filters
Grade
Subject
Format
Resource type
Standard
Programs & methods
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
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 ]
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 ]
Showing 73-96 of 110+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands