Skip to content

SimpleTechTalks

To make technologies simpler

  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us
  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us

Tag: Mediator Design Pattern

C++ / Interview Questions / Programming

Mediator Design Pattern explained with simple example

adminby admin

Mediator design pattern basically defines an interface class which provides a mechanism for providing communication between various modules/components of the software. Since, mediator needs to access each component of the software, which means it should be added as a reference in each component. Using this mediator class components becomes less dependent on each other which means coupling is reduced.

Before going ahead have a look at Design pattern simplified version.

(more…)
Mediator Design Pattern explained with simple example Read More

Search

  • Hash Table With Separate Chaining and Its Basic Implementation
  • Program to Find the Number Appearing Once While Others Appearing Thrice
  • Diameter Protocol AVP Structure
  • C++11: extern template Explained With Simple Example
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Left Right Rotation explained
  • new vs malloc and free vs delete explained with simple example
  • Diameter Agents Simple Explanation
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Trie Data Structure Basics and Implementation Explained With Simple Example
Copyright © 2026 SimpleTechTalks. Privacy Policy