Alok RatnaparkhiAngular Component Life Cycle hooks in simple languageI remember when I started learning Angular many years ago, I found component lifecycle hooks concept very confusing. Thanks to the writing…Jul 23Jul 23
Alok RatnaparkhiSerializable isolation level & 2PLSerializable isolation level guarantees that even multiple transactions are executed concurrently, they will be executed as if they are…Feb 4Feb 4
Alok RatnaparkhiMost Common Problems in Database TransactionsIntroduction: Database transactions are a fundamental aspect of ensuring data integrity, consistency, and reliability. However, they come…Jan 20Jan 20
Alok RatnaparkhiUnderstanding Different Types of Database PartitioningDatabase partitioning is a crucial technique for managing large datasets efficiently. There are several types of partitioning strategies…Jan 5Jan 5
Alok RatnaparkhiAspect Oriented Programming terminologies you should be familiar withAspect: An aspect is a modular unit that encapsulates cross-cutting concerns in a program. Cross-cutting concerns are functionalities that…Dec 26, 2023Dec 26, 2023
Alok RatnaparkhiExploring the Modified Binary Search AlgorithmBinary search is a classic algorithm used to efficiently search for an element in a sorted array. However, there’s a modified version of…Aug 27, 2023Aug 27, 2023
Alok RatnaparkhiDoes Dijkstra algorithm always find shortest distance when it reaches any node for the first time?Yes, Dijkstra’s algorithm always finds the shortest distance to a node when it reaches that node for the first time during its execution…Jul 22, 2023Jul 22, 2023
Alok RatnaparkhiSome notes regarding single source shortest path algorithmsDijkstra and Bellman ford algorithms are popular algorithms for finding shortest distance between the nodes of a weighted graphs. Dijkstra…Jul 17, 2023Jul 17, 2023
