TPT
Total:
$0.00
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 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 Computer Science Fraction to Decimal Mission Challenge

Computer Science Fraction to Decimal Mission Challenge

CTE Computer Science – Fraction to Decimal Mission Challenge 🐍➗ Transform math and coding into an exciting real-world programming mission!The Fraction to Decimal Mission Challenge is an engaging, student-centered Computer Science activity that introduces students to variables, user input, mathematical operations, algorithms, and problem-solving using Python programming. Students become coding agents tasked with creating a program that converts fractions into decimal values while developing es
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 IB DP Computer Science 2026 - Practice Mock Exams: 3 Versions - 18 Papers

IB DP Computer Science 2026 - Practice Mock Exams: 3 Versions - 18 Papers

This practice pack includes three versions of IB DP Computer Science mock exam materials. Each version includes materials for Standard Level and Higher Level, along with a case study booklet for Paper 1. Each version includes:SL Paper 1 SL Paper 2 Option A (Java) SL Paper 2 Option B (Python) SL mark scheme HL Paper 1 HL Paper 2 Option A (Java) HL Paper 2 Option B (Python) HL mark scheme Case study booklet for Paper 1 The papers are written in the style of IB DP Computer Science specimen papers f
Preview of Algorithm Analysis & Design | Complete Step-by-Step Curriculum

Algorithm Analysis & Design | Complete Step-by-Step Curriculum

This Curriculum covers algorithm design strategies, mathematical analysis, time and space complexity, growth rates, searching, sorting, graph algorithms, and pattern algorithms, with each unit standing as a complete, self-contained lesson while also fitting into a cohesive full course. ────────── ⋆⋅☆⋅⋆ ────────── Curriculum Structure & Coverage 1. Foundations of Algorithms ✏️ Introduction to Algorithms ✏️ Algorithm definition and characteristics ✏️ Algorithm analysis and design concept
Preview of Complete Socket Programming Lesson with TCP & UDP Client–Server Examples

Complete Socket Programming Lesson with TCP & UDP Client–Server Examples

This is a complete lesson on Linux System Programming: Socket Programming. Perfect for Operating Systems, Linux Programming, Networking, C Programming, Computer Science, Cybersecurity, and DevOps fundamentals at the university, college, or technical-training level. It explains what sockets are, how client–server communication is established, how IP addressing works, how TCP and UDP operate, and how to build real server–client programs in C (and an example in Python).This lesson includes clea
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
Showing 97-104 of 104 results