Author: Arunkumar Velusamy

DynamoDB is a fully managed NoSQL database service that supports key-value and document data. Supported document formats are JSON, HTML and XML. DynamoDB data will be stored on SSD. It spreads across 3 geographically distinct data centres. DynamoDB transactions provide the ability to perform ACID transactions. DynamoDB consists of tables, items and attributes. It might… Continue reading Amazon DynamoDB

(The main objective of this article is to identify the places where JMS is needed) JMS(Java messaging service) is a widely used technology. It has two different mechanism called Queue and Topic(publish-subscribe). A queue may have multiple listeners. But when u push a message, it will be picked up by only one listener whereas in topic, message will… Continue reading JMS

Serverless allows developers to run application code in the cloud without worrying about managing any servers. It does not mean that there are no servers. AWS takes care of infrastructure management so that developers can only focus on writing code & deploying them. When I started reading serverless, it sounded like what I read about… Continue reading AWS Serverless

IAM is all about identifying the user & providing access to the right resource. Three ways to get access to AWS AWS Management Console: Open the AWS management console in the browser and log in using username & password. This also can be Protected by MFA. AWS Command Line Interface(CLI): Protected by Access Keys. We… Continue reading IAM – Identity and Access Management in AWS

While reading more about AWS & its resources, we came across the term Infrastructure as Code(IaC) in many places like Amazon Elastic Beanstalk(EB), CloudFormation, SAM(Serverless Application Model) and AMS CDK(Cloud Development Kit).We like to explore a bit more about Infrastructure as Code and like to understand the concepts & differences between EB, CDK, SAM, CloudFormation.… Continue reading AWS – Infrastructure as Code

Prerequisite:  Algorithm , Sorting , Asymptotic complexity(Time & Space Complexity) Introduction : If someone gives you a list to sort and we are not aware of various sorting algorithm, most of us will write the below code,  Code: public int[] doSelectionSort(int[] ip) { int temp = 0; for(int i=0;i<ip.length-1;i++) { temp = i; for(int j=i+1;j<ip.length;j++)… Continue reading Selection Sort

          A programmer may write a better program to solve a problem. He may consider the memory management, Asympotatic complexity.            An Object oriented programmer will see everything as an object. Once he got the requirements, he can easily see all the objects or entities involved in… Continue reading Design Patterns

Prerequisite:  Algorithm, Sorting, Asymptotic complexity(time complexity, space complexity) Introduction: Insertion sort will take elements from 0 to n and compare & swap it with the left part of the array which is already sorted among the elements, until it find the right place where the element has to be. You may be clear, when look… Continue reading Insertion sort