MySQL Basics

History of MySQL MySQL was created by a Swedish company, MySQL AB, founded by David Axmark, Allan Larsson and Michael “Monty” Widenius. The first version of MySQL appeared on 23 May 1995. It was initially created for personal usage from mSQL based on the low-level language ISAM. Sun Microsystems acquired MySQL AB In 2008 . … Read more

Method overloading vs Method Overriding

Difference between Method Overloading vs Method overriding: Overloading can occur without inheritance. Overriding of functions occurs when one class is inherited from another class.   Overloaded functions must differ in function signature i.e. either number of parameters or type of parameters should differ. In overriding, function signatures must be same.   Overloaded functions are in same … Read more

Padding and Packing in C Programming

Data structure alignment is the way data is arranged and accessed in computer memory. It consists of two separate but related issues: data alignment and data structure padding. When a modern computer reads from or writes to a memory address, it will do this in word sized chunks (e.g. 4 byte chunks on a 32-bit … Read more

Program to implement Hash Tables in Java

What is Hash Table? Hash tables are an efficient implementation of a keyed array data structure, a structure sometimes known as an associative array or map. If you’re working in C++, you can take advantage of the STL map container for keyed arrays implemented using binary trees, but this article will give you some of the theory behind … Read more

Program to implement Circular Queue in JAVA

In this post we will learn about what are circular queues and how to implement circular queue in Java programming language. So, let’s start with definition of circular queue What is Circular Queue in Java? In  a standard queue data structure re-buffering problem occurs for each  dequeue operation. To solve this problem by joining the … Read more

Merge two sorted Linked Lists

Here we will write a function merge(list 1, list 2) which will take two sorted linked list as argument and it will merge them to form a new linked list in ascending order. For example we will have two linked lists 2 -> 5 -> 9 and  3 -> 7 -> 11 and the function will … Read more