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: Design Principle

C++ / Interview Questions / Programming

Why do we need Software Design Principles

adminby admin

Object oriented software development often becomes victim of non-maintainable, unreliable etc in long run in most of cases. Lot of people might put bad coding skills behind that state (which is true sometime) but bad software design is the actual culprit which will make excellent coders write bad code because software design doesn’t allow them to do so.


Always remember knowing what not to do is more important than what to do !!!

(more…)
Why do we need Software Design Principles Read More

Search

  • AVL Tree Self Balancing Rotations – Right Left(RL) Rotation explained
  • new vs malloc() and delete vs free() in C++
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Trie Data Structure Basics and Implementation Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Left Right (LR) Rotation explained
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Shortest Path in an Unweighted Graph Using BFS
  • Binary Tree Inorder Traversal Explained With Simple Example
  • Binary Search Tree Insertion Of Node Explained With Simple Example
  • Autocomplete Feature Using Trie Explained With Simple Example
Copyright © 2026 SimpleTechTalks. Powered by WordPress and Bam.