Category: Java

Min Heap and Max Heap Implementation in Java

Implement Heap data structure in Java.     We have already introduced heap data structure in previous post and covered heapify-up, push, heapify-down and pop operations. In this post, java implementation of Max Heap and Min heap is discussed.

Stack implementation in Java

  This article covers the stack implementation in Java. A stack is a linear data structure¬†which follows the LIFO (last-in first-out) principle. That means the objects can be inserted or removed only at one end of it also called as top.

Queue implementation in java

  A queue is a linear data structure¬†which follows the FIFO (first-in first-out) principle. That means the object which is inserted first will be the first one out, followed by the object which was inserted next. The queue supports below core operations –

Search exceptions in huge log file | grep utility & Java program

This post discusses about grep utility and provides java code to search exceptions in a huge log file on windows server.   1. On Unix Server It is really frustrating when your code crashes in production. It is even more frustrating when you’re trying to search for an exception in a huge application log file(s). …