Breaking
Principles

Kafka

Kubernetes

## Kubernetes expose API and User interface using Sidecar pattern

#### Software Architect

View All

Atomicity, Consistency, Isolation, Durability is a set of properties that guarantee that database transactions are processed reliably.

SOLID is a mnemonic acronym for five design principles intended to make software designs more understandable, flexible, and maintainable.

Chaos engineering is the discipline of experimenting on a software system in production in order to build confidence in the system’s capability to withstand turbulent and unexpected conditions.

#### Programming Language

View All

Oracle’s Java Certification has a tough passing percentage, close to 65% for both OCAJP (the Oracle Certified Associate Java Programmer)

#### Database Management System

View All

This article includes a set of commonly asked Oracle Interview Questions and answers along with easy examples in simple terms.

#### Data Structure

View All

Write a program to reverse the linked list. The head item should move to tail and tail item should move to head.

Example Given linked list 22->45->67->90->85 and return reverse linked list 85->90->67->45->22.

#### Algorithm

View All

Radix sort is a linear sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.

Least Significant Digit (LSD) radix sort process the integer representations starting from the least digit and moves towards the most significant digit. Radix sort is a linear sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.

Priority queue insert smallest key value is at the front of the queue (Min heap). Write a program to implement min heap priority queue.

Priority queues insert the largest key value at the front of the queue (max heap). Write a program to implement max heap priority queue.

The exchange sort is a sorting algorithm that compares each item with other items of the array and swap the item if requires.

Sort the items by exchanging pairs of items until the sequence is sorted. In general, an algorithm may exchange adjacent elements as well as widely separated one.

Shell sort is a sorting algorithm that starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared. Shell sort is a variation of insertion sort. Shell sort is a generalization of insertion sort.

View All