TPT
Total:
$0.00

Percent Increase and Decrease Quiz - Page 3

105+ results
Filters
Standard
Preview of Data Models and ER Diagram Model complete Lesson  | Database Management System

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
Preview of Pattern Searching Algorithms Lesson | Operations, Diagrams & Examples included

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────
Preview of Searching Algorithms Lesson: Linear, Binary, Jump & Interpolation Search

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────────── ⋆⋅☆⋅⋆ ─────
Preview of Android App UI Design Made Easy  | With Complete XML Layouts & Kotlin Projects

Android App UI Design Made Easy | With Complete XML Layouts & Kotlin Projects

This lesson teaches students how to design User Interfaces (UI) in Android applications using XML layouts and Kotlin code. Learners explore essential Android layouts, UI components, best practices, and complete hands-on examples including LinearLayout UIs, RelativeLayout and ConstraintLayout designs, TableLayout form creation, a fully functional BMI Calculator app, and a Simple Calculator app built using GridLayout and Kotlin event handling. ────────── ⋆⋅☆⋅⋆ ────────── 📦 What’s Included St
Preview of Analysis of Algorithms I Complete Lesson  | Algorithm Analysis and Design

Analysis of Algorithms I Complete Lesson | Algorithm Analysis and Design

This lesson covers time complexity, asymptotic analysis, Big O, Θ, Ω notations, growth orders, and algorithm efficiency evaluation. Ideal for Computer Science, ICT, IT Fundamentals, AP CS, and introductory Data Structures courses, with slides, teacher guide, assessments, and answer keys included. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Analysis of Algorithms I Slide Deck💡 Detailed Teacher Guide & Teaching Script💡 Complete Assessment Test💡 Full Answer Key💡 Worked algorit
Preview of CheckBox, RadioButton, Dialogs, Snackbar & Spinner with  XML + Kotlin Examples

CheckBox, RadioButton, Dialogs, Snackbar & Spinner with XML + Kotlin Examples

This is a lesson on Advanced Android UI Components and User Notifications. It takes students beyond basic layouts and teaches them how to build interactive, user-friendly app interfaces using CheckBox, RadioButton, RadioGroup, Toasts, Custom Toasts, Snackbars, AlertDialogs, List Dialogs, Custom Dialogs, and Spinners. ────────── ⋆⋅☆⋅⋆ ────────── 📦 What’s Included Ready-to-teach lesson slides on Advanced Android UI Components Complete XML layout files for every UI component Fully written Kot
Preview of SQL Joins and Views Complete Lesson | Database Management System [DBMS]

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. ────────── ⋆⋅☆⋅
Preview of Binary Search Tree Complete Lesson  | Operations, Diagrams & Examples included

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 ✨✨ ✏️
Preview of AVL Tree Complete Lesson | Operations, Diagrams & Examples included

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 ✨✨ ✏️
Preview of Analysis of Algorithm Complete Lesson | Operations, Diagrams & Examples Included

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
Preview of Heap Data Structure Complete Lesson | Operations, Diagrams & Examples included

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 ✏️
Preview of Database Security and Access Control Full Lesson | Database Management System

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
Preview of Queue Complete Lesson | Operations, Diagrams & Examples Included

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
Preview of SQL Constraints and Indexing Complete Lesson  | Database Management System

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
Preview of Computer Science Lesson on Operating System Basics, Types & System Structure

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
Preview of Database Design and Normalization Complete Lesson | Database Management System

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
Preview of Introduction to Algorithms: Analysis, Design, Time & Space Complexity and Python

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
Preview of Huffman’s Algorithm Complete Lesson | Operations, Diagrams & Examples included

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
Preview of Doubly Linked List Complete Lesson | Operations, Diagrams & Examples included

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
Preview of The War That Saved My Life | STEAM Activities & Project-Based Learning

The War That Saved My Life | STEAM Activities & Project-Based Learning

The War That Saved My Life | STEAM Activities & Project-Based LearningPrintable & Digital | Grades 5–7 | 44 Pages | Teacher Guides IncludedThis hands-on extension resource brings the historical setting of The War That Saved My Life into focus through 5 engaging, cross-curricular STEAM and project-based learning activities. Students explore art, math, science, engineering, and technology while making real-world connections to World War II. Each project includes a teacher guide and student ha
Preview of Algorithm Analysis & Design: Time Complexity and Asymptotic Notations

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
Preview of Hash Tables Complete Lesson | Operations, Diagrams & Examples included

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
Preview of Algorithm Analysis & Design | Brute Force and Exhaustive Search Complete Lesson

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 +
Preview of How Convolutional Neural Networks Work and See Images Complete Lesson

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────────── ⋆⋅☆⋅⋆ ───
Showing 49-72 of 105+ results