Percent Increase and Decrease Quiz - Page 4
110+ results
Filters
Grade
Subject
Format
Resource type
Standard
Programs & methods
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
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
Binary Expression Tree Complete Lesson| Operations, Diagrams & Examples included
This lesson shows students how mathematical expressions are represented, evaluated, and traversed using trees, turning abstract expressions into working data structures with a complete C++ implementation. Learners see how operands and operators form a binary tree, how expressions are constructed from postfix notation using stacks, and how different traversals produce prefix, infix, and postfix expressions—exactly how compilers and calculators work internally. ────────── ⋆⋅☆⋅⋆ ──────────
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Complete Lesson on Linux System, C Programming, Processes & System Internals
This is a complete introductory lesson on Linux System Programming. Perfect for Computer Science, Linux Administration, Programming, Operating Systems, C Programming, DevOps fundamentals, and technical training programs across high school, college, university, and professional settings. The lesson includes easy-to-follow explanations, command demonstrations, configuration steps, system utilities, hands-on examples, and a practical assignment, making it fully ready for direct classroom use. ──
9th - 12th, Adult Education, 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
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
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
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
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
Getting started with neural networks using Keras and Tensorflow | Deep Learning
This resource is a complete lesson on Getting Started with Neural Networks using Keras and TensorFlow, perfect for Machine Learning, Deep Learning, Artificial Intelligence, Data Science, and advanced ICT or Computer Science courses. The lesson introduces students to the structure of neural networks, how layers and models work, the role of loss functions and optimizers, the relationship between TensorFlow and Keras, and how to set up a practical deep learning workspace. It also includes hands-
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
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
Stacks in Data Structures Lesson | Operations, Diagrams & Examples Included
This lesson gives students a clear and practical understanding of the Stack data structure, showing how stacks work, how they are implemented, and where they are used in real systems — using complete C++ examples, not abstract theory. Students learn stacks as both a concept and a working data structure, removing confusion around LIFO behavior, memory limits, and implementation choices. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Stack is and why it exi
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
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
A Beginner-Friendly Lesson on CNN Architecture, Layers & How They Work
This is a complete lesson on Convolutional Neural Networks (CNNs) — one of the most essential architectures in Deep Learning and Computer Vision. Perfect for Machine Learning, Artificial Intelligence, Data Science, Computer Science, and advanced ICT courses at the high school, college, university, or bootcamp level. The lesson explains what CNNs are, how they work, why they are powerful, and what each component does, supported with clear diagrams, real examples, architecture visuals, filter ex
9th - 12th, Adult Education, 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
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