Skip to main content

UML diagrams

 Class diagrams 

Type of UML (Unified Modeling Language) diagram used to visually represent the structure and relationships of classes within a system.

  • classes are depicted as boxes,
  • each box contain three compartments
    • (i)class name,
    • (ii)attributes/properties, 
    • (iii)methods/functions/operations. 
  • Lines connecting classes illustrate associations, showing relationships such as one-to-one or one-to-many.




  • Attributes, also known as properties or fields, represent the data members of the class. include the visibility (e.g., public, private) and the data type of each attribute.
  • Methods, also known as functions or operations, represent the behavior or functionality of the class, include the visibility (e.g., public, private), return type, and parameters of each method.
visibility notations include:
  • + for public (visible to all classes)
  • - for private (visible only within the class)
  • # for protected (visible to subclasses)
  • ~ for package or default visibility (visible to classes in the same package)




System Architectural design-

1. Domain Model
2. Use case Model
3. Component Model

Comments

Post a Comment

Popular posts from this blog

API Basics

 
Post a Comment
Read more

Algorithm solving Common Patterns & Techniques

  These are targeted data manipulation strategies used to handle arrays, strings, and linked lists efficiently. Two Pointers : Uses two reference pointers to iterate through a data structure simultaneously, typically from opposite ends or at different speeds (Fast & Slow pointers). Sliding Window : Maintains a subset of data (a "window") over a sequential structure to track running statistics without recalculating the whole set. Prefix Sum : Pre-computes and stores cumulative sums of an array to allow for \(O(1)\) constant-time range sum queries. Dynamic Programming (DP ): Dynamic programming is an optimization technique used to solve problems by breaking them down into simpler subproblems and storing the results of these subproblems to avoid redundant computations. It is particularly effective for problems exhibiting overlapping subproblems and optimal substructure. Greedy Algorithm Breadth-First Search (BFS) / Depth-First Search (DFS) : Systematic graph and tree travers...
Post a Comment
Read more