Skip to main content
Advanced Search
Search Terms
Content Type

Exact Matches
Tag Searches
Date Options
Updated after
Updated before
Created after
Created before

Search Results

9 total results found

10.1 Introduction

Internet of Things Module 10 - Mesh

Module 10: Mesh Author: YP Learning Objectives After completing this module, students are expected to be able to: Explain the concept, advantages, and basic architecture of IoT mesh networks. Implement a simple mesh network using ESP32 with the painlessMesh l...

10.3 Example Code

Internet of Things Module 10 - Mesh

10.3.1 Root Node #include <Arduino.h> #include <painlessMesh.h> #include <WiFi.h> // --- Konfigurasi Jaringan --- #define MESH_PREFIX "jaringan_mesh_saya" // HARUS SAMA dengan semua node #define MESH_PASSWORD "password_mesh" // HARUS SAMA dengan se...

10.2 What is Mesh?

Internet of Things Module 10 - Mesh

10.2.1 What is a Mesh Network? A mesh network is a topology where each device (node) is interconnected, creating multiple paths for data. Unlike traditional networks that rely on a single central point (such as a router), a mesh network is decentralized. How ...

1. Introduction

Algorithm Programming Module 6 - Tree

Module 6: Tree Author: YP Learning Objectives After completing this module, students are expected to be able to: Explain the basic concept of a Tree as a non-linear data structure. Identify the differences between root, parent, child, leaf, and subtree. Impl...

2. Tree Concept

Algorithm Programming Module 6 - Tree

2.1 Basic Theory 2.1.1 Definition of a Tree A Tree is a non-linear hierarchical data structure composed of nodes and edges. Every Tree has a root (root node). The root can have children. A node with no children is called a leaf. Each node and its descendants...

1. Introduction

Algorithm Programming Module 9 - Advanced Graph

Module 9: Advanced Graph Author: YP Learning Objectives After completing this module, students are expected to be able to: Explain the basic concepts of Graph (including adjacency list and adjacency matrix representation). Implement graph traversal using DFS ...

2. Graph Concept

Algorithm Programming Module 9 - Advanced Graph

2.1 Theory 2.1.1 Definition of Graph A Graph is a data structure consisting of: Vertex (node) → represents an object. Edge → represents the relationship between objects. Graphs can be: Directed or Undirected. Weighted or Unweighted. 2.1.2 Graph Representa...

1. Introduction: From Procedural to Object-Oriented Programming

Alprog - Elektro KKI Module 8 : OOP (SOLID, Encapsulation, A...

1.1 What is Object-Oriented Programming? Object-Oriented Programming (OOP) is a programming paradigm that organizes code around objects rather than functions and logic. An object is a data structure that contains both data (attributes) and code (methods) that ...

2. C++ Basics: Essential Differences from C

Alprog - Elektro KKI Module 8 : OOP (SOLID, Encapsulation, A...

2.1 Basic Syntax Differences C vs C++ Comparison: Feature C C++ File Extension .c .cpp Input/Output scanf(), printf() cin, cout Header Files #include <stdio.h> #include <iostream> Namespace Not used using namespace std; Comments /* */ and // /* ...