Please bear in mind that what you see here is not an exact reflection of reality, it’s a simplified explanation of a specific use case in which all possible issues have been grossly emphasized to provide an overview of the network communication concerns that API designers must consider when designing APIs.
We want to talk about the API/Dashboard application which provides some logs for your services, so you can have a service or more than one services.
Have you ever thought, Why do the App’s users complain? Why is this application slow and inefficient? …
Design Patterns have a role of an eye-catching picture to me and whenever I want to write a piece of code I’ll stay in front of this picture and while I enjoy of this beautifulness, I think how can I transfer this beauty to my code.
What will we learn from design patterns? You know you don’t want to reinvent the wheel, so you look to Design Patterns
I remember in the whole of my work experiences when I faced with the new-comer developers, they had a big challenge to be a productive developer in a short time. Same as others, it would be very challenging for me and sometimes I’ve read other developers experiences and watched some movies in Ted, and YouTube about other people techniques. I wanted to share with you some of my techniques which were very efficient for me.
First of all, I took some documentation and access for source, database, and QA process for running the development environment to gain some ideas about…
First, let me answer this question, What is Gonum and Sparse package?
One of the most popular libraries in Go for scientific algorithms is the Gonum package. The Gonum package provides utilities that assist us in writing effective numerical algorithms using Go.
This library was created with performance in mind, the creators saw a problem with fighting vectorization in C, so they built this library in order to be able to manipulate vectors and matrices more easily in Go.
The Sparse library was built on top of the Gonum library in order to handle some of the normal sparse matrix…
When I discuss with my coworkers about different subjects, most of the time I face a similar subject which shows the confusing situation for developers to choose technology, components structure and …
To ascertain the best answer to this question, I have studied books about architect areas. However, recently I have studied a book that name is Fundamentals Of Software Architecture An Engineering Approach And published by OREILLY Which clarify these subject fluently.in this post I want to share a brief of mentioned book.
The difference between architecture and design is often a confusing one. Where does architecture end and…
In this story, we will talk about some of the projects that are not part of the core gRPC implementation but that are pretty useful.
These projects are built around gRPC to overcome problems or limitations encountered while building a production system using gRPC. For example, we will check projects that let us match restful with gRPC easily.
This story is a brief of one part of gRPC up & Running book and I highly recommend to read this book for persons that want to complete their knowledge about modern inter-process communication in microservices architect.
Whenever I want to study or talk about Graph, I think, I am doing the hardest thing in the world, however, we should always remember that Graph is one of the interesting algorithms which variety of sciences involved with it(such as: Opte Project and … .), Lets have short look on initial explanations of Graph.
For keep your self and people, these days we should keep minimum 1 meters away from them to reduce the risk of Coronavirus spreading, So not is bad that to talk about types of a fundamental Data type.
a Stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
The order may be LIFO(Last In First Out) or FILO(First In Last Out).
a Queue is a collection of entities that are…
In this story, I Want to talk about Tree Measurement. Sometimes we face to question that the subject is about finding count of node Or how many nodes between x and y are valid?
In this story, I want to talk about Binary Tree Traversal.
Totaly we have 3 different types of left-to-right Traversal which names are:
let me talk about the above types and after that, I try to explain one of my favourable BST algorithms which name is RED-BLACK.
Red–black trees offer worst-case guarantees for insertion time, deletion time, and search time. Not only does this make them valuable in time-sensitive applications such as real-time applications, but it makes them valuable building blocks in other data structures which provide worst-case guarantees.
I have a dream to have a spectacular garden