It2Edu – Home

A MIME stands for Multipurpose Internet Mail Extension. In the context of internet or web applications the way of identifying files according to their nature and format. While developing the web applications specify content-type in the header part of HTTP – response. A MIME type is a mechanism that can …

Bucket sort is a sorting algorithm also knows as bin sort, it works with distributing elements of an array into a number of buckets. A bucket is most commonly a type of data buffer or a type of document in which data is divided into regions. Elements or contents in …

Hadoop is run on Linux kernel. If you want to install Hadoop on windows OS, Cygwin need to install in your machine. Cygwin is creating linux like environment in windows. Here is the link to get cygwin. https://cygwin.com/install.html Hadoop can be installed in Multi Node cluster / single node cluster. …

Java Program – Basic Syntax: public class ClassName { public static void main(String args[]){ Variables; Statements; } } First Java Program: public class FirstJavaProgram { /* This is my first java program. * This will print ‘Hello World’ as the output */ public static void main(String []args) { System.out.println(“Welcome to …

Java Features or Buzz Words: 1. Simple 2. Secure 3.Portable 4.Object-oriented 5.Robust 6.Multithreaded 7.Architecture-neutral 8.Interpreted 9.High performance 10.Distributed 11.Dynamic We discuss about these words how java supported. Simple: java is simple to write program and easy to learn if you understand the basics of OOP. Because it was acquire some …

In this blog I am going to discuss about sorting, what is sorting and how many types of sorting techniques we have. Sorting is technique to arrange the elements in an order either ascending or descending. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for …

Insertion sort is a simple sorting algorithm and it picks one item at a time, sort the elements finally produce the sorted array. Insertion sort is good for small size elements but not for large elements. Insertion sort iterates though out the array and iterates are equal to array size. …

Merge Sort is a sorting technique based on divide and conquer technique with comparison. Conceptually, a merge sort works as follows : i) Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted). ii) Repeatedly merge sublists to produce new sublists …

Web socket are introduced in java EE7 JSR 356 is related to web socket and provides API for creating web socket applications. Web socket is an application protocol that for a ideas full-duplex communication between two peers over the TCP protocol. The web socket enables web applications to deliver a …

Heap Sort is a powerful sorting algorithm that transforms unsorted data into a structured binary tree, providing efficient sorting results. Explore its characteristics, time complexity, and space efficiency in this detailed explanation