TPT
Total:
$0.00

Percent Increase and Decrease Quiz - Page 4

190+ results
Filters
Subject
Standard
Preview of Complete C Programming Lesson on Functions, Structures & Dynamic Memory

Complete C Programming Lesson on Functions, Structures & Dynamic Memory

This Curriculum introduces students to one of the most important foundations of programming: functions, variables, scope, memory layout, structures, typedef, pointers, pointer arithmetic, and dynamic memory allocation. Perfect for ICT, Computer Science, Programming Fundamentals, Software Engineering foundations, and CS1-level courses. This lesson includes clear explanations, diagrams, code examples, memory maps, structure modeling, pointer behavior demonstrations, and practical applications, m
Preview of Complete CS Lesson on OS Design, Processes, Threads, Deadlocks & Binary Systems

Complete CS Lesson on OS Design, Processes, Threads, Deadlocks & Binary Systems

This Curriculum introduces students to processes, process states, process control blocks, swapping, scheduling, context switching, threads, and CPU management. Perfect for ICT, Computer Science, Software Engineering, Operating Systems courses, Diploma/TVET programs, and university-level CS modules. This lesson uses clear diagrams, OS models, state-transition charts, tables, real-world examples, and step-by-step workflows to help students fully understand how processes operate within modern ope
Preview of Objects and Classes Complete Lesson  | Object Oriented Programming ( C++ )

Objects and Classes Complete Lesson | Object Oriented Programming ( C++ )

This lesson introduces students to Objects and Classes in C++, including constructors, destructors, function definitions, static members, objects as arguments, the default copy constructor, const correctness, and memory management. 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 ✨✨ ✔ What Classes & Objects Are ✔ UML Basics for Un
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 Life Science Bundle: Human Body, Animals, and Microbiology | Engineering | Keys

Life Science Bundle: Human Body, Animals, and Microbiology | Engineering | Keys

Life Science Bundle: Human Body, Animals, and MicrobiologyPrintable Biology Workbook Units with Activities, Assessments, and Answer Keys Help students connect biology concepts to the world around them through observation, analysis, reflection, data collection, and real-world application. This middle school life science and introductory biology bundle includes three complete workbook chapters from Dr. Christina Alston's Biology Before Biology: Part 2 — Biology in Action. Students explore the hu
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 Sorting Algorithm I Complete Curriculum  | Algorithm Analysis and Design

Sorting Algorithm I Complete Curriculum | Algorithm Analysis and Design

This is a Complete Lesson on Sorting Algorithms, covering Bubble Sort, Selection Sort, and Insertion Sort, step-by-step execution, and time complexity analysis (O(n²)). Ideal for Computer Science, ICT, IT Fundamentals, Algorithm Analysis & Design, and AP CS–aligned courses, with slides, assessments, and answer keys included. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Sorting Algorithms I Slide Deck💡 Complete Assessment Test💡 Answer Key & Marking Scheme💡 Visual sorting dia
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 Streams and File Handling Complete Lesson | Object Oriented Programming ( C++ )

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
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 Binary Expression Tree Complete Lesson| Operations, Diagrams & Examples included

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. ────────── ⋆⋅☆⋅⋆ ──────────
Preview of Complete Lesson on Linux System, C Programming, Processes & System Internals

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. ──
Preview of Complete Linux Programming Lesson on Semaphores, Shared Memory & Message Queues

Complete Linux Programming Lesson on Semaphores, Shared Memory & Message Queues

This is a complete lesson on Linux Inter-Process Communication (IPC) using Message Queues, Shared Memory, and Semaphores. Perfect for Operating Systems, Linux System Programming, C Programming, Computer Science, and Software Engineering at the college, university, and technical-training levels. It introduces students to three major System V IPC mechanisms and shows how processes exchange data, synchronize critical sections, and safely coordinate access to shared resources. The lesson includes
Preview of Linux IPC with Pipes and FIFOs Lesson on Process Communication

Linux IPC with Pipes and FIFOs Lesson on Process Communication

This resource is a complete lesson on Inter-Process Communication (IPC) using Pipes in Linux System Programming. Perfect for Operating Systems, Linux Programming, System Programming, C Programming, and Computer Science courses at the college, university, or technical-training level. It introduces students to how processes communicate, how pipes work, how to use popen and pclose, how to create and use unnamed pipes, how pipes work across a fork, and how to use FIFOs (named pipes) for communicat
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 Linux Processes and Signals Lesson with fork(), exec(), wait() & C Examples

Linux Processes and Signals Lesson with fork(), exec(), wait() & C Examples

This is a complete lesson on Linux System Programming: Processes and Signals. Perfect for Operating Systems, Linux Programming, System Programming, C Programming, Computer Science, and Engineering courses at the college, university, or technical-training level. It introduces students to how Linux manages running programs, how processes are created, how parents and children behave, how programs are replaced using exec, how zombie processes form, and how signals are sent, handled, and controlle
Preview of Introduction To Data Structures, Algorithms & Dynamic Array [ Includes C++ ]

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
Showing 73-96 of 190+ results