Percent Increase and Decrease Quiz
10+ results
Filters
Subject
Format
Resource type
Audience
Programs & methods
Virtual Routing & Forwarding (VRF) | CCNA 200-301 Prep and Networking Lessons
This is a lesson on Virtual Routing & Forwarding (VRF). Perfect for teaching ICT, Computer Science, Networking, or certification prep (CCNA, CCNP, CompTIA Network+), it provides everything you need to explain, demonstrate, and reinforce how multiple routing tables can coexist on a single device to securely segment network traffic. ◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆ Things we’ll coverIntro to VRFVRF Configuration◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆◇◆ Formats Provided✯ PPTX (editable PowerPoint)✯ PDF (print-friendly v
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 ]
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
![Preview of Implementing Array List in Data Structures Complete Lesson [ C++ Included ]](https://ecdn.teacherspayteachers.com/cdn-cgi/image/format=avif,quality=70,width=525,height=525,onerror=redirect/thumbitem/Implementing-Array-List-Complete-Lesson-15097383-1768745700/750f-15097383-1.jpg)
Implementing Array List in Data Structures Complete Lesson [ C++ Included ]
This lesson teaches students how lists are actually implemented under the hood using arrays, showing how insertion, deletion, and access work at the memory level. Learners move beyond using built-in containers to building their own List data structure from scratch, understanding why operations cost time and how data shifting affects performance. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ️✏️What a List ADT is and why it’s used ✏️ How an Array List stores eleme
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Namespace Complete Lesson | Object Oriented Programming ( C++ )
This lesson introduces students to Namespaces 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 ✨✨ ✔ Purpose of Namespaces ✔ Defining a Namespace ✔ Using Scope Resolution (::) ✔ Calling Functions Inside a Namespace ✔ Using Multiple Namespaces ✔ The using Directive ✔ Classes Inside a Namespace ✔ Using Multiple Classes Within a
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Showing 1-10 of 10+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands