TPT
Total:
$0.00

Percent Increase and Decrease Quiz - Page 4

190+ results
Filters
Standard
Language
Preview of Complete Computer Science Lesson on CPU, Memory, I/O, Interrupts & Storage

Complete Computer Science Lesson on CPU, Memory, I/O, Interrupts & Storage

This Curriculum gives students a complete introduction to computer system structure, OS structure, system components, interrupts, storage hierarchy, caching, I/O operations, and system architecture. Perfect for ICT, Computer Science, Software Engineering, Networking, university-level OS courses, Diploma/TVET programs, and learners preparing for Operating Systems exams. The lesson includes clear diagrams, layered system visuals, interrupt flowcharts, storage hierarchy explanations, and step-by
Preview of Complete C Programming Lesson on Loops, Arrays & Strings with Examples

Complete C Programming Lesson on Loops, Arrays & Strings with Examples

This Curriculum provides a complete, student-friendly walkthrough of loops, control flow, break/continue behavior, arrays, multidimensional arrays, strings, and essential string functions in C. Perfect for ICT, Computer Science, Programming Fundamentals, Software Engineering basics, and CS1-level courses. Each lesson includes clear explanations, step-by-step examples, full C code, flowcharts, diagrams, array memory layouts, and practical applications, helping learners truly understand how loops
Preview of Complete C Programming Lesson on Data Types, Operators & Decision Making

Complete C Programming Lesson on Data Types, Operators & Decision Making

This Curriculum takes students deeper into the core foundations of C by exploring data types, type conversions, operators, logical decisions, bitwise operations, and control flow. Perfect for ICT, Computer Science, Programming Fundamentals, Software Engineering foundations, and CS1-level courses. This resource is Part 2 of the Introduction to C Programming series. Each lesson is crafted with clear explanations, real C code, diagrams, operator tables, memory demonstrations, and step-by-step exa
Preview of Sorting Algorithms II: Counting Sort, Radix Sort, and Merge Sort with Algorithm

Sorting Algorithms II: Counting Sort, Radix Sort, and Merge Sort with Algorithm

This lesson provides a complete foundation in advanced Sorting Algorithms, covering Counting Sort, Radix Sort, and Merge Sort, including step-by-step execution, divide-and-conquer strategy, non-comparison sorting, and time complexity analysis. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Sorting Algorithms II Slide Deck (PPT + PDF) 💡 Step-by-step visual sorting diagrams💡 Python code implementations💡 Worked sorting examples and traces💡 Ready for in-person, online, or hybrid
Preview of Artificial Neural Networks: Complete Lesson with Examples and Backpropagation

Artificial Neural Networks: Complete Lesson with Examples and Backpropagation

This lesson provides a complete foundation in Artificial Neural Networks, covering biological vs artificial neurons, perceptron learning, activation functions, multilayer perceptrons, feedforward networks, and backpropagation. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Artificial Neural Network Slide Deck (PPT + PDF)💡 Visual neuron and network architecture diagrams💡 Step-by-step perceptron learning examples💡 Worked backpropagation calculations💡 Ready for in-person, online
Preview of Graph Algorithm Complete Curriculum | Algorithm Analysis and Design

Graph Algorithm Complete Curriculum | Algorithm Analysis and Design

This is a complete lesson on Graph Algorithms, covering graph data structures, directed vs undirected graphs, cyclic vs acyclic graphs, BFS, DFS, and cycle detection in directed graphs. 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 Graph Algorithms Slide Deck 💡 Complete Assessment Test 💡 Answer Key & Marking Scheme💡 Visu
Preview of Graph Theory Complete Lesson | Operations, Diagrams & Examples included

Graph Theory Complete Lesson | Operations, Diagrams & Examples included

This lesson gives students a complete, practical foundation in Graphs, showing how real-world problems are modeled as nodes and edges and how traversal algorithms explore complex structures efficiently. Learners move from graph definitions to working DFS and BFS implementations in C++, understanding not just what these algorithms do, but why and when each one is used. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What Graphs are and how they differ from trees
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 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
Showing 73-96 of 190+ results