Java Coffee Mug History ~ Java is a high-level programming language that has been around for a long time since its release. And now almost anyone uses it now, it’s only a small percentage of those people who know the history of the cup. Do you even know the history of it? well, in fact… the story is rather interesting as you’ll find out.
Biggest Reasons Why Java Is So Popular Amongst Programmers
Why Java Is So Popular ~ Today we’re talking about the factors that make the 20 years old programming language “Java” is still popular amongst programmers. Nowadays Java is still the most popular programming language for developing an enterprise application.
Why android use Java? ~ Java familiarity among developers and programmers has become the key to create a program a bit quicker. This applies more to google’s android mobile platform than to Apple iOS ore Microsoft Windows Phone Platform.
Advantages of Multithreading ~ These days the shortage of time has led us to a multitasking activities. Where that multitasking has been synonymous with the needs of efficiency. And that is not an exception for the programming world, a program that does a single task is just not enough anymore.
Properties class in java uses both key and value pair as a string. Thus, the properties class can be used to store data. this class can be used to get data from properties file and store data to properties file. It can be used to get the Properties of System as well.
The Advantage Of Properties File
It’s a properties class file, thus it requires no recompilation. So if there is a change of information from the properties file. As a result java class doesn’t need to recompile by the user. In addition the programs frequently changed the information inside this properties class.
What is a comparable interface – Coders can also order objects using java comparable interface. And rather than any type of class for that object. As a result, java uses user-defined class for this interface.
You can find java comparable interface inside the java.lang package since it is located inside that package. Therefore it contains only 1 method which seems like to be CompareTo(objects). Furthermore the interface provides single sorting element on a single data member only. So For an example it may be rollno, name, age or anything else.
compareTo(Object obj) method
Therefore to compare the current object with the specified object we used the syntax :
public int compareTo(Object obj)
Hence, Here is a list of what the element we can sort :
So from the last article I already explain to you what is a Data Structure in general and what is a Java Data Structure. Just like I promised in that craftingez6-coding post, within this 2 post I’ll explain to you the Java Data Structure (interface and classes) one by one.
Enumeration is a type of Interface, enumeration itself is not actually a data structure, but it surely is very very important to the context of the other data structures. The enumeration interface means to retrieve a successive elements from a data structure.
Enumeration could define a method called nextElement. And that method is used to get the next element inside the data structure that contains more than 1 elements.
BitSet is a type of class that implements a group of, guess what? “bits” or flags that you / the person can set and clear individually. This type of class is very useful in some cases where you need to keep up to code a set of Boolean values; you could just assign a bit to each value then set or clear it as appropriate
Vector class actually have similarities with a traditional Java array. Well except that Vector class can grow as necessary to accommodate new elements.
Just like an array, the elements that is inside the Vector object can be accessed via index into the vector. You know what, the nice thing about Vector is that you doesn’t have to worry anymore about setting the elements into a specific size upon creation, it’ll actually grows and shrinks automatically when it is necessary.
Stack class in java implements the last-in-first-out (LIFO) stack of elements. Imagine this illustration, you can imagine stack literally as a vertically stacked objects on top of each other.
When you add new objects, it will get stacked on top of the others (the last object).
Then, when you pull an element off from that stacked objects. The last object will be the first object to come back off again.
This dictionary doesn’t literally mean a dictionary, but it is rather an abstract class that defines data structure for mapping key to values. This kind class is useful whenever you want to access data via particular key rather than using an integer index.
Since the dictionary class is abstract, the class only provides the framework for a key mapped data. Rather than some specific implementation.
first of all lets break it down to pieces : Data and Structure.
What is a data? Googling on the internet said :
Philosophy “things that is probably known or assumed as facts, making the basis of reasoning or calculation”. Computing “the quantities, characters, or symbols on which operations are performed by a computer, being stored and transmitted in the form of another electrical signals and recorded on magnetic, optical, or mechanical recording media“