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: Monostate Design Pattern

C++ / Interview Questions / Programming

Monostate Design Pattern explained with simple example

Sandeep Kumarby Sandeep Kumar

Monostate design pattern is a singleton design pattern variation in which a class will act like a singleton but this class will look like a normal class. This design pattern states that all data member of monostate classes are static but any number of instances can be created in the program.

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

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

Search

  • new vs malloc() and delete vs free() in C++
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol Message Structure
  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • AVL Tree Self Balancing Rotations – Right Left(RL) Rotation explained
  • Shortest Path in an Unweighted Graph Using BFS
  • Diameter Protocol AVP Structure
  • Maximum Heap Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Left Right (LR) Rotation explained
Copyright © 2026 SimpleTechTalks. Powered by WordPress and Bam.